DMCA
Lattice-reductionaided broadcast precoding (2004)
| Venue: | IEEE Trans. Commun |
| Citations: | 55 - 4 self |
BibTeX
@ARTICLE{Windpassinger04lattice-reductionaidedbroadcast,
author = {Christoph Windpassinger and Robert F. H. Fischer and Johannes B. Huber},
title = {Lattice-reductionaided broadcast precoding},
journal = {IEEE Trans. Commun},
year = {2004},
pages = {20572060}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—A precoding scheme for multiuser broadcast communications is described, which fills the gap between the low-complexity Tomlinson–Harashima precoding and the sphere decoderbased 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. Index Terms—Lattice reduction, multiple-input multiple-output (MIMO) broadcast channels, MIMO precoding.
Keyphrases
lattice-reductionaided broadcast precoding tomlinson harashima precoding full diversity order decoderbased system multiuser broadcast communication diversity penalty index term lattice reduction closest-point search mimo precoding precoding scheme multiple-input multiple-output tomlinson harashima broadcast channel babai approximation low-complexity tomlinson harashima precoding simulation result
