Abstract
The pseudorandom sequence of arrays (PRSA) and a method to generate it was reported earlier by the authors. This paper presents another method to generate a PRSA. The mathematical recursion describing the PRSA and some of its properties are discussed.
Similar content being viewed by others
References
S. W. Golomb,Shift Register Sequences, revised ed., Laguna Hills, CA: Aegean Park Press, 1982.
F. J. MacWilliams and N. J. A. Sloane, Pseudorandom sequences and arrays,Proc. IEEE, vol. 64, pp. 1715–1729, December, 1976.
L. T. Wang and E. J. McCluskey, Hybrid designs generating maximal length sequences,IEEE Trans. Comp. Aided Design Int. Circ. Syst., vol. 7, pp. 91–99, January, 1988.
D. H. Green, Structural properties of pseudorandom arrays and volumes and their related sequences,IEEE Proc. Part E, vol. 132, pp. 133–145, May, 1985.
P. H. Bardell and W. H. McAnney, Pseudorandom arrays for built-in tests,IEEE Trans. Comp., vol. C-35, pp. 653–658, July, 1986.
A. Ali and C. A. Halijak, The pseudorandom sequence of arrays,Proc. 21st SE Symp. Syst. Theory (SSST-'89), March, 1989.
W. W. Peterson and E. J. Weldon, Jr.,Error-Correcting Codes, 2nd ed., Cambridge, MA: MIT Press, 1972.
D. T. Tang and C. L. Chen, Logic test pattern generation using linear codes,IEEE Trans. Comp., vol. C-33, pp. 845–850, September, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ali, A., Halijak, C.A. Analysis of a PRSA generator. Circuits Systems and Signal Process 12, 557–566 (1993). https://doi.org/10.1007/BF01188094
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01188094