By Topic

Novel Joint Sorting and Reduction Technique for Delay-Constrained LLL-Aided MIMO Detection

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
$33 $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

2 Author(s)
Ying Hung Gan ; Hong Kong Univ. of Sci. & Technol., Hong Kong ; Wai Ho Mow

In this letter, we introduce a novel technique to speed up the famous LLL lattice reduction algorithm by use of sorting. Simulation results reveal that when applied to LLL-reduction-aided MIMO detectors, our proposed joint sorting and reduction technique can find an LLL-reduced basis with the average number of basis vector swappings reduced by about 47.5% for a 2 times 2 system and more for higher dimensional systems, without degrading the detection performance. Moreover, when the maximum number of vector swapping is limited, our proposed algorithm significantly outperform the conventional one at low-to-moderate bit error rates. This suggests that it can be applied advantageously to those MIMO systems with a strict delay constraint.

Published in:

Signal Processing Letters, IEEE  (Volume:15 )