Abstract
A method for designing a uniform random number generator based on M-sequence is presented. The sequence generated by the method {x_t;t=0, 1, 2…} as well as its properly decimated sequence {x_nt;t=0, 1, 2…} for several values of n have the property of approximate asymptotic randomness. A key idea of the method is to iterate a permutation of the bits in M-sequence random numbers so that leading bits may become linearly independent. Since there are computational difficulties in finding the condition for the linear independence of bits and in solving the optimization problem of bit permutation, we adopt some heuristic methods for finding approximate solutions.
