Upper-Lower Bounded-Complexity QRD-M for Spatial Multiplexing MIMO-OFDM Systems

Authors:
Manar Mohaisen;Kyunghi Chang
Affiliations:
The Graduate School of IT and Telecommunications, Inha University, Nam-Gu, Incheon, Korea 402-751;The Graduate School of IT and Telecommunications, Inha University, Nam-Gu, Incheon, Korea 402-751
Venue:
Wireless Personal Communications: An International Journal
Year:
2011

Citing 6
Cited 0

On Lova´sz' lattice reduction and the nearest lattice point problem

Combinatorica
Modern Wireless Communication

Modern Wireless Communication
On the complexity of sphere decoding in digital communications

IEEE Transactions on Signal Processing
Iterative decoding for MIMO channels via modified sphere decoding

IEEE Transactions on Wireless Communications
Closest point search in lattices

IEEE Transactions on Information Theory
Adaptive control of surviving symbol replica candidates in QRM-MLD for OFDM MIMO multiplexing

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Multiple-input multiple-output (MIMO) technology applied with orthogonal frequency division multiplexing (OFDM) is considered as the ultimate solution to increase channel capacity without any additional spectral resources. At the receiver side, the challenge resides in designing low complexity detection algorithms capable of separating independent streams sent simultaneously from different antennas. In this paper, we introduce an upper-lower bounded-complexity QRD-M algorithm (ULBC QRD-M). In the proposed algorithm we solve the problem of high extreme complexity of the conventional sphere decoding by fixing the upper bound complexity to that of the conventional QRD-M. On the other hand, ULBC QRD-M intelligently cancels all unnecessary hypotheses to achieve very low computational requirements. Analyses and simulation results show that the proposed algorithm achieves the performance of conventional QRD-M with only 26% of the required computations.