Solving a class of optimum multiuser detection problems with polynomial complexity

DOI10.1109/18.705573MaRDI QIDQ4701170zbMATH OpenOpenAlexFDO

Authors Chandrasekar Sankaran, Anthony Ephremides

Publication date 21 November 1999

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

zbMATH Keywords

CDMAcode-division multiple accesscross correlationGold sequenceoptimum multiuser detectionpolynomial complexitypseudorandom codesquadratic 0-1 programming

Mathematics Subject Classification ID

Applications of graph theory (05C90) Analysis of algorithms and problem complexity (68Q25) Boolean programming (90C09) Quadratic programming (90C20) Detection theory in information and communication theory (94A13)

Recommendations

• Polynomial complexity optimal detection of certain multiple-access systems
• Computational complexity of optimum multiuser detection
• Performance of multiuser detection for optical CDMA. II: Asymptotic analysis
• Complexity of Verdu optimum multiuser detection algorithm in multichannel CDMA systems

Cited in

(5)

• Dynamic programming in digital communications: Viterbi decoding to turbo multiuser detection
• Computational complexity of optimum multiuser detection
• A simple way to compute the minimum distance in multiuser CDMA systems
• Polynomial complexity optimal detection of certain multiple-access systems
• Efficient local and tabu search strategies for large-scale general quadratic integer programming

This page was built for publication: Solving a class of optimum multiuser detection problems with polynomial complexity

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