AG Kommunikationstheorie


Analysis of Puncturing Schemes for Polar Codes


Polar codes, invented by Arikan in 2009, are the first known error correcting linear block codes that achieve the symmetric capacity of binary-input discrete memoryless channels. Originally, the block length of polar codes is limited to integer powers of two, yielding a reduced flexibility in modern communication systems. To overcome this restriction, different puncturing techniques can be utilized to realize length-compatible polar codes. In this presentation, important fundamentals of polar coding with respect to puncturing are introduced. Utilizing the exponent of the polarizing matrix as a performance measure, an existing puncturing algorithm is adapted to create rate-compatible code families, which may be used in hybrid automatic repeat request schemes with incremental redundancy (HARQ-IR schemes). Required constraints and the corresponding advantages and disadvantages, which come along with the adapted algorithm, are explained. Finally, simulation results for different puncturing techniques are presented and analyzed.