Minimum Probability of Error for Asynchronous Multiple Access Communication Systems

Consider an ideal white gaussian channel shared by K users that transmit independent data streams by modulating antipodally a set of assigned signal waveforms without maintaining relative synchronism among them. This paper investigates the probability of error achievable by an optimum K-user coherent detector. It is shown that unless signals with poor cross-correlation properties are used or the interfering users are comparatively weak, the minimum error probabilities have the same asymptotic behavior as in a single-user communication system, i.e. there is no performance degradation due to the presence of other users. As illustrated by several examples, this implies that in the SNR region of interest, the error probability of the conventional detector is not necessarily close to the minimum even if signals with low cross-correlations are used.

[1]  Gerard J. Foschini,et al.  A reduced state variant of maximum likelihood sequence detection attaining optimum performance for high signal-to-noise ratios , 1977, IEEE Trans. Inf. Theory.

[2]  Sergio Verdu On Fixed-Interval Minimum Symbol Error Probability Detection. , 1983 .

[3]  K. Schneider Optimum Detection of Code Division Multiplexed Signals , 1979, IEEE Transactions on Aerospace and Electronic Systems.

[4]  Wayne E. Stark,et al.  BOUNDS ON ERROR PROBABILITY FOR DIRECT-SEQUENCE SPREAD-SPECTRUM MULTIPLE-ACCESS COMMUNICATIONS. , 2022 .

[5]  Michael B. Pursley,et al.  Spread-Spectrum Multiple-Access Communications , 1981 .

[6]  M. Pursley,et al.  Optimal phases of maximal length sequences for asynchronous spread-spectrum multiplexing , 1980 .

[7]  G. David Forney Lower Bounds on Error Probability in the Presence of Large Intersymbol Interference , 1972, IEEE Trans. Commun..

[8]  C.L. Weber,et al.  Performance considerations of code division multiple-access systems , 1981, IEEE Transactions on Vehicular Technology.

[9]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[10]  G. David Forney,et al.  Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference , 1972, IEEE Trans. Inf. Theory.

[11]  D. V. Sarwate,et al.  Error Probability for Direct-Sequence Spread-Spectrum Multiple-Access Communications - Part I: Upper and Lower Bounds , 1982, IEEE Transactions on Communications.

[12]  Thomas M. Cover,et al.  Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms , 1982, IEEE Trans. Commun..

[13]  G. Ungerboeck,et al.  Adaptive Maximum-Likelihood Receiver for Carrier-Modulated Data-Transmission Systems , 1974, IEEE Trans. Commun..

[14]  R.M.F. Goodman,et al.  Soft-decision minimum-distance sequential decoding algorithm for convolutional codes , 1981 .

[15]  E. A. Geraniotis,et al.  Error Probability for Direct-Sequence Spread-Spectrum Multiple-Access Communications - Part II: Approximations , 1982, IEEE Transactions on Communications.