List decoding

About: List decoding is a research topic. Over the lifetime, 7251 publications have been published within this topic receiving 151182 citations.

Convergence of non-binary iterative decoding

Abstract: Mutual information transfer characteristics have been proposed by ten Brink (see IEE Electron. Lett., vol.35, no.10, p.806-9, 1999) as a quasi-analytical tool for the performance analysis of iterative decoding of concatenated codes. Given the individual transfer characteristics of the component codes in a concatenated coding system (obtained by simulation), the convergence region and average decoding trajectory of the concatenated system may be accurately predicted. In this paper, we extend the techniques of ten Brink to non-binary codes. In addition to providing a useful tool for the analysis of non-binary codes, our extension reveals several subtle points concerning the motivation and interpretation of the technique for binary codes. We propose a method for practical implementation of our extension, and apply the technique to the evaluation or non-binary turbo codes and space-time turbo codes.

M-ary phase coding for the noncoherent AWGN channel

Abstract: This work considers coded M-ary phase-shift keying (MPSK) schemes with noncoherent detection. A class of block codes called module-phase codes is described. The algebraic framework used for describing these codes relies on elements from module theory which are discussed along with a method for constructing such codes for noncoherent detection. It is shown that differential encoding may be viewed as a specific code from a particular class of module-phase codes. Two classes of codes that achieve significant coding gain with respect to coherent detection of uncoded MPSK are presented. In the first class of module-phase codes, the coding gain is achieved at the expense of bandwidth expansion. In the second class, however, the coding gain is achieved at the expense of signal constellation expansion without expanding bandwidth. Finally, an integrated demodulation/decoding technique based on a modification of information set decoding is presented. It Is shown that this reduced-complexity, suboptimal decoding strategy performs nearly as well as maximum-likelihood decoding. >

BASIC Codes: Low-Complexity Regenerating Codes for Distributed Storage Systems

Abstract: In distributed storage systems, regenerating codes can achieve the optimal tradeoff between storage capacity and repair bandwidth. However, a critical drawback of existing regenerating codes, in general, is the high coding and repair complexity, since the coding and repair processes involve expensive multiplication operations in finite field. In this paper, we present a design framework of regenerating codes, which employ binary addition and bitwise cyclic shift as the elemental operations, named BASIC regenerating codes. The proposed BASIC regenerating codes can be regarded as a concatenated code with the outer code being a binary parity-check code, and the inner code being a regenerating code utilizing the binary parity-check code as the alphabet. We show that the proposed functional-repair BASIC regenerating codes can achieve the fundamental tradeoff curve between the storage and repair bandwidth asymptotically of functional-repair regenerating codes with less computational complexity. Furthermore, we demonstrate that the existing exact-repair product-matrix construction of regenerating codes can be modified to exact-repair BASIC product-matrix regenerating codes with much less encoding, repair, and decoding complexity from the theoretical analysis, and with less encoding time, repair time, and decoding time from the implementation results.

Area efficient parallel turbo decoding

Abstract: Turbo decoders may have large decoding latency and low throughput due to iterative decoding. One way to increase the throughput and reduce the latency of turbo decoders is to use high speed decoding schemes. In particular, area-efficient parallel decoding schemes may be used to overcome the decoding latency and throughput associated with turbo decoders. In addition, hybrid parallel decoding schemes may be used in high-level parallelism implementations. Moreover, the area-efficient parallel decoding schemes introduce little or no performance degradation.

Two-dimensional code having superior decoding property which is possible to control the level of error correcting codes, and method for encoding and decoding the same

Abstract: Two-dimensional Code having superior decoding property which is possible to control the level of error correcting codes, and method for encoding and decoding the two-dimensional Code is provided. The two-dimensional code includes finding pattern area comprised finding patterns for discriminating the code area from whole image, timing pattern area comprised timing patterns for checking a position of data area from the whole code and positions of each cells of the data area, and data area inputted various kinds of data and decoding information of data itself.