Sequential decoding

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

A complexity reducing transformation in algebraic list decoding of Reed-Solomon codes

Abstract: The main computational steps in algebraic soft decoding, as well as Sudan-type list decoding, of Reed-Solomon codes are interpolation and factorization. A series of transformations is given for the interpolation problem that arises in these decoding algorithms. These transformations reduce the space and time complexity to a small fraction of the complexity of the original interpolation problem. A factorization procedure that applies directly to the reduced interpolation problem is also presented.

Decoding low density parity check codes with finite quantization bits

Abstract: This letter is concerned with the implementation issue of the sum-product algorithm (SPA) for decoding the low density parity check codes. It is shown that the direct implementation of the original form of SPA is sensitive to the quantization effect. We propose a parity likelihood ratio technique to overcome the problem. It is shown that for comparable performance the new method can be implemented with much less quantization bits, which can lead to considerably lower decoding cost.

Coding for Satellite Communication

Abstract: This paper discusses a number of coding techniques for future satellite communication; they include Reed-Solomon error decoding for message blocks, probabilistic decoding techniques for punctured convolutional codes, and planar Euclidean geometry difference set codes for random multiple access applications. The provision of code concatenation, helical interleaving, and simulation results of new punctured convolutional codes are included. A number of coded satellite systems that demonstrate the usefulness of coding in satellite communications are described.

Receiving device and decoding method thereof

Abstract: A receiving device in a communication system that separates one frame of information bits into plural blocks, performs turbo encoding of the information bits of each block and transmits the result, and decodes the encoded information bits, where the receiving device includes plural decoders number of which is less than the number of blocks per frame. Each decoder performs a decoding process on encoded information bits of each block that have been expressed by likelihood, when a condition for stopping decoding is met, executes the decoding process of encoded information bits of another block for which decoding has not yet been performed. When the condition for stopping decoding has been met for all block before the number of times decoding has been performed for each decoder reaches a preset maximum number of repetitions, the decoding results of all the blocks are serially combined, an error detection process is executed, and when no error is detected, the decoding results are output.

Further results on high-rate punctured convolutional codes for Viterbi and sequential decoding

Abstract: The weight spectra of high-rate lpunctured convolutional codes are evaluated under the hypothesis of a low-rate structure. This interpretation yields results slightly different from those obtained when weight spectra are evaluated assuming a true high-rate structure for punctured codes. The search for long memory punctured codes is extended by providing new punctured codes of rates 4/5, 5/6, 6/7, and 7/8 with memories ranging from 9 to 19. >