Cellular Automata Based M-Sequence Generation

Author

Chuanwu, Zhang

Author_Institution

Southwest Univ. for Nat. Chengdu, Chengdu

fYear

2007

Firstpage

21217

Lastpage

21947

Abstract

Due to the global processing characteristic, the traditional M-sequence generation method based on LFSR is restricted by the speed. Because of the cellular automata has the characteristics of simple regular structure, locality of information processing, and posses the complex dynamic properties, these make it more suitable for the high speed M-sequence generation method based on the cellular automata. For a giving irreducible polynomial, using the synthesis algorithm based on the Euclid´s division which bring forwarded by Kevin Cattle, we can obtain the rule vector of the 90/150 cellular automata, and by analyzing the homogeneous characteristic of the cellular automata, we can obtain a set of the cellular automata to generation the M-sequence with high speed.

Keywords

cellular automata; m-sequences; polynomial matrices; random number generation; Euclid division; M-sequence generation; cellular automata; homogeneous characteristic; irreducible polynomial; synthesis algorithm; Algorithm design and analysis; Character generation; Cows; Cryptography; Information processing; Instruments; Polynomials; Random sequences; Statistics; Testing; Cellular Automata (CA); Homogeneous Characteristic; M-Sequence;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronic Measurement and Instruments, 2007. ICEMI '07. 8th International Conference on

Conference_Location

Xi´an

Print_ISBN

978-1-4244-1136-8

Electronic_ISBN

978-1-4244-1136-8

Type

conf

DOI

10.1109/ICEMI.2007.4350747

Filename

4350747