We propose a new family of polar coding which realizes high coding gain, low complexity, and high throughput by introducing a protograph-based design. The proposed technique called as quasi-cyclic (QC) polar codes can be highly parallelized without sacrificing decoding complexity. We analyze short cycles in the protograph polar codes and develop a design method to increase the girth. Our approach can resolve the long-standing unsolved problem that belief propagation (BP) decoding does not work well for polar codes due to the inherently short cycles. We demonstrate that a high lifting factor of QC polar codes can improve the performance and that QC polar codes with BP decoding can outperform conventional polar codes with state-of-the-art list decoding. Moreover, we show that a greedy pruning method can improve the performance-complexity trade-off.

中文翻译：

---

基于原型的QC极地代码设计

我们提出了一个新的极性编码系列，该系列通过引入基于原型的设计来实现高编码增益，低复杂度和高吞吐量。所提出的称为准循环（QC）极性代码的技术可以在不牺牲解码复杂度的情况下实现高度并行化。我们分析了原型极地代码中的短周期，并开发了一种增加周长的设计方法。我们的方法可以解决长期以来未解决的问题，即由于固有的短周期，置信传播（BP）解码不适用于极地代码。我们证明了QC极性码的提升因子可以提高性能，并且使用BP解码的QC极性码可以胜过使用最新列表解码的常规极性码。此外，我们表明，贪婪的修剪方法可以改善性能复杂性的折衷。