Minimum complexity FIR filters and sparse systolic arrays

The properties of B-spline approximation and the integral/derivative properties of convolution lead to efficient algorithms for the implementation of multidimensional FIR filters. The implementations are of minimum time complexity under the Nyquist criterion. The algorithm can easily be implemented using a sparse systolic array architecture. The resulting B-spline convolvers have much lower circuit complexity than systolic architectures based on conventional convolution algorithms. A two-dimensional hardware implementation based on simplifications of current architectures is presented.<
>