2019
DOI: 10.1109/tcomm.2019.2930502
|View full text |Cite
|
Sign up to set email alerts
|

Rate Matching for Polar Codes Based on Binary Domination

Abstract: 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 30 publications
0
8
0
Order By: Relevance
“…Alice takes the encoded N bits and rate matches them to E bits according to the actual transmission capacity. Typical rate matching approaches include puncturing, shortening and repetition [33]. MQAM is then performed to obtain S = E/ log 2 M symbols t = [t 1 , t 2 , • • • , t S ] for transmission.…”
Section: Transmittermentioning
confidence: 99%
“…Alice takes the encoded N bits and rate matches them to E bits according to the actual transmission capacity. Typical rate matching approaches include puncturing, shortening and repetition [33]. MQAM is then performed to obtain S = E/ log 2 M symbols t = [t 1 , t 2 , • • • , t S ] for transmission.…”
Section: Transmittermentioning
confidence: 99%
“…The main shortening and puncturing techniques can be found in [27] - [41]. Generally, puncturing or shortening causes a loss of performance because when the number of bits punctured or shortened increases the code length decreases, degrading the performance.…”
Section: Introdutionmentioning
confidence: 99%
“…The polarization-driven (PD) shortening technique has been presented in [40] based on the reduction of the generating matrix along with a strategy for the choice of bits shortened according to the channel polarization indices associated with the line index of the generator matrix. Recently, the PW algorithm has been used in a puncturing and shortening technique as reported in [41].…”
Section: Introdutionmentioning
confidence: 99%
“…Various shortening and puncturing methods for polar codes have been reported in [27]- [41]. Generally, puncturing or shortening causes a loss of performance because when the number of bits punctured or shortened increases the code length decreases, degrading the performance.…”
Section: Introdutionmentioning
confidence: 99%
“…The authors in [40] presented a polarization-driven (PD) shortening technique for the design of rate-compatible polar codes, which consists of reducing the generator matrix by relating its row index with the channel polarization. Recently, the PW algorithm has been used in a puncturing and shortening technique reported in [41].…”
Section: Introdutionmentioning
confidence: 99%