Digital filtering using polynomial transforms

We define discrete transforms in a ring of polynomials. These polynomial transforms have the circular convolution property and can be used for the fast computation of 2-dimensional cyclic convolutions. This yields efficient algorithms for the implementation of 1- and 2-dimensional digital filters.