By Topic

Pseudorandom number generators for VLSI systems based on linear cellular automata

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
P. Tsalides ; Sch. of Eng., Democritus Univ. of Thrace, Xanthi, Greece ; T. A. York ; A. Thanailakis

The use of a simple hybrid cellular automaton (combining rules 90 and 150 in Wolfram's notation) as a built-in self test (BIST) structure for VLSI systems is considered. Two six-bit pseudorandom number generators based on cellular automata (CA) and LFSR have been designed using 2 mu m design rules for an N-well CMOS process. Layout has been achieved using ChipWise. Comparative performance studies of these CA-based new pseudorandom number generators and the LFSR-based generators show the great advantage of these CA-based BIST structures over the LFSR. The group and semigroup algebraic properties of 1-D bounded elementary cellular automata with the linear evolution rules 90 and 150 are also presented and discussed, together with their state transition graphs. The variety of symmetries of these CA systems results in a multiplicity of functional dependences for the group and semigroup orders of the associated algebraic structures and the CA length N.

Published in:

IEE Proceedings E - Computers and Digital Techniques  (Volume:138 ,  Issue: 4 )