Practical fast 1-D DCT algorithms with 11 multiplications
Practical fast 1-D DCT algorithms with 11 multiplications
复制标题
DOI：
10.1109/icassp.1989.266596
复制
发表时间：
1989-05
期刊：
影响因子：
--
通讯作者：
C. Loeffler;A. Ligtenberg;G. Moschytz
中科院分区：
文献类型：
--
作者：
C. Loeffler;A. Ligtenberg;G. Moschytz
介绍了一类实用的离散余弦变换(DCT)快速算法。对于8点DCT，只需要11次乘法和29次加法。提出了一种系统的方法来生成该类中的不同成员，所有成员都具有相同的最小算术复杂度。许多已发表的算法的结构可以在这个类的成员中找到。给出了该算法对较长变换的扩展。得到的16点DCT只需要31次乘法和81次加法，据作者所知，这比以前发表的算法所需的要少。
A class of practical fast algorithms is introduced for the discrete cosine transform (DCT). For an 8-point DCT only 11 multiplications and 29 additions are required. A systematic approach is presented for generating the different members in this class, all having the same minimum arithmetic complexity. The structure of many of the published algorithms can be found in members of this class. An extension of the algorithm to longer transformations is presented. The resulting 16-point DCT requires only 31 multiplications and 81 additions, which is, to the authors' knowledge, less than required by previously published algorithms.>