Iterative processing for superposition mapping

  • Authors:

  • Tianbin Wo;Meelis Noemm;Dapeng Hao;Peter Adam Hoeher

  • Affiliations:

  • Information and Coding Theory Laboratory, University of Kiel, Kiel, Germany;Information and Coding Theory Laboratory, University of Kiel, Kiel, Germany;Information and Coding Theory Laboratory, University of Kiel, Kiel, Germany;Information and Coding Theory Laboratory, University of Kiel, Kiel, Germany

  • Venue:
  • Journal of Electrical and Computer Engineering - Special issue on iterative signal processing in communications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Superposition mapping (SM) is a modulation technique which loads bit tuples onto data symbols simply via linear superposition. Since the resulting data symbols are often Gaussian-like, SM has a good theoretical potential to approach the capacity of Gaussian channels. On the other hand, the symbol constellation is typically nonbijective and its characteristic is very different from that of conventional mapping schemes like QAM or PSK. As a result, its behavior is also quite different from conventional mapping schemes, particularly when applied in the framework of bit-interleaved coded modulation. In this paper, a comprehensive analysis is provided for SM, with particular focus on aspects related to iterative processing.