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
TL;DR: An exhaustive treatment of various coding and decoding techniques for use in fast frequency-hopping/multiple frequency shift keying multiple-access systems to show how reliability information on each received bit can be derived to enable soft-decision decoding.
Abstract: In this contribution we present an exhaustive treatment of various coding and decoding techniques for use in fast frequency-hopping/multiple frequency shift keying multiple-access systems. One of the main goals is to show how reliability information on each received bit can be derived to enable soft-decision decoding. Convolutional codes as well as turbo codes are considered applying soft-decision, erasure, and hard-decision decoding. Their performance is compared to that of previously proposed Reed-Solomon with either errors-only or errors-and-erasures decoding. A mobile radio environment yielding a frequency-selective fading channel is assumed. It is shown that the application of turbo codes and convolutional codes with soft decision decoding can allow for a comparable number of simultaneously transmitting users to Reed-Solomon codes with errors-and-erasures decoding. Furthermore, the advantage of soft decisions is shown, which can be applied to a widely and growing range of channel codes. The pertinent technique of calculating soft decisions is described in the paper.
35 citations
01 Sep 2014
TL;DR: Numerical results show that both BCH-polar codes and Convolutional- polar codes can outperform stand-alone polar codes for some lengths and choice of decoding algorithms used to decode the outer codes.
Abstract: We analyze concatenation schemes of polar codes with outer binary BCH codes and convolutional codes. We show that both BCH-polar and Convolutional-polar (Conv-polar) codes can have frame error rate that decays exponentially with the frame length, which is a substantial improvement over standalone polar codes. With the increase in the cutoff rate of the channel after polarization, long constraint-length convolutional codes with sequential decoding suffice to achieve a frame error rate that decays exponentially with the frame length, whereas the average decoding complexity is low. Numerical results show that both BCH-polar codes and Conv-polar codes can outperform stand-alone polar codes for some lengths and choice of decoding algorithms used to decode the outer codes. For the additive white Gaussian noise channel, Conv-polar codes substantially outperform concatenated Reed Solomon-polar codes with a careful choice of the lengths of inner and outer codes.
35 citations
TL;DR: An efficient VLSI architecture for H.264/AVC content-adaptive binary arithmetic code (CABAC) decoding is presented and several new techniques to maximize the parallelism of the decoding process are introduced, including variable-bin-rate strategy, multiple-bin arithmetic decoding, and efficient probability propagation scheme.
Abstract: This paper presents an efficient VLSI architecture for H.264/AVC content-adaptive binary arithmetic code (CABAC) decoding. We introduce several new techniques to maximize the parallelism of the decoding process, including variable-bin-rate strategy, multiple-bin arithmetic decoding, and efficient probability propagation scheme. The CABAC engine can ensure the real-time decoding for H.264/AVC main profile HD level 4.0. Synthesis results show that the multi-bin decoder can be operated up to 45 MHz, and the total logic area is only 42 K gates when targeted at TSMC's 0.18-mum process.
35 citations
TL;DR: In this paper, the output produced by steps of belief propagation (BP) is successively applied to a legacy decoding algorithm for iterative decoding of Reed-Solomon (RS) codes.
Abstract: In this paper, we present a practical approach to the iterative decoding of Reed-Solomon (RS) codes. The presented methodology utilizes an architecture in which the output produced by steps of belief-propagation (BP) is successively applied to a legacy decoding algorithm. Due to the suboptimal performance of BP conducted on the inherently dense RS parity-check matrix, a method is first provided for the construction of reduced-density, binary, parity-check equations. Iterative decoding is then conducted utilizing a subset of a redundant set of parity-check equations to minimize the number of connections into the least-reliable bits. Simulation results show that performance comparable to (and exceeding) the best known practical RS decoding techniques is achievable with the presented methodology. The complexity of the proposed algorithm is significantly lower than these existing procedures and permits a practical implementation in hardware.
35 citations
Patent•
07 Dec 2000
TL;DR: In this article, a plurality of turbo code signals or SCCC blocks interfering with one another is implemented in parallel so that iterative decoding is performed making use of the decoded data and likelihood information obtained as the transitive decoding result of turbo codes or sCCC, to decode other blocks.
Abstract: Since iterative decoding of turbo codes or SCCC outputs provisional decoded result and likelihood information in the course of the decoding process, effective use of this makes it possible to implement interference cancellation without marked increase in the amount of operations for decoding. For this purpose, decoding of a plurality of turbo code signals or SCCC blocks interfering with one another is implemented in parallel so that iterative decoding is performed making use of the decoded data and likelihood information obtained as the transitive decoding result of turbo codes or SCCC, to decode other blocks.
35 citations