The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation
DOI10.1016/S0165-1684(99)00088-2zbMATH Open0939.94002OpenAlexW2029769546MaRDI QIDQ1978398FDOQ1978398
Authors: Yanyan Li 
Publication date: 4 June 2000
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0165-1684(99)00088-2
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
discrete cosine transformdiscrete sine transformorthogonal transformsgeneralized discrete Fourier transformdiscrete trigonometric transformsgeneralized discrete \(W\) transformgeneralized discrete Hartley transformdiscrete sinusoidal transforms
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)
Cited In (8)
- Fast unified computation of the multi-dimensional discrete sinusoidal transforms
- Title not available (Why is that?)
- A Unified Treatment of Discrete Fast Unitary Transforms
- On a set of matrix algebras related to discrete Hartley-type transforms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alpha fractional frequency Laplace transform through multiseries
- One dimensional fractional frequency Fourier transform by inverse difference operator
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)
