Mapping Design for <inline-formula> <tex-math notation="LaTeX">$2^{M}$ </tex-math></inline-formula>-Ary Bit-Interleaved Polar Coded Modulation

Abstract

This paper proposes a mapping design for bit-interleaved polar coded modulation (BIPCM) systems with belief propagation (BP) decoding. We first introduce a two-layer bipartite graph to represent BIPCM, where a new mapping graph linking polar graph to modulator is added to the conventional factor graph. Then, a mapping design is proposed and the design paradigm is to separate sub-channels with lower reliability to different stopping trees of polar codes, aiming to make sure that each stopping tree receives reliable extrinsic information from demodulator. The proposed mapping algorithm is employed for BIPCM with traditional polar codes over 16-quadrature amplitude modulation (QAM) and 256-QAM. Numerical results show that our scheme can improve the error-correcting performance compared to the conventional scheme with a random mapping. Furthermore, to meet code-length requirement of different modulation orders, we propose an efficient method to construct flexible-length polar code (FLPC) by coupling several short length polar codes with a repeat-accumulate (RA) code. Also, the proposed FLPC is employed in the BIPCM system, with the designed mapping algorithm, simulation result also reveals that the block error rate performance of proposed BIPCM scheme with BP decoding outperforms the one with successive cancellation decoding by providing a gain up to 1 dB.

Keywords

• Polar codes
• bit-interleaved polar coded modulation (BIPCM)
• belief propagation decoding