Home > Research > Publications & Outputs > A modified Blahut algorithm for decoding Reed-S...
View graph of relations

A modified Blahut algorithm for decoding Reed-Solomon codes beyond the half the minimum distance

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>1/12/2004
<mark>Journal</mark>IEEE Transactions on Communications
Issue number12
Number of pages5
Pages (from-to)2052-2056
Publication StatusPublished
<mark>Original language</mark>English


A modification of the Blahut algorithm is proposed for decoding of Reed-Solomon codes beyond half the minimum distance. An effective method is offered for the searching of unknown discrepancies needed for analytical continuation of the Berlekamp-Massey algorithm through two additional iterations. This reduces the search time by 2(q-1)n/((n+t+1)(n-t)) times, compared with the Blahut algorithm. An architecture of a searcher for unknown discrepancies is given. The coding gain of the proposed algorithm is shown for some practical codes.

Bibliographic note

This paper describes a new decoding algorithm that allows the decoding of Reed-Solomon codes beyond the conventional error correction bound. The results of this research was implemented in the professional DVB-S receivers and as a VHDL code offered to customers. RAE_import_type : Journal article RAE_uoa_type : Electrical and Electronic Engineering