Lattice-reduction-aided broadcast precoding

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 f...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2004-12, Vol.52 (12), p.2057-2060
Main Authors: Windpassinger, C., Fischer, R.F.H., Huber, J.B.
Format: Article
Language:English
Subjects:
Applied sciences
Broadcasting
Coding, codes
Decoding
Error analysis
Exact sciences and technology
Information, signal and communications theory
Lattice reduction
Lattices
MIMO
MIMO precoding
multiple-input multiple-output (MIMO) broadcast channels
Quadrature amplitude modulation
Receiving antennas
Signal and communications theory
Signal to noise ratio
Telecommunications and information theory
Transmitters
Transmitting antennas
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2004.838732