The vector-radix fast cosine transform: Pruning and complexity analysis

DOI10.1016/0165-1684(94)00153-QzbMATH Open0925.65255OpenAlexW2072161905MaRDI QIDQ673542FDOQ673542

Authors: Juan-Miguel Gracia 

Publication date: 28 February 1997

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-1684(94)00153-q

Recommendations

• A new two-dimensional fast cosine transform algorithm
• Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding
• A two-dimensional fast cosine transform
• Fast algorithms for the discrete cosine transform

zbMATH Keywords

Fast algorithmsDiscrete cosine transformPruning algorithms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (4)

• A generalized output pruning algorithm for matrix-vector multiplication and its application to compute discrete cosine transform
• Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding
• Vector coding algorithms for multidimensional discrete Fourier transform
• A two-dimensional fast cosine transform

This page was built for publication: The vector-radix fast cosine transform: Pruning and complexity analysis

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