Advanced decoding algorithms for Reed-Solomon/convolutional concatenated codes

M. Lamarca, J. Sala, A. Martinez

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)


The evaluation of the union bound for theber of Reed-Solomon/Convolutional concatenated codes indicates that their performance might largely improve through the application of soft iterative decoders. This paper presents an iterative decoding algorithm for concatenated codes consisting of an outer Reed-Solomon code, a symbol interleaver and an inner convolutional code. The performance improvement for iterative and non-iterative decoders is evaluated. Existing solutions for the different decoding stages and their interfaces are discussed and their performance is compared. A new procedure is proposed to define the feedback signal from the output of the Reed-Solomon decoder to the input of the convolutional decoder, which captures the reliability information that can be inferred from errors-and-era-suresrs decoders and includes the “state pinning” approach as a particular case. The decoding schemes are applied to the specificdvb-s concatenated code.
Original languageEnglish
Pages (from-to)45-78
Number of pages34
JournalAnnals of Telecommunications
Issue number1-2
Publication statusPublished - 2005


Dive into the research topics of 'Advanced decoding algorithms for Reed-Solomon/convolutional concatenated codes'. Together they form a unique fingerprint.

Cite this