Computational complexity of optimum multiuser detection

DOI10.1007/BF01553893zbMath0684.68066OpenAlexW2063089586MaRDI QIDQ1825661

Sergio Verdú

Publication date: 1989

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01553893

zbMATH Keywords

hypothesis testingNP-completecode division multiple-accessGaussian communication channelsmaximum-likelihood sequence detection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Detection theory in information and communication theory (94A13)

Related Items (8)

Exploiting low-rank structure in semidefinite programming by approximate operator splitting ⋮ A low complexity semidefinite relaxation for large-scale MIMO detection ⋮ Dynamic programming in digital communications: Viterbi decoding to turbo multiuser detection ⋮ Performance analysis of optimal channel estimation and multiuser detection in a randomly-spread CDMA channel ⋮ Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection ⋮ Optimizing revenue in CDMA networks under demand uncertainty ⋮ Adaptive Multiuser Detection ⋮ An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimum Multiuser Asymptotic Efficiency
• Minimum probability of error for asynchronous Gaussian multiple-access channels
• Multiple-access channels with point-process observations: Optimum demodulation
• Linear multiuser detectors for synchronous code-division multiple-access channels
• Computational savings and implementation of maximum likelihood detectors (Corresp.)

This page was built for publication: Computational complexity of optimum multiuser detection