Convolutional Polar Coded Modulation

TL;DR

This paper introduces convolutional polar coded modulation (CPCM), a novel scheme that enhances spectral efficiency for $2^m$-ary modulation by addressing the dependence among bit channels, combining low complexity with improved performance.

Contribution

The paper proposes CPCM, a new coding scheme that maintains low complexity like BICM while overcoming the limitations of existing multi-level coding methods.

Findings

CPCM outperforms traditional schemes in spectral efficiency.

Numerical results demonstrate improved performance of CPCM.

CPCM effectively handles dependent bit channels in $2^m$-ary modulation.

Abstract

$2^m$-ary modulation creates $m$ bit channels which are neither independent nor identical, and this causes problems when applying polar coding because polar codes are designed for independent identical channels. Different from the existing multi-level coding (MLC) and bit-interleaved coded modulation (BICM) schemes, this paper provides a convolutional polar coded modulation (CPCM) method that preserves the low-complexity nature of BICM while offering improved spectral efficiency. Numerical results are given to show the good performance of the proposed method.