On iterative arrays for the Euclidean algorithm over finite fields
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 38 (10) , 1473-1478
- https://doi.org/10.1109/12.35844
Abstract
Iterative arrays are described which implement the extended Euclidean algorithm over finite fields with characteristic two and are designed to have throughputs in the area of hundreds of megabits per second. A special form of the Euclidean algorithm is the basis of these arrays, which can be used for error decoding. The propagation time through the array is derived as a function of the degree of the input polynomials.Keywords
This publication has 4 references indexed in Scilit:
- The VLSI Implementation of a Reed—Solomon Encoder Using Berlekamp's Bit-Serial Multiplier AlgorithmIEEE Transactions on Computers, 1984
- Systolic VLSI Arrays for Polynomial GCD ComputationIEEE Transactions on Computers, 1984
- A Universal Reed-Solomon DecoderIBM Journal of Research and Development, 1984
- A method for solving key equation for decoding goppa codesInformation and Control, 1975