Parallel Random Number Generation for VLSI Systems Using Cellular Automata
暂无分享,去创建一个
[1] R. Tausworthe. Random Numbers Generated by Linear Recurrence Modulo Two , 1965 .
[2] Wolfram,et al. Origins of randomness in physical systems. , 1985, Physical review letters.
[3] Parker,et al. Design for Testability—A Survey , 1982, IEEE Transactions on Computers.
[4] Howard C. Card,et al. Group Properties of Cellular Automata and VLSI Applications , 1986, IEEE Transactions on Computers.
[5] S. Wolfram. Statistical mechanics of cellular automata , 1983 .
[6] G. S. Fishman,et al. A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 231 — 1 , 1982 .
[7] R. R. Coveyou,et al. Fourier Analysis of Uniform Random Number Generators , 1967, JACM.
[8] PETER D. HORTENSIUS,et al. Importance Sampling for Ising Computers Using One-Dimensional Cellular Automata , 1989, IEEE Trans. Computers.
[9] Howard C. Card,et al. Cellular automata-based pseudorandom number generators for built-in self-test , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[10] S. Wolfram. Random sequence generation by cellular automata , 1986 .
[11] Scott Kirkpatrick,et al. A very fast shift-register sequence random number generatorjournal of computational physics , 1981 .
[12] Stephen Wolfram,et al. Universality and complexity in cellular automata , 1983 .