Studentische Arbeiten

Titel: On the Successive Iterative Decoding of Polar Codes
  • Forschungsarbeit
  • Forschungsarbeit
Status: laufend



Polar codes, as devised by Arıkan [1], are based on the concept of channel polarization. They have become an active area of research over the past few years owing to the fact that polar codes are the first theoretically proven type of channel codes known to achieve the capacity of an arbitrary Symmetric Binary Input Discrete Memoryless Channel (BI-DMC) under Successive Cancellation (SC) decoding at affordable complexity [1], assuming infinite length codes. (Enjoy playing aroung with [2] to get more knowledge about the basic concepts of polar codes).


[1] E. Arıkan, “Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels,” IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051–3073, July 2009.





Improving the performance of finite length polar codes is an active area of research. Iterative decoding is known to suit better hardware implementations, due to the potential of parallel processing. However, it is outperformed by the state-of-the-art seccessive decoding schemes. Due to all that, variants of iterative decoding of polar codes exist, aiming at finding a good tradeoff between pure iterative and successive decoding schemes.



  • Understand polar coding concepts.

  • Understand BP decoder of polar codes: strengths and limitations.

  • Study successive iterative decoding techniques and implement it.

  • Compare SCAN-BP, BP, and SC/SCL.

  • Study different scheduling and their effect on the decoder performance.

  • [optional] Implement own ideas.




  • Good knowledge of channel coding.
  • Good knowledge of Matlab programming.
  • The tasks are conducted in English.