DocumentCode :
3454731
Title :
Bounded complexity tree search MMSE detection for MIMO systems using improved channel partition preprocessing
Author :
Radji, Djelili ; Leib, Harry
Author_Institution :
Dept. of Electr. & Comput. Eng., McGill Univ., Montreal, QC, Canada
fYear :
2011
fDate :
8-11 May 2011
Abstract :
MIMO communication is a core technology for wireless systems. This work presents a fixed complexity scheme based on simplified channel partition and efficient tree based precancellation employing the MMSE criterion. This algorithm is then extended to a variable complexity tree search scheme that provides lower average complexity. The resulting algorithm operates on a very small subset of candidates and employs an improved channel matrix ordering rule in the preprocessing stage that guarantees its high signal-to-noise-ratio (SNR) optimality for space uncorrelated channels. The proposed scheme provides substantial complexity reduction over conventional variable complexity detection schemes.
Keywords :
MIMO communication; communication complexity; mean square error methods; tree searching; wireless channels; MIMO communication; MIMO system; MMSE criterion; SNR optimality; bounded complexity tree search MMSE detection; channel matrix ordering rule; channel partition preprocessing; signal-to-noise-ratio; space uncorrelated channel; tree based precancellation; variable complexity detection; wireless system; Bit error rate; Complexity theory; Correlation; MIMO; Partitioning algorithms; Signal to noise ratio; Wireless communication; MIMO detection; MMSE detection; sphere decoding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical and Computer Engineering (CCECE), 2011 24th Canadian Conference on
Conference_Location :
Niagara Falls, ON
ISSN :
0840-7789
Print_ISBN :
978-1-4244-9788-1
Electronic_ISBN :
0840-7789
Type :
conf
DOI :
10.1109/CCECE.2011.6030546
Filename :
6030546
Link To Document :
بازگشت