DocumentCode :
3572157
Title :
The conditional metric merge algorithm for maximum likelihood multiuser-macrodiversity detection
Author :
Welburn, Lisa ; Cavers, James K. ; Sowerby, Kevin W.
Author_Institution :
Sch. of Eng. Sci., Simon Fraser Univ., Burnaby, BC, Canada
Volume :
5
fYear :
2001
fDate :
6/23/1905 12:00:00 AM
Firstpage :
3206
Abstract :
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
Keywords :
Viterbi detection; diversity reception; error statistics; maximum likelihood detection; multiuser channels; BER; CMM algorithm; ML detection; Viterbi algorithm; bit error rate; computational complexity; conditional metric merge algorithm; macrodiversity reception; maximum likelihood detection; multiuser detection; Base stations; Computational complexity; Coordinate measuring machines; Detectors; Dynamic programming; Fading; Maximum likelihood detection; Multiaccess communication; Multiuser detection; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE
Print_ISBN :
0-7803-7206-9
Type :
conf
DOI :
10.1109/GLOCOM.2001.966018
Filename :
966018
Link To Document :
بازگشت