By Topic

Bounded Block Parallel Lattice Reduction algorithm for MIMO-OFDM and its application in LTE MIMO receiver

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Ahmad, U. ; Interuniversity Micro-Electron. Center (IMEC) vzw, Leuven, Belgium ; Min Li ; Pollin, S. ; Fasthuber, R.
more authors

Lattice reduction is a promising technique to enhance the performance of sub-optimal MIMO detectors. This paper presents the Bounded Block Parallel Lattice Reduction (BBP-LR) algorithm, which is an implementation friendly low complexity algorithm specifically optimized for practical MIMO-OFDM systems. The optimisation of the BBP-LR algorithm is based on the following: 1) exploiting the frequency coherence in MIMO-OFDM to enable parallel processing that suits SIMD/vector architectures; 2) bounding the execution behaviour to reduce complexity and enable hard real-time task scheduling; 3) performing a frame based preprocessing to significantly reduce complexity. The proposed BBP-LR algorithm has been evaluated in the context of LTE MIMO receivers. When comparing to linear MIMO detectors, the proposed algorithm brings performance improvement at a small complexity increase. Specifically, when compared to ZF, BBP-LR based preprocessing brings an impressive 11dB SNR gain at the cost of only 23% complexity increase.

Published in:

Signal Processing Systems (SIPS), 2010 IEEE Workshop on

Date of Conference:

6-8 Oct. 2010