제어로봇시스템학회:학술대회논문집

Institute of Control, Robotics and Systems (제어로봇시스템학회)
권호 표지

The fast DCT algorithm based on the new prime factor and common factor decomposition

  • Choi, Byeong-Ho (CAD and Communication Circuit Lab., Dept. of Electronic Eng. Hanyang Univ., Video Lab.) ;
  • Kim, Jong-Uk (CAD and Communication Circuit Lab., Dept. of Electronic Eng. Hanyang Univ., Video Lab.) ;
  • Suh, Ki-Bum (CAD and Communication Circuit Lab., Dept. of Electronic Eng. Hanyang Univ., Video Lab.) ;
  • Chong, Jong-Wha (CAD and Communication Circuit Lab., Dept. of Electronic Eng. Hanyang Univ., Video Lab.) ;
  • Bang, Gyo-Yoon (GoldStar Co., Ltd)
  • Published : 1992.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we present a nev algorithm for the fast computation of the discrete cosine transform(DCT). This algorithm consists of the three dimensional prime factor-decomposed algorithm(PFA) and three dimensional common factor-decomposed algorithm(CFA). We can compute N-point DCT for the number N decomposable Into three relative prime numbers using PFA and into three common numbers using CFA. We also show input and output index mapping for the three decomposition. it results in requiring fever multiplicaions than the previous algorithms. Particularly, for the large number N, it is more powerful in reducing the number of multiplication.

Keywords