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.
| Original language | English |
|---|---|
| Article number | 2514279 |
| Pages (from-to) | 224-227 |
| Number of pages | 4 |
| Journal | IEEE Communications Letters |
| Volume | 20 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Feb 2016 |
Keywords
- Bit-interleaved coded modulation
- Joint decoding and demapping
- Modulation coding
- Polar codes
Fingerprint
Dive into the research topics of 'Joint successive cancellation decoding for bit-interleaved polar coded modulation'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver