DocumentCode :
1495888
Title :
Reduced complexity sphere decoding via a reordered lattice representation
Author :
Azzam, Luay ; Ayanoglu, Ender
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Irvine, CA, USA
Volume :
57
Issue :
9
fYear :
2009
fDate :
9/1/2009 12:00:00 AM
Firstpage :
2564
Lastpage :
2569
Abstract :
In this letter, we propose a reordering of the channel representation for Sphere Decoding (SD) where the real and imaginary parts of each jointly detected symbol are decoded independently. Making use of the proposed structure along with a scalar quantization technique, we reduce the decoding complexity substantially. We show that this approach achieves 85% reduction in the overall complexity compared to the conventional SD for a 2 times 2 system, and 92% reduction for the 4 times 4 and 6 times 6 cases at low SNR values, and almost 50% at high SNR, thus relaxing the requirements for hardware implementation.
Keywords :
channel coding; computational complexity; decoding; lattice theory; quantisation (signal); wireless channels; channel representation; reduced complexity sphere decoding; reordered lattice representation; scalar quantization technique; symbol detection; AWGN; Additive white noise; Arithmetic; Covariance matrix; Hardware; Lattices; MIMO; Maximum likelihood decoding; Quantization; Transmitting antennas; Maximum-likelihood detection, multiple-input multiple-output channels, sphere decoding.;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOMM.2009.09.070238
Filename :
5281743
Link To Document :
بازگشت