排序方式: 共有5条查询结果,搜索用时 15 毫秒
1
1.
2.
二维离散余弦变换的一种新的快速算法 总被引:1,自引:0,他引:1
介绍了二维离散余弦变换的一种新的快速算法,对N×N DCT(N=2^m),只需用N个一维DCT和若干加法运算,与常规的行-列法相比,所需的乘法运算量减少了一半,也比其它快速算法的乘法运算量要少,而加法支算量基本上是相同的。 相似文献
3.
二维离散余弦变换的一种新的快速算法 总被引:2,自引:0,他引:2
本文介绍了二维离散余弦变换(DCT)的一种新的快速算法,对于N×N DCT(N=2^m),只需用N个一维DCT和若干加法运算。与常规的行-列法相比,所需的乘法运算量减少了一半,也比其它的快速算法的乘法运算量要少,而加法运算量基本上是相同的。 相似文献
4.
5.
In this paper, a new algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N×N DCT, where N = 2m, can be computed using only N 1-D DCT's and additions, instead of using 2N 1-D DCT's as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only half of that required for the row-column approach, and is also less than that of most of other fast algorithms, while the number of additions is almost comparable to that of others. 相似文献
1