Abstract
Polar coding and sparse code multiple access (SCMA) are key technologies for 5G mobile communication, the joint design of them has a great significance to improve the overall performance of the transmitter-receiver symmetric wireless communication system. In this paper, we firstly propose a pruning iterative joint detection and decoding algorithm (PI-JDD) based on the confidence stability of resource nodes. Branches to be updated are dynamically pruned to avoid redundant iterative, which is able to reduce 24~50% complexity while achieving the approximate error performance of traditional serial joint iterative detection and decoding algorithm S-JIDD. Then, to further reduce the bit error rate (BER) of the receiver, a cyclic redundancy check (CRC) termination mechanism is added at the end of each joint iteration to avoid the convergence error caused by decoding deviation. Simulation results show that the addition of an early stopping criterion can achieve a remarkable performance gain compared with the S-JIDD algorithm. More importantly, the combined algorithm of the two proposed schemes can reduce the computational complexity while achieving better error performance.
Highlights
Polar code is a kind of channel coding theory that has been strictly proved to reach the Shannon capacity in the binary-discrete memoryless channel (B-DMC)
We propose the pruning iterative joint detection and decoding algorithm (PI-JDD) scheme to effectively reduce the computational complexity of the PC-Sparse code multiple access (SCMA) system, and the proposed C-joint iterative detection and decoding algorithm (JIDD) algorithm can achieve significant performance gain while maintaining ideal complexity
We proposed a joint detection and decoding algorithm PI-JDD for polar code SCMA (PC-SCMA)
Summary
Polar code is a kind of channel coding theory that has been strictly proved to reach the Shannon capacity in the binary-discrete memoryless channel (B-DMC). For the separate detection and decoding scheme, since the intermediate messages cannot be fully utilized, the receiver would not achieve ideal error performance and the computational complexity is relatively high. The authors of [17] proposed a JIDD, where messages are updated through the external iteration between the MPA and SCAN algorithm, and it improved the convergence speed and efficiently reduced the computational complexity. S-JIDD is proposed to accelerate the convergence speed by updating the messages serially, and reduce the computational complexity effectively without losing the error performance. The joint algorithm PIC-JDD which combines the PI-JDD and CRC early stopping condition can effectively improve the joint detection and decoding performance with a lower computation complexity. We summarize the paper and look forward to the future work
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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.
