Spread Spectrum Techniques

Spread spectrum signals have the distinguishing characteristic that the bandwidth used to transmit a message is much greater than the message bandwidth. This band spread is achieved by using a spreading code or pseudo-noise (PN) sequence that is independent of the message and is known to the receiver. The receiver uses a synchronized replica of the PN sequence to despread the received signal allowing recovery of the message. The chapter begins with an introduction to direct sequence (DS) and frequency hop (FH) spread spectrum. PN sequences are fundamental to all spread spectrum systems and are treated in detail. A variety of sequences are considered including m-sequences, Gold sequences, Kasami sequences, Barker sequences, Walsh-Hadamard sequences, variable length orthogonal codes, and complementary code keying. The remainder of the chapter concentrates on DS spread spectrum. The power spectral density of DS spread spectrum signals is considered. Afterwards, the bit error rate performance of DS spread spectrum signals is considered in the presence of tone interference. Afterwards, the performance of point-to-point DS spread spectrum on frequency-selective fading channels is discussed and it is shown how a RAKE receiver can be used to gain multipath diversity. The chapter concludes with a discussion of CDMA multiuser detection techniques, including optimum CDMA multiuser detection, decorrelation detection and minimum mean square error detection.

[1]  P. E. Green,et al.  A Communication Technique for Multipath Channels , 1958, Proceedings of the IRE.

[2]  Michael B. Pursley,et al.  Error Probabilities for Binary Direct-Sequence Spread-Spectrum Communications with Random Signature Sequences , 1987, IEEE Trans. Commun..

[3]  Jack M. Holtzman,et al.  A simple, accurate method to calculate spread-spectrum multiple-access error probabilities , 1992, IEEE Trans. Commun..

[4]  Robert C. Dixon,et al.  Spread spectrum techniques , 1976 .

[5]  David C. Chu,et al.  Polyphase codes with good periodic correlation properties (Corresp.) , 1972, IEEE Trans. Inf. Theory.

[6]  Shu Lin,et al.  Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application , 1966, Inf. Control..

[7]  Evaggelos Geraniotis Direct-Sequence Spread-Spectrum Multiple-Access Communications Over Nonselective and Frequency-Selective Rician Fading Channels , 1986, IEEE Trans. Commun..

[8]  George R. Cooper,et al.  A spread-spectrum technique for high-capacity mobile communications , 1978 .

[9]  James S. Lehnert,et al.  Bit-to-bit error dependence in slotted DS/SSMA packet systems with random signature sequences , 1989, IEEE Trans. Commun..

[10]  I. Good,et al.  A Table of Discrete Fourier Transform Pairs , 1977 .

[11]  L. B. Milstein,et al.  Theory of Spread-Spectrum Communications - A Tutorial , 1982, IEEE Transactions on Communications.

[12]  Evaggelos Geraniotis,et al.  Throughput analysis of a random access tree protocol for direct-sequence spread-spectrum packet radio networks , 1987, 26th IEEE Conference on Decision and Control.

[13]  James L. Massey,et al.  Review of 'Error-Correcting Codes, 2nd edn.' (Peterson, W. W., and Weldon, E. J., Jr.; 1972) , 1973, IEEE Trans. Inf. Theory.

[14]  R. Gold,et al.  Optimal binary sequences for spread spectrum multiplexing (Corresp.) , 1967, IEEE Trans. Inf. Theory.