An Efficient CRC-Aided Parity-Check Concatenated Polar Coding

Parity check (PC) and cyclic redundancy check (CRC) concatenated polar codes can achieve better decoding performance compared with PC polar codes or CRC polar codes, but high check complexity and decoding delay greatly affect its performance. Based on the existing concatenated polar codes, this paper proposed a new scheme of CRC aided double PC concatenated polar codes and designed new encoding and decoding rules. The new scheme can prune in time and save correct paths to the greatest extent, so it can improve the block error rate performance without increasing the complexity significantly. Simulation results show that the proposed shame is better than other concatenated polar codes.