Fast recursive algorithms for 2-D discrete cosine transform.

DOI10.1016/S0165-1684(00)00102-XzbMATH Open1037.65137OpenAlexW2047252910WikidataQ126437020 ScholiaQ126437020MaRDI QIDQ1575779

N. Delaunay

Publication date: 21 August 2000

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

Full work available at URL: https://doi.org/10.1016/s0165-1684(00)00102-x

zbMATH Keywords

algorithmdiscrete cosine transform

Mathematics Subject Classification ID

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

Related Items (2)

A new two-dimensional fast cosine transform algorithm ⋮ Fast computation of two-dimensional discrete cosine transforms using fast discrete radon transform

This page was built for publication: Fast recursive algorithms for 2-D discrete cosine transform.

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