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

09/25/2018
by   Valerio Bioglio, et al.
0

Multi-kernel polar codes have recently been proposed to construct polar codes of lengths different from powers of two. Decoder implementations for multi-kernel polar codes need to account for this feature, that becomes critical in memory management. We propose an efficient, generalized memory management framework for implementation of successivecancellation decoding of multi-kernel polar codes. It can be used on many types of hardware architectures and different flavors of SC decoding algorithms. We illustrate the proposed solution for small kernel sizes, and give complexity estimates for various kernel combinations and code lengths.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2019

Fast Decoding of Multi-Kernel Polar Codes

Polar codes are a class of linear error correction codes which provably ...
research
01/14/2020

Multi-Kernel Polar Codes: Concept and Design Principles

In this paper, we propose a new polar code construction by employing ker...
research
05/23/2018

Convolutional Polar Codes on Channels with Memory

Arikan's recursive code construction was designed for memoryless channel...
research
02/02/2018

A Multi-Kernel Multi-Code Polar Decoder Architecture

Polar codes have received increasing attention in the past decade, and h...
research
04/16/2020

Sliding Window Polar Codes

We propose a novel coupling technique for the design of polar codes of l...
research
05/02/2014

Representation of a Sentence using a Polar Fuzzy Neutrosophic Semantic Net

A semantic net can be used to represent a sentence. A sentence in a lang...
research
03/09/2019

Polar Coding with Chemical Reaction Networks

In this paper, we propose a new polar coding scheme with molecular progr...

Please sign up or login with your details

Forgot password? Click here to reset