scispace - formally typeset
Search or ask a question
Topic

List decoding

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


Papers
More filters
Patent
Nam Yul Yu1, Kim Min-Goo1, Choi Soon-Jae1, Beong-Jo Kim1, Young-Hwan Lee1 
24 Dec 2001
TL;DR: In this paper, a turbo decoder sequentially outputs absolute LLR values associated with the respective information bits of the received frame, and stops the iterative decoding in response to a stop command.
Abstract: Disclosed is an apparatus for stopping iterative decoding in a turbo decoder performing iterative decoding on a received frame comprised of information bits and then outputting the iteratively decoded results. A turbo decoder sequentially outputs absolute LLR (Log Likelihood Ratio) values associated with the respective information bits of the received frame by the iterative decoding, and stops the iterative decoding in response to a stop command for the iterative decoding. A minimum LLR detector selects a minimum value M(i) among the sequentially output absolute LLR values. A controller issues a command to stop the iterative decoding, if the minimum value M(i) is larger than a first threshold determined based on a minimum value Fmin among absolute LLR values output through previous iterative decoding.

29 citations

Proceedings ArticleDOI
09 Jul 2006
TL;DR: An efficient approach is introduced for reliability-based list decoding of a linear block code if a local optimal candidate satisfies a probabilistic sufficient condition and the average computation complexity is greatly reduced.
Abstract: In this work, an efficient approach is introduced for reliability-based list decoding of a linear block code. This method terminates the decoding if a local optimal candidate satisfies a probabilistic sufficient condition. The average computation complexity is greatly reduced with this method. The false alarm probability associated with the use of the probabilistic sufficient condition is also derived. Simulation results confirm the analysis with no performance degradation and important computation savings on average for soft decision decoding of the (255,239) RS code (reduction by a factor between 2 and 20).

29 citations

Book ChapterDOI
09 Dec 2001
TL;DR: In this article, the authors show that the ability to trace with the IPP algorithm implies the ability of tracing with the TA algorithm when using an algebraic structure, and they also construct schemes with an algorithm that finds all possible traitor coalitions faster than the TA tracing algorithm.
Abstract: We use powerful new techniques for list decoding errorcorrecting codes to efficiently trace traitors. Although much work has focusedon constructing traceability schemes, the complexity of the tracing algorithm has receivedlittle attention. Because the TA tracing algorithm has a runtime of O(N) in general, where N is the number of users, it is inefficient for large populations.We produce schemes for which the TA algorithm is very fast. The IPP tracing algorithm, though less efficient, can list all coalitions capable of constructing a given pirate. We give evidence that when using an algebraic structure, the ability to trace with the IPP algorithm implies the ability to trace with the TA algorithm. We also construct schemes with an algorithm that finds all possible traitor coalitions faster than the IPP algorithm. Finally, we suggest uses for other decoding techniques in the presence of additional information about traitor behavior.

29 citations

Proceedings ArticleDOI
01 Dec 2003
TL;DR: The BER estimates of the finite-length turbo codes are obtained in the form of a lower bound, which shows a gentle waterfall over a wide waterfall region and is in reasonable agreement with the BER obtained by simulations of the iterative decoding algorithm.
Abstract: We propose a tool for the analysis of the finite-length iterative turbo decoding algorithm. The proposed tool is a generalized EXIT (extrinsic information transfer) chart based on the mutual information transfer characteristics of the extrinsic information in the iterative turbo decoding algorithm. The proposed tool can describe the probabilistic convergence behavior of the iterative decoding algorithm. By using this tool, we obtain the BER estimates of the finite-length turbo codes in the form of a lower bound, which shows a gentle waterfall over a wide waterfall region. The obtained lower bound is in reasonable agreement with the BER obtained by simulations of the iterative decoding algorithm.

29 citations

Proceedings ArticleDOI
28 Mar 2000
TL;DR: A simple parallel algorithm for decoding a Huffman encoded file is presented, exploiting the tendency of Huffman codes to resynchronize quickly in most cases.
Abstract: A simple parallel algorithm for decoding a Huffman encoded file is presented, exploiting the tendency of Huffman codes to resynchronize quickly in most cases. An extention to JPEG decoding is mentioned.

29 citations


Network Information
Related Topics (5)
Base station
85.8K papers, 1M citations
89% related
Fading
55.4K papers, 1M citations
89% related
Wireless network
122.5K papers, 2.1M citations
87% related
Network packet
159.7K papers, 2.2M citations
87% related
Wireless
133.4K papers, 1.9M citations
86% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202384
2022153
202179
202078
201982
201894