极化码盲检测中精度与复杂度之间的权衡
On the Tradeoff Between Accuracy and Complexity in Blind Detection of Polar Codes
AI总结：
本文针对极化码盲检测，提出三种基于置信传播译码和早停准则的可变复杂度检测方法，并展示精度与复杂度的权衡，在复杂预算内可剔除干扰块并保持低漏检率。
摘要：
极化码是一类具有诸多优良特性的新型纠错码族。其颠覆性体现在被迅速采纳于第五代移动通信标准中，用于保护控制消息。本文描述了一个两阶段系统，用于识别控制消息的位置，该系统由检测与选择阶段以及随后的译码阶段组成。第一阶段催生了对具有可变工作量的极化码检测算法的需求，以平衡两个阶段之间的复杂度。我们针对面向第一阶段的多种检测算法阐述了这种可变工作量的思想。我们提出了三种新颖的盲检测方法，这些方法基于受早停准则启发的置信传播译码。然后我们展示了它们的可靠性如何随译码迭代次数的增加而提升，以突出精度与复杂度之间可能的权衡。此外，我们展示了先前工作中一种检测方法的类似权衡。在仅有一个目标极化码编码块存在于众多其他块之中的设置下，我们的结果显著表明，根据复杂度预算，可以剔除可变数量的非期望块，同时实现与复杂译码算法的块错误率一致的漏检率。
英文摘要：
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 $5^{th}$-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 highlight the possible tradeoffs between accuracy and complexity. Additionally, we show similar tradeoffs for a detection method from previous work. In a setup where only one block encoded with the polar code of interest is present among many other blocks, our results notably show that, depending on the complexity budget, a variable number of undesirable blocks can be dismissed while achieving a missed-detection rate in line with the block-error rate of a complex decoding algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
