A Fast Computational Algorithm for the Discrete Cosine Transform

DOI10.1109/TCOM.1977.1093941MaRDI QIDQ4149639zbMATH OpenOpenAlexWikidataFDO

Authors Wen-Hsiung Chen, C. Harrison Smith, Stanley C. Fralick

Publication date 1977

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcom.1977.1093941

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Software, source code, etc. for problems pertaining to information and communication theory (94-04) Communication theory (94A05)

Cited in

(24)

• Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
• The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
• Local cosine transform -- A method for the reduction of the blocking effect in JPEG
• On algebras related to the discrete cosine transform
• Fast and numerically stable algorithms for discrete cosine transforms
• Image morphing in frequency domain
• A unified algorithm for subband-based discrete cosine transform
• Low-complexity 8-point DCT approximation based on angle similarity for image and video coding
• Signal flow graph approach to efficient and forward stable DST algorithms
• 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
• An extra-component method for evaluating fast matrix-vector multiplication with special functions
• Signal processing based on stable radix-2 DCT I-IV algorithms having orthogonal factors
• Optimized spatial matrix representations of quantum Hamiltonians
• Conservative scale recomposition for multiscale denoising (the devil is in the high frequency detail)
• Lowest complexity self-recursive radix-2 DCT II/III algorithms
• Render unto numerics: orthogonal polynomial neural operator for PDEs with nonperiodic boundary conditions
• Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization
• Simple systolic arrays for discrete cosine transform
• Efficient MPEG-2 to H.264/AVC transcoding of intra-coded video
• A generalized approach to linear transform approximations with applications to the discrete cosine transform
• Morphological transform for image compression

This page was built for publication: A Fast Computational Algorithm for the Discrete Cosine Transform

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