Skip to main content

A New Method for Generating Sets of Orthogonal Sequences for a Synchronous CDMA System

  • Conference paper
  • First Online:
Cryptography and Coding (Cryptography and Coding 1999)

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

Included in the following conference series:

Abstract

A new, systematic method of generating orthogonal sets of sequences with good correlation properties is described. An orthogonal set is defined as a collection of n sequences, of length n chips, that are mutually orthogonal. Although there are many possible combinations of sequences forming orthogonal sets of a specified length, few have been identified with a structured method of generation such as Walsh codes and orthogonal Gold codes. The application of the new sequences discussed is orthogonal spreading codes in a synchronous code division multiple access (CDMA) system and their correlation properties are considered accordingly.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garg, V.K., Smolik, K., Wilkes, J.E.: Applications of CDMA in Wireless/Personal Communications. Prentice Hall (1997)

    Google Scholar 

  2. Tachikawa, S.: Recent Spreading Codes for Spread Spectrum Communication Systems. Elec. and Comm. in Japan. Vol.75.No.6. (1992) 41–49

    Article  Google Scholar 

  3. Popovic, B.M.: Efficient despreaders for multi-code CDMA systems. Proc. ICUPC. (1997) 516–520

    Google Scholar 

  4. Dinan, E.H., Jabbari, B.: Spreading codes for direct sequence CDMA and wideband CDMA cellular networks. IEEE Comms. Mag. (1998) 48–54

    Google Scholar 

  5. Sarwate, D.V.: Bounds on crosscorrelation and autocorrelation of sequences. IEEE Trans. on Communications. Vol.IT-25.No.6 (1979) 720–724

    MathSciNet  MATH  Google Scholar 

  6. Pursley, M.B.: Performance evaluation for phase-coded spread-spectrum multiple-access communications-Part I: System analysis. IEEE Trans.on Communications. Vol.COM-25.No.8. (1977) 795–799

    Article  MathSciNet  Google Scholar 

  7. Schotten, H.: Tutorial: Sequenzen und ihre Korrelationseigenschaften. University of Ulm.(1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Donelan, H., O’Farrell, T. (1999). A New Method for Generating Sets of Orthogonal Sequences for a Synchronous CDMA System. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-46665-7_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66887-9

  • Online ISBN: 978-3-540-46665-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics