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
25 May 2003
TL;DR: A high-throughput memory-efficient decoder architecture for architecture-aware low-density parity-check (LDPC) codes is proposed based on a novel turbo-decoding algorithm that achieves savings of 89.13 % and 62.5 % in power consumption and silicon area over state-of-the-art.
Abstract: A high-throughput memory-efficient decoder architecture for architecture-aware low-density parity-check (LDPC) codes is proposed based on a novel turbo-decoding algorithm. The architecture benefits from various optimizations at the code-design, decoding algorithm, and decoder architecture levels. The interconnect complexity and memory overhead problems of current decoder implementations are reduced by designing structured or architecture-aware LDPC codes and employing a new turbo-decoding algorithm. An efficient memory architecture coupled with a scalable and dynamic transport network for storing and routing messages are proposed. Simulations demonstrate that the proposed architecture attains a throughput of 1.92 Gbits/s for a frame length of 2304 bits, and achieves savings of 89.13 % and 62.80 % in power consumption and silicon area over state-of-the-art, with a reduction of 60.5 % in interconnect wires.
47 citations
TL;DR: In this article, a particle swarm optimization (PSO) algorithm was combined with the cocktail decoding method to solve the problem of multiprocessor task-scheduling in a hybrid flow shop (HFS) problem.
47 citations
TL;DR: It is proved that on the AWGN channel, RA codes have the potential for achieving channel capacity, and as the rate of the RA code approaches zero, the average required bit Eb/N0 for arbitrarily small error probability with maximum-likelihood decoding approaches log 2, which is the Shannon limit.
Abstract: In ref. [3] we introduced a simplified ensemble of serially concatenated "turbo-like" codes which we called repeat-accumulate, or RA codes. These codes are very easy to decode using an iterative decoding algorithm derived from belief propagation on the appropriate Tanner graph, yet their performance is scarcely inferior to that of full-fledged turbo codes. In this paper, we prove that on the AWGN channel, RA codes have the potential for achieving channel capacity. That is, as the rate of the RA code approaches zero, the average required bit Eb/N0 for arbitrarily small error probability with maximum-likelihood decoding approaches log 2, which is the Shannon limit. In view of the extreme simplicity of RA codes, this result is both surprising and suggestive.
47 citations
TL;DR: A new decoding algorithm for general linear block codes that generates a direct estimate of the error locations based on exploiting the statistical information embedded in the classical syndrome decoding.
Abstract: This paper introduces a new decoding algorithm for general linear block codes. The algorithm generates a direct estimate of the error locations based on exploiting the statistical information embedded in the classical syndrome decoding. The algorithm can be used to cryptanalyze many algebraic-code public-key crypto and identification systems. In particular results show that the McEliece public-key cryptosystem with its original parameters is not secure.
47 citations
07 Aug 2002
TL;DR: A soft-in/soft-out decoder for a new class of block codes derived from multiple description scalar quantization and an iterative decoding scheme, which makes use of the correlation between descriptions in a very effective way.
Abstract: The transmission of multimedia data over best-effort packet networks has motivated a strong research effort in the area of multiple description coding. While most contributions concentrate on the design of encoders for the erasure channel, this paper considers the transmission of multiple descriptions over a typical wireless link. Assuming that channel state information is available and that the reliability of each transmitted bit is known to the receiver, we present a soft-in/soft-out decoder for a new class of block codes derived from multiple description scalar quantization. The idea of cross decoding multiple descriptions using soft information, can be successfully extended to the concatenation of multiple description codes and convolutional codes. For this case, the application of the turbo principle yields an iterative decoding scheme, which makes use of the correlation between descriptions in a very effective way.
47 citations