Coded Modulation Using Superimposed Binary Codes

Xiao Ma, Li Ping

IEEE Transactions on Information Theory · 2004 · 142 citations · 42 references

Concepts

TL;DR

The authors investigate a one‑layer coding/shaping scheme that mimics a perfectly cooperated multiple‑access system and propose optimal demapping and power‑allocation strategies. They encode binary data with single‑ or multilevel codes, interleave, map multiple bits to 2‑PAM signals that are superimposed, and use an iterative decoding/demapping algorithm with an entropy‑based stopping criterion. The approach achieves high bandwidth efficiency by employing unequal power allocations and a linear‑complexity Gaussian‑approximation demapping algorithm.

Abstract

In this correspondence, we investigate in a comprehensive fashion a one-layer coding/shaping scheme resembling a perfectly cooperated multiple-access system. At the transmitter, binary data are encoded by either single-level or multilevel codes. The coded bits are first randomly interleaved and then entered into a signal mapper. At each time, the signal mapper accepts as input multiple binary digits and delivers as output an amplitude signal, where the input are first independently mapped into 2-PAM signals (possibly having different amplitudes) and then superimposed to form the output. The receiver consists of an iterative decoding/demapping algorithm with an entropy-based stopping criterion. In the special cases when all the 2-PAM signals have equal amplitudes, based on an irregular trellis, we propose an optimal soft-input-soft-output (SISO) demapping algorithm with quadratic rather than exponential complexity. In the general cases, when multilevel codes are employed, we propose power-allocation strategies to facilitate the iterative decoding/dempaping algorithm. Using the unequal power-allocations and the Gaussian-approximation-based suboptimal demapping algorithm (with linear complexity), coded modulation with high bandwidth efficiency can be implemented.

References

42