Title :
Reduced complexity M-ary hypotheses testing in wireless communications
Author :
Nafie, Mohammed ; Tewfik, Ahmed H.
Author_Institution :
Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA
Abstract :
We present a progressive refinement approach to M-ary detection problems. The approach leads on average to a logarithmic reduction in the complexity of the detector. It relies on designing binary decision trees that trade complexity with probability of error. We also discuss simplified solutions that can be used in several cases of interest in wireless communications such as CDMA multiuser detection and blind equalization
Keywords :
Gaussian noise; code division multiple access; computational complexity; equalisers; error statistics; radiocommunication; signal detection; white noise; CDMA; M-ary detection problems; binary decision trees; blind equalization; detector complexity; error probability; logarithmic reduction; multiuser detection; progressive refinement approach; reduced complexity M-ary hypotheses testing; white Gaussian noise; wireless communications; Bayesian methods; Blind equalizers; Decision trees; Detectors; Maximum likelihood detection; Multiaccess communication; Signal processing; Surveillance; Testing; Wireless communication;
Conference_Titel :
Acoustics, Speech and Signal Processing, 1998. Proceedings of the 1998 IEEE International Conference on
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-4428-6
DOI :
10.1109/ICASSP.1998.679547
