TL;DR: The results show that the proposed multiuser detectors afford important performance gains over conventional single-user systems, in which the signal constellation carries the entire burden of complexity required to achieve a given performance level.
Abstract: Consider a Gaussian multiple-access channel shared by K users who transmit asynchronously independent data streams by modulating a set of assigned signal waveforms. The uncoded probability of error achievable by optimum multiuser detectors is investigated. It is shown that the K -user maximum-likelihood sequence detector consists of a bank of single-user matched filters followed by a Viterbi algorithm whose complexity per binary decision is O(2^{K}) . The upper bound analysis of this detector follows an approach based on the decomposition of error sequences. The issues of convergence and tightness of the bounds are examined, and it is shown that the minimum multiuser error probability is equivalent in the Iow-noise region to that of a single-user system with reduced power. These results show that the proposed multiuser detectors afford important performance gains over conventional single-user systems, in which the signal constellation carries the entire burden of complexity required to achieve a given performance level.
TL;DR: Under the assumptions of symbol-synchronous transmissions and white Gaussian noise, the authors analyze the detection mechanism at the receiver, comparing different detectors by their bit error rates in the low-background-noise region and by their worst-case behavior in a near-far environment.
Abstract: Under the assumptions of symbol-synchronous transmissions and white Gaussian noise, the authors analyze the detection mechanism at the receiver, comparing different detectors by their bit error rates in the low-background-noise region and by their worst-case behavior in a near-far environment where the received energies of the users are not necessarily similar. Optimum multiuser detection achieves important performance gains over conventional single-user detection at the expense of computational complexity that grows exponentially with the number of users. It is shown that in the synchronous case the performance achieved by linear multiuser detectors is similar to that of optimum multiuser detection. Attention is focused on detectors whose linear memoryless transformation is a generalized inverse of the matrix of signature waveform crosscorrelations, and on the optimum linear detector. It is shown that the generalized inverse detectors exhibit the same degree of near-far resistance as the optimum multiuser detectors. The optimum linear detector is obtained. >
TL;DR: It is concluded that MMSE detectors can alleviate the need for stringent power control in CDMA systems, and may be a practical alternative to the matched filter receiver.
Abstract: We consider interference suppression for direct-sequence spread-spectrum code-division multiple-access (CDMA) systems using the minimum mean squared error (MMSE) performance criterion. The conventional matched filter receiver suffers from the near-far problem, and requires strict power control (typically involving feedback from receiver to transmitter) for acceptable performance. Multiuser detection schemes previously proposed mitigate the near-far problem, but are complex and require explicit knowledge or estimates of the interference parameters. In this paper, we present and analyze several new MMSE interference suppression schemes, which have the advantage of being near-far resistant (to varying degrees, depending on their complexity), and can be implemented adaptively when interference parameters are unknown and/or time-varying, Numerical results are provided that show that these schemes offer significant performance gains relative to the matched filter receiver. We conclude that MMSE detectors can alleviate the need for stringent power control. In CDMA systems, and may be a practical alternative to the matched filter receiver. >
TL;DR: A multiuser detection strategy for coherent demodulation in an asynchronous code-division multiple-access system is proposed and analyzed, showing that the two-stage receiver is particularly well suited for near-far situations, approaching performance of single-user communications as the interfering signals become stronger.
Abstract: A multiuser detection strategy for coherent demodulation in an asynchronous code-division multiple-access system is proposed and analyzed. The resulting detectors process the sufficient statistics by means of a multistage algorithm based on a scheme for annihilating successive multiple-access interference. An efficient real-time implementation of the multistage algorithm with a fixed decoding delay is obtained and shown to require a computational complexity per symbol which is linear in the number of users K. Hence, the multistage detector contrasts with the optimum demodulator, which is based on a dynamic programming algorithm, has a variable decoding delay, and has a software complexity per symbol that is exponential in K. An exact expression is obtained and used to compute the probability of error is obtained for the two-stage detector, showing that the two-stage receiver is particularly well suited for near-far situations, approaching performance of single-user communications as the interfering signals become stronger. The near-far problem is therefore alleviated. Significant performance gains over the conventional receiver are obtained even for relatively high-bandwidth-efficiency situations. >
TL;DR: It is shown that robust wireless communication in high-scattering propagation environments using multi-element antenna arrays (MEAs) at both transmit and receive sites using a simplified, but highly spectrally efficient space-time communication processing method can offer no more than about 40% more capacity than the simple architecture presented.
Abstract: We investigate robust wireless communication in high-scattering propagation environments using multi-element antenna arrays (MEAs) at both transmit and receive sites. A simplified, but highly spectrally efficient space-time communication processing method is presented. The user's bit stream is mapped to a vector of independently modulated equal bit-rate signal components that are simultaneously transmitted in the same band. A detection algorithm similar to multiuser detection is employed to detect the signal components in white Gaussian noise (WGN). For a large number of antennas, a more efficient architecture can offer no more than about 40% more capacity than the simple architecture presented. A testbed that is now being completed operates at 1.9 GHz with up to 16 quadrature amplitude modulation (QAM) transmitters and 16 receive antennas. Under ideal operation at 18 dB signal-to-noise ratio (SNR), using 12 transmit antennas and 16 receive antennas (even with uncoded communication), the theoretical spectral efficiency is 36 bit/s/Hz, whereas the Shannon capacity is 71.1 bit/s/Hz. The 36 bits per vector symbol, which corresponds to over 200 billion constellation points, assumes a 5% block error rate (BLER) for 100 vector symbol bursts.