IEICE TRANSACTIONS on Fundamentals
An Area-Time Efficient Key Equation Solver with Euclidean Algorithm for Reed-Solomon Decoders
Summary :
Reed-Solomon (RS) code is one of the well-known and widely used error correction codes. Among the components of a hardware RS decoder, the key equation solver (KES) unit occupies a relatively large portion of the hardware. It is important to develop an efficient KES architecture to implement efficient RS decoders. In this paper, a novel polynomial division technique used in the Euclidean algorithm (EA) of the KES is presented which achieves the short critical path delay of one Galois multiplier and one Galois adder. Then a KES architecture with the EA is proposed which is efficient in the sense of the product of area and time.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E96-A No.2 pp.609-617
- Publication Date
- 2013/02/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E96.A.609
- Type of Manuscript
- PAPER
- Category
- VLSI Design Technology and CAD
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Kazuhito ITO, "An Area-Time Efficient Key Equation Solver with Euclidean Algorithm for Reed-Solomon Decoders" in IEICE TRANSACTIONS on Fundamentals,
vol. E96-A, no. 2, pp. 609-617, February 2013, doi: 10.1587/transfun.E96.A.609.
Abstract: Reed-Solomon (RS) code is one of the well-known and widely used error correction codes. Among the components of a hardware RS decoder, the key equation solver (KES) unit occupies a relatively large portion of the hardware. It is important to develop an efficient KES architecture to implement efficient RS decoders. In this paper, a novel polynomial division technique used in the Euclidean algorithm (EA) of the KES is presented which achieves the short critical path delay of one Galois multiplier and one Galois adder. Then a KES architecture with the EA is proposed which is efficient in the sense of the product of area and time.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E96.A.609/_p
Copy
@ARTICLE{e96-a_2_609,
author={Kazuhito ITO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Area-Time Efficient Key Equation Solver with Euclidean Algorithm for Reed-Solomon Decoders},
year={2013},
volume={E96-A},
number={2},
pages={609-617},
abstract={Reed-Solomon (RS) code is one of the well-known and widely used error correction codes. Among the components of a hardware RS decoder, the key equation solver (KES) unit occupies a relatively large portion of the hardware. It is important to develop an efficient KES architecture to implement efficient RS decoders. In this paper, a novel polynomial division technique used in the Euclidean algorithm (EA) of the KES is presented which achieves the short critical path delay of one Galois multiplier and one Galois adder. Then a KES architecture with the EA is proposed which is efficient in the sense of the product of area and time.},
keywords={},
doi={10.1587/transfun.E96.A.609},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - An Area-Time Efficient Key Equation Solver with Euclidean Algorithm for Reed-Solomon Decoders
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 609
EP - 617
AU - Kazuhito ITO
PY - 2013
DO - 10.1587/transfun.E96.A.609
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E96-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2013
AB - Reed-Solomon (RS) code is one of the well-known and widely used error correction codes. Among the components of a hardware RS decoder, the key equation solver (KES) unit occupies a relatively large portion of the hardware. It is important to develop an efficient KES architecture to implement efficient RS decoders. In this paper, a novel polynomial division technique used in the Euclidean algorithm (EA) of the KES is presented which achieves the short critical path delay of one Galois multiplier and one Galois adder. Then a KES architecture with the EA is proposed which is efficient in the sense of the product of area and time.
ER -
English
