Optimum PN sequences for CDMA systems. (English) Zbl 1415.94019
Glisic, Savo G. (ed.) et al., Code division multiple access communications. Boston, MA: Kluwer Academic Publishers. 53-78 (1995).
Summary: Most known methods for the design of hopping patterns for frequency-hopped code-division multiple-access (CDMA) systems and for the design of signature sequences for direct-sequence CDMA systems provide sequences that can be viewed as codewords (or the images of codewords) selected from low-rate Reed-Solomon codes. This chapter surveys sequence designs for CDMA systems from this viewpoint.
For the entire collection see [Zbl 1412.94003].
For the entire collection see [Zbl 1412.94003].
References:
| [1] | C. A. Baum and M. B. Pursley, “Bayesian methods for erasure insertion in frequency-hop communication systems with partial-band interference,” IEEE Transactions on Communications, vol. 40, pp. 1231-1238, July 1992. · Zbl 0825.94042 · doi:10.1109/26.153368 |
| [2] | N. Burger, “The design of frequency hopping patterns for multiple-access communications,” M. S. thesis, Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois, January 1994. |
| [3] | G. R. Cooper and C. D. McGillem, Modern Communications and Spread Spectrum, New York: McGraw-Hill, 1984. |
| [4] | G. R. Cooper and R. W. Nettleton, “A spread spectrum technique for high-capacity mobile communications,” IEEE Trans. Vehicular Tech., vol. VT-27, pp. 264-275,1978. · doi:10.1109/T-VT.1978.23758 |
| [5] | G. Einarsson, “Address assignment for a time-frequency-coded, spread spectrum system,” Bell Syst. Tech. J., vol. 59, pp. 1241-1255, 1980. |
| [6] | E. A. Geraniotis and M. B. Pursley, “Error probabilities for slow frequency-hopped spread-spectrum multiple-access communication over fading channels,” IEEE Trans. Commun., vol. COM-30, pp. 996-1009, 1982. · doi:10.1109/TCOM.1982.1095551 |
| [7] | S. W. Golomb, Shift Register Sequences. San Francisco: Holden-Day, 1967. · Zbl 0267.94022 |
| [8] | J. B. Jevtic and H. B. Alkhatib, “Frequency-hopping codes for multiple-access channels: A geometric approach,” IEEE Trans. Inform. Theory, vol. 35, pp. 477-481, March 1989. · doi:10.1109/18.32145 |
| [9] | P. V. Kumar, “Frequency-hopping code sequence designs having large linear span,” IEEE Trans. Inform. Theory, vol. 34, pp. 146-151, January 1988. · doi:10.1109/18.2616 |
| [10] | A. Lempel and H. Greenberger, “Families of sequences with optimal Hamming correlation properties,” IEEE Trans. Inform. Theory, vol. IT-20,pp. 90-94, January 1974. · Zbl 0277.94006 · doi:10.1109/TIT.1974.1055169 |
| [11] | J. H. van Lint, A Course in Coding Theory, Berlin: Springer-Verlag, 1989. |
| [12] | F. J. MacWilliams and N. J. A. Sloane, “Pseudorandom sequences and arrays,” Proc. IEEE„ vol. 64, pp. 1715-1729, December 1976. · doi:10.1109/PROC.1976.10411 |
| [13] | F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. · Zbl 0369.94008 |
| [14] | S. V. Maric and E. L. Titlebaum, “Frequency hop multiple access codes based upon the theory of cubic congruences,” IEEE Trans. Aerospace and Electronic Systems, vol. 25, pp. 1035-1039, November 1990. · doi:10.1109/7.62257 |
| [15] | R. J. McEliece, “Some combinatorial aspects of spread spectrum communication systems,” in New Concepts in Multi-User Communications, J. K. Skwirzynski (Ed.), NASI Sirjhoff and Noordhoff, 1981. |
| [16] | R. J. McEliece, Finite Fields for Computer Scientists and Engineers, Kluwer Press: Boston MA 1989. · Zbl 0662.94014 |
| [17] | R. M. Mersereau and T. S. Seay, “Multiple access frequency hopping patterns with low ambiguity,” IEEE Trans. Aerospace and Electronic Systems, vol. AES-17, pp. 571-578, 1981. · doi:10.1109/TAES.1981.309186 |
| [18] | B. Popovic, “New sequences for frequency hopping multiplex,” Electronics Letters, vol. 24, June 1986. |
| [19] | B. Popovic, “Comment on‘Code acquisition for a frequency hopping system’,”IEEE Trans. Commun. May 1989. |
| [20] | M. B. Pursley, “Frequency-hop transmission for satellite packet switching and terrestrial packet radio networks,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 652-667, September 1986. · Zbl 0618.94002 · doi:10.1109/TIT.1986.1057225 |
| [21] | M. B. Pursley, “Reed-Solomon codes for frequency-hop communications,” in Reed-Solomon Codes and Their Applications, S. B. Wicker and V. K. Bhargava (eds.), Piscataway, NJ: IEEE Press, 1994. · Zbl 1126.94359 |
| [22] | I. S. Reed, “k-th order near-orthogonal codes,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 116-117, January 1971. · Zbl 0217.28802 · doi:10.1109/TIT.1971.1054571 |
| [23] | G. M. Roth and G. Seroussi, “On cyclic MDS codes of length q over GF(q),” IEEE Trans. Inform. Theory, vol. IT-32, pp. 284-285, March 1986. · Zbl 0592.94016 · doi:10.1109/TIT.1986.1057151 |
| [24] | D. V. Sarwate and M. B. Pursley, “Hopping patterns for frequency hopped multiple access communications,” Conf. Record: IEEE Int. Conf. on Commun., (Toronto, Ontario: June 4-8, 1978), vol. 1, pp. 7.4.1-7.4.3. |
| [25] | D. V. Sarwate and M. B. Pursley, “Crosscorrelation properties of pseudorandom and related sequences,” Proc. IEEE, vol. 68, pp. 593-619, May 1980. · doi:10.1109/PROC.1980.11697 |
| [26] | A. A. Shaar and P. A. Davies, “Prime sequences: quasi-optimal sequences for OR channel code division multiplexing,” Electronics Letters, vol. 19, pp. 888-890, 1981. · doi:10.1049/el:19830605 |
| [27] | A. A. Shaar and P. A. Davies, “A survey of one-coincidence sequences for frequency-hopped spread-spectrum systems,” IEE Proc. — Part F: Commun., Radar, and Signal Proc., vol. 131, pp. 719-724, December 1984. · doi:10.1049/ip-f-1.1984.0108 |
| [28] | A. A. Shaar, C. F. Woodcock, and P. A. Davies, “Number of one-coincidence sequence sets for frequency-hopping multiple access communication systems,” IEE Proc. — Part F: Commun., Radar, and Signal Proc., vol. 131, pp. 725-728, December 1984. · doi:10.1049/ip-f-1.1984.0109 |
| [29] | M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications. Rockville, MD: Computer Science Press, 1985. |
| [30] | G. Solomon, “Optimal frequency hopping sequences for multiple access,” Proc. Symp. on Spread Spectrum Commun., Vol. 1, AD-915852, pp. 33-35, 1973. |
| [31] | H. Y. Song, I. S. Reed, and S. W. Golomb, “On the nonperiodic cyclic equivalence classes of Reed-Solomon codes,” IEEE Trans. Inform. Theory, vol. 39, pp. 1431-1434, July 1993. · Zbl 0804.94016 · doi:10.1109/18.243465 |
| [32] | E. L. Titlebaum, “Time frequency hop signals, Part I: Coding based upon the theory of linear congruences,” IEEE Trans. Aerospace and Electronic Systems, vol. AES-17, pp. 490-494, July 1981. · doi:10.1109/TAES.1981.309176 |
| [33] | E. L. Titlebaum and L. H. Sibul,“Time frequency hop signals, Part II: Coding based upon the theory of quadratic congruences,” IEEE Trans. Aerospace and Electronic Systems, vol. AES-17, pp. 494-501, July 1981. · doi:10.1109/TAES.1981.309177 |
| [34] | I. Vajda,“Code sequences for frequency-hopping multiple-access systems,” IEEE Trans. Commun. to appear. · Zbl 0978.94501 |
| [35] | R. E. Ziemer and R. L. Peterson, Digital Communications and Spread Spectrum Systems. New York: Macmillan, 1985. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
