Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Golden space-time block-coded modulation
IEEE Transactions on Information Theory
On the densest MIMO lattices from cyclic division algebras
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Modulation and coding for linear Gaussian channels
IEEE Transactions on Information Theory
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory
Super-orthogonal space-time trellis codes
IEEE Transactions on Information Theory
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
Full-diversity, high-rate space-time block codes from division algebras
IEEE Transactions on Information Theory
Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels
IEEE Transactions on Information Theory
The golden code: a 2×2 full-rate space-time code with nonvanishing determinants
IEEE Transactions on Information Theory
High-rate concatenated space-time block code M-TCM designs
IEEE Transactions on Information Theory
A unified framework for tree search decoding: rediscovering the sequential decoder
IEEE Transactions on Information Theory
Approximately universal codes over slow-fading channels
IEEE Transactions on Information Theory
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
IEEE Transactions on Information Theory
Perfect Space–Time Block Codes
IEEE Transactions on Information Theory
Golden Space–Time Trellis Coded Modulation
IEEE Transactions on Information Theory
Perfect Space–Time Codes for Any Number of Antennas
IEEE Transactions on Information Theory
Coset codes. I. Introduction and geometrical classification
IEEE Transactions on Information Theory - Part 1
Linear block codes over cyclic groups
IEEE Transactions on Information Theory
Asymptotic performance of linear receivers in MIMO fading channels
IEEE Transactions on Information Theory
Golden space-time block-coded modulation
IEEE Transactions on Information Theory
Coding and decoding for the dynamic decode and forward relay protocol
IEEE Transactions on Information Theory
On the densest MIMO lattices from cyclic division algebras
IEEE Transactions on Information Theory
Construction methods for asymmetric and multiblock space-time codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
The coding gain of real matrix lattices: bounds and existence results
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
| Hi-index | 755.32 |
We present constructions of space-time (ST) codes based on lattice coset coding. First, we focus on ST code constructions for the short block-length case, i.e., when the block length is equal to or slightly larger than the number of transmit antennas. We present constructions based on dense lattice packings and nested lattice (Voronoi) shaping. Our codes achieve the optimal diversity-multiplexing tradeoff (DMT) of quasi-static multiple-input multiple-output (MIMO) fading channels for any fading statistics, and perform very well also at practical, moderate values of signal-to-noise ratios (SNR). Then, we extend the construction to the case of large block lengths, by using trellis coset coding. We provide constructions of trellis coded modulation (TCM) schemes that are endowed with good packing and shaping properties. Both short-block and trellis constructions allow for a reduced complexity decoding algorithm based on minimum mean-squared error generalized decision feedback equalizer (MMSE-GDFE) lattice decoding and a combination of this with a Viterbi TCM decoder for the TCM case. Beyond the interesting algebraic structure, we exhibit codes whose performance is among the state-of-the art considering codes with similar encoding/decoding complexity.