Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Reexamination Certificate
2005-06-21
2005-06-21
Mai, Tan V. (Department: 2124)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
Reexamination Certificate
active
06910057
ABSTRACT:
A system and a method to reduce a search space to determine viable cellular automata based random number generators (CA-based RNGs) are presented. A CA-based RNG is where an output of each cell of the CA at time t is dependent on inputs from any cells of the CA (including perhaps itself) at time t−1. The connections (or inputs) are selected to produce high entropy such that the RNG passes a standard suite of random number of tests, such as the DIEHARD suite. As the number of inputs grow (corresponding to the neighborhood size), the number of truth tables grows dramatically. By reducing the search space of viable CA-based RNGs, high quality random number generators with higher neighborhood sizes may be found.
REFERENCES:
patent: 4691291 (1987-09-01), Wolfram
patent: 4860236 (1989-08-01), McLeod et al.
patent: 5043988 (1991-08-01), Brglez et al.
patent: 6272653 (2001-08-01), Amstutz
patent: 6429795 (2002-08-01), Amstutz
patent: 6708192 (2004-03-01), Rajski et al.
patent: 2002/0154769 (2002-10-01), Petersen et al.
Shackleford J. Barry
Tanaka Motoo
LandOfFree
Truth table candidate reduction for cellular automata based... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Truth table candidate reduction for cellular automata based..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Truth table candidate reduction for cellular automata based... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3518178