List Autoencoder: Towards Deep Learning Based Reliable Transmission Over Noisy Channels

12/19/2021
by   Hamid Saber, et al.
0

There has been a growing interest in automating the design of channel encoders and decoders in an auto-encoder(AE) framework in recent years for reliable transmission of data over noisy channels. In this paper we present a new framework for designing AEs for this purpose. In particular, we present an AE framework, namely listAE, in which the decoder network outputs a list of decoded message word candidates. A genie is assumed to be available at the output of the decoder and specific loss functions are proposed to optimize the performance of the genie-aided (GA)-listAE. The listAE is a general AE framework and can be used with any network architecture. We propose a specific end-to-end network architecture which decodes the received word on a sequence of component codes with decreasing rates. The listAE based on the proposed architecture, referred to as incremental redundancy listAE (IR-listAE), improves the state-of-the-art AE performance by 1 dB at low block error rates under GA decoding. We then employ cyclic redundancy check (CRC) codes to replace the genie at the decoder, giving CRC-aided (CA)-listAE with negligible performance loss compared to the GA-listAE. The CA-listAE shows meaningful coding gain at the price of a slight decrease in the rate due to appending CRC to the message word.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/05/2021

Deep Learning Based Near-Orthogonal Superposition Code for Short Message Transmission

Massive machine type communication (mMTC) has attracted new coding schem...
research
06/30/2022

Learning-Based Near-Orthogonal Superposition Code for MIMO Short Message Transmission

Massive machine type communication (mMTC) has attracted new coding schem...
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
10/31/2020

Using List Decoding to Improve the Finite-Length Performance of Sparse Regression Codes

We consider sparse superposition codes (SPARCs) over complex AWGN channe...
research
11/16/2022

The Levenshtein's Sequence Reconstruction Problem and the Length of the List

In the paper, the Levenshtein's sequence reconstruction problem is consi...
research
12/08/2022

On CRC-Aided, Dual-Trellis, List Decoding for High-Rate Convolutional Codes with Short Blocklengths

Recently, rate-1/n zero-terminated and tail-biting convolutional codes (...
research
02/26/2019

Statistical Learning Aided Decoding of BMST of Tail-Biting Convolutional Code

This paper is concerned with block Markov superposition transmission (BM...

Please sign up or login with your details

Forgot password? Click here to reset