Neural Polar Decoders for Deletion Channels
Ziv Aharoni, Henry D. Pfister

TL;DR
This paper presents a neural polar decoder (NPD) tailored for deletion channels that significantly reduces computational complexity, enabling practical decoding for longer block lengths and supporting advanced techniques like list decoding.
Contribution
The paper extends the neural polar decoder architecture to deletion channels, reducing complexity from $O(N^4)$ to $O(AN \, \log N)$, facilitating longer block length decoding and improved performance.
Findings
Reduced decoding complexity enables longer block length applications.
NPD achieves accurate decoding verified against trellis decoder.
Incorporating list decoding further enhances performance.
Abstract
This paper introduces a neural polar decoder (NPD) for deletion channels with a constant deletion rate. Existing polar decoders for deletion channels exhibit high computational complexity of , where is the block length. This limits the application of polar codes for deletion channels to short-to-moderate block lengths. In this work, we demonstrate that employing NPDs for deletion channels can reduce the computational complexity. First, we extend the architecture of the NPD to support deletion channels. Specifically, the NPD architecture consists of four neural networks (NNs), each replicating fundamental successive cancellation (SC) decoder operations. To support deletion channels, we change the architecture of only one. The computational complexity of the NPD is , where the parameter represents a computational budget determined by the user and is…
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
TopicsNeural Networks and Applications · Advanced Memory and Neural Computing
