scientific article; zbMATH DE number 193953

MaRDI QIDQ4040743zbMATH OpenFDO

Authors Michael T. Heideman

Publication date 5 June 1993

zbMATH Keywords

convolutiondiscrete Fourier transformmultiplicative complexityfactorization of matrices

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Analysis of algorithms and problem complexity (68Q25) Convolution as an integral transform (44A35) Trigonometric interpolation (42A15)

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)

• The multiplicative complexity of discrete cosine transforms
• Derivation and analysis of fast bilinear algorithms for convolution
• Low-complexity 8-point DCT approximation based on angle similarity for image and video coding
• 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 fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings
• Multiplicative complexity of length-2^mtwo-dimensional discrete cosine transform
• An integer approximation method for discrete sinusoidal transforms
• On the multiplicative complexity of discrete cosine transforms
• scientific article; zbMATH DE number 847093 (Why is no real title available?)
• Fast multipole methods for particle dynamics
• Lowest complexity self-recursive radix-2 DCT II/III algorithms
• An orthogonal 16-point approximate DCT for image and video compression
• Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
• On the real complexity of a complex DFT
• The equivariant complexity of multiplication in finite field extensions
• A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)

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)