Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution. (Q1583138)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution. |
scientific article; zbMATH DE number 1521676
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution. |
scientific article; zbMATH DE number 1521676 |
Statements
Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution. (English)
0 references
26 October 2000
0 references
Polynomial transform
0 references
generalized discrete Fourier transform
0 references
generalized discrete Hartley transform
0 references
skew circular convolution
0 references
index permutation
0 references
linear congruence
0 references
0 references
0 references
0.8535257
0 references
0 references
0.8406069
0 references
0.8403466
0 references
