On the Tradeoff Between Accuracy and Complexity in Blind Detection of Polar Codes
Pascal Giard, Alexios Balatsoukas-Stimming, Andreas Burg

TL;DR
This paper explores the balance between detection accuracy and computational complexity in blind detection of polar codes, proposing new methods that adapt effort levels to optimize performance within complexity constraints.
Contribution
It introduces three novel belief-propagation based blind detection algorithms with variable effort, analyzing their tradeoffs between accuracy and complexity.
Findings
Reliability of detection improves with more decoding iterations.
Tradeoffs exist between detection accuracy and computational effort.
Variable effort algorithms can effectively dismiss undesirable blocks.
Abstract
Polar codes are a recent family of error-correcting codes with a number of desirable characteristics. Their disruptive nature is illustrated by their rapid adoption in the -generation mobile-communication standard, where they are used to protect control messages. In this work, we describe a two-stage system tasked with identifying the location of control messages that consists of a detection and selection stage followed by a decoding one. The first stage spurs the need for polar-code detection algorithms with variable effort to balance complexity between the two stages. We illustrate this idea of variable effort for multiple detection algorithms aimed at the first stage. We propose three novel blind detection methods based on belief-propagation decoding inspired by early-stopping criteria. Then we show how their reliability improves with the number of decoding iterations to…
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.
