Systolic array implementations of modified Gaussian eliminations for the decoding of an (n, n-2t) RS code, including the Hong-Vetterli algorithm and the FIA proposed by Feng and Tzeng, are designed in this paper. These modified Gaussian eliminations are more easily understanding than the classical Berlekamp-Massey algorithm and, in addition, are efficient to decode RS codes for small e or e <<t, where e is the number of errors actually occurred. These architectures can also be applied to solving a linear system Ax
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Chih-Wei LIU, Li-Lien LIN, "Systolic Implementations of Modified Gaussian Eliminations for the Decoding of Reed-Solomon Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 10, pp. 2251-2258, October 1999, doi: .
Abstract: Systolic array implementations of modified Gaussian eliminations for the decoding of an (n, n-2t) RS code, including the Hong-Vetterli algorithm and the FIA proposed by Feng and Tzeng, are designed in this paper. These modified Gaussian eliminations are more easily understanding than the classical Berlekamp-Massey algorithm and, in addition, are efficient to decode RS codes for small e or e <<t, where e is the number of errors actually occurred. These architectures can also be applied to solving a linear system Ax
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_10_2251/_p
Copy
@ARTICLE{e82-a_10_2251,
author={Chih-Wei LIU, Li-Lien LIN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Systolic Implementations of Modified Gaussian Eliminations for the Decoding of Reed-Solomon Codes},
year={1999},
volume={E82-A},
number={10},
pages={2251-2258},
abstract={Systolic array implementations of modified Gaussian eliminations for the decoding of an (n, n-2t) RS code, including the Hong-Vetterli algorithm and the FIA proposed by Feng and Tzeng, are designed in this paper. These modified Gaussian eliminations are more easily understanding than the classical Berlekamp-Massey algorithm and, in addition, are efficient to decode RS codes for small e or e <<t, where e is the number of errors actually occurred. These architectures can also be applied to solving a linear system Ax
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Systolic Implementations of Modified Gaussian Eliminations for the Decoding of Reed-Solomon Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2251
EP - 2258
AU - Chih-Wei LIU
AU - Li-Lien LIN
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1999
AB - Systolic array implementations of modified Gaussian eliminations for the decoding of an (n, n-2t) RS code, including the Hong-Vetterli algorithm and the FIA proposed by Feng and Tzeng, are designed in this paper. These modified Gaussian eliminations are more easily understanding than the classical Berlekamp-Massey algorithm and, in addition, are efficient to decode RS codes for small e or e <<t, where e is the number of errors actually occurred. These architectures can also be applied to solving a linear system Ax
ER -