Polynomial complexity optimal detection of certain multiple-access systems

DOI10.1109/18.868499zbMath1004.94005OpenAlexW2130315682MaRDI QIDQ4545807

Alex Grant, Christian Schlegel

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

polynomial complexitymultiuser detectionoptimal detection algorithmsynchronous CDMA

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Related Items (1)

Dynamic programming in digital communications: Viterbi decoding to turbo multiuser detection

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