Abstract
Two families of low correlation QAM sequences are presented here. In a CDMA setting, these sequences have the ability to transport a large amount of data as well as enable variable-rate signaling on the reverse link.
The first family \({\cal I}^2{\cal SQ - B}\) is constructed by interleaving 2 selected QAM sequences. This family is defined over M 2-QAM, where M = 2m, m ≥ 2. Over 16-QAM, the normalized maximum correlation \(\overline{\theta}_{\max}\) is bounded above by \( \lesssim 1.17 \, \sqrt{N}\), where N is the period of the sequences in the family. This upper bound on \(\overline{\theta}_{\max}\) is the lowest among all known sequence families over 16-QAM.
The second family \({\cal I}^4{\cal SQ}\) is constructed by interleaving 4 selected QAM sequences. This family is defined over M 2-QAM, where M = 2m, m ≥ 3, i.e., 64-QAM and beyond. The \(\overline{\theta}_{\max}\) for sequences in this family over 64-QAM is upper bounded by \( \lesssim 1.60 \, \sqrt{N}\). For large M, \(\overline{\theta}_{\max} \lesssim 1.64 \, \sqrt{N}\). These upper bounds on \(\overline{\theta}_{\max}\) are the lowest among all known sequence families over M 2-QAM, M = 2m, m ≥ 3.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anand, M., Kumar, P.V.: Low Correlation Sequences over QAM and AM-PSK Constellations. IEEE Trans. Inform. Theory 54(2), 791–810 (2008)
Boztaş, S.: CDMA over QAM and other Arbitrary Energy Constellations. Proc. IEEE Int. Conf. on Comm. Systems 2, 21.7.1–21.7.5 (1996)
Boztaş, S.: New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary Energy. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds.) AAECC 1999. LNCS, vol. 1719, pp. 410–419. Springer, Heidelberg (1999)
Boztaş, S., Hammons, R., Kumar, P.V.: 4-phase sequences with near-optimum correlation properties. IEEE Trans. Inform. Theory 38(3), 1101–1113 (1992)
Garg, G., Kumar, P.V., Veni Madhavan, C.E.: Low correlation interleaved QAM sequences. In: Int. Symp. on Inf. Theory (ISIT), Toronto, Canada, July 6–11 (2008)
Hammons Jr., A.R., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., Solé, P.: The ℤ4-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inform. Theory 40(2), 301–319 (1994)
Helleseth, T., Kumar, P.V.: Sequences with low correlation. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, Elsevier, Amsterdam (1998)
Kumar, P.V., Helleseth, T., Calderbank, A.R.: An upper bound for Weil exponential sums over Galois rings and applications. IEEE Trans. Inform. Theory 41(2), 456–468 (1995)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)
Solé, P.: A quaternary cyclic code and a family of quadriphase sequences with low correlation properties. In: Coding Theory and Applications. LNCS, vol. 388. Springer, Heidelberg (1989)
Tang, X., Udaya, P.: A Note on the Optimal Quadriphase Sequences Families. IEEE Trans. Inform. Theory 53(1), 433–436 (2007)
Udaya, P., Siddiqi, M.U.: Optimal Biphase Sequences with Large Linear Complexity Derived from Sequences over Z4. IEEE Trans. on Inform. Theory 42(1), 206–216 (1996)
Welch, L.R.: Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inform. Theory 20(3), 397–399 (1974)
Yang, K., Helleseth, T., Kumar, P.V., Shanbhag, A.: The weight hierarchy of Kerdock codes over ℤ4. IEEE Trans. Inform. Theory 42(5), 1587–1593 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garg, G., Kumar, P.V., Madhavan, C.E.V. (2008). Two New Families of Low-Correlation Interleaved QAM Sequences. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds) Sequences and Their Applications - SETA 2008. SETA 2008. Lecture Notes in Computer Science, vol 5203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85912-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-85912-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85911-6
Online ISBN: 978-3-540-85912-3
eBook Packages: Computer ScienceComputer Science (R0)