Solving a class of optimum multiuser detection problems with polynomial complexity
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 44 (5) , 1958-1961
- https://doi.org/10.1109/18.705573
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Randomized AlgorithmsPublished by Cambridge University Press (CUP) ,1995
- A family of suboptimum detectors for coherent multiuser communicationsIEEE Journal on Selected Areas in Communications, 1990
- Multistage detection in asynchronous code-division multiple-access communicationsIEEE Transactions on Communications, 1990
- Computational complexity of optimum multiuser detectionAlgorithmica, 1989
- Linear multiuser detectors for synchronous code-division multiple-access channelsIEEE Transactions on Information Theory, 1989
- Minimum probability of error for asynchronous Gaussian multiple-access channelsIEEE Transactions on Information Theory, 1986
- Minimum cuts and related problemsNetworks, 1975