Proceedings 2002 NASA/DoD Conference on Evolvable Hardware
DOI: 10.1109/eh.2002.1029885
|View full text |Cite
|
Sign up to set email alerts
|

High-performance cellular automata random number generators for embedded probabilistic computing systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(14 citation statements)
references
References 18 publications
0
14
0
Order By: Relevance
“…The f avg-max of the frequency mix was set approximately to 100 MHz. To switch the control, three types of number sequences were evaluated: (1) linear sequence, (2) LFSR based random number [9] and (3) cellular automata based random number sequences [11]. The sampling distribution characteristics of pseudo random clocks were studied for 1GHz, 622.08MHz, 500MHz, 300MHz and 250MHz signals.…”
Section: Experimental Setup and Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The f avg-max of the frequency mix was set approximately to 100 MHz. To switch the control, three types of number sequences were evaluated: (1) linear sequence, (2) LFSR based random number [9] and (3) cellular automata based random number sequences [11]. The sampling distribution characteristics of pseudo random clocks were studied for 1GHz, 622.08MHz, 500MHz, 300MHz and 250MHz signals.…”
Section: Experimental Setup and Resultsmentioning
confidence: 99%
“…In this work we compare three types of switching sequences: (1) linear sequence, (2) LFSR based random number [9] and (3) cellular automata based random number sequences [11].…”
Section: ) Pseudo Random Clock Produced By Frequency MIXmentioning
confidence: 99%
“…The random mechanism employs the greedy approach as a backbone, but it allows for overwriting of paths if the probability of caching that path (as obtained from a random number generator) is greater than a certain threshold. 32-bit non-local and asymmetrical cellular-automata CA25443 was used as a random number generator because it passed more empirical randomness tests, displayed large cycle length [7] and allowed efficient implementation.…”
Section: Quality Of Paths Optimizationmentioning
confidence: 99%
“…In [1], Barry et al expanded the neighborhood size to four and introduced a nonlocal neighborhood connection scheme. They found a number of 64-cell 1-D CA PRNGs passing DIEHARD through exhaustive searching.…”
Section: A 1-and 2-d Ca Prngsmentioning
confidence: 99%