Approximate Lattice Decoding: Primal Versus Dual Basis Reduction
Author:
- 1 July 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1-5
Abstract
Lattice decoding enables significant complexity reduction in multi-input multi-output (MIMO) communications. Unlike most work on the lattice-reduction-aided decoding technique, this paper is aimed at a comparative study of primal versus dual basis reduction for approximate lattice decoding. We derive the respective proximity factors for the two methods, which measure the performance gap to maximum-likelihood (ML) decoding. It is found that in many cases reducing the dual can result in smaller proximity factors than reducing the primal basisKeywords
This publication has 10 references indexed in Scilit:
- Universal lattice decoding: principle and recent advancesWireless Communications and Mobile Computing, 2003
- V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel2002
- Closest point search in latticesIEEE Transactions on Information Theory, 2002
- A universal lattice code decoder for fading channelsIEEE Transactions on Information Theory, 1999
- New bounds in some transference theorems in the geometry of numbersMathematische Annalen, 1993
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal latticeCombinatorica, 1990
- A hierarchy of polynomial time lattice basis reduction algorithmsTheoretical Computer Science, 1987
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986
- Improved methods for calculating vectors of short length in a lattice, including a complexity analysisMathematics of Computation, 1985
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982