Efficient Soft Cancelation Decoder Architectures for Polar Codes

The flooding belief propagation (FO-BP) and the soft-cancelation (SCAN) algorithms are the two most popular soft-output BP algorithms for the decoding of capacity-achieving polar codes. The FO-BP algorithm has high throughput at the cost of performance degradation in high signal-to-noise ratio (SNR) region or with large block length. The SCAN algorithm has much better decoding performance while suffering from long decoding latency and low throughput. In this paper, an improved BP algorithm, named reduced complexity soft-cancelation (RCSC) algorithm, is proposed. Compared with the SCAN algorithm, the number of memory entries required by the RCSC algorithm is reduced by more than 50% in general, while achieving comparable or even better (e.g., when block size N = 215) decoding performance. When block size is large (e.g., N ≥ 215), the proposed RCSC algorithm reduces the required memory entries by more than 23% compared with the state-of-the-art FO-BP algorithm. The numerical results show that the error performance improvement of the RCSC algorithm is more significant when the SNR increases. For a different tradeoff, a reduced latency soft-cancelation (RLSC) algorithm is proposed to reduce the decoding latency and increase the throughput of the RCSC algorithm while slightly sacrificing decoding performance. Finally, the optimized VLSI architectures are presented for the RCSC and RLSC algorithms, respectively. The synthesis results demonstrate the efficiency of the proposed algorithms and architectures.

[1]  G. Forney,et al.  Codes on graphs: normal realizations , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[2]  In-Cheol Park,et al.  Partially Parallel Encoder Architecture for Long Polar Codes , 2015, IEEE Transactions on Circuits and Systems II: Express Briefs.

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

[4]  Chin-Long Wey,et al.  Algorithms of Finding the First Two Minimum Values and Their Hardware Implementation , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[5]  Zhiyuan Yan,et al.  A Multimode Area-Efficient SCL Polar Decoder , 2016, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[6]  Chi-Ying Tsui,et al.  Low complexity belief propagation polar code decoder , 2015, 2015 IEEE Workshop on Signal Processing Systems (SiPS).

[7]  Emre Telatar,et al.  Polarization for arbitrary discrete memoryless channels , 2009, 2009 IEEE Information Theory Workshop.

[8]  Zhengya Zhang,et al.  A 4.68Gb/s belief propagation polar decoder with bit-splitting register file , 2014, 2014 Symposium on VLSI Circuits Digest of Technical Papers.

[9]  Zhongfeng Wang,et al.  A memory efficient belief propagation decoder for polar codes , 2015, China Communications.

[10]  Alexander Vardy,et al.  Fast Polar Decoders: Algorithm and Implementation , 2013, IEEE Journal on Selected Areas in Communications.

[11]  John R. Barry,et al.  Low-Complexity Soft-Output Decoding of Polar Codes , 2014, IEEE Journal on Selected Areas in Communications.

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

[13]  Gwan S. Choi,et al.  XJ-BP: Express Journey Belief Propagation Decoding for Polar Codes , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).

[14]  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.

[15]  Keshab K. Parhi,et al.  Early Stopping Criteria for Energy-Efficient Low-Latency Belief-Propagation Polar Code Decoders , 2014, IEEE Transactions on Signal Processing.

[16]  Zhiyuan Yan,et al.  An Efficient List Decoder Architecture for Polar Codes , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[17]  Warren J. Gross,et al.  A Semi-Parallel Successive-Cancellation Decoder for Polar Codes , 2013, IEEE Transactions on Signal Processing.

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

[19]  Zhiyuan Yan,et al.  A High Throughput List Decoder Architecture for Polar Codes , 2016, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[20]  Hossein Pishro-Nik,et al.  On Finite-Length Performance of Polar Codes: Stopping Sets, Error Floor, and Concatenated Design , 2012, IEEE Transactions on Communications.

[21]  Frank R. Kschischang,et al.  A Simplified Successive-Cancellation Decoder for Polar Codes , 2011, IEEE Communications Letters.

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

[23]  Ying Li,et al.  Construction and Block Error Rate Analysis of Polar Codes Over AWGN Channel Based on Gaussian Approximation , 2014, IEEE Communications Letters.