A new type of integer DCT transform radix and its rapid algorithm
A new type of integer DCT transform radix and its rapid algorithm
复制标题
一种新型整数DCT变换基数及其快速算法
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Yanli Li
中科院分区：
文献类型：
--
作者：
Junqin Wu;Yanli Li
在不改变整数DCT变换基特征的前提下，对其矩阵填充规则进行改进，得到一种新的整数DCT变换基。除了正交性之外，这种整数DCT变换基还满足整数作为矩阵的元素之间的数量关系，并且归一化系数矩阵具有与原始DCT矩阵相似的特性。这类变换基可以用快速蝶形算法实现，在这种快速算法中实现整数DCT，没有乘法，只有加法和移位运算。这种整数DCT快速算法保证了变换运算的准确性，降低了变换运算的复杂度。
Without changing the features of the integer DCT transform radix, improve on its matrix filling rules and get a new type of integer DCT transform radix. Other than orthogonality, such a variety of integer DCT transform radix also meet the quantity relationships between elements of an integer as a matrix, and the normalized coefficients matrix have similar characteristic with the original DCT matrix. This type of transform radix can be implemented by rapid butterfly algorithm, in such fast algorithm implementation of integer DCT, no multiplication, just additions and shifts operations. This fast algorithm of integer DCT ensure the accuracy of transformation operations, reduce the complexity of the transformation operations.