Condensed recursive structures for computing multidimensional DCT/IDCT with arbitrary length

DOI10.1109/TCSI.2005.852935zbMATH Open1388.65192OpenAlexW2029298186MaRDI QIDQ4590463FDOQ4590463

Authors: Che-Hong Chen, Bin-Da Liu, Jar-Ferr Yang 

Publication date: 20 November 2017

Published in: IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcsi.2005.852935

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (3)

• Scaled AAN for fixed-point multiplier-free IDCT
• General approach for the realization of DCT/IDCT using convolutions
• An Efficient Unified Framework for Implementation of a Prime-Length DCT/IDCT With High Throughput

This page was built for publication: Condensed recursive structures for computing multidimensional DCT/IDCT with arbitrary length

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