Sorting Clock Generator?



I want to ask if this is a good idea or not:

You have two (or as many as you wish) independent pseudorandom number
generators that output between 0 and 1048576. Both generators output
a value.

The larger value is used first, for example 789,301, modulo 256,
yields 53 (ascii "5"), which sent to the output stream.

The smaller value is used second, for example 247,888, modulo 256,
yields 80 (ascii "P"), which sent to the output stream.

Repeat as needed. Note that the sorting occurs before the modulo 256
operation.

Any comments?
.



Relevant Pages

  • Re: Sorting Clock Generator?
    ... generators that output between 0 and 1048576. ... yields 53 (ascii "5"), which sent to the output stream. ... The smaller value is used second, for example 247,888, modulo 256, ...
    (sci.crypt)
  • Re: shuffle in fortran
    ... generators. ... Do you remember RANDU? ... Everyone's least favorite RNG, ... take the result modulo some prime not so far from ...
    (comp.lang.fortran)
  • Re: Random Number Generation --> Hardware or Software?
    ... >outputs of pseudo-random number generators is a subset of the set ... output stream. ... a semi-infinite stream of ones. ...
    (comp.arch.embedded)