리프팅 구조를 경유한 고속의 DCT 계산 알고리즘에 관한 연구 = A study on the Fast Computational Algorithm for the Discrete Cosine Transform(DCT) via Lifting Scheme

다국어 초록 (Multilingual Abstract)

In this paper, we show the design of fast invertible block transforms that can replace the DCT in future wireless and portable computing application. This is called binDCT. In binDCT, both the forward and the inverse transforms can be implemented using only binary shift and addition operation. And the binDCT inherits all desirable DCT characteristics such as high coding gain, no DC leakage, symmetric basis functions, and recursive construction. The binDCT also inherits all lifting properties such as fast implementations, invertible integer-to-integer mapping, in-place computation. In this paper, we present computation costs and performance analysis between DCT and binDCT using Shapiro's EZW.

목차 (Table of Contents)

• 목차
• ABSTRACT
• Ⅰ. 서론
• Ⅱ. 회전 변환에 근거한 리프팅과 DCT 인수분해
• 1. 공간 회전에 근거한 DCT 인수분해
• 2. 공간 회전에 근거한 리프팅
• Ⅲ. 성능 평가
• 1. Coding gain
• 2. Mean Square Error(MSE)
• Ⅳ. 8-point binDCT
• Ⅴ. 실험 및 결과
• Ⅵ. 결론
• <참고 문헌>