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 32 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)
- Fast and numerically stable algorithms for discrete Hartley transforms and applications to preconditioning (Q820192) (← 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)
- Fast radix-\(p\) discrete cosine transform (Q1197099) (← links)
- On matrix factorizations for recursive pruned discrete cosine transforms (Q1275141) (← links)
- Fast algorithms for the discrete cosine transformation (Q1309087) (← links)
- Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications (Q1315227) (← 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)
- A generalized fast algorithm for \(n\)-D discrete cosine transform and its application to motion picture coding (Q2733052) (← links)
- Exact computation in numerical linear algebra: The discrete Fourier transform (Q2776695) (← links)
- Two new fast cosine transform (FCT) algorithms based on product system (Q2778242) (← links)
- Fast Algorithms for Digital Computation of Linear Canonical Transforms (Q2798298) (← 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)
- Fast Three-Dimensional Discrete Cosine Transform (Q3648604) (← links)
- Fast odd discrete cosine transform algorithms (Q3981761) (← links)
- Fast algorithms for the discrete cosine transform and for the discrete Fourier transform (Q3982444) (← links)
- Fast algorithms for the discrete cosine transform (Q4031486) (← links)
- The Arithmetic Cosine Transform: Exact and Approximate Algorithms (Q4570298) (← links)
- Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms (Q4643325) (← links)
- Numerical stability of biorthogonal wavelet transforms (Q5900219) (← links)
- Two new algorithms based on product system for discrete cosine transform (Q5958190) (← links)
