A reduced-complexity finite field ALU
G.S. Zelniker, Fred J. Taylor · IEEE Transactions on Circuits and Systems · 1991
Computation by homomorphic images has been shown to be a viable technique for the VLSI implementation of real and complex arithmetic. Embedding the integers or the Gaussian integers into a direct sum of Galois fields has led to finite computational structures, which are multiplier-free; multiplication is replaced with finite field logarithm addition. While this led to an efficient realization of multiplication, addition was made more difficult. The authors propose a scheme to allow both addition and multiplication with finite field logarithms that alleviates the earlier difficulties with addition and leads to a more compact hardware realization.>