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
Book•
01 May 2005
TL;DR: This paper presents a GMD Decoding of Concatenated Codes, a Unified Framework for List Decoded of Algebraic Codes, and sample applications outside Coding Theory.
Abstract: 1 Introduction.- 1 Introduction.- 2 Preliminaries and Monograph Structure.- I Combinatorial Bounds.- 3 Johnson-Type Bounds and Applications to List Decoding.- 4 Limits to List Decodability.- 5 List Decodability Vs. Rate.- II Code Constructions and Algorithms.- 6 Reed-Solomon and Algebraic-Geometric Codes.- 7 A Unified Framework for List Decoding of Algebraic Codes.- 8 List Decoding of Concatenated Codes.- 9 New, Expander-Based List Decodable Codes.- 10 List Decoding from Erasures.- III Applications.- Interlude.- III Applications.- 11 Linear-Time Codes for Unique Decoding.- 12 Sample Applications Outside Coding Theory.- 13 Concluding Remarks.- A GMD Decoding of Concatenated Codes.
34 citations
TL;DR: This paper presents a hybrid data format-based interpolation architecture that is well suited for high-speed implementation of the soft-decision decoders and can achieve significantly higher throughput than conventional designs with equivalent or lower hardware complexity.
Abstract: Algebraic soft-decision decoding of Reed-Solomon (RS) codes delivers promising coding gains over conventional hard-decision decoding. The most computationally demanding step in soft-decision decoding of RS codes is bivariate polynomial interpolation. In this paper, we present a hybrid data format-based interpolation architecture that is well suited for high-speed implementation of the soft-decision decoders. It will be shown that this architecture is highly scalable and can be extensively pipelined. It also enables maximum overlap in time for computations at adjacent iterations. It is estimated that the proposed architecture can achieve significantly higher throughput than conventional designs with equivalent or lower hardware complexity
34 citations
01 Sep 2014
TL;DR: In this article, a random linear code construction for erasure packet channel was introduced and the in-order delivery delay behavior was analyzed, and it was shown that for rates below the capacity, the mean inorder-delivery delay of the scheme is better than the mean delay introduced by the scheme which implements the random linear block coding.
Abstract: We introduce a random linear code construction for erasure packet channel. We then analyze its in-order delivery delay behavior. We show that for rates below the capacity, the mean in-order-delivery delay of our scheme is better than the mean delay introduced by the scheme which implements the random linear block coding. We also compute the decoding failure probability and encoding and decoding complexity of our scheme.
34 citations
TL;DR: This work proposes using a convolutional encoder for joint source and channel encoding, and reduces to a Convolutional source code that is simpler to encode than any other optimal noiseless source code known to date.
Abstract: In certain communications problems, such as remote telemetry, it is important that any operations performed at the transmitter be of a simple nature, while operations performed at the receiver can frequently be orders of magnitude more complex. Channel coding is well matched to such situations while conventional source coding is not. To overcome this difficulty of usual source coding, we propose using a convolutional encoder for joint source and channel encoding. When the channel is noiseless this scheme reduces to a convolutional source code that is simpler to encode than any other optimal noiseless source code known to date. In either case, decoding can be a minor variation on sequential decoding.
34 citations
TL;DR: In this article, it was shown that a sequential decoder can optimally locate the sync pattern, i.e., exactly, without delay, and with probability approaching one as N rarr infin, if the asynchronism level grows as O(eNα), with alpha below the synchronization threshold, a constant that admits a simple expression depending on the channel.
Abstract: We consider the ldquoone-shot frame synchronization problem,rdquo where a decoder wants to locate a sync pattern at the output of a memoryless channel on the basis of sequential observations. The sync pattern of length N starts being emitted at a random time within some interval of size A, where A characterizes the asynchronism level. We show that a sequential decoder can optimally locate the sync pattern, i.e., exactly, without delay, and with probability approaching one as N rarr infin, if the asynchronism level grows as O(eNalpha), with alpha below the synchronization threshold, a constant that admits a simple expression depending on the channel. If alpha exceeds the synchronization threshold, any decoder, sequential or nonsequential, locates the sync pattern with an error that tends to one as Nrarr infin. Hence, a sequential decoder can locate a sync pattern as well as the (nonsequential) maximum-likelihood decoder that operates on the basis of output sequences of maximum length A+N-1, but with far fewer observations.
34 citations