loading...
A Methodology for Minimum Area Cellular Automata Generation
Singapore December 02-December 04
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ATS.1998.741577Seventh Asian Test Symposium (ATS'98)
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Cellular automata (CAs) have been adopted in several VLSI applications to generate pseudo-random sequences. CAs should be able to generate maximum cycle length pseudo-random sequences. As they are built into high performance VLSI chips they should also present minimum area. Previous works on CAs generation have failed, up to now, to solve the problem. In this paper we present a "guided search" methodology to generate such minimum area CAs. Results are compared to the ones obtained in previous works and the area gain reported.
Citation:
Paulo Sérgio Cardoso, Marius Strum, JoséRoberto de A. Amazonas, Wang Jiang Chau, "A Methodology for Minimum Area Cellular Automata Generation," ats, pp.33, Seventh Asian Test Symposium (ATS'98), 1998
Usage of this product signifies your acceptance of the Terms of Use.