Skip to Main Content
Discrete transforms are introduced and are defined in a ring of polynomials. These polynomial transforms are shown to have the convolution property and can be computed in ordinary arithmetic, without multiplications. Polynomial transforms are particularly well suited for computing discrete two-dimensional convolutions with a minimum number of operations. Efficient algorithms for computing one-dimensional convolutions and Discrete Fourier Transforms are then derived from polynomial transforms.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.