Computational complexity of optimum multiuser detection
- 1 June 1989
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 4 (1-4) , 303-312
- https://doi.org/10.1007/bf01553893
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Linear multiuser detectors for synchronous code-division multiple-access channelsIEEE Transactions on Information Theory, 1989
- Optimum Multiuser Asymptotic EfficiencyIEEE Transactions on Communications, 1986
- Multiple-access channels with point-process observations: Optimum demodulationIEEE Transactions on Information Theory, 1986
- Minimum probability of error for asynchronous Gaussian multiple-access channelsIEEE Transactions on Information Theory, 1986
- Optimum Detection of Code Division Multiplexed SignalsIEEE Transactions on Aerospace and Electronic Systems, 1979
- Computational savings and implementation of maximum likelihood detectors (Corresp.)IEEE Transactions on Information Theory, 1978
- A reduced state variant of maximum likelihood sequence detection attaining optimum performance for high signal-to-noise ratiosIEEE Transactions on Information Theory, 1977
- The viterbi algorithmProceedings of the IEEE, 1973