Skip to main content
SpringerLink
Log in

Criteria for sequence set design in CDMA communications

  • Invited Contributions
  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 673))

Abstract

This paper surveys some of the traditional sequence designs that have been considered for code-division multiple-access (CDMA) communications. The design criteria are based on periodic and partial-period cross-correlation properties of the sequence sets. Variations of the design criteria are suggested here which are related more directly to CDMA system performance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Akheizer, N.I. (1965): The Classical Moment Problem. Hafner, New York.

    Google Scholar 

  • Bekir, N.E. (1978): Bounds on the distribution of partial correlation for PN and Gold sequences. Ph.D. dissertation, U. of Southern California

    Google Scholar 

  • Boztaş, S., Kumar, P.V. (1993): Binary sequences with Gold-like correlation but large linear span. IEEE Trans. Inform. Theory (to appear)

    Google Scholar 

  • Fredricsson, S.A. (1975): Pseudo-randomness properties of binary shift register sequences. IEEE Trans. Inform. Theory IT-21(1), 115–120

    Google Scholar 

  • Gabidulin, E. (1993): Non-binary sequences with the perfect periodic auto-correlation and with optimal periodic cross-correlation. International Symposium on Information Theory, 412

    Google Scholar 

  • Gold, R. (1967): Optimal binary sequences for spread-spectrum multiplexing. IEEE Trans. Inform. Theory IT-13(4), 619–621

    Google Scholar 

  • Hammons, R., Kumar, P.V. (1992): On a recent 4-phase sequence design. IEEE Second International Symposium on Spread Spectrum Techniques and Applications, Yokohama, Japan, 219–225

    Google Scholar 

  • Kasami, T. (1966): Weight distribution formula for some classes of cyclic codes. Coordinated Science Lab., Univ. Illinois, Tech. Rep. R-285 (AD 632574)

    Google Scholar 

  • Lerner, R.M. (1961): Signals having good correlation functions. IEEE WESCON Convention Record

    Google Scholar 

  • Lindholm, J.H. (1968): An analysis of the pseudo-randomness properties of subsequences of long m-sequences. IEEE Trans. Inform. Theory IT-14(4), 569–576

    Google Scholar 

  • Liu, K.H. (1987): Binary sequences with very small local partial period correlations and local orthogonal sequences. Ph.D. dissertation, U. of Southern California

    Google Scholar 

  • Massey, J.L., Urhan, J.J., Jr. (1975): Sub-baud Decoding. Proc. 13th Annual Allerton Conf. Circuit and System Theory, 539–547

    Google Scholar 

  • No, J.S., Kumar, P.V. (1989): A new family of binary pseudorandom sequences having optimal correlation properties and large linear span. IEEE Trans. Inform. Theory IT-35(2), 371–379

    Google Scholar 

  • Olsen, J.D., Scholtz, R.A., Welch, L.R. (1982): Bent-function sequences. IEEE Trans. Inform. Theory IT-28(6), 858–864

    Google Scholar 

  • Pless, V. (1963): Power moment identities on weight distributionsin error correcting codes. Info. and Control 6, 147–152

    Google Scholar 

  • Poor, H.V. (1992): Signal processing for wideband communications. IEEE Inform. Theory Newsletter 32(2), 1–10

    Google Scholar 

  • Rothaus, O.S. (1976): On “bent” functions. J. Comb. Theory, Series A20, 300–305

    Google Scholar 

  • Sarwate, D.V., Pursley, M.B. (1980): Crosscorrelation properties of pseudorandom and related sequences. Proc. IEEE 68(5), 593–619

    Google Scholar 

  • Scholtz, R.A., Welch, L.R. (1978): Group characters: sequences with good correlation properties. IEEE Trans. Inform. Theory IT-24(5), 537–545

    Google Scholar 

  • Scholtz, R.A., Welch, L.R. (1984): GMW sequences. IEEE Trans. Inform. Theory IT-30(3), 548–553

    Google Scholar 

  • Simon, M.K., Omura, J.K., Scholtz, R.A., Levitt, B.K. (1985): Spread Spectrum Communications. Computer Science Press, Rockville MD

    Google Scholar 

  • Solé, P. (1988): A Quaternary cyclic code, and a family of quadriphase sequences with low correlation properties. Coding Theory and Applications, Third International Colloquium. (Lecture Notes in Computer Science, 388) Springer, New York Berlin Heidelberg, 193–201

    Google Scholar 

  • Suehiro, N., Hatori, M. (1988): Modulatable orthogonal sequences and their application to SSMA systems. IEEE Trans. Inform. Theory IT-34(1), 93–100

    Google Scholar 

  • Wainberg, S., Wolf, J.K. (1970): Subsequences of pseudo-random sequences. IEEE Trans. Commun. Tech., COM-18(5), 606–612

    Google Scholar 

  • Welch, L.R. (1974): Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inform. Theory IT-20(3), 397–399

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Communication Sciences Institute, University of Southern California, 90089-2565, Los Angeles, CA, USA

    Robert A. Scholtz

Authors
  1. Robert A. Scholtz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Teo Mora Oscar Moreno

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Scholtz, R.A. (1993). Criteria for sequence set design in CDMA communications. In: Cohen, G., Mora, T., Moreno, O. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1993. Lecture Notes in Computer Science, vol 673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56686-4_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-56686-4_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56686-1

  • Online ISBN: 978-3-540-47630-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation