By Topic

Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction

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

2 Author(s)
Windpassinger, C. ; Lehrstuhl fur Informationsubertragung, Erlangen-Nurnberg Univ., Erlangen, Germany ; Fischer, R.F.H.

We consider the lattice-reduction-aided detection scheme for 2×2 channels recently proposed by H. Yao and G.W. Wornell (see Proc. IEEE Globecom, 2002). By using an equivalent real-valued substitute MIMO channel model, their lattice reduction algorithm can be replaced by the well-known LLL (Lenstra-Lenstra-Lovasz) algorithm (Lenstra, A.K. et al., 1982), which enables the application of the algorithm to MIMO systems with arbitrary numbers of dimensions. We show how lattice reduction can also be favourably applied in systems that use precoding and give simulation results that underline the usefulness of this approach.

Published in:

Information Theory Workshop, 2003. Proceedings. 2003 IEEE

Date of Conference:

31 March-4 April 2003