arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0703150math.NAcs.DScs.MScs.NA
收藏

Type-II/III DCT/DST 算法:减少算术运算次数

Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

Xuancheng Shao, Steven G. Johnson

AI总结:

本文提出第二/三类DCT/DST的低复杂度算法,通过将DCT视为对称DFT并剪除冗余运算,将运算次数降至约(17/9)N log2 N,且可进一步节省N次乘法,推广了Arai技术。

摘要:

我们提出了针对第二类和第三类离散余弦变换(DCT)及离散正弦变换(DST)的算法,这些算法在不牺牲数值精度的前提下,实现了比先前已发表算法更低的实数乘法和加法运算次数。渐近地,对于大小为 2 的幂的变换 N,运算次数从约 2N log_2 N 减少到约 (17/9) N log_2 N。此外,我们证明通过对输入或输出进行某种特定的重新缩放,可以进一步节省 N 次乘法,这推广了 Arai 等人针对 N=8 的著名技术。这些结果是通过将 DCT 视为长度为 4N 的 DFT 的特殊情况(具有某些对称性),然后从最近改进的快速傅里叶变换算法(基于共轭对分裂基算法的递归重新缩放)中剪除冗余运算而推导得出的。针对 DCT-III、DST-II 和 DST-III 的改进算法直接从 DCT-II 的改进计数中得出。

英文摘要:

We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical accuracy. Asymptotically, the operation count is reduced from ~ 2N log_2 N to ~ (17/9) N log_2 N for a power-of-two transform size N. Furthermore, we show that a further N multiplications may be saved by a certain rescaling of the inputs or outputs, generalizing a well-known technique for N=8 by Arai et al. These results are derived by considering the DCT to be a special case of a DFT of length 4N, with certain symmetries, and then pruning redundant operations from a recent improved fast Fourier transform algorithm (based on a recursive rescaling of the conjugate-pair split radix algorithm). The improved algorithms for DCT-III, DST-II, and DST-III follow immediately from the improved count for the DCT-II.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑