Computational complexity of optimum multiuser detection

DOI10.1007/BF01553893MaRDI QIDQ1825661zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Solving a class of optimum multiuser detection problems with polynomial complexity
• Complexity of Verdu optimum multiuser detection algorithm in multichannel CDMA systems
• Polynomial complexity optimal detection of certain multiple-access systems
• Optimum Multiuser Asymptotic Efficiency
• Single-user detectors for multiuser channels

Cites work

• scientific article; zbMATH DE number 3781076 (Why is no real title available?)
• scientific article; zbMATH DE number 193447 (Why is no real title available?)
• scientific article; zbMATH DE number 3612920 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Computational savings and implementation of maximum likelihood detectors (Corresp.)
• Linear multiuser detectors for synchronous code-division multiple-access channels
• Minimum probability of error for asynchronous Gaussian multiple-access channels
• Multiple-access channels with point-process observations: Optimum demodulation
• Optimum Multiuser Asymptotic Efficiency

Cited in

(10)

• Optimizing revenue in CDMA networks under demand uncertainty
• Complexity of Verdu optimum multiuser detection algorithm in multichannel CDMA systems
• Dynamic programming in digital communications: Viterbi decoding to turbo multiuser detection
• Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
• Exploiting low-rank structure in semidefinite programming by approximate operator splitting
• Performance analysis of optimal channel estimation and multiuser detection in a randomly-spread CDMA channel
• Polynomial complexity optimal detection of certain multiple-access systems
• Adaptive Multiuser Detection
• A low complexity semidefinite relaxation for large-scale MIMO detection
• An efficient quadratic programming relaxation based algorithm for large-scale MIMO detection

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825661)