Spreading Codes Generator for Wireless CDMA Networks

The prime characteristic of spread spectrum modulated signals is that their bandwidth is greater than the information rate. In this way a redundancy is introduced that allows the severe levels of inteference inherent in the transmission of digital information over radio and satellite links to be overcome. Current spread spectrum applications are primarily in military communications; nevertheless, there is growing interest in this technique for third generation mobile radio networks (UMTS, FPLTS, etc.) with open discussion regarding the practicality of using a multiple access system based on spread spectrum techniques (CDMA). However, in order to support as many users in the same bandwidth as other multiple access techniques such as TDMA or FDMA, it is important how to generate large families of sequences that 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 military networks such as message privacy (increasingly important in commercial networks) without additional cost. The structure presented shows itself to be advantageous for high speed generation of codes at a low cost, low power consumption (allowing longer life for batteries), small size and simplicity of implementation, essential ingredients for commercial equipment. Another attractive feature is its structural parallelism, useful in VLSI implementations. All of these features render it potentially suitable for the implementation of channel bandwidth sharing systems in future wireless personal communications networks.