Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution
Resource
Signal Processing 80 (10): 2255-2260
Journal
Signal Processing
Journal Volume
80
Journal Issue
10
Pages
2255-2260
Date Issued
2000
Author(s)
Huang, Y.-M.
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.
Subjects
Algorithms; Computational complexity; Convolution; Fourier transforms; Polynomials; Statistical methods; Generalized discrete Hartley transforms (GDHT); Polynomial transform-based algorithms; Skew circular convolutions; Signal filtering and prediction
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
73.pdf
Size
156.11 KB
Format
Adobe PDF
Checksum
(MD5):d0f01b323f5f6ea8a9f0c3aabdd9daa8