Joint Successive Cancellation Decoding for Bit-Interleaved Polar Coded Modulation

Communications Letters, IEEE(2016)

Cited 10|Views21
No score
Abstract
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.
More
Translated text
Key words
Decoding,Correlation,Complexity theory,Modulation,Encoding,Concatenated codes,Algorithm design and analysis
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined