Simple FFT and DCT algorithms with reduced number of operations.
From MaRDI portal
Publication:554691
DOI10.1016/0165-1684(84)90059-8zbMath1218.65158OpenAlexW2084466783WikidataQ59341927 ScholiaQ59341927MaRDI QIDQ554691
Martin Vetterli, Henri J. Nussbaumer
Publication date: 5 August 2011
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/33931/files/VetterliN84.pdf
Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for integral transforms (65R10) Application of orthogonal and other special functions (94A11)
Related Items
A new matrix approach to real FFTs and convolutions of length \(2^k\), The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms, On algebras related to the discrete cosine transform, Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization, On circulant and skew-circulant splitting algorithms for (continuous) Sylvester equations, The Tangent FFT, A quadratic classifier for high-dimensional, periodic-measurement pattern-recognition problems, Fast radix-\(p\) discrete cosine transform, Modified FFTs for Fused Multiply-Add Architectures, Improvement of the discrete cosine transform calculation by means of a recursive method, An orthogonal 16-point approximate DCT for image and video compression, Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding, Critical analysis of electrohysterographic methods for continuous monitoring of intrauterine pressure, The multiplicative complexity of discrete cosine transforms, Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms, The eigen-structures of real (skew) circulant matrices with some applications, Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication, Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms, Fast discrete transforms by means of eigenpolynomials, Cosine manifestations of the Gelfand transform
