卷积(计算机科学)
快速傅里叶变换
中国剩余定理
卷积定理
数学
圆卷积
算法
序列(生物学)
重叠-添加方法
离散傅里叶变换(通用)
余数
离散时间傅里叶变换
雷达FFT算法
傅里叶变换
算术
计算机科学
傅里叶分析
数学分析
分数阶傅立叶变换
人工神经网络
机器学习
生物
遗传学
作者
R. Agarwal,James W. Cooley
出处
期刊:IEEE Transactions on Acoustics, Speech, and Signal Processing
[Institute of Electrical and Electronics Engineers]
日期:1977-10-01
卷期号:25 (5): 392-410
被引量:221
标识
DOI:10.1109/tassp.1977.1162981
摘要
It is shown how the Chinese Remainder Theorem (CRT) can be used to convert a one-dimensional cyclic convolution to a multi-dimensional convolution which is cyclic in all dimensions. Then, special algorithms are developed which, compute the relatively short convolutions in each of the dimensions. The original suggestion for this procedure was made in order to extend the lengths of the convolutions which one can compute with number-theoretic transforms. However, it is shown that the method can be more efficient, for some data sequence lengths, than the fast Fourier transform (FFT) algorithm. Some of the short convolutions are computed by methods in an earlier paper by Agarwal and Burrus. Recent work of Winograd, consisting of theorems giving the minimum possible numbers of multiplications and methods for achieving them, are applied to these short convolutions.
科研通智能强力驱动
Strongly Powered by AbleSci AI