Polynomial complexity optimal detection of certain multiple-access systems

DOI10.1109/18.868499MaRDI QIDQ4545807zbMATH OpenOpenAlexFDO

Authors Christian B. Schlegel, Alex Grant

Publication date 2000

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

Full work available at URL https://semanticscholar.org/paper/89c31229aa69822aa18d22922479c021f07476e3

zbMATH Keywords

multiuser detectionoptimal detection algorithmpolynomial complexitysynchronous CDMA

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Recommendations

• Solving a class of optimum multiuser detection problems with polynomial complexity
• Computational complexity of optimum multiuser detection
• Complexity of Verdu optimum multiuser detection algorithm in multichannel CDMA systems
• Greedy detection
• On optimal detectors in multiuser detection problems

Cited in

(8)

• Dynamic programming in digital communications: Viterbi decoding to turbo multiuser detection
• Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems
• Greedy detection
• Computational complexity of optimum multiuser detection
• Complexity of Verdu optimum multiuser detection algorithm in multichannel CDMA systems
• Solving a class of optimum multiuser detection problems with polynomial complexity
• \textit{CHIRRUP}: a practical algorithm for unsourced multiple access
• The equivalence between optimal detecting arrays and super-simple OAs

This page was built for publication: Polynomial complexity optimal detection of certain multiple-access systems

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