Title :
Reduced complexity two-stage approximate sorting Fixed Complexity Sphere Decoder with real-valued lattice formulation for MIMO system
Author :
Lee, Kelvin ; Daneshrad, Babak
Author_Institution :
EE Dept., Univ. of California, Los Angeles, CA
Abstract :
This paper presents a multiple-input multiple-output (MIMO) decoder which combines fixed complexity sphere decoder (FSD) algorithm with a new real-valued lattice formulation to simultaneously improve the throughput, bit error rate (BER), complexity and power. A pair-wise sorted QR decomposition (P-SQRD) approach is also introduced to enhance the lattice searching efficiency and BER while preserving important characteristics of the real-valued lattice structure. Two-stage approximate sorting scheme with minimum data swapping is adopted to intelligently trade-off the number of paths to be visited at each lattice level and further reduce complexity and power. The proposed MIMO decoding algorithm achieves 20% reduction in the overall complexity compared to the other constant throughput SDs [3]-[4] for a 4times4 MIMO system with only minor BER degradation.
Keywords :
MIMO communication; approximation theory; error statistics; MIMO decoding algorithm; MIMO system; bit error rate; fixed complexity sphere decoder algorithm; lattice searching efficiency; multiple-input multiple-output decoder; real-valued lattice formulation; two-stage approximate sorting scheme; Bit error rate; Detectors; Kelvin; Lattices; MIMO; Maximum likelihood decoding; Maximum likelihood detection; Signal processing algorithms; Sorting; Throughput;
Conference_Titel :
Military Communications Conference, 2008. MILCOM 2008. IEEE
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-2676-8
Electronic_ISBN :
978-1-4244-2677-5
DOI :
10.1109/MILCOM.2008.4753530