List decoding

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

A hybrid decoding scheme for short non-binary LDPC codes

Abstract: In this paper, an iterative soft-decision hybrid decoding algorithm for non-binary low-density parity-check (LDPC) codes with short codeword lengths is proposed. The rationale of the approach is to combine the classical belief propagation (BP) iterative LDPC decoding algorithm with the most reliable basis (MRB) decoding algorithm. This allows to achieve significant performance improvements, with a complexity that, for medium/low error rates, is only slightly higher than that of the BP algorithm alone. The performance improvement with respect to pure BP decoding is up to 0.7 dB at codeword error rate (CER) ≈ 10 -5 . Notably, for a fixed MRB order, hybrid decoding achieves a gain up to 0.5 dB at CER ≈ 10 -5 with respect to BP decoding and MRB decoding used alone.

LDPC Decoding Scheduling for Faster Convergence and Lower Error Floor

Abstract: This paper presents a maximum mutual information increase (M 2 I 2 )-based algorithm that can be used to arrange low-density parity-check (LDPC) decoding schedules for faster convergence, where the increase is used to guide the arrangement of the fixed decoding schedule. The predicted mutual information for the messages to be updated is used in the calculation of the increase. By looking ahead for several decoding stages, a high-order prediction can be realized, which can then be used to devise a schedule with an even faster convergence. For a single received frame, different decoding results can be obtained using different schedules, and, hence, schedule diversity, that lowers the error floor resultant from the dominant trapping sets, is proposed. By adopting the M 2 I 2 -based schedule together with the schedule diversity, both the convergence speed in the waterfall region and the error-rate in the floor region can be improved.

Fast factorization architecture in soft-decision Reed-Solomon decoding

Abstract: Reed-Solomon (RS) codes are among the most widely utilized block error-correcting codes in modern communication and computer systems. Compared to its hard-decision counterpart, soft-decision decoding offers considerably higher error-correcting capability. The recent development of soft-decision RS decoding algorithms makes their hardware implementations feasible. Among these algorithms, the Koetter-Vardy (KV) algorithm can achieve substantial coding gain for high-rate RS codes, while maintaining a polynomial complexity with respect to the code length. In the KV algorithm, the factorization step can consume a major part of the decoding latency. A novel architecture based on root-order prediction is proposed in this paper to speed up the factorization step. As a result, the time-consuming exhaustive-search-based root computation in each iteration level, except the first one, of the factorization step is circumvented with more than 99% probability. Using the proposed architecture, a speedup of 141% can be achieved over prior efforts for a (255, 239) RS code, while the area consumption is reduced to 31.4%.

Image decoding device, image coding device, image decoding method, image coding method, and program

Abstract: An image decoding device is provided which is capable of decoding views coded using inter-view prediction even when decoding is not instantly completed. The image decoding device includes: a decoding processing unit (100) which decodes a second view coded with reference to a first view; and a buffer memory (900) provided upstream of the decoding processing unit (100), and when the first view and the second view are assigned with an identical decoding point in time, the decoding processing unit (100) decodes a picture of the second view at a point in time determined by adding a delay time which has a length required to complete decoding of a picture of the first view, to the decoding point in time assigned to the picture of the second view.

Performance of sphere decoding of block codes

Abstract: A sphere decoder searches for the closest lattice point within a certain search radius. The search radius provides a tradeoff between performance and complexity. We focus on analyzing the performance of sphere decoding of linear block codes. We analyze the performance of soft-decision sphere decoding on AWGN channels and a variety of modulation schemes. A hard-decision sphere decoder is a bounded distance decoder with the corresponding decoding radius. We analyze the performance of hard-decision sphere decoding on binary and q-ary symmetric channels. An upper bound on the performance of maximum-likelihood decoding of linear codes defined over Fq (e.g. Reed- Solomon codes) and transmitted over q-ary symmetric channels is derived and used in the analysis.We then discuss sphere decoding of general block codes or lattices with arbitrary modulation schemes. The tradeoff between the performance and complexity of a sphere decoder is then discussed.