Performance Bounds for DS/SSMA Communications with Complex Signature Sequences

摘要

This paper presents a unified performance analysis of direct-sequence spread-spectrum multiple-access (DS/SSMA) communications with deterministic complex signature sequences. The probability density function (pdf) of the multiple-user interference is determined. Using a round-down and round-up procedure on the pdf, arbitrarily tight lower and upper bounds on the probability of bit error (pbe) are obtained. Results based on the Gaussian approximation method are also presented. It is shown that complex sequences can yield better performance than binary sequences. Using complex sequences, the number of signature sequences that