Pages that link to "Item:Q1765902"
From MaRDI portal
The following pages link to Fast and numerically stable algorithms for discrete cosine transforms (Q1765902):
Displaying 15 items.
- A wavelet OFDM receiver for baseband power line communications (Q285777) (← links)
- Wiener-Hopf and spectral factorization of real polynomials by Newton's method (Q393389) (← links)
- New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks (Q839079) (← links)
- Improvement of the discrete cosine transform calculation by means of a recursive method (Q969952) (← links)
- Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks (Q1032381) (← links)
- Signal flow graph approach to efficient and forward stable DST algorithms (Q2002787) (← links)
- Cosine manifestations of the Gelfand transform (Q2114988) (← links)
- Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms (Q2184016) (← links)
- Fast SGL Fourier transforms for scattered data (Q2197962) (← links)
- Sparse fast DCT for vectors with one-block support (Q2274167) (← links)
- Real sparse fast DCT for vectors with short support (Q2332391) (← links)
- Roundoff error analysis of fast DCT algorithms in fixed point arithmetic (Q2463439) (← links)
- ESPRIT versus ESPIRA for reconstruction of short cosine sums and its application (Q2679669) (← links)
- Signal Processing based on Stable radix-2 DCT I-IV Algorithms having Orthogonal Factors (Q2813064) (← links)
- Fast and Stable Algorithms for Discrete Sine Transformations having Orthogonal Factors (Q3459745) (← links)