Multiplicative complexity, convolution, and the DFT
From MaRDI portal
Extended version of the author's thesis ``Applications of multiplicative complexity theory to convolution and the discrete Fourier transform.
Recommendations
- The multiplicative complexity of the discrete Fourier transform
- Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)
- The multiplicative complexity of discrete cosine transforms
- On the multiplicative complexity of discrete cosine transforms
- scientific article; zbMATH DE number 847093
- Multiplicative complexity of discrete cosine and sine transform
- Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
- On the computational complexity of the general discrete Fourier transform
- Fourier transforms of multiplicative convolutions
- On the real complexity of a complex DFT
Cited in
(17)- Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. I: Rational number system
- Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. II: Complex rational number system
- On the real complexity of a complex DFT
- The multiplicative complexity of discrete cosine transforms
- Low-complexity 8-point DCT approximation based on angle similarity for image and video coding
- A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)
- An orthogonal 16-point approximate DCT for image and video compression
- The equivariant complexity of multiplication in finite field extensions
- Fast multipole methods for particle dynamics
- Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
- Multiplicative complexity of length-2mtwo-dimensional discrete cosine transform
- On the multiplicative complexity of discrete cosine transforms
- An integer approximation method for discrete sinusoidal transforms
- Lowest complexity self-recursive radix-2 DCT II/III algorithms
- scientific article; zbMATH DE number 847093 (Why is no real title available?)
- Derivation and analysis of fast bilinear algorithms for convolution
- On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings
This page was built for publication: Multiplicative complexity, convolution, and the DFT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040743)
