Multidimensional polynomial transform algorithm for multidimensional discrete Hartley transform
From MaRDI portal
Recommendations
- New algorithms for multidimensional discrete Hartley transform
- Fast algorithm for multi-dimensional discrete Hartley transform with size \(q^{l_{1}}\times q^{l_{2}}\times \cdots \times q^{l_{r}}\)
- Polynomial transform fast Hartley transform
- Fast computation of the discrete Hartley transform
- New polynomial transform algorithm for multidimensional DCT
Cited in
(9)- Multidimensional polynomial transform algorithm for multidimensional discrete \(W\) transform
- scientific article; zbMATH DE number 1247162 (Why is no real title available?)
- scientific article; zbMATH DE number 5026599 (Why is no real title available?)
- Combined polynomial transform and radix-\(q\) algorithm for multi-dimensional DCT-III
- New algorithms for multidimensional discrete Hartley transform
- Fast algorithm for multi-dimensional discrete Hartley transform with size \(q^{l_{1}}\times q^{l_{2}}\times \cdots \times q^{l_{r}}\)
- Polynomial transform fast Hartley transform
- Fast 3-D decimation-in-frequency algorithm for 3-D Hartley transform
- Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution.
This page was built for publication: Multidimensional polynomial transform algorithm for multidimensional discrete Hartley transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601342)