Puncturing scheme for polar codes based on channel reliability estimation

Abstract

The compiled code algorithms for polar codes, which were proposed by Arikan, are of low complexity, with excellent performance for a given code length. Consequently, it has attracted widespread attention and gained popularity since its inception. The construction of punctured polar codes allows for more flexibility in coding, making them suitable for a greater variety of scenarios. This paper proposes an improved puncturing scheme for polar codes. With the constraints imposed by conventional punctured polar codes, the error probability of each polarized sub-channel is then calculated on the basis of the channel reliability estimation methodology, so as to puncture the less reliable polarized sub-channels. Furthermore, to achieve better decoding performance, this scheme sets the initial log-likelihood rate (LLR) of the punctured bits to infinity (or negative infinity). The simulation outcomes indicate that the improved punctured polar codes as proposed in this paper perform better than the conventional punctured polar codes.

An improved algorithm of generating shortening patterns for polar codes

“…The novel puncturing scheme described in [13] serves as the second-rate matching technique, which forms the foundation of the shortening process. When a coded bit is shortened, its corresponding input bit channel is transferred to the set of frozen bits, while another bit is moved to the set of information bits.…”

“…Tianwei Han and alt. introduced an enhanced puncturing scheme for polar codes, where the initial log-likelihood rate (LLR) of the punctured bits is set to infinity to improve decoding performance [13].…”

Reliability weight‐based extended puncturing mechanism for polar codes using translation shift

“…3 The SC-list and CRC overcame the problems of performance degradation on lower code length and made them suitable practical, and usable choices for some time. Some of the prevailing methods for the polar code construction include the log-likelihood ratio (LLR)-based construction, 4 Gaussian approximation (GA), 5 quasi-uniform puncturing algorithm, 6 and a bit reversal shortening (BRS) scheme 7 are introduced. At the same time, they also have some downside, which uses enormous computation complexity and long latency.…”