A Systolic Architecture For High-Speed Two-Dimensional Convolutions In Finite-Field Arithmetic
Harold A. Klotz · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1986
A two-dimensional linear-convolution algorithm is presented which couples the efficiency of the polynomial transform convolution-algorithm with the parallelism of finite-field arithmetic. This algorithm requires fewer arithmetic operations than most two-dimensional convolution algorithms, and possesses a structure which facilitates systolic architectures. Forming the polynomial transform in a finite field allows large numbers to be broken into small residues, each of which may be processed in parallel. A systolic architecture is described which may be used to evaluate two-dimensional convolutions in 0(N) processor cycles. This architecture is comprised of engagement processors, to form the polynomial transform, and pipelined processors, to form the polynomial product.