
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P.D. Hortensius, R.D. McLeod, H.C Card, "Parallel Random Number Generation for VLSI Systems Using Cellular Automata," IEEE Transactions on Computers, vol. 38, no. 10, pp. 14661473, October, 1989.  
BibTex  x  
@article{ 10.1109/12.35843, author = {P.D. Hortensius and R.D. McLeod and H.C Card}, title = {Parallel Random Number Generation for VLSI Systems Using Cellular Automata}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {10}, issn = {00189340}, year = {1989}, pages = {14661473}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.35843}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Parallel Random Number Generation for VLSI Systems Using Cellular Automata IS  10 SN  00189340 SP1466 EP1473 EPD  14661473 A1  P.D. Hortensius, A1  R.D. McLeod, A1  H.C Card, PY  1989 KW  random number generation; VLSI systems; cellular automata; parallel processing; pseudorandom numbers; finite automata; parallel architectures; random number generation. VL  38 JA  IEEE Transactions on Computers ER   
[1] P. D. Hortensius, "Parallel computation of nondeterministic algorithms in VLSI," Ph.D. dissertation, Univ. of Manitoba, Winnipeg, Canada, 1987, unpublished.
[2] P. D. Hortensius, H. C. Card, R. D. McLeod, and W. Pries, "Importance sampling for Ising computers using onedimensional cellular automata,"IEEE Trans. Comput., vol. 38, pp. 769774, June 1989.
[3] P. D. Hortensius, H. C. Card, and R. D. McLeod, "CMOS implementations of Ising computers," inProc. 1986 Canadian VLSI Conf., Montreal, P.Q., Canada, Oct. 1986, pp. 127132.
[4] P. D. Hortensius, R. D. Mcleod, W. Pries, D. M. Miller, and H. C. Card, "Cellular automata based pseudorandom number generators for builtin selftest,"IEEE Trans. Comput.Aided Design, vol. 8, no 8, pp. 84259, Aug. 1989.
[5] D. Knuth,Seminumerical Algorithms. Reading, MA: Addison Wesley, 1981.
[6] R. R. Coveyou and R. D. MacPherson, "Fourier analysis of uniform random number generators,"J. ACM, vol. 14, pp. 100119, 1967.
[7] G. Marsaglia, "The structure of linear congruential sequences," inApplication of Number Theory to Numerical Analysis, S. K. Zaremba, Ed. New York: Academic, 1972.
[8] G. S. Fishman and L. R. Moore, "A statistical evaluation of multiplicative congruential random number generators with modulus 231 1,"J. Amer. Statist. Ass., vol. 77, no. 377, pp. 129136, Mar. 1982
[9] R. C. Tausworthe, "Random numbers generated by linear recurrance modulo two,"Math. Computat., vol. 19, pp. 201209, 1965.
[10] S. Wolfram, "Statistical mechanics of cellular automata,"Rev. Modern Phys., vol. 55, pp. 601644, 1983.
[11] S. Wolfram, "University and complexity in cellular automata,"Physica, vol. 10D, pp. 135, 1984.
[12] S. Wolfram, "Origins of randomness in physical systems,"Phys. Rev. Lett., vol. 55, pp. 449452, 1985.
[13] S. Wolfram, "Random sequence generation by cellular automata,"Advances Appl. Math., vol. 7, pp. 127169, 1986.
[14] T. W. Williams and K. P. Parker, "Design for testabilityA survey,"Proc.IEEE, vol. 71, pp. 98112, 1983.
[15] W. Pries, A. Thanailakis, and H. C. Card, "Group properties of cellular automata and VLSI applications,"IEEE Trans. Comput., vol. C35, pp. 10131024, Dec. 1986.
[16] S. Kirkpatrick and E. P. Stoll, "A very fast shiftregister sequence random number generator," J. Computat. Phys., vol. 40, pp. 517 526, 1981.