Systolic multiplier for finite fields gf(2/sup m/)
Chi-Tsuen Yeh, I.S. Reed · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1983
A systolic architecture is developed for performing the product-sum computation, ab+c, in the finite field gf(2/sup m/) of 2/sup m/ elements, where a, b and c are arbitrary elements of gf(2/sup m/). The multiplier is a serial-in, serial-out, one-dimensional systolic array. This multiplier for gf(2/sup m/) requires m basic cells. The average time per computation of the multiplier is m time units if a number of computations are computed consecutively. To perform an isolated computation the multiplier requires 3m time units. The architecture is simple and regular and possesses the desirable properties of concurrency and modularity and is well suited for use. 10 references.