Efficient Recursive Structures for Forward and Inverse Discrete Cosine Transform

DOI10.1109/TSP.2004.831911MaRDI QIDQ5354157zbMATH OpenFDO

Authors Che-Hong Chen, Bin-Da Liu, Jar-Ferr Yang, Jiun-Lung Wang

Publication date 8 September 2017

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

Full work available at URL https://doi.org/10.1109/TSP.2004.831911

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Cited in

(3)

• A cyclic correlated structure for the realization of discrete cosine transform
• Scaled AAN for fixed-point multiplier-free IDCT
• Fast computation of the discrete Hartley transform

This page was built for publication: Efficient Recursive Structures for Forward and Inverse Discrete Cosine Transform

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