A Fast Computational Algorithm for the Discrete Cosine Transform

DOI10.1109/TCOM.1977.1093941zbMath0371.94016OpenAlexW2105815873WikidataQ55970231 ScholiaQ55970231MaRDI QIDQ4149639

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

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) Communication theory (94A05) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Related Items (23)

Efficient MPEG-2 to H.264/AVC transcoding of intra-coded video ⋮ Optimized spatial matrix representations of quantum Hamiltonians ⋮ The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms ⋮ On algebras related to the discrete cosine transform ⋮ Image morphing in frequency domain ⋮ An extra-component method for evaluating fast matrix-vector multiplication with special functions ⋮ A unified algorithm for subband-based discrete cosine transform ⋮ A generalized approach to linear transform approximations with applications to the discrete cosine transform ⋮ Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms ⋮ 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 ⋮ Morphological transform for image compression ⋮ Fast and numerically stable algorithms for discrete cosine transforms ⋮ An orthogonal 16-point approximate DCT for image and video compression ⋮ 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 ⋮ Signal Processing based on Stable radix-2 DCT I-IV Algorithms having Orthogonal Factors ⋮ Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization ⋮ Conservative Scale Recomposition for Multiscale Denoising (The Devil is in the High Frequency Detail) ⋮ Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms ⋮ Simple systolic arrays for discrete cosine transform ⋮ Local cosine transform -- A method for the reduction of the blocking effect in JPEG ⋮ Cosine manifestations of the Gelfand transform

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