Fast Structural Two Dimensional Discrete Cosine Transform Algorithms

スポンサーリンク

概要

• 論文の詳細を見る

• The matrix decomposition of transformation associated with the Kronecker Product not only provides a thoughtful structure in hardware realization but also bestows a skillful tool for complexity evaluation. Hence, there are several fast algorithms developed to achieve efficient computation of two-dimensional(2-D)discrete cosine transform(DCT)with matrix decomposition techniques. However, we found that their derivations associated with their computation structures were not shown formally. In this paper, we propose formal derivations to remedy their deficiencies to acheive more structural 2-D DCT and inverse DCT(IDCT)algorithms. Furthermore, we also show that the remedied algorithms are with less computational complexity and more regular structure for realization.

• 社団法人電子情報通信学会の論文
• 1998-06-25

著者

• YANG Jar-Ferr

  the Department of Electrical Engineering, National Cheng Kung University

• Fan C‐p

  The Department Of Electrical Engineering National Cheng Kung University

• Yang Jar-ferr

  The Department Of Electrical Engineering National Cheng Kung University

• FAN Chih-Peng

  the Department of Electrical Engineering, national Cheng Kung University

関連論文

• Complexity Scalability for ACELP and MP-MLQ Speech Coders
• Transform-Based Vector Quantization Using Bitmap Search Algorithms
• Fast Structural Two Dimensional Discrete Cosine Transform Algorithms

スポンサーリンク