Iterative MIMO sphere decoding throughput guarantees under realistic channel conditions

Authors:
Mansour Rachid;Babak Daneshrad
Affiliations:
University of California, Los Angeles, CA;University of California, Los Angeles, CA
Venue:
IEEE Communications Letters
Year:
2010

Citing 4
Cited 0

On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications

ACM SIGSAM Bulletin
Advanced receiver algorithms for MIMO wireless communications

Proceedings of the conference on Design, automation and test in Europe: Proceedings
Reduced-complexity mimo detector with close-to ml error rate performance

Proceedings of the 17th ACM Great Lakes symposium on VLSI
A universal lattice code decoder for fading channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Block-based early termination has been proposed for depth-first based MIMO sphere decoders (SD) in order to provide throughput guarantees. We show in this letter that such termination incurs, even under simple tree and norm choices, significant overhead in the required number of iterations under realistic channel conditions due to the depth-first search's highly variable complexity (number of iterations to achieve a target performance). We propose the use of a constrained version of Dijkstra's metric-first search which exhibits indistinguishable performance while avoiding the impractical memory requirements of Dijkstra's search. We show that for a 4×4 64-subcarrier OFDM system, the proposed alternative achieves ∼2x decrease in complexity as compared to the depth-first SD with block early termination for the same throughput guarantee.