Several approaches for the evaluation of upper and lower bounds on error probability of asynchronous spread spectrum multiple access communication systems are presented. These bounds are obtained by utilizing an isomorphism theorem in the theory of moment spaces. From this theorem, we generate closed, compact, and convex bodies, where one of the coordinates represents error probability, while the other coordinate represents a generalized moment of the multiple access interference random variable. Derivations for the second moment, fourth moment, single exponential moment, and multiple exponential moment are given in terms of the partial cross correlations of the codes used in the system. Error bounds based on the use of these moments are obtained. By using a sufficient number of terms in the multiple exponential moment, upper and lower error bounds can be made arbitrarily tight. In that case, the error probability equals the multiple exponential moment of the multiple access interference random variable. An example using partial cross correlations based on codes generated from Gold's method is presented.
[1]
J. W. Matthews.
Sharp error bounds for intersymbol interference
,
1973,
IEEE Trans. Inf. Theory.
[2]
M. Pursley,et al.
Performance Evaluation for Phase-Coded Spread-Spectrum Multiple-Access Communication - Part II: Code Sequence Analysis
,
1977,
IEEE Transactions on Communications.
[3]
Melvin Dresher,et al.
Moment spaces and inequalities
,
1953
.
[4]
Kung Yao,et al.
Moment space upper and lower error bounds for digital systems with intersymbol interference
,
1976,
IEEE Trans. Inf. Theory.
[5]
R. Gold,et al.
Optimal binary sequences for spread spectrum multiplexing (Corresp.)
,
1967,
IEEE Trans. Inf. Theory.