Rate matching for polar codes based on binary domination

by   Min Jang, et al.

In this paper, we investigate the fundamentals of puncturing and shortening for polar codes, based on binary domination which plays a key role in polar code construction. We first prove that the orders of encoder input bits to be made incapable (by puncturing) or to be shortened are governed by binary domination. In particular, we show that binary domination completely determines incapable or shortened bit patterns for polar codes, and that all the possible incapable or shortened bit patterns can be identified. We then present the patterns of the corresponding encoder output bits to be punctured or fixed, when the incapable or shortened bits are given. We also demonstrate that the order and the pattern of puncturing and shortening for polar codes can be aligned. In the previous work on the rate matching for polar codes, puncturing of encoder output bits begins from a low-indexed bit, while shortening starts from a high-indexed bit. Unlike such a conventional approach, we show that encoder output bits can be punctured from high-indexed bits, while keeping the incapable bit pattern exactly the same. This makes it possible to design a unified circular-buffer rate matching (CB-RM) scheme that includes puncturing, shortening, and repetition.


All the codeword bits in polar codes have the same BER under the SC decoder

We prove that for any binary-input memoryless symmetric (BMS) channel, a...

Optimal Puncturing of Polar Codes With a Fixed Information Set

For a given polar code construction, the existing literature on puncturi...

Adjacent-Bits-Swapped Polar codes: A new code construction to speed up polarization

The construction of polar codes with code length n=2^m involves m layers...

A General Construction and Encoder Implementation of Polar Codes

Similar to existing codes, puncturing and shortening are two general way...

A Scalable High-Performance Priority Encoder Using 1D-Array to 2D-Array Conversion

In our prior study of an L-bit priority encoder (PE), a so-called one-di...

A Balanced Tree Approach to Construction of Length-Compatible Polar Codes

From the perspective of tree, we design a length-compatible coding schem...

Design of Puncturing for Length-Compatible Polar Codes Using Differential Evolution

This paper presents a puncturing technique to design length-compatible p...

Please sign up or login with your details

Forgot password? Click here to reset