New fast DCT algorithms based on Loeffler's factorization

Abstract

This paper proposes a new 32-point fast discrete cosine transform (DCT) algorithm based on the Loeffler's 16-point transform. Fast integer realizations of 16-point and 32-point transforms are also provided based on the proposed transform. For the recent development of High Efficiency Video Coding (HEVC), simplified quantization and de-quantization process are proposed. Three different forms of implementation with the essentially same performance, namely matrix multiplication, partial buttery, and full factorization can be chosen according to the given platform. In terms of the number of multiplications required for the realization, our proposed full-factorization is 3∼4 times faster than a partial buttery, and about 10 times faster than direct matrix multiplication. © 2012 SPIE.