By Topic

Reduced complexity M-ary hypotheses testing in wireless communications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Nafie ; Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA ; A. H. Tewfik

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

Published in:

Acoustics, Speech and Signal Processing, 1998. Proceedings of the 1998 IEEE International Conference on  (Volume:6 )

Date of Conference:

12-15 May 1998