A new algorithm to compute the discrete cosine Transform

DOI10.1109/TASSP.1984.1164443MaRDI QIDQ3696478zbMATH OpenFDO

Authors Byeong Gi Lee

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.1164443

zbMATH Keywords

discrete cosine transformfast Fourier transformnumber of multiplications

Mathematics Subject Classification ID

Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for trigonometric approximation and interpolation (65T40) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4131613
• Fast algorithms for the discrete cosine transform
• scientific article; zbMATH DE number 24367
• New fast algorithm for two-dimensional discrete Fourier transform DFT(2ⁿ; 2)
• A new two-dimensional fast cosine transform algorithm

Cited in

(32)

• The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
• A fast algorithm for the \(n\)-D discrete cosine transform
• On algebras related to the discrete cosine transform
• Fast and numerically stable algorithms for discrete cosine transforms
• The multiplicative complexity of discrete cosine transforms
• Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms
• Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format
• A unified algorithm for subband-based discrete cosine transform
• Low-complexity 8-point DCT approximation based on angle similarity for image and video coding
• An orthogonal 16-point approximate DCT for image and video compression
• Cosine manifestations of the Gelfand transform
• Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding
• Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications
• Concurrent computation of two-dimensional discrete cosine transform
• A generalized output pruning algorithm for matrix-vector multiplication and its application to compute discrete cosine transform
• scientific article; zbMATH DE number 4130975 (Why is no real title available?)
• scientific article; zbMATH DE number 4131613 (Why is no real title available?)
• New fast discrete Hartley transform algorithm
• Convolution-based DCT algorithm
• A new look at DCT-type transforms
• Fixed-point round-off error analysis for the discrete cosine transform
• A cyclic correlated structure for the realization of discrete cosine transform
• A new algorithm for computing modified z-transforms
• The Arithmetic Cosine Transform: Exact and Approximate Algorithms
• Efficient index mapping for computing discrete cosine transform
• An efficient algorithm for cyclic convolution based on fast-polynomial and fast-W transforms
• Two new algorithms based on product system for discrete cosine transform
• A new square wave transform based on the DCT
• The single-pass perceptual embedded zero-tree coding implementation on DSP
• Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization
• Simple systolic arrays for discrete cosine transform
• A generalized approach to linear transform approximations with applications to the discrete cosine transform

This page was built for publication: A new algorithm to compute the discrete cosine Transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3696478)