Application of the fast Fourier transform to calculating pruned convolution

被引：0
|
作者：
P. A. Mikheev
机构：
[1] LLC “Nanotech SVGL”,
来源：
Doklady Mathematics | 2015年 / 92卷
关键词：
Computational Complexity; Fast Fourier Transform; DOKLADY Mathematic; Complexity Constant; Intermediate Data;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
An efficient method for applying the fast Fourier transform to calculate the convolution of twodimensional functions with different grid step sizes at the input and the output is described. A comparison with other methods is performed.
引用
收藏
页码：630 / 633
页数：3
相关论文
共 50 条
12345