Joint Successive Cancellation Decoding for Bit-Interleaved Polar Coded Modulation
To improve the performance of bit-interleaved polar-coded modulation (BIPCM), a joint successive cancellation (SC) decoding algorithm for BIPCM is proposed. In the proposed algorithm, the correlation between coded bits, which are mapped into the same symbol is considered. Based on the recursive stru...
Saved in:
Published in | IEEE communications letters Vol. 20; no. 2; pp. 224 - 227 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.02.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | To improve the performance of bit-interleaved polar-coded modulation (BIPCM), a joint successive cancellation (SC) decoding algorithm for BIPCM is proposed. In the proposed algorithm, the correlation between coded bits, which are mapped into the same symbol is considered. Based on the recursive structure of the proposed algorithm, the demapping and deinterleaving units are combined with SC decoder. Thus, the information bits are directly decoded by the likelihood ratios (LRs) of the received symbols instead of the LRs of coded bits. Simulation results show that the performance of existing BIPCM schemes can be improved 0.75-1.25 dB with the proposed algorithm. |
---|---|
ISSN: | 1089-7798 1558-2558 |
DOI: | 10.1109/LCOMM.2015.2514279 |