Pages that link to "Item:Q3757261"
From MaRDI portal
The following pages link to On computing the discrete Fourier and cosine transforms (Q3757261):
Displaying 11 items.
- On computation of certain discrete Fourier transforms using binary calculus (Q674150) (← links)
- Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization (Q784516) (← links)
- The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms (Q1105346) (← links)
- Discrete Fourier transform computation using prime Ramanujan numbers (Q1370324) (← links)
- Fast and numerically stable algorithms for discrete cosine transforms (Q1765902) (← links)
- Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications (Q2277807) (← links)
- (Q3974366) (← links)
- Vector computation of the discrete Fourier transform (Q4220994) (← links)
- Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms (Q4643325) (← links)
- (Q4718675) (← links)
- Binary Discrete Cosine and Hartley Transforms (Q5008512) (← links)