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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
