One- and two-dimensional constant geometry fast cosine transform algorithms and architectures

DOI10.1109/78.771049MaRDI QIDQ2723637zbMATH OpenOpenAlexFDO

Authors Jinsuk Kwak, Jaehee You

Publication date 8 July 2001

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

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

zbMATH Keywords

constant geometry algorithmconstant geometry fast cosine transform algorithmsVLSI

Mathematics Subject Classification ID

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

Recommendations

• Constant geometry algorithm for discrete cosine transform
• Fast algorithms for the discrete cosine transform
• A new two-dimensional fast cosine transform algorithm
• A two-dimensional fast cosine transform
• scientific article; zbMATH DE number 4197369

Cited in

(5)

• 1-D and 2-D algorithms for orthogonal transformations
• Stride permutation networks for array processors
• Architecture-oriented regular algorithms for discrete sine and cosine transforms
• Constant geometry algorithm for discrete cosine transform
• A new two-dimensional fast cosine transform algorithm

This page was built for publication: One- and two-dimensional constant geometry fast cosine transform algorithms and architectures

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