Near optimum decoding of product codes

Pyndiah, Ramesh; Glavieux, Alain; Picart, Annie; Jacq, Sylvie

doi:10.1109/glocom.1994.513494

Cited by 209 publications

(122 citation statements)

References 6 publications

Supporting

Mentioning

115

Contrasting

Unclassified

Order By: Relevance

“…It could, for example, be used for soft decoding of BCH codes. It is also possible to add a soft output computation stage in order to perform iterative decoding of product codes [14].…”

Section: Discussionmentioning

confidence: 99%

Stochastic Chase Decoding of Reed-Solomon Codes

et al. 2010

View full text Add to dashboard Cite

Abstract-In this letter, we propose a probabilistic approach to the generation of test patterns in the Chase Algorithm (CA) denoted as the Stochastic Chase Algorithm (SCA). We compare the performance of SCA with the regular CA for different ReedSolomon codes. Simulation results show that the probabilistic nature of the SCA helps in providing a more efficient test pattern generation. SCA avoids the use of least reliable bits selection and reduces the number of candidate codewords up to 60% for the same decoding performance.

show abstract

“…It could, for example, be used for soft decoding of BCH codes. It is also possible to add a soft output computation stage in order to perform iterative decoding of product codes [14].…”

Section: Discussionmentioning

confidence: 99%

Stochastic Chase Decoding of Reed-Solomon Codes

et al. 2010

View full text Add to dashboard Cite

show abstract

“…The first algorithm used is based on the Chase algorithm, a soft-input, hard-output algorithm, combined with a soft-output stage in [2], hence the Chase-Pyndiah algorithm.…”

Section: Algorithmmentioning

confidence: 99%

“…The Chase-Pyndiah algorithm [2] is a turbo product code decoding algorithm. The elementary decoding step requires a soft-input, soft-output decoder out of the Chase algorithm.…”

Section: A the Chase-pyndiah Algorithmmentioning

confidence: 99%

“…Berrou introduced CTCs, or Convolutional Turbo Codes. R. Pyndiah [2] introduced iterative decoding of product codes (product codes were introduced in [3]) based on the Chase algorithm, which represent the best compromise complexity-performance for BCH and RS codes with a reasonable error correction capability(1-4 for BCH, 1-2 for RS). Turbo product codes are interesting for high code rates (over 0.95) or small blocks size.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fine grain parallel decoding of turbo product codes: Algorithm and architecture

Goubier¹,

Dezan

Pottier

et al. 2008

2008 5th International Symposium on Turbo Codes and Related Topics

View full text Add to dashboard Cite

Abstract-In turbo decoding of product codes, we propose an algorithm implementation, based on the Chase-Pyndiah algorithm, which exhibits a modular, simple structure with fine grain parallelism. It is implemented into deep pipelined architectures, including an interleaving block decoding scheme, with good potential on FPGAs and MP-SoCs targets. We include an evaluation of the essential parameters of those architectures, which are situated in a different area of the block turbo decoder implementation design space 1 .

show abstract

“…A reduced complexity approach is the modified Chase decoder (Chase, 1972), also known from the decoding of block turbo codes (Pyndiah et al, 1994), as a sub-optimum softout decoding method. The Chase algorithm is a list decoding algorithm operating on a code word list.…”

Section: Block Code Soft Decodingmentioning

confidence: 99%

Turbo Equalization Of Nonlinear ISI-channels Using High Rate FEC Codes

et al. 2005

View full text Add to dashboard Cite

Abstract. Turbo equalization is a widely known method to cope with low signal to noise ratio (SNR) channels corrupted by linear intersymbol interference (ISI) Hagenauer et al., 1997). Recently in this workshop it was reported that also for nonlinear channels a remarkable turbo decoding gain can be achieved (Siegrist et al., 2001). However, the classical turbo equalization relies on code rates at 1/3 up to 1/2 which makes it quite unattractive for high rate data transmission. Considering the potential of iterative equalization and decoding, we obtain a considerable turbo decoding gain also for high rate codes of less than 7% redundancy by using punctured convolutional codes and block codes.

show abstract

Near optimum decoding of product codes

Cited by 209 publications

References 6 publications

Stochastic Chase Decoding of Reed-Solomon Codes

Stochastic Chase Decoding of Reed-Solomon Codes

Fine grain parallel decoding of turbo product codes: Algorithm and architecture

Turbo Equalization Of Nonlinear ISI-channels Using High Rate FEC Codes

Contact Info

Product

Resources

About