数据采集与处理2001，Vol.16Issue(1)：42-46,5.
利用循环卷积实现的素长度DCT快速算法
Fast Algorithm for Computing Prime-Length DCT Using Cyclic Convolutions
摘要
Abstract
A new algorithm for the computation of discrete cosine transform(DCT) with odd prime length using cyclic or skew cyclic convolutions is proposed.The algorithm separates DCT coefficients into three parts: DC coefficients, evenand odd-indexed DCT coefficients. According to the number theory a new indexmapping operation is defined. By means of the index-mapping operation,the evenindexed part is converted to a cyclic convolution, and the odd-indexed part is converted to a cyclic or skew cyclic convolution depending on its length. Since efficient and fast cyclic convolution algorithms are available, the algorithm has low computational complexity, simple and regular structure.关键词
离散余弦变换/快速算法/循环卷积/截断正弦离散傅里叶变换/截断余弦离散傅里叶变换分类
信息技术与安全科学引用本文复制引用
殷瑞祥..利用循环卷积实现的素长度DCT快速算法[J].数据采集与处理,2001,16(1):42-46,5.
