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

Huang, Y.-M.Y.-M.HuangJA-LING WU2018-09-102018-09-102000http://www.scopus.com/inward/record.url?eid=2-s2.0-0034301760&partnerID=MN8TOARShttp://scholars.lib.ntu.edu.tw/handle/123456789/289088Fast 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.application/pdf159852 bytesapplication/pdfAlgorithms; Computational complexity; Convolution; Fourier transforms; Polynomials; Statistical methods; Generalized discrete Hartley transforms (GDHT); Polynomial transform-based algorithms; Skew circular convolutions; Signal filtering and predictionPolynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolutionjournal article10.1016/S0165-1684(00)00110-92-s2.0-0034301760