Convolution-based DCT algorithm

DOI10.1049/EL:19911140MaRDI QIDQ3359715zbMATH OpenOpenAlexFDO

Authors

Publication date 1991

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910032310/1/00229990.pdf

zbMATH Keywords

discrete cosine transformconvolution-based algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• A new algorithm to compute the DCT and its inverse
• A new fast algorithm for computing prime-Length DCT through cyclic convolutions.
• A new two-dimensional fast cosine transform algorithm
• A new algorithm to compute the discrete cosine Transform
• On the computation of two-dimensional DCT

Cited in

(5)

• A new fast algorithm for computing prime-Length DCT through cyclic convolutions.
• Two-dimensional linear convolution in the discrete trigonometric transform domain
• A new algorithm to compute the DCT and its inverse
• General approach for the realization of DCT/IDCT using convolutions
• A new discrete Fourier transform algorithm using butterfly structure fast convolution

This page was built for publication: Convolution-based DCT algorithm

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