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: A novel relaxed check node processing scheme is proposed for the min-max NB-LDPC decoding algorithm and the complexity of the check nodes processing can be substantially reduced using the proposed scheme.
Abstract: Compared to binary low-density parity-check (LDPC) codes, nonbinary (NB) LDPC codes can achieve higher coding gain when the codeword length is moderate, but at the cost of higher decoding complexity. One major bottleneck of NB-LDPC decoding is the complicated check node processing. In this paper, a novel relaxed check node processing scheme is proposed for the min-max NB-LDPC decoding algorithm. Each finite field element of GF(2p) can be uniquely represented by a linear combination of p independent field elements. Making use of this property, an innovative method is developed in this paper to first find a set of the p most reliable variable-to-check messages with independent field elements, called the minimum basis. Then, the check-to-variable messages are efficiently computed from the minimum basis. With very small performance loss, the complexity of the check node processing can be substantially reduced using the proposed scheme. In addition, efficient VLSI architectures are developed to implement the proposed check node processing and the overall NB-LDPC decoder. Compared to the most efficient prior design, the proposed decoder for a (837, 726) NB-LDPC code over GF(25) can achieve 52% higher efficiency in terms of throughput-over-area ratio.
40 citations
TL;DR: An adaptive version of the suboptimal soft output decoding algorithm of Picart and Pyndiah (1996) is developed, which provides a gain of approximately 0.24 dB at a bit error rate (BER) of 10/sup -5/ after four iterations and about 0.43 dB after ten iterations over the algorithm ofPicart et al.
Abstract: This paper develops an approach to iterative multistage decoding of multilevel codes. This involves passing reliability information to previous and subsequent decoders instead of only hard decisions to subsequent decoders. The paper also develops an adaptive version of the suboptimal soft output decoding algorithm of Picart and Pyndiah (1996). This adaptive algorithm provides a gain of approximately 0.24 dB at a bit error rate (BER) of 10/sup -5/ after four iterations and approximately 0.43 dB after ten iterations over the algorithm of Picart et al. If the adaptive algorithm is used in conjunction with iterative multistage decoding then a gain of approximately 0.62 dB is obtained at a BER of 10/sup -5/ after four iterations and approximately 0.9 dB after ten iterations over the algorithm of Picart et al.
40 citations
TL;DR: A new probabilistic decoding algorithm for low-rate interleaved Reed–Solomon (IRS) codes is presented, which increases the error correcting capability of IRS codes compared to other known approaches with high probability.
Abstract: A new probabilistic decoding algorithm for low-rate interleaved Reed---Solomon (IRS) codes is presented. This approach increases the error correcting capability of IRS codes compared to other known approaches (e.g. joint decoding) with high probability. It is a generalization of well-known decoding approaches and its complexity is quadratic with the length of the code. Asymptotic parameters of the new approach are calculated and simulation results are shown to illustrate its performance. Moreover, an upper bound on the failure probability is derived.
40 citations
31 Oct 2005
TL;DR: This work shows that network codes can be constructed for cyclic networks as long as at least one edge in each cycle has a delay, but it is not required that every edge would have a delay.
Abstract: In this work we address the problem of network codes for cyclic networks. We show that network codes can be constructed for cyclic networks as long as at least one edge in each cycle has a delay, but it is not required that every edge would have a delay. We then present the algorithm for constructing an optimal multicast network code, developed in our previous work, and analyze its computational complexity, showing that it is polynomial in the graph size. We discuss the properties of the resulting codes, and show the ability to modify the code in a localized manner when sinks are added or removed. This property is also applicable to acyclic networks. Finally, we propose the sequential decoding algorithm we developed in an earlier work for decoding the resulting codes. For this we analyze its decoding delay, for both acyclic and cyclic networks
40 citations
31 Oct 2005
TL;DR: It is shown for a large class of LDPC ensembles, including RA and IRA codes, that the bit iterative decoding threshold is essentially identical to the block iterative decode threshold.
Abstract: We show for a large class of LDPC ensembles, including RA and IRA codes, that the bit iterative decoding threshold is essentially identical to the block iterative decoding threshold
40 citations