Scaled AAN for fixed-point multiplier-free IDCT

DOI10.1155/2009/485817zbMath1184.94083OpenAlexW2015533857WikidataQ59248959 ScholiaQ59248959MaRDI QIDQ967120

B. E. Eshmatov

Publication date: 24 April 2010

Published in: EURASIP Journal on Advances in Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2009/485817

Mathematics Subject Classification ID

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

Cites Work

• Condensed recursive structures for computing multidimensional DCT/IDCT with arbitrary length
• Efficient Recursive Structures for Forward and Inverse Discrete Cosine Transform

This page was built for publication: Scaled AAN for fixed-point multiplier-free IDCT