Hardware Efficient Fast DCT Based on Novel Cyclic Convolution Structures

DOI10.1109/TSP.2006.881269MaRDI QIDQ4588038zbMATH OpenOpenAlexFDO

Authors Chao Cheng, Keshab K. Parhi

Publication date 30 October 2017

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

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

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Recommendations

• A new fast algorithm for computing prime-Length DCT through cyclic convolutions.
• Efficient VLSI implementations of fast multiplierless approximated DCT using parameterized hardware modules for silicon intellectual property design
• An efficient algorithm for cyclic convolution based on fast-polynomial and fast-W transforms
• scientific article; zbMATH DE number 1833436
• New DCT computation technique based on scalable resources
• Application of modular computing technique for high speed implementation of cyclic convolution
• Fast DCT-I, DCT-III, and DCT-IV via moments
• scientific article; zbMATH DE number 733445
• On the regular structure for the fast 2-D DCT algorithm

Cited in

(3)

• General approach for the realization of DCT/IDCT using convolutions
• V-cycle optimal convergence for DCT-III matrices
• DCT hardware structure for sequentially presented data

This page was built for publication: Hardware Efficient Fast DCT Based on Novel Cyclic Convolution Structures

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