Augmented Lattice Reduction for MIMO decoding release_mrsjdtxgvfflnd5c2jlqaghmqq

by Laura Luzzi, Ghaya Rekaya-Ben Othman, Jean-Claude Belfiore

Released as a article .

2010  

Abstract

Lattice reduction algorithms, such as the LLL algorithm, have been proposed as preprocessing tools in order to enhance the performance of suboptimal receivers in MIMO communications. In this paper we introduce a new kind of lattice reduction-aided decoding technique, called augmented lattice reduction, which recovers the transmitted vector directly from the change of basis matrix, and therefore doesn't entail the computation of the pseudo-inverse of the channel matrix or its QR decomposition. We prove that augmented lattice reduction attains the maximum receive diversity order of the channel; simulation results evidence that it significantly outperforms LLL-SIC detection without entailing any additional complexity. A theoretical bound on the complexity is also derived.
In text/plain format

Archived Files and Locations

application/pdf  200.5 kB
file_e7cenub5r5hnzcafeofucms3ny
arxiv.org (repository)
web.archive.org (webarchive)
application/pdf  195.4 kB
file_wft5ow4urfdpfji2o3cyjbpvdu
core.ac.uk (web)
archive.org (archive)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2010-01-11
Version   v1
Language   en ?
arXiv  1001.1625v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: f772fbbe-5b94-4d24-99ae-151d79493d20
API URL: JSON