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: The use of majority logic decoding as a pseudonoise code acquisition technique is considered and it is shown that the probability of acquiring an 8191 code in one attempt can be made nearly one at -10-dB SNR.
Abstract: This paper considers the use of majority logic decoding as a pseudonoise code acquisition technique A bound on the probability of code acquisition is derived and it is shown that the probability of acquiring an 8191 code in one attempt can be made nearly one at -10-dB SNR
51 citations
TL;DR: It is shown how good low-rate convolutional codes can readily be constructed from higher-rate codes that are known to exhibit good performance.
Abstract: Low-rate convolutional codes are useful as an interference mitigation technique in frequency-hopped spread-spectrum systems. In this paper we show how good low-rate convolutional codes can readily be constructed from higher-rate codes that are known to exhibit good performance. The performance of low-rate convolutional codes is established theoretically and through the use of computer simulation and hardware experimentation. Typical performance curves are shown for convolutional codes with rates between 1/64 and 1/2, both in additive white Gaussian noise and in burst interference. The impact of code rate, constraint length, burst length, interleaving and modulation on total system performance are discussed.
51 citations
28 Oct 2010
TL;DR: A method to improve the finite-length performance of polar codes together with successive cancellation (SC) decoding by means of simple and short inner block codes is presented.
Abstract: Polar coding is a recently introduced capacity-achieving code constructing method for binary-input discrete memoryless channels. We present a method to improve the finite-length performance of polar codes together with successive cancellation (SC) decoding by means of simple and short inner block codes. Example simulations show an improvement of about 0.3 dB.
51 citations
16 Aug 1998
TL;DR: This work considers a generalized version of low-density parity-check codes, where the decoding procedure can be based on the decoding of Hamming component codes, and shows that a performance close to the Shannon capacity limit can be achieved.
Abstract: A generalization of Gallager's low-density parity-check codes is introduced, where as component codes single-error correcting Hamming codes are used instead of single-error detecting parity-check codes. Low-density (LD) parity-check codes were first introduced by Gallager in 1963. These codes are, in combination with iterative decoding, very promising for achieving low error probabilities at a reasonable cost. Results of computer simulations for long LD codes show, that a performance close to the Shannon capacity limit can be achieved. In this work, we consider a generalized version of low-density parity-check codes, where the decoding procedure can be based on the decoding of Hamming component codes.
51 citations
TL;DR: The proposed error-control systems achieve good tradeoffs between error-performance and complexity as compared to the traditional schemes and is also very favorable for implementation.
Abstract: In this work, we consider high-rate error-control systems for storage devices using multi-level per cell (MLC) NAND flash memories. Aiming at achieving a strong error-correcting capability, we propose error-control systems using block-wise parallel/serial concatenations of short Bose-Chaudhuri-Hocquenghem (BCH) codes with two iterative decoding strategies, namely, iterative hard-decision decoding (IHDD) and iterative reliability based decoding (IRBD). It will be shown that a simple but very efficient IRBD is possible by taking advantage of a unique feature of the block-wise concatenation. For tractable performance analysis and design of IHDD and IRBD at very low error rates, we derive semi-analytic approaches. The proposed error-control systems are compared with various error-control systems with well-known coding schemes such as a product code, multiple BCH codes, a single long BCH code, and low-density parity-check codes in terms of page error rates, which confirms our claim: the proposed error-control systems achieve good tradeoffs between error-performance and complexity as compared to the traditional schemes and is also very favorable for implementation.
51 citations