New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary Energy

  • Serdar Boztaş
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1719)

Abstract

In this paper, we consider a recent technique of Levenshtein [9] which was introduced to prove improved lower bounds on aperiodic correlation of sequence families over the complex roots of unity. We first give a new proof of the Welch [12] lower bound on the periodic correlation of complex roots of unity sequences using a modification of Levenshtein’s technique. This improves the Welch lower bound in the case that the family size is “large enough” compared to sequence length. Our main result is an improved lower bound on the periodic complex valued sequences with QAM-type alphabets. This result improves an earlier result by Boztaş [2]. To achieve this result, we extend the Levenshtein technique in a new direction.

Here, we assume that sequences are drawn from energy “shells” which are no more than PSK signal sets with the scaling determining the signal energy. It turns out that, if the weights are associated with the energy of the sequence in question, the Levenshtein technique can be modified to obtain lower bounds.

The new bound is a non-convex function of a set of suitably chosen “weights.” We demonstrate that our results improve those of [2] with a concrete example.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Boztaş, R. Hammons, and P. V. Kumar, “4-phase sequences with near-optimum correlation properties,”IEEE Trans. Inform. Theory IT-38 (1992), 1101–1113.CrossRefGoogle Scholar
  2. 2.
    S. Boztaş, “Lower bounds on the maximum periodic and aperiodic correlation of signal sets with arbitrary energy distribution”, in Proc. of the International Symposium on Information Theory and Its Applications, Sydney, Australia, 20-25 November 1994, pp. 1007–1012.Google Scholar
  3. 3.
    S. Boztaş, “New Lower Bounds on the Aperiodic Crosscorrelation of Codes over m th Roots of Unity”, RMIT Mathematics Research Report 13, September, 1998.Google Scholar
  4. 4.
    A. R. Hammons, Jr., P. V. Kumar, A. R. Calderbank, N. J. A. Sloane, and P. Solé, “ The Z4-linearity of Kerdock, Preparata, Goethals and related codes, ” IEEE Trans. Inform. Theory IT-40 (1994), 301–319.CrossRefGoogle Scholar
  5. 5.
    R. Gold, “Optimal binary sequences for spread spectrum multiplexing,” IEEE Trans. Inform. Theory IT-13 (1967), 619–621.CrossRefGoogle Scholar
  6. 6.
    S. W. Golomb, Shift-Register Sequences. Aegean Park Press, 1982.Google Scholar
  7. 7.
    T. Helleseth and V. Kumar, “Sequences with low correlation”, in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds., Elsevier, Amsterdam, 1998.Google Scholar
  8. 8.
    P. Kumar and O. Moreno, “Prime-phase sequences with correlation better than binary sequences,” IEEE Trans. Inform. Theory IT-37 (1991), 603–616.CrossRefGoogle Scholar
  9. 9.
    V. I. Levenshtein, “New lower bounds on aperiodic crosscorrelation of binary codes”, IEEE Trans. Inform. Theory, IT-45 (1999), 284–288.CrossRefMathSciNetGoogle Scholar
  10. 10.
    D. V. Sarwate and M. B. Pursley, “Crosscorrelation properties of pseudorandom and related sequences, ” Proc. IEEE 68 (1980), 593–620.CrossRefGoogle Scholar
  11. 11.
    V. M. Sidelnikov, “On mutual correlation of codes”, Dokl. Akad. Nauk SSSR, vol. 196, no. 3, pp. 531–534, 1971. English translation in Soviet Math. Dokl., vol. 12, no. 1, pp. 197-201, 1971.MathSciNetGoogle Scholar
  12. 12.
    L. R. Welch, “Lower bounds on the maximum cross-correlation of signals”, IEEE Trans. on Inform. Theory, IT-20 (1974), 397–399.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Serdar Boztaş
    • 1
  1. 1.Department of MathematicsRMIT UniversityMelbourneAustralia

Personalised recommendations