Computationally efficient bounds for the performance of direct-sequence spread-spectrum multiple-access communications systems in jamming environments

Abstract

An approach for calculating upper and lower bounds for the probability of error for asynchronous multiple-access spread-spectrum communication systems using deterministic codes is presented. The techniques is then generalized to include multiple-tone jamming. The approach utilizes the cumulative distribution function of individual interference terms. The computational complexity of the technique is calculated to the polynomial-like. Results showing the multiple-access performance of gold codes of lengths 31 and 127 in the presence of jamming are shown. The fact that this computational technique gives upper and lower bounds is rigorously proved using the Riemann-Stieltjes integral. >