Issue No.06 - June (1988 vol.37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2219
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 cir
minimum complexity FIR filters; integral properties; digital filters; sparse systolic arrays; B-spline approximation; derivative properties; minimum time complexity; Nyquist criterion; two-dimensional hardware implementation; approximation theory; digital filters; splines (mathematics).
L.A. Ferrari, P.V. Sankar, "Minimum Complexity FIR Filters and Sparse Systolic Arrays", IEEE Transactions on Computers, vol.37, no. 6, pp. 760-764, June 1988, doi:10.1109/12.2219