Abstract
In the successive cancellation list (SCL) decoding of polar codes, as the list size increases, the error correction performance improves. However, a large list size results in high computational complexity and large memory requirement.In this paper, we investigate the list decoding process by introducing a new parameter named path metric range (PMR) to elucidate the properties of the evolution of the path metrics (PMs) within the list throughout the decoding process. Then, we advocate that the list size can change stepwise depending on PMR. As a result, we propose a stepped list decoding scheme in which the error correction performance of the conventional list decoding is preserved while the path memory may reduce by 75%, the size of the internal LLR memory and partial sums memory can drop by 50%, and the computational complexity may halve. The reduction in complexity is SNR-independent and achieved without introducing any computational overhead.
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.
