Pages that link to "Item:Q3982444"
From MaRDI portal
The following pages link to Fast algorithms for the discrete cosine transform and for the discrete Fourier transform (Q3982444):
Displaying 18 items.
- Fast Fourier transform using matrix decomposition (Q508808) (← links)
- Simple FFT and DCT algorithms with reduced number of operations. (Q554691) (← links)
- Type-II/III DCT/DST algorithms with reduced number of arithmetic operations (Q971426) (← links)
- On matrix factorizations for recursive pruned discrete cosine transforms (Q1275141) (← links)
- Fast algorithms for the discrete cosine transformation (Q1309087) (← links)
- On algebras related to the discrete cosine transform (Q1372961) (← links)
- Invertible integer DCT algorithms (Q1406574) (← links)
- Fast and numerically stable algorithms for discrete cosine transforms (Q1765902) (← links)
- Sparse fast DCT for vectors with one-block support (Q2274167) (← links)
- Real sparse fast DCT for vectors with short support (Q2332391) (← links)
- A new sparse matrix analysis of discrete Fourier transform (Q2378792) (← links)
- A generalized fast algorithm for \(n\)-D discrete cosine transform and its application to motion picture coding (Q2733052) (← links)
- (Q3033283) (← links)
- (Q3701319) (← links)
- (Q3735040) (← links)
- On computing the discrete Fourier and cosine transforms (Q3757261) (← links)
- Fast odd discrete cosine transform algorithms (Q3981761) (← links)
- FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2 (Q5203651) (← links)
