A novel modularized fast polynomial transform algorithm for two-dimensional convolutions
Journal
Signal Processing
Journal Volume
26
Journal Issue
1
Pages
27-36
Date Issued
1992
Author(s)
Abstract
This paper presents a novel modularized fast polynomial transform (FPT) algorithm for computing two-dimensional (2-D) convolutions. In this new method, only FPTs, FFTs or NTTs of the same length are required. As a result, the modularity and regularity of the proposed algorithm makes it suitable for a concurrent implementation of the 2-D convolver. © 1992.
Type
journal article