https://scholars.lib.ntu.edu.tw/handle/123456789/289088
Title: | Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution | Authors: | Huang, Y.-M. JA-LING WU |
Keywords: | 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 | Issue Date: | 2000 | Journal Volume: | 80 | Journal Issue: | 10 | Start page/Pages: | 2255-2260 | Source: | Signal Processing | 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. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-0034301760&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/289088 |
DOI: | 10.1016/S0165-1684(00)00110-9 |
Appears in Collections: | 資訊工程學系 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.