Overlapped List Successive Cancellation Approach for Hardware Efficient Polar Code Decoder
Tiben Che, Jingwei Xu, Gwan Choi

TL;DR
This paper introduces a hardware-efficient list successive cancellation decoder for polar codes that reduces complexity and latency through path-overlapping, achieving higher efficiency without performance loss.
Contribution
It proposes a novel path-overlapping scheme for LSC decoding, significantly reducing hardware complexity and latency compared to existing methods.
Findings
Hardware efficiency increased significantly
No decoding performance loss
Latency reduced through pipeline optimization
Abstract
This paper presents an efficient hardware design approach for list successive cancellation (LSC) decoding of polar codes. By applying path-overlapping scheme, the l instances of (l > 1) successive cancellation (SC) decoder for LSC with list size l can be cut down to only one. This results in a dramatic reduction of the hardware complexity without any decoding performance loss. We also develop novel approaches to reduce the latencyassociated with the pipeline scheme. Simulation results show that with proposed design approach the hardware efficiency is increased significantly over the recently proposed LSC decoders.
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
