Computational complexity of optimum multiuser detection

Engineering & Materials Science

• Multiuser detection 69%
• Data streams 56%
• Computational complexity 45%
• Polynomials 43%
• Viterbi algorithm 36%
• Matched filters 32%
• Information theory 32%
• Demodulation 30%
• Code division multiple access 26%
• Detectors 21%
• Statistics 21%

Mathematics

• Multiuser Detection 100%
• Computational Complexity 52%
• Data Streams 19%
• Viterbi Algorithm 11%
• Demodulation 11%
• Matched Filter 11%
• Polynomial time 11%
• Multiple Access Channel 11%
• Data Communication 11%
• Code Division multiple Access 9%
• Communication Theory 9%
• Algorithm Complexity 9%
• Performance Analysis 8%
• Cross-correlation 8%
• Sufficient Statistics 8%
• Waveform 8%
• Asymptotic Efficiency 8%
• Detector 8%
• Euclidean Distance 7%
• Combinatorial Problems 7%
• Time Complexity 7%
• Minimum Distance 7%
• Likely 6%
• Linearly 5%
• Open Problems 5%
• Output 5%
• Distinct 4%
• Energy 4%
• Arbitrary 3%