Optimum Multiuser Asymptotic Efficiency

The degradation in bit error rate due to the presence of multiple-access interference in a white Gaussian channel can be measured by the multiuser asymptotic efficiency, defined as the ratio between the SNR required to achieve the same uncoded bit error rate in the absence of interfering users and the actual SNR. In this paper, the asymptotic efficiency of the optimum multiuser demodulator (a bank of matched filters followed by a Viterbi algorithm) is investigated and compared to that of the conventional single-user matched filter receiver. The computation of the optimum asymptotic efficiency of any given user is equivalent to the minimization of the Euclidean distance between any pair of multiuser signals which differ in at least one of the symbols of that user. It is shown that the optimum multiuser efficiency of asynchronous systems is nonzero with probability 1, and therefore the optimum demodulator does not become multiple-access limited in contrast to the single-user receiver. A class of signal constellations with moderate cross-correlation requirements is shown to achieve unit optimum multiuser efficiencies and, hence, to be equivalent to orthogonal signal sets from the viewpoint of performance of the optimum multiuser detector.

[1]  Carl-Erik W. Sundberg,et al.  On the minimum Euclidean distance for a class of signal space codes , 1982, IEEE Trans. Inf. Theory.

[2]  Joseph Y. N. Hui,et al.  Throughput analysis for code division multiple accessing of the spread spectrum channel , 1984, IEEE Transactions on Vehicular Technology.

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

[4]  David G. Luenberger,et al.  Technical Note - Cyclic Dynamic Programming: A Procedure for Problems with Fixed Delay , 1971, Oper. Res..

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

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

[7]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

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

[9]  Staffan A. Fredricsson,et al.  Optimum transmitting filter in digital PAM systems with a Viterbi detector , 1974, IEEE Trans. Inf. Theory.

[10]  R. Anderson,et al.  The minimum distance for MLSE digital data systems of limited complexity , 1975, IEEE Trans. Inf. Theory.

[11]  Rui-Hua Dou,et al.  Error Probability Bounds and Approximations for DS Spread-Spectrum Communication Systems with Mutiple Tone or Multiple Access Interference , 1984, IEEE Trans. Commun..

[12]  Aydano B. Carleial,et al.  A case where interference does not reduce capacity (Corresp.) , 1975, IEEE Trans. Inf. Theory.

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

[14]  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.

[15]  Sergio Verdú,et al.  Minimum probability of error for asynchronous Gaussian multiple-access channels , 1986, IEEE Trans. Inf. Theory.

[16]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[17]  D. G. Messerschmitt A Geometric Theory of Intersymbol Interference: Part II: Performance of the Maximum Likelihood Detector , 1973 .