Pages that link to "Item:Q554691"
From MaRDI portal
The following pages link to Simple FFT and DCT algorithms with reduced number of operations. (Q554691):
Displaying 27 items.
- Subband DFT. I: Definition, interpretation and extensions (Q674029) (← links)
- Five-step FFT algorithm with reduced computational complexity (Q845949) (← links)
- Improvement of the discrete cosine transform calculation by means of a recursive method (Q969952) (← links)
- Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations (Q971394) (← links)
- Type-II/III DCT/DST algorithms with reduced number of arithmetic operations (Q971426) (← links)
- A new set of minimum-add small-n rotated DFT modules (Q1098609) (← links)
- The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms (Q1105346) (← links)
- A quadratic classifier for high-dimensional, periodic-measurement pattern-recognition problems (Q1193830) (← links)
- Fast radix-\(p\) discrete cosine transform (Q1197099) (← links)
- Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication (Q1307205) (← links)
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms (Q1307276) (← links)
- Fast discrete transforms by means of eigenpolynomials (Q1311982) (← links)
- On algebras related to the discrete cosine transform (Q1372961) (← links)
- The multiplicative complexity of discrete cosine transforms (Q1802353) (← links)
- Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms (Q1812878) (← links)
- An orthogonal 16-point approximate DCT for image and video compression (Q2014160) (← links)
- Critical analysis of electrohysterographic methods for continuous monitoring of intrauterine pressure (Q2038688) (← links)
- Cosine manifestations of the Gelfand transform (Q2114988) (← links)
- Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding (Q2267025) (← links)
- The eigen-structures of real (skew) circulant matrices with some applications (Q2326922) (← links)
- A new matrix approach to real FFTs and convolutions of length \(2^k\) (Q2369946) (← links)
- Error analysis and efficient realization of the multiplier-less FFT-like transformation (ML-FFT) and related sinusoidal transformations (Q2505083) (← links)
- On circulant and skew-circulant splitting algorithms for (continuous) Sylvester equations (Q2667960) (← links)
- Generating and searching families of FFT algorithms (Q2786917) (← links)
- Modified FFTs for Fused Multiply-Add Architectures (Q4293974) (← links)
- Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization (Q4833437) (← links)
- The Tangent FFT (Q5386108) (← links)
