15 October 2012 New fast DCT algorithms based on Loeffler's factorization
Author Affiliations +
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 quanti-zation and de-quantization process are proposed. Three different forms of implementation with the essentially same performance, namely matrix multiplication, partial butterfly, and full factorization can be chosen accord-ing 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 butterfly, and about 10 times faster than direct matrix multiplication.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yoon Mi Hong, Il-Koo Kim, Tammy Lee, Min-Su Cheon, Elena Alshina, Woo-Jin Han, Jeong-Hoon Park, "New fast DCT algorithms based on Loeffler's factorization", Proc. SPIE 8499, Applications of Digital Image Processing XXXV, 84990U (15 October 2012); doi: 10.1117/12.970324; https://doi.org/10.1117/12.970324
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT


Back to Top