Complexity of Verdu optimum multiuser detection algorithm in multichannel CDMA systems

DOI10.1109/26.809712MaRDI QIDQ2732779zbMATH OpenOpenAlexFDO

Authors Qingchong Liu, Zhen Zhang, Robert A. Scholtz

Publication date 2 December 2001

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/26.809712

zbMATH Keywords

code-division multiple-access systemscommunication systemcomplexity functionmultichannel CDMArandom channel accessspread-spectrum communicationsVerdu optimum multiuser detection

Mathematics Subject Classification ID

Communication theory (94A05) Detection theory in information and communication theory (94A13) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Computational complexity of optimum multiuser detection
• Polynomial complexity optimal detection of certain multiple-access systems
• Randomly Spread CDMA: Asymptotics Via Statistical Physics
• A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors
• Optimum asymptotic multiuser efficiency of randomly spread CDMA

Cited in

(5)

• Computational complexity of optimum multiuser detection
• Performance of multiuser detection for optical CDMA. II: Asymptotic analysis
• Polynomial complexity optimal detection of certain multiple-access systems
• Performance analysis of optimal channel estimation and multiuser detection in a randomly-spread CDMA channel
• Solving a class of optimum multiuser detection problems with polynomial complexity

This page was built for publication: Complexity of Verdu optimum multiuser detection algorithm in multichannel CDMA systems

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