Abstract
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. Using such description allows an easy development of these algorithms for arbitrary polarizing kernels. Hardware architectures for these decoding algorithms are also described in a recursive way, both for Arıkan’s standard polar codes and for arbitrary polarizing kernels.
Original language | English |
---|---|
Pages (from-to) | 1-65 |
Number of pages | 65 |
Journal | Advances in Mathematics of Communications |
Volume | 11 |
Issue number | 1 |
DOIs | |
State | Published - Feb 2017 |
Keywords
- Decoding
- Encoding
- Error correction coding
- Polar coding