Concatenations of polar codes with outer BCH codes and convolutional codes Conference Paper uri icon

abstract

  • 2014 IEEE. We analyze concatenation schemes of polar codes with outer binary BCH codes and convolutional codes. We show that both BCH-polar and Convolutional-polar (Conv-polar) codes can have frame error rate that decays exponentially with the frame length, which is a substantial improvement over standalone polar codes. With the increase in the cutoff rate of the channel after polarization, long constraint-length convolutional codes with sequential decoding suffice to achieve a frame error rate that decays exponentially with the frame length, whereas the average decoding complexity is low. Numerical results show that both BCH-polar codes and Conv-polar codes can outperform stand-alone polar codes for some lengths and choice of decoding algorithms used to decode the outer codes. For the additive white Gaussian noise channel, Conv-polar codes substantially outperform concatenated Reed Solomon-polar codes with a careful choice of the lengths of inner and outer codes.

name of conference

  • 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)

published proceedings

  • 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)

altmetric score

  • 6

author list (cited authors)

  • Wang, Y., & Narayanan, K. R.

citation count

  • 13

complete list of authors

  • Wang, Ying||Narayanan, Krishna R

publication date

  • September 2014

publisher