The composite sequences, a class of spreading sequences for direct-sequence spread spectrum communication (DS-SS), is investigated for the case of components which are binary maximal length sequences. The relevant properties of the composite sequences are derived and the acquisition time performance is determined for a noisy environment. It is demonstrated that the composite sequences are a large, balanced class of spreading sequences with a high linear span, reasonable autocorrelation performance, an essentially featureless power spectrum, improved security, and rapid acquisition capability. A novel subclass of composite sequences, termed the sliding composite sequences (SCS), is also presented, and their properties and performance are investigated and derived. It is shown that SCS are a large, nearly balanced class of spreading sequences with high linear span, an essentially featureless power spectrum, and improved security. Most importantly, through exploitation of the inherent rapid acquisition structure of SCS construction, a novel acquisition algorithm is developed which gives orders of magnitude reduction in acquisition time for DS-SS communications. In addition, a novel algorithm for generating primitive polynomials is presented and the aperiodic autocorrelation magnitude of m-sequences is bounded empirically.
- Pub Date:
- September 1992
- Power Spectra;
- Spread Spectrum Transmission;
- Communications and Radar