Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution

[[abstract]]Fast computation of two-dimensional (2-D) generalized discrete Fourier transforms (GDFTs) and generalized discrete Hartley transforms (GDHTs) are discussed in terms of a new method which is derived based on index permutation, linear congruences, and polynomial transforms, Further, the 2-D skew circular convolution computed by the proposed skew polynomial transform is also included. (C) 2000 Elsevier Science B.V. All rights reserved.[[note]]SC