Abstract
Successive cancellation (SC) is a low complexity serial decoding algorithm for polar codes, and successive cancellation list (SCL) can achieve excellent error-correcting performance. However, SCL decoder suffers from long decoding latency compared with belief propagation (BP) decoder. In this paper, a low-latency list decoder whose latency performance can approach that of BP deocder is proposed. A prunable subtree recognizing scheme based on ${\boldsymbol~H}$-Matrix check is proposed by taking the reliability of frozen bits into account. Then, a latency-reduced list decoder based on the prunable constituent codes is proposed. Simulation results show that the decoding latency of proposed list scheme can be reduced significantly, especially for high signal noise ratio (SNR) region.
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.
