Combined Pseudorandom Sequence Generator Based on Cellular Automata

By analyzing the period of the bit computation of AND, OR, and XOR, it is proved that the frequency characters of the bit computation of XOR is better than the original frequency characters. The study of the linear complexity of the combined bits demonstrates that:the linear complexity of the bit computation of AND and OR is equal to the product of the linear complexity of the originals; and the linear complexity of the bit computation of XOR equal to the addition of the linear complexity of the originals. Computer simulation demonstrates that the combined pseudorandom sequence generator has simple architecture and high speed information processing characters, and can efficiently increase the period and linear complexity efficiently of pseudorandom sequence.