By Topic

Performance bounds for direct-sequence spread-spectrum communications with complex signature sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lam, A.W. ; Dept. of Electr. & Comput. Eng., US Naval Postgraduate Sch., Monterey, CA, USA ; Ozluturk, F.M.

The authors present 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 pbe performance than binary sequences. Using complex sequences, the number of signature sequences that have good auto- and crosscorrelation properties is greatly enlarged. New users that use complex or binary signature sequences can be added into existing systems with graceful performance degradation

Published in:

Computers and Communications, 1991. Conference Proceedings., Tenth Annual International Phoenix Conference on

Date of Conference:

27-30 Mar 1991