In this paper, the traditional BP decoding algorithm of LDPC code is investigated in detail. The large computation load is a shortcoming of traditional BP decoding algorithm, and an improved BP decoding algorithm is then proposed to deal with the problem. In the iterative decoding process, the wrong bit information only needs to be updated for the decoding algorithm, which consequently improves...

This talk is intended to give a survey on the existing literature on the decoding of algebraic-geometric codes. Although the motivation originally was to find an efficient decoding algorithm for algebraic-geometric codes, the latest results give algorithms which can be explained purely in terms of linear algebra. We will treat the following subjects: 1. The decoding problem 2. Decoding by error...

Recent research in neural machine translation has largely focused on two aspects; neural network architectures and end-toend learning algorithms. The problem of decoding, however, has received relatively little attention from the research community. In this paper, we solely focus on the problem of decoding given a trained neural machine translation model. Instead of trying to build a new decodi...

Sequential decoding can achieve a very low computational complexity and short decoding delay when the signalto-noise ratio (SNR) is relatively high. In this article, a low-complexity high-throughput decoding architecture based on a sequential decoding algorithm is proposed for convolutional codes. Parallel Fano decoders are scheduled to the codewords in parallel input buffers according to buffe...

In the development of digital communication and information theory, every channel decoding rule has resulted in a revolution at the time when it was invented. In the area of information theory, early channel coding theorems were established mainly by maximum likelihood decoding, while the arrival of typical sequence decoding signaled the era of multi-user information theory, in which achievabil...

We examine codes from the Paley graphs for the purpose of permutation decoding and observe that after a certain length, PD-sets to correct errors up to the code’s error-capability will not exist. In this paper we construct small sets of permutations for correcting two errors by permutation decoding for the case where the codes have prime length.

This article surveys many variants of sequential decoding in literature. Rather than introducing them chronologically, this article first presents the Algorithm A, a general sequential search algorithm. The stack algorithm and the Fano algorithm are then described in details. Next, trellis variants of sequential decoding, including the recently proposed maximum-likelihood sequential decoding al...

A reprogrammable logic or interconnect architecture termed non-orthogonal decoding' is described, which increases routability with no additional circuitry and negligible added layout area, compared to an existing reprogrammable routing architecture, the orthogonal decoding architecture introduced by Aptix. An orthogonal decoding architecture's routing channel box is modified to illustrate non-o...

A new method for low-complexity near-maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over the additive white Gaussian noise channel is presented. The proposed method termed beliefpropagation–list erasure decoding (BP-LED) is based on erasing carefully chosen unreliable bits performed in case of BP decoding failure. A strategy of introducing erasures into the received v...

This paper presents an improved version of multistage threshold decoding with a difference register (MTD-DR) for selforthogonal convolutional codes (SOCCs). An approximate lower bound on the bit error rate (BER) with the maximum likelihood (ML) decoding is also given. MTD-DR is shown to achieve an approximate lower bound of ML decoding performance at the higher Eb/N0. The code with larger minim...