Recursive Descriptions of Decoding Algorithms and Hardware Architectures for Polar Codes
Noam Presman, Simon N. Litsyn · arXiv (Cornell University) · 2012
Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. This description allows an easy development of the first two algorithms for arbitrary polarizing kernels. Hardware architectures for these decoding algorithms are also described in a recursive way, both for Arikan's standard polar codes and for arbitrary polarizing kernels.