Share Email Print
cover

Proceedings Paper

New fast DCT algorithms based on Loeffler's factorization
Author(s): Yoon Mi Hong; Il-Koo Kim; Tammy Lee; Min-Su Cheon; Elena Alshina; Woo-Jin Han; Jeong-Hoon Park
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 15 October 2012
PDF: 8 pages
Proc. SPIE 8499, Applications of Digital Image Processing XXXV, 84990U (15 October 2012); doi: 10.1117/12.970324
Show Author Affiliations
Yoon Mi Hong, Samsung Electronics Co., Ltd. (Korea, Republic of)
Il-Koo Kim, Samsung Electronics Co., Ltd. (Korea, Republic of)
Tammy Lee, Samsung Electronics Co., Ltd. (Korea, Republic of)
Min-Su Cheon, Samsung Electronics Co., Ltd. (Korea, Republic of)
Elena Alshina, Samsung Electronics Co., Ltd. (Korea, Republic of)
Woo-Jin Han, Gachon Univ. (Korea, Republic of)
Jeong-Hoon Park, Samsung Electronics Co., Ltd. (Korea, Republic of)


Published in SPIE Proceedings Vol. 8499:
Applications of Digital Image Processing XXXV
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top