Data-Driven Neural Polar Codes for Unknown Channels With and Without Memory

09/06/2023
โˆ™
by   Ziv Aharoni, et al.
โˆ™
0
โˆ™

In this work, a novel data-driven methodology for designing polar codes for channels with and without memory is proposed. The methodology is suitable for the case where the channel is given as a "black-box" and the designer has access to the channel for generating observations of its inputs and outputs, but does not have access to the explicit channel model. The proposed method leverages the structure of the successive cancellation (SC) decoder to devise a neural SC (NSC) decoder. The NSC decoder uses neural networks (NNs) to replace the core elements of the original SC decoder, the check-node, the bit-node and the soft decision. Along with the NSC, we devise additional NN that embeds the channel outputs into the input space of the SC decoder. The proposed method is supported by theoretical guarantees that include the consistency of the NSC. Also, the NSC has computational complexity that does not grow with the channel memory size. This sets its main advantage over successive cancellation trellis (SCT) decoder for finite state channels (FSCs) that has complexity of O(|๐’ฎ|^3 Nlog N), where |๐’ฎ| denotes the number of channel states. We demonstrate the performance of the proposed algorithms on memoryless channels and on channels with memory. The empirical results are compared with the optimal polar decoder, given by the SC and SCT decoders. We further show that our algorithms are applicable for the case where there SC and SCT decoders are not applicable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
โˆ™ 03/27/2022

All the codeword bits in polar codes have the same BER under the SC decoder

We prove that for any binary-input memoryless symmetric (BMS) channel, a...
research
โˆ™ 12/10/2018

Study of Puncturing Techniques for Polar Codes in 5G Cellular and IoT Networks

This paper presents a puncturing technique based on the channel polariza...
research
โˆ™ 05/23/2018

Convolutional Polar Codes on Channels with Memory

Arikan's recursive code construction was designed for memoryless channel...
research
โˆ™ 11/12/2020

Realization of Stochastic Neural Networks and Its Potential Applications

Successive Cancellation Decoders have come a long way since the implemen...
research
โˆ™ 11/20/2019

Decoding Polar Codes via Weighted-Window Soft Cancellation for Slowly-Varying Channel

Polar codes are a class of structured channel codes proposed by Arฤฑkan ...
research
โˆ™ 10/01/2022

CRISP: Curriculum based Sequential Neural Decoders for Polar Code Family

Polar codes are widely used state-of-the-art codes for reliable communic...
research
โˆ™ 07/19/2019

Modified zero forcing decoder for ill-conditioned channels

A modified zero-forcing (MZF) decoder for ill-conditioned Multi-Input Mu...

Please sign up or login with your details

Forgot password? Click here to reset