Fast algorithms for the discrete W transform and for the discrete Fourier transform
From MaRDI portal
Publication:3698241
DOI10.1109/TASSP.1984.1164399zbMath0577.65134OpenAlexW2086393337MaRDI QIDQ3698241
Publication date: 1984
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tassp.1984.1164399
discrete Fourier transformsparse matrix factorizationdiscrete cosine transformdiscrete sine transformdiscrete W transform
Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items
On a set of matrix algebras related to discrete Hartley-type transforms ⋮ The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms ⋮ Generalized orthogonal discrete W transform and its fast algorithm ⋮ Matrix displacement decompositions and applications to Toeplitz linear systems ⋮ Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization ⋮ \(h\)-space structure in matrix displacement formulas ⋮ Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms ⋮ Fast orthogonal transforms and generation of Brownian paths ⋮ A tutorial overview on the properties of the discrete cosine transform for encoded image and video processing ⋮ Fast spherical Fourier algorithms. ⋮ Modified integer sine transforms. Construction method and separable directional adaptive transforms for intra prediction in image/video coding ⋮ Symmetric sine and cosine structures for trigonometric transforms ⋮ Roundoff error analysis of fast DCT algorithms in fixed point arithmetic ⋮ Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms ⋮ Trigonometric transform splitting methods for real symmetric Toeplitz systems ⋮ Signal flow graph approach to efficient and forward stable DST algorithms ⋮ Fast and numerically stable algorithms for discrete cosine transforms ⋮ An orthogonal 16-point approximate DCT for image and video compression ⋮ Matrix algebras in optimal preconditioning ⋮ An efficient hardware accelerator architecture for implementing fast IMDCT computation ⋮ Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications ⋮ Biorthogonal recombination nonuniform cosine-modulated filter banks and their multiplier-less realizations ⋮ Error analysis and efficient realization of the multiplier-less FFT-like transformation (ML-FFT) and related sinusoidal transformations ⋮ Preconditioners for non-Hermitian Toeplitz systems ⋮ Signal Processing based on Stable radix-2 DCT I-IV Algorithms having Orthogonal Factors ⋮ Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems ⋮ Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms ⋮ Discrete cosine-sine type VII transform and fast integer transforms for intra prediction of images and video coding ⋮ More on Electrostatic Models for Zeros of Orthagonal Polynomials ⋮ Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization ⋮ Real sparse fast DCT for vectors with short support ⋮ Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format ⋮ Fast unified computation of the multi-dimensional discrete sinusoidal transforms ⋮ Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms ⋮ Fast discrete transforms by means of eigenpolynomials ⋮ Local cosine transform -- A method for the reduction of the blocking effect in JPEG
