The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1737503
- Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
- scientific article; zbMATH DE number 1737498
- Fast generalized DFT and DHT algorithms
- Fast algorithms for the discrete W transform and for the discrete Fourier transform
Cited in
(8)- scientific article; zbMATH DE number 1737503 (Why is no real title available?)
- Alpha fractional frequency Laplace transform through multiseries
- One dimensional fractional frequency Fourier transform by inverse difference operator
- Fast unified computation of the multi-dimensional discrete sinusoidal transforms
- A Unified Treatment of Discrete Fast Unitary Transforms
- scientific article; zbMATH DE number 7551248 (Why is no real title available?)
- On a set of matrix algebras related to discrete Hartley-type transforms
- scientific article; zbMATH DE number 1737498 (Why is no real title available?)
This page was built for publication: The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978398)