Performance and Complexity of the Sequential Successive Cancellation Decoding Algorithm
Peter Trifonov
TL;DR
This paper evaluates the performance and complexity of the sequential successive cancellation decoding algorithm across various codes, providing detailed analysis and comparisons with other coding schemes.
Contribution
It offers a comprehensive description and performance analysis of the sequential successive cancellation decoding algorithm for polar subcodes, BCH, and other codes.
Findings
Sequential decoding shows competitive performance with other coding schemes.
Complexity analysis reveals trade-offs in decoding efficiency.
Performance comparison highlights strengths and limitations of the algorithm.
Abstract
Simulation results illustrating the performance and complexity of the sequential successive cancellation decoding algorithm are presented for the case of polar subcodes with Arikan and large kernels, as well as for extended BCH\ codes. Performance comparison with Arikan PAC and LDPC codes is provided. Furthermore, complete description of the decoding algorithm is presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Advanced Wireless Communication Techniques · Coding theory and cryptography