Performance bounds for linear codes in multi-rate superposition schemes

Authors:
Uttam Bhat;Dario Fertonani;Tolga M. Duman
Affiliations:
Department of Electrical Engineering, Arizona State University, Tempe, AZ;Department of Electrical Engineering, Arizona State University, Tempe, AZ;Department of Electrical Engineering, Arizona State University, Tempe, AZ
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 5
Cited 0

Unveiling turbo codes: some results on parallel concatenated coding schemes

IEEE Transactions on Information Theory
Comments on broadcast channels

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

IEEE Transactions on Information Theory
LDPC codes for fading Gaussian broadcast channels

IEEE Transactions on Information Theory
Bandwidth-efficient turbo trellis-coded modulation using punctured component codes

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider unequal error-protection schemes obtained by means of two-level superposition coding. The performance over additive white Gaussian noise channels is investigated for optimal maximum-likelihood decoding as well as for a suboptimal decoding strategy based on interference cancellation. Assuming that linear codes are used, we evaluate, for both strategies, analytical approximations of the word-error rate, based on the union bound. As in the case of turbo codes and turbo-coded modulations, the derivation exploits the concept of uniform interleaving, and the bounds are in excellent agreement with the simulation results obtained using iterative decoding. The analytical expressions are useful for code design and for the selection of decoding strategies providing a suitable performance/complexity tradeoff.