Constant geometry algorithm for discrete cosine transform

DOI10.1109/78.845951MaRDI QIDQ2734344zbMATH OpenOpenAlexFDO

Authors Jarmo Takala, David Akopian, Jaakko Astola, Jukka Saarinen

Publication date 13 December 2001

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

zbMATH Keywords

constant geometry algorithmdiscrete cosine transformdiscrete trigonometric transformsfast transformsperfect shuffle

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• One- and two-dimensional constant geometry fast cosine transform algorithms and architectures
• Architecture-oriented regular algorithms for discrete sine and cosine transforms
• Fast algorithms for the discrete cosine transform
• Fast radix-\(p\) discrete cosine transform
• Fast algorithms for computing the discrete cosine transform

Cited in

(4)

• Cosine manifestations of the Gelfand transform
• One- and two-dimensional constant geometry fast cosine transform algorithms and architectures
• Architecture-oriented regular algorithms for discrete sine and cosine transforms
• Improvement of the discrete cosine transform calculation by means of a recursive method

This page was built for publication: Constant geometry algorithm for discrete cosine transform

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