Superposition coded modulation and iterative linear MMSE detection
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
A two-stage capacity-achieving demodulation/decoding method for random matrix channels
IEEE Transactions on Information Theory
Superposition coded modulation with peak-power limitation
IEEE Transactions on Information Theory
On the capacity of the symbol-asynchronous relay channel
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Turbo joint source-channel coding of non-uniform memoryless sources in the bandwidth-limited regime
IEEE Communications Letters
Interior point decoding for linear vector channels based on convex optimization
IEEE Transactions on Information Theory
IEEE Transactions on Communications
Iterative soft compensation for OFDM systems with clipping and superposition coded modulation
IEEE Transactions on Communications
Iterative processing for superposition mapping
Journal of Electrical and Computer Engineering - Special issue on iterative signal processing in communications
Full length article: Performance analysis of superposition coded modulation
Physical Communication
| Hi-index | 755.02 |
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.