Abstract
In this paper, we analyze Pseudo-Noise (PN) sequences generated by a maximum-length 90/150 Null Boundary Cellular Automata and we give the relationship among minimum offsets.
Similar content being viewed by others
References
P.H. Bardell,Analysis of cellular automata used as pseudorandom pattern generators, Proc. IEEE int. Test. Conf., 1990, 762–767.
S. Bhattacharjee, U. Raghavendra, D. R. Chowdhury and P.P. Chaudhuri,An efficient encoding algorithm for image compression hardware based on cellular automata, Proc. 3rd Internat. Conf. High Performance Comput., 1996, 239–244.
S. Bhattacharjee, S. Sinha, C. Chattopadhyay and P.P. Chaudhuri,Cellular automata based scheme for solution of Boolean equations, IEEE Proc.-Comput. Digit. Tech.143, 1996, 174–180.
S. Chakraborty, D.R. Chowdhury and P.P. Chaudhuri,Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines, IEEE Trans. Computers,45, 1996, 769–781.
K. Cattell and Jon C. Muzio,Analysis of one-dimensional linear hybrid cellular automata over GF(q), IEEE Trans. Comput.,45, 1996, 782–792.
S.J. Cho, U.S. Choi and H.D. Kim,Analysis of complemented CA derived from a linear TPMACA, Computers and Mathematics with Applications,45, 2003, 689–698.
S.J. Cho, U.S. Choi and H.D. Kim,Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA, Mathematical and Computer Modelling,36, 2002, 979–986.
A.K. Das and P.P. Chaudhuri,Efficient characterization of cellular automata, Proc. IEE(Part E),137, 1990, 81–87.
A.K. Das and P.P. Chaudhuri,Vector space theoretic analysis of additive cellular automata and its application for pseudo-exhaustive test pattern generation, IEEE Trans. Comput.,42, 1993, 340–352.
S.W. Golomb,Shift Register Sequeces, Holden Day, 1967.
R. Lidl and H. Niederreiter,Finite Fields, Cambridge University Press, 1997.
S. Nandi and P.P. Chaudhuri,Additive Cellular Automata as an on-chip test pattern generator, IEEE, 1993, 166–171.
S. Nandi and P.P. Chaudhuri,Analysis of periodic and intermediate boundary 90/150 cellular automata, IEEE Trans. Computers,45, 1996, 1–12.
S. Nandi, B.K. Kar and P.P. Chaudhuri,Theory and applications of cellular automata in cryptography, IEEE Trans. Computers,43, 1994, 1346–1357.
J. Von Neumann,The Theory of Self-reproducing Automata, A.W. Burks ed. (Univ. of Illinois Press, Urbana and London), 1966.
M. Serra, T. Slater, J.C. Muzio and D.M. Miller,The analysis of one dimensional linear cellular automata and their aliasing properties, IEEE Trans Computer-Aided Design,9, 1990, 767–778.
A. Swiecjcka and F. Seredynski,Cellular automata approach to scheduling problem, Proc. Internat. Conf. Parallel Comput. Electrical Engineering, 2000, 29–33.
S. Tezuka and M. Fushimi,A method of designing cellular automata as pseudo random number generators for built-in self-test for VLSI, Comtemporary Mathematica,168, 1994, 363–367.
S. Wolfram,Statistical Mechanics of Cellular Automata, Rev. Mod. Phys.,55, 1983, 601–644.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by grant No. (R01-2003-000-10663-0) from the Basic Research Program of the Korea Science and Engineering Foundation.
Sung-Jin Cho received his Ph.D. at Korea University. Since 1988 he has been at the Pukyong National University. His research interests center on Cellular Automata, Cryptography and Coding Theory.
Rights and permissions
About this article
Cite this article
Cho, SJ. Analysis of Pseudo-Noise sequences generated by Null Boundary Cellular Automata. JAMC 18, 287–300 (2005). https://doi.org/10.1007/BF02936572
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02936572