Polar Codes with Memory

Polar codes with memory (PCM) are proposed in this paper: a pair of consecutive code blocks containing a controlled number of mutual information bits. The shared mutual information bits of the succeeded block can help the failed block to recover. The underlying polar codes can employ any decoding scheme such as the successive cancellation (SC) decoding (PCM-SC), the belief propagation (BP) decoding (PCM-BP), and the successive cancellation list (SCL) decoding (PCM-SCL). The analysis shows that the packet error rate (PER) of PCM decreases to the order of PER squared while maintaining the same complexity as the underlying polar codes. Simulation results indicate that for PCM-SC, the PER is comparable to (less than 0.3 dB) the stand-alone SCL decoding with two lists for the block length $N=256$. The PER of PCM-SCL with $L$ lists can match that of the stand-alone SCL decoding with $2L$ lists. Two hardware decoders for PCM are also implemented: the in-serial (IS) decoder and the low-latency interleaved (LLI) decoder. For $N=256$, synthesis results show that in the worst case, the latency of the PCM LLI decoder is only $16.1\%$ of the adaptive SCL decoder with $L=2$, while the throughput is improved by 13 times compared to it.

[1]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[2]  Kai Chen,et al.  CRC-Aided Decoding of Polar Codes , 2012, IEEE Communications Letters.

[3]  Alexander Vardy,et al.  How to Construct Polar Codes , 2011, IEEE Transactions on Information Theory.

[4]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.

[5]  H. Pishro-Nik,et al.  On bit error rate performance of polar codes in finite regime , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[6]  Keshab K. Parhi,et al.  Low-Latency Sequential and Overlapped Architectures for Successive Cancellation Polar Decoder , 2013, IEEE Transactions on Signal Processing.

[7]  Altuğ Süral.  An fpga implementation of successive cancellation list decoding for polar codes , 2016 .

[8]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[9]  Kai Chen,et al.  Improved Successive Cancellation Decoding of Polar Codes , 2012, IEEE Transactions on Communications.

[10]  Keshab K. Parhi,et al.  Interleaved successive cancellation polar decoders , 2014, 2014 IEEE International Symposium on Circuits and Systems (ISCAS).

[11]  E. Arkan,et al.  A performance comparison of polar codes and Reed-Muller codes , 2008, IEEE Communications Letters.

[12]  Onur Dizdar,et al.  High throughput decoding methods and architectures for polar codes with high energy-efficiency and low latency , 2017 .