Sequential decoding

About: Sequential decoding is a research topic. Over the lifetime, 8667 publications have been published within this topic receiving 204271 citations.

Reducing average number of turbo decoding iterations

Abstract: The average number of decoding iterations in a turbo decoder is reduced by incorporating CRC error detection into the decoding iteration process. Turbo decoding iterations are stopped when CRC decoding determines that there is no error in the decoded data sequence. Computer simulations assuming a turbo-coded W-CDMA mobile radio reverse link under frequency selective Rayleigh fading demonstrate that when the maximum number of iterations is 8, the average number of decoding iterations can be reduced to 1/4 at BER=10/sup -6/.

Apparatus and method for receiving signal in a communication system using a low density parity check code

Abstract: An apparatus and a method for receiving a signal in a communication system using a Low Density Parity Check (LDPC) code. The apparatus and the method includes decoding a received signal according to a hybrid decoding scheme, wherein the hybrid decoding scheme is generated by combining two of a first decoding scheme, a second decoding scheme, and a third decoding scheme.

Optimal and efficient decoding of concatenated quantum block codes

Abstract: We consider the problem of optimally decoding a quantum error correction code—that is, to find the optimal recovery procedure given the outcomes of partial "check" measurements on the system. In general, this problem is NP hard. However, we demonstrate that for concatenated block codes, the optimal decoding can be efficiently computed using a message-passing algorithm. We compare the performance of the message-passing algorithm to that of the widespread blockwise hard decoding technique. Our Monte Carlo results using the five-qubit and Steane's code on a depolarizing channel demonstrate significant advantages of the message-passing algorithms in two respects: (i) Optimal decoding increases by as much as 94% the error threshold below which the error correction procedure can be used to reliably send information over a noisy channel; and (ii) for noise levels below these thresholds, the probability of error after optimal decoding is suppressed at a significantly higher rate, leading to a substantial reduction of the error correction overhead.

Iterative algebraic soft-decision list decoding of Reed-Solomon codes

Abstract: In this paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon (RS) codes offering both complexity and performance advantages over previously known decoding algorithms. Our algorithm is a list decoding algorithm which combines two powerful soft-decision decoding techniques which were previously regarded in the literature as competitive, namely, the Koetter-Vardy algebraic soft-decision decoding algorithm and belief-propagation based on adaptive parity-check matrices, recently proposed by Jiang and Narayanan. Building on the Jiang-Narayanan algorithm, we present a belief-propagation-based algorithm with a significant reduction in computational complexity. We introduce the concept of using a belief-propagation-based decoder to enhance the soft-input information prior to decoding with an algebraic soft-decision decoder. Our algorithm can also be viewed as an interpolation multiplicity assignment scheme for algebraic soft-decision decoding of RS codes.

Generalized Multiple-Mode OFDM With Index Modulation

Abstract: Multiple-mode orthogonal frequency division multiplexing with index modulation (MM-OFDM-IM), which transmits an OFDM signal with information bits embedded onto multiple distinguishable signal constellations of the same cardinality and their permutations, is a recently proposed IM technique in the frequency domain. It is capable of achieving higher spectral efficiency and better error performance than classical OFDM and existing frequency-domain IM schemes. In this paper, we propose the scheme of generalized (G-) MM-OFDM-IM, which allows a different subcarrier to utilize a signal constellation of a different size while conveying the same number of IM bits. Considering phase shift keying constellations, we present design guidelines for GMM-OFDM-IM to achieve an optimal error performance in the asymptotically high signal-to-noise ratio region. A computationally efficient and near-optimal detector based on the idea of sequential decoding is also tailored to GMM-OFDM-IM, which avoids the detection of an illegitimate constellation permutation. Monte Carlo simulations are conducted to validate the inherent properties and advantages of GMM-OFDM-IM.