Crosscorrelation Properties of Pseudorandom and Related Sequences

Proceedings of the IEEE

Volumn 68, Issue 5, 1980, Pages 593-619

  Sarwate, Dillp V ^a   Pursley, Michael B ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PSEUDORANDOM SEQUENCES; SPREAD-SPECTRUM COMMUNICATIONS;

DIGITAL COMMUNICATION SYSTEMS - SYNCHRONIZATION; RADAR - THEORY; SYSTEMS ENGINEERING; TELECOMMUNICATION SYSTEMS, SATELLITE RELAY;

INFORMATION THEORY;

EID: 0019021287     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/PROC.1980.11697     Document Type: Article

References (136)

1. M. H. Ackroyd “Synthesis of efficient Huffman sequences,” IEEE Trans. Aerosp. Electron. Syst., vol. AES-8, pp. 2–6, 1972.
2. —, “Huffman sequences with approximately uniform envelopes or cross-correlation functions,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 620–623, 1977.
3. J. M. Aein and J. W. Schwartz, Eds., “Multiple-access to a communication satellite with a hard-limiting repeater—Volume II: Proceedings of the IDA multiple access summer study,” Inst. Defense Analyses, Rep. R-108, (AD 465789), 1965.
4. D. R. Anderson, “A new class of cyclic codes,” SIAM J. Appl. Math., vol. 16, pp. 181–197, 1968.
5. D. R. Anderson and P. A. Wintz “Analysis of a spread-spectrum multiple-access system with a hard limiter,” IEEE Trans. Commun. Technol., vol. COM-17, pp. 285–290, 1969.
6. R. H. Barker, “Group synchronizing of binary digital systems,” in Communication Theory. London, England: Butterworth, 1953.
7. L. D. Baumert and R. J. McEliece “Weights of irreducible cyclic codes,” Inform. Cont., vol. 20, pp. 158–175, 1972.
8. N. E. Bekir, R. A. Scholtz, and L. R. Welch, “Partial-period correlation properties of PN sequences,” in 1978 National Telecommunications Conf. Rec., vol. 3, pp. 35.1.1–4, 1978.
9. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
10. G. S. Bloom and S. W. Golomb “Applications of numbered undirected graphs,” Proc. IEEE, vol. 65, pp. 562–570, 1977.
11. A. M. Boehmer “Binary pulse compression codes,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 156–167, 1967.
12. D. E. Borth and M. B. Pursley “Analysis of direct sequence spread-spectrum multiple-access communication over Rician fading channels,” IEEE Trans. Commun., vol. COM-27, pp. 1566–1577, 1979.
13. R. N. Bracewell, The Fourier Transform and Its Applications. New York: McGraw-Hill, 1965.
14. P. A. N. Briggs and K. R. Godfrey “Pseudorandom signals for the dynamic analysis of multivariable systems,” Proc. Inst. Elec. Eng., vol. 113, pp. 1259–1267, 1966.
15. —, “New class of pseudorandom ternary sequences,” Electron. Lett., vol. 4, pp. 438–439, 1968.
16. —, “Design of uncorrected signals,” Electron. Lett., vol. 12, pp. 555–556, 1976.
17. P. A. N. Briggs, P. H. Hammond, M. T. G. Hughes, and G. O. Plumb “Correlation analysis of process dynamics using pseudo-random binary test perturbation,” Proc. Inst. Mech. Eng., vol. 179, pt. 3H, pp. 37–51, 1965.
18. D. Calabro and J. Paolillo “Synthesis of cyclically orthogonal binary sequences of the same least period,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 756–758, 1968.
19. J. R. Caprio “Strictly complex impulse-equivalent codes and subsets with very uniform distribution,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 695–706, 1969.
20. N. B. Chakrabarti and M. Tomlinson “Design of sequences with specified autocorrelation and cross-correlation,” IEEE Trans. Commun., vol. COM-24, pp. 1246–1252, 1976.
21. D. C. Chu “Polyphase codes with good periodic correlation properties,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 531–532, 1972.
22. G. R. Cooper and R. W. Nettleton “A spread-spectrum technique for high-capacity mobile communications,” IEEE Trans. Veh. Technol., vol. VT-27, pp. 264–275, 1978.
23. T. A. Dowling and R. J. McEliece “Cross-correlation of reverse maximal-length shift register sequences,” JPL Space Programs Summary 37-53, vol. 3, pp. 192–193, 1968.
24. R. L. Frank “Polyphase codes with good nonperiodic correlation properties,” IEEE Trans. Inform. Theory, vol. IT-9, pp. 43–45, 1963.
25. R. Frank and S. Zadoff “Phase shift codes with good periodic correlation properties,” IRE Trans. Inform. Theory, vol. IT-8, pp. 381–382, 1962.
26. S. Fredricsson “Pseudo-randomness properties of binary shift register sequences,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 115–120, 1975.
27. R. M. Gagliardi “Rapid acquisition signal design in a multiple-access environment,” IEEE Trans. Aerosp. Electron. Syst., vol. AES-10, pp. 359–363, 1974.
28. K. R. Godfrey “Three-level m-sequences,” Electron. Lett., vol. 2, pp. 241–243, 1966.
29. —, “The theory of the correlation method of dynamic analysis and its application to industrial processes and nuclear power plants,” Meas. Contr., vol. 2, pp. T65–T72, 1969.
30. M. J. E. Golay “Complementary series,” IRE Trans. Inform Theory, vol. IT-7, pp. 82–87, 1961.
31. —, “A class of finite binary sequences with alternate autocorrelation values equal to zero,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 449–450, 1972.
32. —, “Notes on impulse equivalent pulse trains,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 718–721, 1975.
33. R. Gold “Characteristic linear sequences and their coset functions,” SIAM J. Appl. Math., vol. 14, pp. 980–985, 1966.
34. —, “Study of correlation properties of binary sequences,” AF Avionics Lab., Wright-Patterson AFB, OH, Tech. Rep. AFAL-TR-66-234, (AD 488858), 1966.
35. —, “Optimal binary sequences for spread spectrum multiplexing,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 619–621, 1967.
36. —, “Study of correlation properties of binary sequences,” AF Avionics Lab., Wright-Patterson AFB, OH, Tech. Rep. AFAL-TR-67-311 (AD 826367), 1967.
37. —, “Maximal recursive sequences with 3-valued recursive cross-correlation functions,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 154–156, 1968.
38. —, “Study of multistate PN sequences and their application to communication systems,” Rockwell International Corp. Rep. (AD A025137), 1976.
39. R. Gold and E. Kopitzke, “Study of correlation properties of binary sequences,” Interim Tech. Rep. 1, vols. 1–4, Magnavox Res. Lab., Torrance, CA (AD 470696-9), 1965.
40. S. W. Golomb, Ed., Digital Communications with Space Applications. Englewood Cliffs, NJ: Prentice-Hall, 1964.
41. —, Shift Register Sequences. San Francisco, CA: Holden-Day, 1967.
42. —, “Theory of transformation groups of polynomials over GF(2) with applications to linear shift register sequences,” Inform. Sci., vol. 1, pp. 87–109, 1968.
43. S. W. Golomb and R. A. Scholtz “Generalized Barker sequences,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 533–537, 1965.
44. R. C. Heimiller “Phase shift pulse codes with good periodic correlation properties,” IRE Trans. Inform. Theory, vol. IT-7, pp. 254–257, 1961.
45. T. Helleseth “Some results about the cross-correlation function between two maximal linear sequences,” Discrete Math., vol. 16, pp. 209–232, 9176.
46. D. A. Huffman, “The generation of impulse-equivalent pulse trains,” IRE Trans. Inform. Theory, vol. IT-8, pp. S10–S16, 1962.
47. D. L. Huffman “A modification of Huffman's impulse-equivalent pulse trains to increase signal energy utilization,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 559–561, 1974.
48. IEEE Trans. Commun.: Special Issue on Spread Spectrum Communications, vol. COM-25, 1977.
49. G. A. Kabatyanskii and V. I. Levenshtein “Bounds for packings on a sphere and in space,” Probl. Peredach. Inform., vol. 14, pp. 3–25, Jan. 1978, (in Russian). English translation in Probl. Inform. Transmission, vol. 14, pp. 1–17, 1978.
50. J. Kaiser, J. W. Schwartz, and J. M. Aein, “Multiple access to a communication satellite with a hard-limiting repeater. Volume I: Modulation techniques and their applications,” Inst. Defense Analyses, Rep. R-108, (AD 457945), 1965.
51. T. Kasami, “Weight distribution formula for some class of cyclic codes,” Coordinated Science Lab., Univ. Illinois, Urbana. Tech. Rep. R-285 (AD 632574), 1966.
52. —, “Weight distribution of Bose-Chaudhuri-Hocquenghem codes,” in Combinatorial Mathematics and Its Applications. Chapel Hill, NC: Univ. of North Carolina Press, 1969 (also Coordinated Science Lab. Univ. Illinois, Urbana, Tech. Rep. R-317, 1966). Reprinted in E. R. Berlekamp, Ed., Key Papers in the Development of Coding Theory. New York: IEEE Press, 1974.
53. A. M. Kerdock, F. J. MacWilliams, and A. M. Odlyzko, “A new theorem about the Mattson-Solomon polynomial and some applications,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 85–89, 1974.
54. E. L. Key “An analysis of the structure and complexity of nonlinear binary sequence generators,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 732–736, 1976.
55. Y. I. Kotov “Correlation functions of composite sequences constructed from m-sequences,” Radio Eng. Electron. Phys., vol. 19, pp. 128–130, 1974.
56. I. L. Lebow, K. L. Jordan, and P. R. Drouilhet, Jr. “Satellite communications to mobile platforms,” Proc. IEEE, vol. 59, pp. 139–159, 1971.
57. J. Lee and D. R. Smith “Families of shift-register sequences with impulsive correlation properties,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 255–261, 1974.
58. A. Lempel “Analysis and synthesis of polynomials and sequences over GF(2),” IEEE Trans. Inform. Theory, vol. IT-17, pp. 297–303, 1971.
59. —, M. Cohn, and W. L. Eastman, “A class of balanced binary sequences with optimal autocorrelation properties,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 38–42, 1977.
60. A. Lempel and H. Greenberger “Families of sequences with optimal Hamming correlation properties,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 90–94, 1974.
61. R. M. Lerner, “Signals having good correlation functions,” WESCON Conv. Rec., 1961.
62. K. N. Levitt and J. K. Wolf, “On the interleaving of two-level periodic binary sequences,” Proc. N. E. C, pp. 644–649, 1965.
63. J. H. Lindholm “An analysis of the pseudo-randomness properties of subsequences of long m-sequences,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 569–576, 1968.
64. J. Lindner, “Binary sequences up to length 40 with best possible autocorrelation function,” Electron. Lett., vol. 11, p. 507, 1975.
65. R. J. McEliece “On periodic sequences from GF(q),” J. Combinatorial Theory, series A, vol. 10, pp. 80–91, 1971.
66. —, “Correlation properties of sets of sequences derived from irreducible cyclic codes,” Inform. Contr., to be published.
67. R. J. McEliece and H. Rumsey, Jr. “Euler products, cyclotomy, and coding,” J. Number Theory, vol. 4, pp. 302–311, 1972.
68. F. J. MacWilliams “An example of two cyclically orthogonal sequences with maximum period,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 338–339, 1967.
69. F. J. MacWilliams and N. J. A. Sloane “Pseudo-random sequences and arrays,” Proc. IEEE, vol. 64, pp. 1715–1729, 1976.
70. —, The Theory of Error-Correcting Codes. Amsterdam, the Netherlands: North-Holland, 1977.
71. J. L. Massey and J. J. Uhran, Jr., “Final report for multipath study,” Contract NAS5-10786, Univ. Notre Dame, Notre Dame, IN, 1969.
72. —, “Sub-baud coding,” in Proc. 13th Annu. Allerton Conf. Circuit and System Theory, pp. 539–547, 1975.
73. K. A. Meshkovskii, “A new class of pseudorandom sequences of binary signals,” Probl. Peredach. Inform., vol. 9, pp. 117–119, July 1973 (in Russian). English translation in Probl. Inform. Transmission, vol. 9, pp. 267–269, 1973.
74. L. B. Milstein “Some statistical properties of combination sequences,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 254–258, 1977.
75. L. B. Milstein and R. R. Ragonetti “Combination sequences for spread spectrum communications,” IEEE Trans. Commun., vol. COM-25, pp. 691–696, 1977.
76. J. W. Moon and L. Moser “On the correlation function of random binary sequences,” SIAM J. Appl. Math., vol. 16, no. 2, pp. 340–343, 1968.
77. Y. Niho, “Multi-valued cross-correlation functions between two maximal linear recursive sequences,” Ph.D. dissertation, Dep. Elec. Eng., Univ. Southern California (also USC EE Rep. 409), 1972.
78. M. I. Pelekhatyi and E. A. Golubev “Autocorrelative properties of certain types of binary sequences,” Probl Peredach. Inform., vol. 8, pp. 92–99, Jan. 1972 (in Russian). English translation in Probl Inform. Transmission, vol. 8, pp. 71–76, 1972.
79. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes, 2nd ed. Cambridge, MA: M.I.T. Press, 1972.
80. M. B. Pursley, “Evaluating performance of codes for spread spectrum multiple access communications,” in Proc. 12th Annu. Allerton Conf. Circuit and System Theory, pp. 765–774, 1974.
81. —, “Performance evaluation for phase-coded spread-spectrum multiple-access communication—Part I: System analysis,” IEEE Trans Commun., vol. COM-25, pp. 795–799, 1977.
82. —, “On the mean-square partial correlation of periodic sequences,” in Proc. 1979 Conf. Information Sciences and Systems (John Hopkins Univ., Baltimore, MD), pp. 377–379, 1979.
83. M. B. Pursley and F. D. Garber, “Quadriphase spread-spectrum multiple-access communications,” in IEEE Int. Conf. Communications, Conf. Rec., vol. 1, pp. 7.3.1–7.3.5, 1978.
84. M. B. Pursley and H. F. A. Roefs “Numerical evaluation of correlation parameters for optimal phases of binary shift-register sequences,” IEEE Trans. Commun., vol. COM-27, pp. 1597–1604, 1979.
85. M. B. Pursley and D. V. Sarwate “Bounds on aperiodic cross-correlation for binary sequences,” Electron. Lett., vol. 12, pp. 304–305, 1976.
86. —, “Evaluation of correlation parameters for periodic sequences,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 508–513, 1977.
87. —, “Performance evaluation for phase-coded spread-spectrum multiple-access communication—Part II: Code sequence analysis,” IEEE Trans. Commun., vol. COM-25, pp. 800–803, 1977.
88. I. S. Reed “kth order near-orthogonal codes,” IEEE Trans Inform. Theory, vol. IT-17, pp. 116–117, 1971.
89. I. S. Reed and H. Blasbalg “Multipath tolerant ranging and data transfer techniques for air-to-ground and ground-to-air links,” Proc. IEEE, vol. 58, pp. 422–429, 1970.
90. H. F. A. Roefs, “Binary sequences for spread-spectrum multiple-access communication,” Ph.D. dissertation, Dep. Elec. Eng., Univ. Illinois, Urbana, (also Coordinated Science Lab. Rep. R-785), Aug. 1977.
91. H. F. A. Roefs and M. B. Pursley “Correlation parameters of random binary sequences,” Electron. Lett., vol. 13, pp. 488–489, 1977.
92. H. F. A. Roefs, D. V. Sarwate, and M. B. Pursley. “Periodic correlation functions for sums of pairs of m-sequences,” in Proc. 1977 Conf. Information Sciences and Systems (Johns Hopkins Univ., Baltimore, MD), pp. 487–492, 1977.
93. D. V. Sarwate “Comments on ‘A class of balanced binary sesequences with optimal autocorrelation properties’,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 128–129, 1978.
94. —, “Crosscorrelation properties of sequences with applications to spread-spectrum multiple-access communication,” in Proc. AFOSR Workshop in Communication Theory and Applications, Provincetown, MA. pp. 88–91, 1978.
95. D. V. Sarwate “Bounds on crosscorrelation and autocorrelation of sequences,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 720–724, 1979.
96. D. V. Sarwate and M. B. Pursley, “Applications of coding theory to spread-spectrum multiple-access satellite communications,” in Proc. 1976 IEEE Canadian Communications and Power Conf., pp. 72–75, 1976.
97. —, “New correlation identities for periodic sequences,” Electron. Lett., vol. 13, no. 2, pp. 48–49, 1977.
98. —, “Hopping patterns for frequency hopped multiple-access communication,” in IEEE Int. Conf. Communications, Conf. Rec., pp. 7.4.1–7.4.3, 1978.
99. K. S. Schneider and R. S. Orr “Aperiodic correlation constraints on large binary sequence sets,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 79–84, 1975.
100. M. R. Schroeder “Synthesis of low-peak-factor signals and binary sequences with low autocorrelation,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 79–84, 1970.
101. R. A. Scholtz and L. R. Welch “Group characters: Sequences with good correlation properties,” IEEE Trans Inform. Theory, vol. IT-24, pp. 537–545, 1978.
102. J. W. Schwartz, J. M. Aein, and J. Kaiser “Modulation techniques for multiple access to a hard-limiting satellite repeater,” Proc. IEEE, vol. 54, pp. 763–777, 1966.
103. G. Seguin, “Binary sequences with specified correlation properties,” Ph.D. dissertation, Dep. Elec. Eng., Univ. Notre Dame, Notre Dame, IN (also Tech. Rep. 7103), 1971.
104. E. S. Selmer, “Linear recurrence relations over finite fields,” Dep. Math., Univ. Bergen, Bergen, Norway, 1966.
105. D. A. Shedd and D. V. Sarwate “Construction of sequences with good correlation properties,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 94–97, 1979.
106. V. M. Sidelnikov “Some k-valued pseudo-random sequences and nearly equidistant codes,” Probl Peredach. Inform., vol. 5, pp. 16–22, Jan. 1969 (in Russian). English translation in Probl. Inform. Transmission, vol. 5, pp. 12–16, 1969.
107. —, “Cross correlation of sequences,” Probl. Kybern., vol. 24, pp. 15–42, 1971 (in Russian).
108. —, “On mutual correlation of sequences,” Soviet Math. Dokl., vol. 12, pp. 197–201, 1971.
109. N. I. Smirnov, “Applications of m-sequences in asynchronous radio systems,” Telecommun. Radio Eng., vol. 24, no. 10, pp. 26–35 (translated from the Russian journal Elektrosvayz), 1970.
110. N. I. Smirnov and N. A. Golubkov, “Correlation properties of segments of m-sequences,” Telecommun. Radio Eng., vol. 28, no. 6, pp. 123–125 (translation from the Russian journal Elektrosvayz), 1973.
111. G. Solomon “Optimal frequency hopping sequences for multiple-access,” in Proc. 1973 Symp. Spread Spectrum Communications, vol. 1, (AD 915852), pp. 33–35, 1973.
112. G. Solomon and R. J. McEliece “Weights of cyclic codes,” J. Combinatorial Theory, vol. 1, pp. 459–475, 1966.
113. U. Somaini and M. H. Ackroyd “Uniform complex codes with low autocorrelation sidelobes,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 689–691, 1974.
114. R. Spann, “A two-dimensional correlation property of pseudo-random maximal-length sequences,” Proc. IEEE, vol. 53, p. 1257, 1963.
115. J. E. Stalder and C. R. Cahn “Bounds for correlation peaks of periodic digital sequences,” Proc. IEEE, vol. 52, pp. 1262–1263, 1964.
116. J. J. Stiffler “Rapid acquisition sequences,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 221–225, 1968.
117. —, Theory of Synchronous Communications. Englewood Cliffs, NJ: Prentice-Hall, 1971.
118. I. G. Stiglitz “Multiple-access considerations—A satellite example,” IEEE Trans. Commun., vol. COM-21, pp. 577–582, 1973.
119. Y. Sugiyama, S. Hirasawa, M. Kasahara, and T. Namekawa “The construction of sequences by interleaving method,” Electron. Commun. Japan, vol. 55-A, pp. 35–42, 1972.
120. Y. Taki, H. Miyakawa, M. Hatori, and S. Namba “Even-shift orthogonal sequences,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 295–300, 1969.
121. R. C. Titsworth “Optimal ranging codes,” IEEE Trans. Space Electron. Telem., vol. SET-10, pp. 19–30, 1964.
122. C.-C. Tseng and C. L. Liu “Complementary sets of sequences,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 644–652, 1972.
123. R. Turyn “The correlation function of a sequence of roots of 1,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 524–525, 1967.
124. —, “Sequences with small correlation,” in Error Correcting Codes, H. B. Mann, Ed. New York: Wiley, 1968.
125. —, “Four-phase Barker codes,” IEEE Transactions on Information Theory, vol. IT-20, pp. 366–371, 1974.
126. R. Turyn and J. Storer “On binary sequences,” Proc. Amer. Math. Soc, vol. 12, pp. 394–399, 1961.
127. S. Wainberg and J. K. Wolf “Subsequences of pseudorandom sequences,” IEEE Trans. Commun., vol. COM-18, pp. 606–612, 1970.
128. G. D. Weathers, E. R. Graf, and G. R. Wallace “The subsequence weight distribution of summed maximal length digital sequences,” IEEE Trans. Commun., vol. COM-22, pp. 997–1004, 1974.
129. L. R. Welch “Lower bounds on the maximum cross correlation of signals,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 397–399, 1974.
130. L. Weng “Decomposition of m-sequences and its applications,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 457–463, 1971.
131. M. Willett “The index of an m-sequence,” SIAM J. Appl. Math., vol. 25, pp. 24–27, 1973.
132. M. Willett “Characteristic m-sequences,” Math. Comput., vol. 30, pp. 306–311, 1976.
133. K. Yao “Error probability of asynchronous spread spectrum multiple access communications systems,” IEEE Trans. Commun., vol. COM-25, pp. 803–809, 1977.
134. N. Zierler “Linear recurring sequences,” J. Soc. Industrial and Applied Mathematics, vol. 7, pp. 31–48, 1959.
135. —, “Linear recurring sequences and error-correcting codes,” in Error Correcting Codes, H. B. Mann, Ed. New York: Wiley, 1968.
136. N. Zierler and W. H. Mills “Products of linear recurring sequences,” J. Algebra, vol. 27, pp. 147–157, 1973.