Abstract
The phaseshifts between the bitstreams emitted from various stages of one-dimensional linear finitestate machines are analyzed. An operational calculus involving ashift operator is developed. The concept of discrete lograithms of binary polynomials is introduced to calculate phaseshifts. The analysis technique is applied to various examples of cellular automata and LFSRs. Phaseshift end effects are observed in cellular automata due to rule configurations. Modified LFSR generators are shown to have potentially more useful outputs than cellular automata, lower circuit complexity, and equivalent phaseshift statistics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P.H. Bardell, “Design considerations for parallel pseudorandom pattern generators,”J. Elect. Testing: Theory and Appl., vol. 1, pp. 73–87, 1990.
P.D. Hortensius, R.D. McLeod, and B.W. Podaima, “Cellular automata circuits for built-in self-test,”IBM J. Res. and Dev., vol. 34, pp. 389–405, March/May 1990.
P.H. Bardell and W.H. McAnney, “Pseudorandom arrays for built-in tests,”IEEE Trans. Comput., vol. C-35, pp. 653–658, July 1986.
M. Serra, D.M. Miller, and J.C. Muzio, “Linear cellular automata and LFSRs are isomorphic,” Proc. Third Tech. Workshop on New Dir. for IC Testing, Halifax, N.S. pp. 213–233, October, 1988.
P.H. Bardell, “Analysis of cellular automata used as parallel pseudorandom pattern generators,”Proc. IEEE Int. Test Conf., pp. 762–767, September 10–14, 1990.
S. Wolfram, “Statistical mechanics of cellular automata,”Rev. Modern Physics, vol. 55, pp. 601–644, July 1983.
S. Wolfram, “Random sequence generation by cellular automata,”Adv. in Appl. Math., vol. 7, pp. 127–169, 1986.
A.M. Odlyzko, “Discrete logarithms in finite fields and their cryptographic significance,”Advances in Crypotology: Proc. EUROCRYPT '84, in Lecture Notes in Computer Science 209, Berlin: Springer-Verlag, pp. 225–314, 1984.
L. Adleman, “A subexponential algorithm for the discrete logarithm problem with applications to cryptography,” Proc. IEEE 20th Annual Symposium of Foundations of Computer Science, pp. 55–60, 1979.
D. Coppersmith, “Fast evaluation of logarithms in fields of characteristic two,”IEEE Trans. on Information Theory, vol. IT-30, pp. 587–594, July 1984.
S.W. Golomb,Shift Register Sequences, (rev. ed), Laguna Hills, CA: Aegean Park Press, 1982.
D.E. Knuth,The Art of Computer Programming, vol. 2·/ Seminumerical Algorithms, (Second ed), Reading, MA: Addison Wesley, 1981.
M. Serra and T. Slater, “A Lanczos algorithm in a finite field and its application,”J. Combinatorial Mathematics and Combinatorial Computing, vol. 7, April 1990.
L.T. Wang and E.J. McCluskey, “A hybrid design of maximum length sequence generators,”Proc. IEEE Int. Test Conf., Washington, D.C., pp. 38–45, September 1986.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bardell, P.H. Discrete logarithms a parallel pseudorandom pattern generator analysis method. J Electron Test 3, 17–31 (1992). https://doi.org/10.1007/BF00159828
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00159828