On iterative arrays for the Euclidean algorithm over finite fields

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