A method of generating uniformly distributed sequences over [0, K], where K+1 is not a power of two
暂无分享,去创建一个
A new methodology has been recently proposed for the efficient generation of multiple pseudo-random bit sequences that are statistically uncorrelated [R. Kuehnel, March 2003]. Random sequences that are uniformly distributed over a range [0,K], where K+ 1 is a power of 2, can be constructed by forming a vector of M independent bit sequences, where M = log/sub 2/(K + 1). In this paper we demonstrate that this method of construction represents a special case of a more generalized approach in which K can be any positive integer. The procedures described here can be used to efficiently generate multiple independent random sequences that are uniformly distributed over any range.
[1] Jukka Saarinen,et al. VLSI implementation of Tausworthe random number generator for parallel processing environment , 1991 .
[2] Serge Demidenko,et al. Generation and Application of Pseudorandom Sequences for Random Testing , 1988 .
[3] Howard C. Card,et al. Stochastic Neural Computation I: Computational Elements , 2001, IEEE Trans. Computers.
[4] Dennis R. Morgan. Autocorrelation Function of Sequential M-Bit Words Taken from an N-Bit Shift Register (PN) Sequence , 1980, IEEE Transactions on Computers.