Optimal Puncturing of Polar Codes With a Fixed Information Set

Li, Liping; Song, Wei; Niu, Kai

doi:10.1109/access.2019.2918346

Cited by 13 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we will compare our proposed RNCS scheme with the existing punctured schemes RC, 8 ISAP, 9 and WQP 11 for SC‐list decoding polar code with the list size

L=8

and varying

\alpha

between 0.1 and 1. We have shown the difference between the simulations for rate

R=0.55,0.85

\left(512,256\right)

and

R=0.59,0.88

\left(1024,512\right)

for SC‐list polar code, plotted the block‐error‐rate (BLER) curve against

{E}_b/{N}_0

for

\alpha =0.70

as shown in Figure 4.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…A similar estimation has also been used in IR‐HARQ for practical systems 10 in which an identical information set is estimated, known as IR‐HARQ techniques. Similarly, Reference 11 have developed fixed information set backed technique names as worst quality puncturing (WQP). In this article, we propose a novel translation shift technique for shifting the non‐reliable bits in a three‐dimensional (3D) Euclidean space using formulations 12 and implementing the reliability metric‐enabled optimization search, with the information set for initialization taken from Reference 9.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Ali,

Xia

2024

Trans Emerging Tel Tech

View full text Add to dashboard Cite

This article proposes an extended version of the enhanced puncturing mechanism for polar codes of limited lengths based on the translation shift of the channel indices coordinates, which is determined by introducing a new parameter known as reliability weight. It has been found that the message log‐likelihood ratio (LLR) gets influenced during transmission. This influence can be measured in terms of the reliability magnitude of the LLR messages by the path under consideration. Our work analyzes this correlation as a scaling technique for the reliability measurement of LLR values evaluated through the straight path phenomenon over the decoder tree traversing, providing a base for translating channel coordinates in Euclidean space. Further, we presented a reliable nearest coordinate shifting algorithm for puncturing the least reliable bits taken from a fixed information set, which maximizes the gap between reliable and unreliable bits. Simulation results demonstrate that the designed algorithm enhances the puncturing of unreliable channel coordinates by widening the gap between reliable and unreliable bits and has the lowest hardware complexity.

show abstract

“…In this section, we will compare our proposed RNCS scheme with the existing punctured schemes RC, 8 ISAP, 9 and WQP 11 for SC‐list decoding polar code with the list size

L=8

and varying

\alpha

between 0.1 and 1. We have shown the difference between the simulations for rate

R=0.55,0.85

\left(512,256\right)

and

R=0.59,0.88

\left(1024,512\right)

for SC‐list polar code, plotted the block‐error‐rate (BLER) curve against

{E}_b/{N}_0

for

\alpha =0.70

as shown in Figure 4.…”

Section: Simulation Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

Ali,

Xia

2024

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…Based on this property, a new puncturing technique is proposed in Ref. [37], which can outperform the QUP scheme. The authors in Ref.…”

Section: Puncturing Schemesmentioning

confidence: 99%

Polar Codes: Encoding/Decoding and Rate-Compatible Jointly Design for HARQ System

Zeng

Zhou

et al. 2021

Intell. and Converged Netw.

View full text Add to dashboard Cite

Polar coding are the first class of provable capacity-achieving coding techniques for a wide range of channels. With an ideal recursive structure and many elegant mathematical properties, polar codes are inherently implemented with low complexity encoding and decoding algorithms. Since the block length of the original polar construction is limited to powers of two, rate-compatible polar codes (RCPC) are presented to meet the flexible length/rate transmission requirements in practice. The RCPC codes are well-conditioned to combine with the hybrid automatic repeat request (HARQ) system, providing high throughput efficiency and such RCPC-HAPQ scheme is commonly used in delay-insensitive communication system. This paper first gives a survey of both the classical and state-of-the-art encoding/decoding algorithms for polar codes. Then the RCPC construction methods are discussed, including the puncturing, shortening, multi-kernel construction, etc. Finally, we investigate several RCPC-HARQ jointly design systems and discuss their encoding gain and re-transmission diversity gain.

show abstract

“…In [10], a hierarchical puncture algorithm was proposed to construct puncture polar codes by optimizing the information set. Considering the error probability of polarized sub-channels, WQP algorithm based on fixed information set was proposed in [11] to determine puncture pattern. In [12], an improved puncture algorithm was proposed based on bit-reversal puncture to support multi-coding rate system.…”

Section: Introductionmentioning

confidence: 99%

Minimum Row Weight and Polar Spectrum Based Puncture Polar Codes Construction Algorithm

2023

KSII TIIS

View full text Add to dashboard Cite

In order to handle the problem that puncture patterns will change the position distribution of original information bits and frozen bits in polar codes, which affects performance of puncture polar codes further, a minimum row weight and polar spectrum based puncture polar codes construction algorithm (called PA-MRWP) is proposed in this paper. The algorithm calculates row weight of generator matrix and sorts the row weight in ascending order first. Next, the positions with the minimum row weight are selected as initial puncture positions. If the rows with the same row weight cannot all be punctured, polar spectrum based auxiliary puncture scheme is used. In sub-channels with the same row weight, rows corresponding to the polarized sub-channels with higher reliability are selected as puncture positions to construct puncture vector, and the reliability is calculated based on polar spectrum. It is actually a two-step selection strategy, the proposed minimum row weight puncture (MRWP) algorithm is used for primary selection and polar spectrum based auxiliary puncture is used for adjustment. Simulation results show that, compared with worst quality puncture (WQP) algorithm, the proposed PA-MRWP algorithm and Gaussian approximation-aided minimum row weight puncture (GA-MRWP) algorithm provide gains of about 0.46 dB and 0.29 dB at bit error rate (BER) of 4 10 − , respectively when code length 400 N = , code rate 1 / 2 R = . In addition, the proposed puncture algorithms improve the BER performance significantly with respect to quasi-uniform puncture (QUP) algorithm.

show abstract

Optimal Puncturing of Polar Codes With a Fixed Information Set

Cited by 13 publications

References 14 publications

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

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

Polar Codes: Encoding/Decoding and Rate-Compatible Jointly Design for HARQ System

Minimum Row Weight and Polar Spectrum Based Puncture Polar Codes Construction Algorithm

Contact Info

Product

Resources

About