| The composite sequences, a class of spreading sequences for direct-sequence spread spectrum (DS-SS) communications, are investigated for the case of components which are binary maximal-length sequences. The relevant properties of the composite sequences are derived and in particular, the acquisition time performance is determined for a noisy environment. It is demonstrated in this thesis that the composite sequences are a large, balanced class of spreading sequences with 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, is also presented here. As with the composite sequences, the properties and performance of sliding composite sequences are investigated and derived. It is demonstrated that the sliding composite sequences 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 the sliding composite sequence 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 the generation of primitive polynomials is presented in this thesis and the aperiodic autocorrelation magnitude of m-sequences is bounded empirically. |
