Polynomial transform computation of the 2-D DCT

This publication has 6 references indexed in Scilit:

• Fast 2-D discrete cosine transform
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
  IEEE Transactions on Acoustics, Speech, and Signal Processing, 1990
• Simple FFT and DCT algorithms with reduced number of operations
  Signal Processing, 1984
• Fast Fourier Transform and Convolution Algorithms
  Published by Springer Nature ,1982
• Fast computation of discrete Fourier transforms using polynomial transforms
  IEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
• Discrete Cosine Transform
  IEEE Transactions on Computers, 1974