Topic
Sequential decoding
About: Sequential decoding is a research topic. Over the lifetime, 8667 publications have been published within this topic receiving 204271 citations.
Papers published on a yearly basis
Papers
More filters
•
30 Mar 2012TL;DR: In this article, an entropy decoding method was proposed for decoding a bin of a syntax element, and a step of acquiring information on the syntax element based on the decoded bin.
Abstract: The present invention relates to an entropy decoding method and to a decoding apparatus using same. The entropy decoding method according to the present invention comprises: a step of decoding a bin of a syntax element; and a step of acquiring information on the syntax element based on the decoded bin. In the step of decoding the bin, context-based decoding or bypass decoding is performed for each bin of the syntax element.
36 citations
•
36 citations
••
TL;DR: A formulation of the ADMM decoding algorithm with modified computation scheduling is proposed that increases the error correction performance of the decoding algorithm and reduces the average computation complexity of the decode process thanks to a faster convergence.
Abstract: The alternate direction method of multipliers (ADMM) approach has been recently considered for LDPC decoding. It has been approved to enhance the error rate performance compared with conventional message passing (MP) techniques in both the waterfall and error floor regions at the cost of a higher computation complexity. In this letter, a formulation of the ADMM decoding algorithm with modified computation scheduling is proposed. It increases the error correction performance of the decoding algorithm and reduces the average computation complexity of the decoding process thanks to a faster convergence. Simulation results show that this modified scheduling speeds up the decoding procedure with regards to the ADMM initial formulation while enhancing the error correction performance. This decoding speed-up is further improved when the proposed scheduling is teamed with a recent complexity reduction method detailed in Wei et al. IEEE Commun. Lett. , 2015.
36 citations
••
10 Jul 2016TL;DR: This paper shows that in the conventional formulation of SCL, there are redundant calculations which do not need to be performed in the course of the algorithm, and simplifies SCL by removing these redundant calculations and proves that the proposed simplified SCL and the conventional SCL algorithms are equivalent.
Abstract: The Successive-Cancellation List (SCL) decoding algorithm is one of the most promising approaches towards practical polar code decoding. It is able to provide a good trade-off between error-correction performance and complexity, tunable through the size of the list. In this paper, we show that in the conventional formulation of SCL, there are redundant calculations which do not need to be performed in the course of the algorithm. We simplify SCL by removing these redundant calculations and prove that the proposed simplified SCL and the conventional SCL algorithms are equivalent. The simplified SCL algorithm is valid for any code and can reduce the time-complexity of SCL without affecting the space complexity.
36 citations
01 Jan 1994
TL;DR: Improved lower bounds for linear and for nonlinear codes for list decoding are derived and coqjecture shows that the two bounds are identical.
Abstract: Elias (6) derived upper and lower bounds on the sizes of error-correcting codes for list decoding. The asymptotic values of his lower bounds for linear codes and for nonlinear codes are separated. We derive improved lower bounds for linear and for nonlinear codes. We coqjecture our two bounds are identical. However, we were able to verify this only for small lists.
35 citations