Abstract
The problem of implementing a two-dimensional recursive filter as a one-dimensional recursive filter is examined. The results of the present paper show that the exact one-dimensional implementation of a planar recursive filter is a time-varying filter. However, planar filters may be approximated by one-dimensional time-invariant recursive filters. The frequency response, stability, and storage requirements of the approximate filters are derived and illustrated.

This publication has 2 references indexed in Scilit: