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
Proceedings ArticleDOI
18 Oct 1998
TL;DR: In this article, the performance of the turbo code is sensitive to its code structure, which is made up of code rate, constraint length, tap connection, block size, interleaving pattern and number of decoding iterations.
Abstract: The performance of the turbo code is sensitive to its code structure, which is made up of code rate, constraint length, tap connection, block size, interleaving pattern and number of decoding iterations. In this paper, mitigation techniques that can lower the error floor are adopted in both encoder and decoder. Optimum tap connections are listed for codes with constraint lengths 3, 4, and 5. Performance variations achieved by changing different parameters are investigated. Simulation results show that (1) using 10 decoding iterations is adequate; (2) the S-random interleaving provides the best performance among the interleavers investigated; (3) using codes with constraint lengths greater than 3 does not buy any additional coding gain for short block size (in the vicinity of 100); (4) for block size greater than 500, no significant improvement is noticed by increasing the constraint length from 4 to 5 in the range of bit error rate (BER) <10/sup -6/; and (5) the punctured rate 1/2 code structure degrades the performance by only 0.5 to 0.7 dB in comparison with the classic rate 1/3 turbo code for constraint lengths 3, 4, and 5.

39 citations

Proceedings ArticleDOI
Chung-Hyo Kim, In-Cheol Park1
21 May 2006
TL;DR: A CABAC decoder based on the proposed prediction scheme improves the decoding performance by 24% compared to conventional decoders.
Abstract: Context-based adaptive binary arithmetic coding (CABAC) is the major entropy-coding algorithm employed in H.264/AVC. Although the performance gain of H.264/AVC is mostly resulted from CABAC, it is difficult to achieve a fast decoder because the decoding algorithm is basically sequential. In this paper, a prediction scheme is proposed to enhance overall decoding performance by decoding two binary symbols at a time. A CABAC decoder based on the proposed prediction scheme improves the decoding performance by 24% compared to conventional decoders.

39 citations

Proceedings ArticleDOI
01 Jul 2017
TL;DR: This work proposes a practical error correction construction for PUF-based secret generation that are based on polar codes, and proposes an adaptive list decoder for polar codes that makes use of the hash that is already available at the decoder.
Abstract: Physical unclonable functions (PUFs) are relatively new security primitives used for device authentication and device-specific secret key generation. In this paper we focus on SRAM- PUFs. The SRAM-PUFs enjoy uniqueness and randomness properties stemming from the intrinsic randomness of SRAM memory cells, which is a result of manufacturing variations. This randomness can be translated into the cryptographic keys thus avoiding the need to store and manage the device cryptographic keys. Therefore these properties, combined with the fact that SRAM memory can be often found in today's IoT devices, make SRAM-PUFs a promising candidate for securing and authentication of the resource-constrained IoT devices. PUF observations are always affected by noise and environmental changes. Therefore secret- generation schemes with helper data are used to guarantee reliable regeneration of the PUF-based secret keys. Error correction codes (ECCs) are an essential part of these schemes. In this work, we propose a practical error correction construction for PUF-based secret generation that are based on polar codes. The resulting scheme can generate 128-bit keys using 1024 SRAM-PUF bits and 896 helper data bits and achieve a failure probability of 10^{-9} or lower for a practical SRAM-PUFs setting with bit error probability of 15%. The method is based on successive cancellation combined with list decoding and hash-based checking that makes use of the hash that is already available at the decoder. In addition, an adaptive list decoder for polar codes is investigated. This decoder increases the list size only if needed.

39 citations

Proceedings ArticleDOI
24 Jun 2007
TL;DR: A refined version of the Singleton bound for network error correction is presented, and an algorithm for constructing network codes that achieve this bound is proposed.
Abstract: In this paper, we present a refined version of the Singleton bound for network error correction, and propose an algorithm for constructing network codes that achieve this bound.

39 citations

Proceedings ArticleDOI
20 Jun 2004
TL;DR: An algorithmic transformation for reducing the iterations required in generating the interpolation polynomial and present efficient architectures by sharing computations for interpolation and factorization of Reed-Solomon codes.
Abstract: We present the architectures for bivariate polynomial interpolation and factorization; the two main steps in algebraic soft-decision decoding of Reed-Solomon codes. We present an efficient formulation of the interpolation algorithm in which dependencies among the discrepancy coefficient computations are utilized to reduce interpolation complexity. Interpolation and factorization complexity is also reduced by using an FFT-like formulation for univariate polynomial translation. The modifications required to incorporate the recently proposed algorithm level modifications for efficient interpolation and factorization are also presented. We determine the latency and hardware requirements for soft-decoding a [255,239] Reed-Solomon code using the proposed architectures.

39 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