Lattice-Reduction-Aided Broadcast Precoding
- 20 December 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 52 (12) , 2057-2060
- https://doi.org/10.1109/tcomm.2004.838732
Abstract
A precoding scheme for multiuser broadcast communications is described, which fills the gap between the low-complexity Tomlinson-Harashima precoding and the sphere decoder-based system of Peel et al. Simulation results show that, replacing the closest-point search with the Babai approximation, the full diversity order supported by the channel is available to each user, as in the system of Peel et al., and unlike Tomlinson-Harashima precoding, which suffers some diversity penalty. The complexity of the scheme is similar to that of Tomlinson-Harashima precoding.Keywords
This publication has 9 references indexed in Scilit:
- Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reductionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- MIMO precoding for decentralized receiversPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Closest point search in latticesIEEE Transactions on Information Theory, 2002
- Precoding and Signal Shaping for Digital TransmissionPublished by Wiley ,2002
- Simplified processing for high spectral efficiency wireless communication employing multi-element arraysIEEE Journal on Selected Areas in Communications, 1999
- On the complexity of decoding lattices using the Korkin-Zolotarev reduced basisIEEE Transactions on Information Theory, 1998
- Dynamics limited precoding, shaping, and blind equalization for fast digital transmission over twisted pair linesIEEE Journal on Selected Areas in Communications, 1995
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982