Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution.
From MaRDI portal
Publication:1583138
DOI10.1016/S0165-1684(00)00110-9zbMath1098.94547OpenAlexW2084027894MaRDI QIDQ1583138
Publication date: 26 October 2000
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0165-1684(00)00110-9
linear congruencegeneralized discrete Fourier transformgeneralized discrete Hartley transformindex permutationPolynomial transformskew circular convolution
This page was built for publication: Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution.