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

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A modified Blahut algorithm for decoding Reed-Solomon codes beyond the half the minimum distance. / Egorov, S.; Markarian, G.; Pickavance, K.
In: IEEE Transactions on Communications, Vol. 52, No. 12, 01.12.2004, p. 2052-2056.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Egorov, S, Markarian, G & Pickavance, K 2004, 'A modified Blahut algorithm for decoding Reed-Solomon codes beyond the half the minimum distance', IEEE Transactions on Communications, vol. 52, no. 12, pp. 2052-2056. https://doi.org/10.1109/TCOMM.2004.838673

APA

Egorov, S., Markarian, G., & Pickavance, K. (2004). A modified Blahut algorithm for decoding Reed-Solomon codes beyond the half the minimum distance. IEEE Transactions on Communications, 52(12), 2052-2056. https://doi.org/10.1109/TCOMM.2004.838673

Vancouver

Egorov S, Markarian G, Pickavance K. A modified Blahut algorithm for decoding Reed-Solomon codes beyond the half the minimum distance. IEEE Transactions on Communications. 2004 Dec 1;52(12):2052-2056. doi: 10.1109/TCOMM.2004.838673

Author

Egorov, S. ; Markarian, G. ; Pickavance, K. / A modified Blahut algorithm for decoding Reed-Solomon codes beyond the half the minimum distance. In: IEEE Transactions on Communications. 2004 ; Vol. 52, No. 12. pp. 2052-2056.

Bibtex

@article{8650aa31a34341f890b7bd3d4e309563,

title = "A modified Blahut algorithm for decoding Reed-Solomon codes beyond the half the minimum distance",

abstract = "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.",

keywords = "DCS-publications-id, art-906, DCS-publications-personnel-id, 141",

author = "S. Egorov and G. Markarian and K. Pickavance",

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",

year = "2004",

month = dec,

day = "1",

doi = "10.1109/TCOMM.2004.838673",

language = "English",

volume = "52",

pages = "2052--2056",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "12",

}

RIS

TY - JOUR

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

AU - Egorov, S.

AU - Markarian, G.

AU - Pickavance, K.

N1 - 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

PY - 2004/12/1

Y1 - 2004/12/1

N2 - 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.

AB - 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.

KW - DCS-publications-id

KW - art-906

KW - DCS-publications-personnel-id

KW - 141

U2 - 10.1109/TCOMM.2004.838673

DO - 10.1109/TCOMM.2004.838673

M3 - Journal article

VL - 52

SP - 2052

EP - 2056

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 12

ER -

Research

Links

Text available via DOI:

Keywords