Performance bounds for linear codes in multi-rate superposition schemes

Uttam Bhat, Dario Fertonani, Tolga M. Duman

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationGLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference
StatePublished - Dec 1 2009
Event2009 IEEE Global Telecommunications Conference, GLOBECOM 2009 - Honolulu, HI, United States
Duration: Nov 30 2009Dec 4 2009

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference


Other2009 IEEE Global Telecommunications Conference, GLOBECOM 2009
Country/TerritoryUnited States
CityHonolulu, HI

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Performance bounds for linear codes in multi-rate superposition schemes'. Together they form a unique fingerprint.

Cite this