By Topic

The conditional metric merge algorithm for maximum likelihood multiuser-macrodiversity detection

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

3 Author(s)
L. Welburn ; Sch. of Eng. Sci., Simon Fraser Univ., Burnaby, BC, Canada ; J. K. Cavers ; K. W. Sowerby

The combination of macrodiversity reception with maximum likelihood (ML) multiuser detection has the capability to reduce the bit error rate (BER) for many users by several orders of magnitude compared with multiuser detectors that operate on each antenna separately. In this paper, we present the conditional metric merge (CMM) algorithm which reduces the computational complexity of the ML multiuser-macrodiversity detector by an enormous factor. The CMM algorithm can be viewed as a spatial variant of the Viterbi algorithm. It is a new algorithm and is the first of its kind as ML multiuser-macrodiversity detection (MUMD) is a relatively new area of research

Published in:

Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE  (Volume:5 )

Date of Conference: