Computational complexity of optimum multiuser detection
- 291 Downloads
Optimum centralized demodulation of the independent data streams transmitted simultaneously by several users through a Code Division Multiple-Access channel is considered. Each user sends an arbitrary assigned signal waveform, which is linearly modulated by symbols drawn from a finite alphabet. If the users are asynchronous, the optimum multiuser detector can be implemented by a Viterbi algorithm whose time-complexity is linear in the number of symbols transmitted by each user and exponential in the number of users. It is shown that the combinatorial problem of selecting the most likely transmitted data stream given the sufficient statistics (sequence of matched filter outputs), and the signal energies and cross-correlations is nondeterministic polynomial-time hard (NP-hard) in the number of users. And it remains so even if the users are restricted to be symbol-synchronous.
The performance analysis of optimum multiuser detection in terms of the set of multiuser asymptotic efficiencies is equivalent to the computation of the minimum Euclidean distance between any pair of distinct multiuser signals. This problem is also shown to be NP-hard and a conjecture on a longstanding open problem in single user data communication theory is presented.
Key wordsNP-complete Hypothesis testing Code Division Multiple Access Gaussian communication channels Maximum-likelihood sequence detection
Unable to display preview. Download preview PDF.
- S. Verdú, Optimum Multi-user Signal Detection, Ph.D. Dissertation, Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign. Report T-151, Coordinated Science Laboratory, Urbana, IL (August 1984).Google Scholar
- C. H. Papadimitrou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ (1982).Google Scholar
- R. Lupas and S. Verdú, Linear Multiuser Detectors for Synchronous Code-Division Multiple-Access Channels,IEEE Trans. Inform. Theory,35 (January 1989).Google Scholar