We can generate a sequence of numbers, given that the first p numbers are provided e.g. from a multiplicative congruential generator. The operation denoted by is conventionally the `exclusive-or'. It may be however just simple addition or subtraction, and recent studies favour the latter operation, giving rise to a subtracted Fibonacci generator.And especially interesting development is the subtract-with-borrow generator of this type. The algorithm is

Next: The `carry' coefficient, , Up: Fibonacci generators Previous: Fibonacci generators Contents

We can generate a sequence of numbers, given that the first p numbers are provided e.g. from a multiplicative congruential generator. The operation denoted by $\odot$ is conventionally the `exclusive-or'. It may be however just simple addition or subtraction, and recent studies favour the latter operation, giving rise to a subtracted Fibonacci generator.And especially interesting development is the subtract-with-borrow generator of this type. The algorithm is

$\nu _{i}=(\nu _{i-q}-\vec{\nu }_{i-p}-\beta )$ mod m

Next: The `carry' coefficient, , Up: Fibonacci generators Previous: Fibonacci generators Contents

Amaury LATAILLADE 2002-11-04