Spreading Codes Generator for Wireless CDMA Networks

  • Authors:
  • Ernesto J. Cruselles;Miguel Soriano;José Luis Melús

  • Affiliations:
  • Department of Applied Mathematics and Telematics, Universitat Politécnica de Catalunya (UPC), Campus Nord - Edificio C3, c/Jordi Girona 1,3. 08034, Apartado 30,002 - Barcelona, Spain.;Department of Applied Mathematics and Telematics, Universitat Politécnica de Catalunya (UPC), Campus Nord - Edificio C3, c/Jordi Girona 1,3. 08034, Apartado 30,002 - Barcelona, Spain.;Department of Applied Mathematics and Telematics, Universitat Politécnica de Catalunya (UPC), Campus Nord - Edificio C3, c/Jordi Girona 1,3. 08034, Apartado 30,002 - Barcelona, Spain.

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

The prime characteristic of spread spectrum modulated signals is that theirbandwidth is greater than the information rate. In this way a redundancyis introduced that allows the severe levels of inteference inherent in the transmission of digital information over radio and satellite links to beovercome. Current spread spectrum applications are primarily in militarycommunications; nevertheless, there is growing interest in this technique for third generation mobile radio networks (UMTS, FPLTS, etc.) with opendiscussion regarding the practicality of using a multiple access system based on spread spectrum techniques (CDMA). However, in order to support asmany users in the same bandwidth as other multiple access techniques such as TDMA or FDMA, it is important how to generate large families of sequencesthat present low cross-correlation. The aim of this paper is to describe a spreading codes generator that can produce a large number of PN sequences with good properties of auto- and cross-correlation. Moreover, the codes generated shows high unpredictability and good statistical behaviour. This also allows the implementation of some features that are common on militarynetworks such as message privacy (increasingly important in commercialnetworks) without additional cost. The structure presented shows itself tobe advantageous for high speed generation of codes at a low cost, low powerconsumption (allowing longer life for batteries), small size and simplicityof implementation, essential ingredients for commercial equipment. Another attractive feature is its structural parallelism, useful in VLSIimplementations. All of these features render it potentially suitable for the implementation of channel bandwidth sharing systems in future wirelesspersonal communications networks.