scientific article
From MaRDI portal
Publication:4040743
zbMATH Open0654.65096MaRDI QIDQ4040743FDOQ4040743
Publication date: 5 June 1993
Title of this publication is not available (Why is that?)
Numerical methods for trigonometric approximation and interpolation (65T40) Analysis of algorithms and problem complexity (68Q25) Convolution as an integral transform (44A35) Trigonometric interpolation (42A15)
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
- Derivation and Analysis of Fast Bilinear Algorithms for Convolution
- An integer approximation method for discrete sinusoidal transforms
- Low-complexity 8-point DCT approximation based on angle similarity for image and video coding
- Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms
- Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
- An orthogonal 16-point approximate DCT for image and video compression
- On the real complexity of a complex DFT
- Multiplicative complexity of length-2mtwo-dimensional discrete cosine transform
- Fast multipole methods for particle dynamics
- The equivariant complexity of multiplication in finite field extensions
- The multiplicative complexity of discrete cosine transforms
- On the multiplicative complexity of discrete cosine transforms
- Title not available (Why is that?)
- A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)
- On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings
Recommendations
- Title not available (Why is that?) 👍 👎
- On the multiplicative complexity of discrete cosine transforms 👍 👎
- Fourier Transforms of Multiplicative Convolutions 👍 👎
- On the computational complexity of the general discrete Fourier transform 👍 👎
- The multiplicative complexity of the discrete Fourier transform 👍 👎
- On the real complexity of a complex DFT 👍 👎
- Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2) 👍 👎
- The multiplicative complexity of discrete cosine transforms 👍 👎
- Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms 👍 👎
- Multiplicative complexity of discrete cosine and sine transform 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040743)
