On computing the discrete Fourier and cosine transforms
From MaRDI portal
Publication:3757261
Recommendations
- On the discrete cosine transform computation
- scientific article; zbMATH DE number 3915602
- On the computation of running discrete cosine and sine transform
- scientific article; zbMATH DE number 3918252
- Publication:3199959
- scientific article; zbMATH DE number 11434
- Fast algorithms for computing the discrete cosine transform
- scientific article; zbMATH DE number 24367
- Rapid Computation of the Discrete Fourier Transform
- On a fast algorithm for computing the Fourier transform
Cited in
(11)- Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications
- scientific article; zbMATH DE number 954648 (Why is no real title available?)
- Fast and numerically stable algorithms for discrete cosine transforms
- Vector computation of the discrete Fourier transform
- Lowest complexity self-recursive radix-2 DCT II/III algorithms
- Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization
- Binary Discrete Cosine and Hartley Transforms
- scientific article; zbMATH DE number 11434 (Why is no real title available?)
- Discrete Fourier transform computation using prime Ramanujan numbers
- The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
- On computation of certain discrete Fourier transforms using binary calculus
This page was built for publication: On computing the discrete Fourier and cosine transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757261)
