Table of Contents
Fetching ...

Selectively Precoded Polar Codes

Samir Kumar Mishra, KwangChul Kim

TL;DR

Simulation results show that for a target frame erasure rate (FER) of $10^{-5}$, a (128, 64) SPP code is just 0.23 dB away from the information theoretic limit at this blocklength.

Abstract

In this paper, we propose \textit{selectively precoded polar (SPP) code}, built on top of Arikan's capacity achieving polar codes. We provide the encoding and decoding scheme for SPP code. Simulation results show that for a target frame erasure rate (FER) of $\mathbf{10^{-5}}$, a (128, 64) SPP code is just 0.23 dB away from the information theoretic limit at this blocklength. Further, it is also shown that such codes possess better distance properties compared to other contemporary polar code variants.

Selectively Precoded Polar Codes

TL;DR

Simulation results show that for a target frame erasure rate (FER) of , a (128, 64) SPP code is just 0.23 dB away from the information theoretic limit at this blocklength.

Abstract

In this paper, we propose \textit{selectively precoded polar (SPP) code}, built on top of Arikan's capacity achieving polar codes. We provide the encoding and decoding scheme for SPP code. Simulation results show that for a target frame erasure rate (FER) of , a (128, 64) SPP code is just 0.23 dB away from the information theoretic limit at this blocklength. Further, it is also shown that such codes possess better distance properties compared to other contemporary polar code variants.

Paper Structure

This paper contains 11 sections, 5 equations, 3 figures, 1 table, 2 algorithms.

Figures (3)

  • Figure 1: FER Performance of (128, 64) polar code variants
  • Figure 2: Coding scheme of SPP code
  • Figure 3: Truncated Union Bound for (128, 64) polar code variants