Design of Mapping Matrix for Arithmetic Bit-Interleaved Coded Modulation

Abstract

Arithmetic bit-interleaved coded modulation (A-BICM) is a coded rate compatible modulation (RCM). It achieves progressive mapping to strike a trade-off between high signal-to-noise ratio (SNR) and low SNR. However, the weights for parity bits are random and not sufficient, which decreases the performance significantly. In order to address the problem, this paper proposes a novel weight mapping scheme for A-BICM. The proposed scheme aims to design the degree and the weight distribution in the mapping matrix to decrease the error probability of parity bits. Through analysis, we have found that the proposed scheme is beneficial to increase the minimum Euclidean distance of symbols. Through simulation, the proposed scheme is verified to increase the throughput of transmission and decrease the demapping complexity at the same time. Both analysis and simulation results show that the proposed scheme outperforms the original A-BICM.