Sliding Window Polar Codes

04/16/2020
by   Valerio Bioglio, et al.
0

We propose a novel coupling technique for the design of polar codes of length N, making them decodable through a sliding window of size M < N. This feature allows to reduce the computational complexity of the decoder, an important possibility in wireless communication downlink scenarios. Our approach is based on the design of an ad-hoc kernel to be inserted in a multi-kernel polar code framework; this structure enables the sliding window decoding of the code. Simulation results show that the proposed sliding window polar codes outperform the independent blocks transmission in the proposed scenario, at the cost of a negligible decoding overhead.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/22/2020

Large Kernel Polar Codes with efficient Window Decoding

In this paper, we modify polar codes constructed with some 2^t x 2^t pol...
research
04/02/2018

Algebraic matching techniques for fast decoding of polar codes with Reed-Solomon kernel

We propose to reduce the decoding complexity of polar codes with non-Ari...
research
11/27/2017

Skip-Sliding Window Codes

Constrained coding is used widely in digital communication and storage s...
research
09/25/2018

Memory Management in Successive-Cancellation based Decoders for Multi-Kernel Polar Codes

Multi-kernel polar codes have recently been proposed to construct polar ...
research
04/28/2020

Error Propagation Mitigation in Sliding Window Decoding of Braided Convolutional Codes

We investigate error propagation in sliding window decoding of braided c...
research
06/30/2018

A sliding window technique for interactive high-performance computing scenarios

Interactive high-performance computing is doubtlessly beneficial for man...
research
01/10/2018

Combating Error Propagation in Window Decoding of Braided Convolutional Codes

In this paper, we study sliding window decoding of braided convolutional...

Please sign up or login with your details

Forgot password? Click here to reset