Belief Propagation List Decoding of Polar Codes
Belief Propagation List Decoding of Polar Codes
复制标题
DOI：
10.1109/lcomm.2018.2850772
复制
发表时间：
2018-08-01
期刊：
影响因子：
--
通讯作者：
ten Brink, Stephan
中科院分区：
文献类型：
--
作者：
Elkelesh, Ahmed;Ebada, Moustafa;ten Brink, Stephan
提出了一种性能相当于极化码连续消除列表(SCL)译码的信任传播列表(BPL)译码算法，对于足够大的列表长度L，它已经达到了极坐标编码的最大似然(ML)范围。生成可能发送的码字的列表，并根据欧几里得距离挑选最接近接收到的矢量的码字。据我们所知，所提出的BPL译码在迭代译码下提供了与普通极性码最好的性能。所提出的算法不需要对极性码结构本身进行任何改变，使得BPL成为SCL解码器的替代方案，其配备了软输出能力，使得能够例如迭代检测和解码以进一步提高性能。进一步的好处是比SCL解码器更低的解码延迟和高吞吐量实现的敏感性。此外，我们还证明了不同的冻结比特位置选择策略可以进一步提高所提出的解码器的误码率性能。
We propose a belief propagation list (BPL) decoder with comparable performance to the successive cancellation list (SCL) decoder of polar codes, which already achieves the maximum likelihood (ML) hound of polar codes for sufficiently large list size L. The proposed decoder is composed of multiple parallel independent belief propagation (BP) decoders based on differently permuted polar code factor graphs. A list of possible transmitted codewords is generated and the one closest to the received vector, in terms of Euclidean distance, is picked. To the best of our knowledge, the proposed BPL decoder provides the best performance of plain polar codes under iterative decoding known so far. The proposed algorithm does not require any changes in the polar code structure itself, rendering the BPL into an alternative to the SCL decoder, equipped with a soft output capability enabling, e.g., iterative detection and decoding to further improve performance. Further benefits are the lower decoding latency than the SCL decoder and the passibility of high throughput implementations. Additionally, we show that a different selection strategy of frozen bit positions can further enhance the error-rate performance of the proposed decoder.