In this paper, we investigate various types of multi-stage decoding for multi-level block modulation codes, in which the decoding of a component code at each stage can be either soft-decision or hard-decision, maximum likelihood or bounded-distance. Error performance of codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the pr...

In this paper, we consider decoding of loss tolerant data encoded by network coding and transmitted over error-prone networks. Intermediate network nodes typically perform the random linear network coding in a Galois field and a Gaussian elimination is used for decoding process in the terminal nodes. In such settings, conventional decoding approaches can unfortunately not reconstruct any encode...

In this paper, we present a new soft-decision decoding algorithm for Reed-Muller codes. It is based on the GMC decoding algorithm proposed by Schnabl and Bossert [1] which interprets Reed-Muller codes as generalized multiple concatenated codes. We extend the GMC algorithm to list-decoding (L-GMC). As a result, a SDML decoding algorithm for the first order Reed-Muller codes is obtained. Moreover...

AbstructGeneral symmetric channels are introduced, and near-maximum-likelihood decoding in these channels is studied. First, we define a class of suboptimal decoding algorithms .based on an incomplete search through the code trellis. It is proved that the decoding error probability of suboptimal decoding is bounded above for any q-ary code of length TL and code rate T by twice the error probabi...

In this letter, we propose a recursive space time decoding method for orthogonal frequency division multiplexing (OFDM) systems exploiting multiple transmit antenna diversity when the channels are fast fading. We first develop a computationally efficient space-time decoding method involving a matrix inversion to mitigate the channel variation effect. We then further reduce the computational com...

The ordered statistics-based list decoding techniques for linear binary block codes of small to medium block length are investigated. The construction of a list of the test error patterns is considered. The original ordered-statistics decoding (OSD) is generalized by assuming segmentation of the most reliable independent positions (MRIPs) of the received bits. The segmentation is shown to overc...

In this paper, we proposed the simplified binaural decoding method for reducing the complexity of the binaural decoding. In the proposed simplified binaural decoding the high frequency components of the HRTF (head related transfer function) coefficients are excluded and the binaural decoding process in the high frequency regions is simplified. From the experimental results, it is confirmed that...

We propose a new conndence score for decoding and veriication. Since the traditional log likelihood ratio (LLR) is borrowed from speaker veriication technique, it may not be apropriate for decoding because we do not have a good modelling and deenition of LLR for decoding/utterance veriication. We have proposed a new formulation of LLR that can be used for decoding and veriication task. Experime...

We propose a novel decoding approach for neural machine translation (NMT) based on continuous optimisation. We reformulate decoding, a discrete optimization problem, into a continuous problem, such that optimization can make use of efficient gradient-based techniques. Our powerful decoding framework allows for more accurate decoding for standard neural machine translation models, as well as ena...

We propose a new decoding algorithm of LDPC codes over the binary erasure channel (BEC). The proposed decoding algorithm is an iterative one which uses the sparseness structure of the parity-check matrix of LDPC codes. We show by simulation results that the proposed decoding algorithm and the conventional decoding algorithm have a trade-off between remaining erasure rate and complexity. Keyword...