Multilevel codes for OFDM-like modulation over underspread fading channels

Authors:
Siddhartha Mallik;Ralf Koetter
Affiliations:
The Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL;The Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
EURASIP Journal on Applied Signal Processing
Year:
2006

Citing 8
Cited 0

Robust space-time codes for correlated Rayleigh fading channels

IEEE Transactions on Signal Processing
Algebraic tools to build modulation schemes for fading channels

IEEE Transactions on Information Theory
Bit-interleaved coded modulation

IEEE Transactions on Information Theory
Signal space diversity: a power- and bandwidth-efficient diversity technique for the Rayleigh fading channel

IEEE Transactions on Information Theory
Fading channels: information-theoretic and communications aspects

IEEE Transactions on Information Theory
Multilevel codes: theoretical concepts and practical design rules

IEEE Transactions on Information Theory
Orthogonal time-frequency signaling over doubly dispersive channels

IEEE Transactions on Information Theory
Nonorthogonal pulseshapes for multicarrier communications in doubly dispersive channels

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of modulation and coding for doubly dispersive, that is, time and frequency selective, fading channels. Using the recent result that underspread linear systems are approximately diagonalized by biorthogonal Weyl-Heisenberg bases, we arrive at a canonical formulation of modulation and code design. For coherent reception with maximum-likelihood decoding, we derive the code design criteria as a function of the channel's scattering function. We use ideas from generalized concatenation to design multilevel codes for this canonical channel model. These codes are based on partitioning a constellation carved out from the integer lattice. Utilizing the block fading interpretation of the doubly dispersive channel, we adapt these partitioning techniques to the richness of the channel. We derive an algebraic framework which enables us to partition in arbitrarily large dimensions.