Information Set Optimization for Polar Codes Under BP Decoder

Application of the belief propagation (BP) decoding on the polar codes is one of the promising solutions for achieving low latency. To compensate for performance degradation caused by the BP decoding, we proposed the iterative algorithm to obtain the information set optimized for the BP decoding. By employing the proposed iterative algorithm, the performance were improved compared to the performance employing the information set optimized for the successive cancellation decoding.