DocumentCode
2508682
Title
An Efficient Tree Search Decoder with Column Reordering for Underdetermined MIMO Systems
Author
Chang, Xiao-Wen ; Yang, Xiaohua
Author_Institution
McGill Univ., Quebec
fYear
2007
fDate
26-30 Nov. 2007
Firstpage
4375
Lastpage
4379
Abstract
An efficient tree search decoder for underdetermined MIMO systems is presented. The decoder employs a novel column reordering strategy for the channel matrix in the reduction process, which can significantly reduce the computational cost. Simulation results show that this new algorithm is much more efficient than current approaches for a square constellation higher than 4QAM.
Keywords
MIMO communication; decoding; fading channels; matrix algebra; tree searching; channel matrix; column reordering; reduction process; tree search decoder; underdetermined MIMO system; Computational efficiency; Computational modeling; Computer science; Decoding; Linear systems; MIMO; Partitioning algorithms; Receiving antennas; Transmitting antennas; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
Conference_Location
Washington, DC
Print_ISBN
978-1-4244-1042-2
Electronic_ISBN
978-1-4244-1043-9
Type
conf
DOI
10.1109/GLOCOM.2007.832
Filename
4411742
Link To Document