CRC Code Design for List Decoding of Polar Codes
Top Cited Papers
- 22 February 2017
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 21 (6) , 1229-1232
Abstract
Cyclic redundancy check (CRC) assisted list successive cancellation decoding (SCLD) makes polar codes competitive with the state-of-art codes. In this letter, we try to find the optimal CRC for polar codes to further improve its performance. We first analyze the undetected error probability of CRC-aided SCLD as well as the characteristics of Hamming weight distribution of polar codes. Based on these characteristics, a multilevel SCLD-based searching strategy with moderate list size is proposed to compute the minimum Hamming weight distribution (MHWD) of different CRC-concatenated polar codes. Using the searched MHWD, the optimal CRC for polar codes are presented in this letter. Simulation results show that the performance of optimal CRC-aided SCLD significantly outperforms the standard one, especially at high code rate.Keywords
Funding Information
- National Natural Science Foundation of China (61501508)
This publication has 12 references indexed in Scilit:
- Convolutional-Code-Specific CRC Code DesignIEEE Transactions on Communications, 2015
- List Decoding of Polar CodesIEEE Transactions on Information Theory, 2015
- Distance spectrum analysis of polar codes2014
- Improved Successive Cancellation Decoding of Polar CodesIEEE Transactions on Communications, 2013
- On Finite-Length Performance of Polar Codes: Stopping Sets, Error Floor, and Concatenated DesignIEEE Transactions on Communications, 2013
- An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy CheckIEEE Communications Letters, 2012
- CRC-Aided Decoding of Polar CodesIEEE Communications Letters, 2012
- Efficient Design and Decoding of Polar CodesIEEE Transactions on Communications, 2012
- List decoding of polar codes2011
- Cyclic redundancy code (CRC) polynomial selection for embedded networks2004