[Back]

B. Tahir:
"Construction and Performance of Polar Codes for Transmission over the AWGN Channel";
Supervisor: M. Rupp, S. Schwarz; Institute of Telecommunications (E389), 2017; final examination: 11-17-2017.

Polar codes attracted a lot of attention since they were introduced by Arikan in 2008. They are the first practical codes that are proven to achieve the channel capacity at infinite length. The field of polar coding is an active field of research, and one of its main topics is the code construction. The construction of polar codes involves finding the set of the most unreliable bit positions, usually called the Frozen set. The complement set is then used to transport information bits.
In this thesis, we look at polar codes operating over the Additive White Gaussian Noise (AWGN) channel and we consider two topics: their construction, and their performance against Turbo and Low-Density Parity-Check (LDPC) codes. In the first part, we start with some construction algorithms that are frequently used, and then we show a new construction algorithm and demonstrate its performance. For the second part, we review the state-of-the-art turbo and LDPC architectures and we benchmark their performance against polar codes.

Polar codes attracted a lot of attention since they were introduced by Arikan in 2008. They are the first practical codes that are proven to achieve the channel capacity at infinite length. The field of polar coding is an active field of research, and one of its main topics is the code construction. The construction of polar codes involves finding the set of the most unreliable bit positions, usually called the Frozen set. The complement set is then used to transport information bits.
In this thesis, we look at polar codes operating over the Additive White Gaussian Noise (AWGN) channel and we consider two topics: their construction, and their performance against Turbo and Low-Density Parity-Check (LDPC) codes. In the first part, we start with some construction algorithms that are frequently used, and then we show a new construction algorithm and demonstrate its performance. For the second part, we review the state-of-the-art turbo and LDPC architectures and we benchmark their performance against polar codes.

Polar codes, channel coding, code construction, comparison, turbo, LDPC

http://publik.tuwien.ac.at/files/publik_262980.pdf