Egorov, S. and Markarian, G. and Pickavance, K. (2004) A modified Blahut algorithm for decoding Reed-Solomon codes beyond the half the minimum distance. IEEE Transactions on Communications, 52 (12). pp. 2052-2056. ISSN 0090-6778Full text not available from this repository.
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.
|Journal or Publication Title:||IEEE Transactions on Communications|
|Additional Information:||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|
|Uncontrolled Keywords:||DCS-publications-id ; art-906 ; DCS-publications-personnel-id ; 141|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Departments:||Faculty of Science and Technology > Engineering|
Faculty of Science and Technology > School of Computing & Communications
|Deposited On:||27 Mar 2008 16:17|
|Last Modified:||21 Feb 2017 01:28|
Actions (login required)