A Storage Efficient Way to Implement the Discrete Cosine Transform

DOI10.1109/TC.1976.1674687MaRDI QIDQ4099171zbMATH OpenFDO

Authors Robert Haralick

Publication date 1976

Published in IEEE Transactions on Computers (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Special integral transforms (Legendre, Hilbert, etc.) (44A15) Numerical methods for integral equations (65R20)

Cited in

(2)

• Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
• A frequency domain algorithm for maximum likelihood estimation of gaussian fields

This page was built for publication: A Storage Efficient Way to Implement the Discrete Cosine Transform

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