ON THE REGULAR STRUCTURE FOR THE FAST 2-D DCT ALGORITHM

被引：26

作者：

CHO, NI

YUN, ID

LEE, SU

机构：

[1] Signal Processing Lab, Department of Control and Instrumentation Engineering, Seoul National University, Shillim-Dong, Kwanak-Gu

来源：

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING | 1993年 / 40卷 / 04期

关键词：

D O I：

10.1109/82.224317

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Recently, a new fast algorithm for 2-D N x N DCT, where N=2m, has been proposed [1]. It requires only half number of multiplications compared to the conventional row-column approach. However, the signal flow graph for the post-addition stage seems very complicated and the order of the output index is seemingly irregular, because the post-addition stage was not based on the mathematical expressions. Consequently, derivation of the signal flow graph becomes complicated as the transform size increases. Hence, In this paper, we present a systematic expressions for the post-addition stage in the 2-D DCT algorithm [1], which enable us to implement any N x N DCT in a straightforward manner. The results show that the signal flow graph from input to output has the recursive structure in which the structure for smaller N reappears for larger N. However, the number of additions increases in the new signal flow graph at the expense of improving the regularity in the structure.

引用

页码：259 / 266

页数：8