pith. sign in

arxiv: 1708.09679 · v1 · pith:NUFDW6GKnew · submitted 2017-08-31 · 💻 cs.IT · math.IT

An Incremental Redundancy HARQ Scheme for Polar Code

classification 💻 cs.IT math.IT
keywords codepolarproposedalgorithmbitscomparisondirectlygenerated
0
0 comments X
read the original abstract

A polar code extension method which supports incremental redundancy hybrid ARQ(IR-HARQ) is proposed in this paper. By copying information bits to proper positions of the extend part, the extended polar code can give additional protection for the bits weakly protected by the first transmission. A comparison between the proposed algorithm with directly generated polar code, LTE turbo code, and some other IR-HARQ supporting polar code is given. Simulation results show that the proposed algorithm has nearly the same performance as directly generated polar code, which is chosen as base line for comparison.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Capacity-Achieving BBT Polar Codes with Interleaver-Assisted BP Decoding

    cs.IT 2026-03 conditional novelty 8.0

    BBT polar codes achieve capacity for any block length via a new tree transformation and support low-latency BP decoding through interleaving and sub-graph processing.