Issue No. 10 - October (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.35844
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 o
iterative arrays; Euclidean algorithm; finite fields; error decoding; decoding; error correction codes.
D.M. Mandelbaum, "On Iterative Arrays for the Euclidean Algorithm Over Finite Fields", IEEE Transactions on Computers, vol. 38, no. , pp. 1473-1478, October 1989, doi:10.1109/12.35844