Abstract
The decoding latency of the successive-cancellation decoder for polar codes is of great importance in its practical applications, and it can be reduced by implementing multi-bit decision decoders in the constituent nodes of the decoding tree. In this letter, we develop a matrix analysis method to analyze the corresponding parity submatrix of the decoding tree’s internal node. Two generalized constituent nodes are presented for the fast simplified successive-cancellation (fast-SSC) decoding of linear kernels-mixed multi-kernel polar codes. Results show that the proposed method achieves latency reduction and preserves the error-correction performance.
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.
