NEW FAST ALGORITHM FOR TWO-DIMENSIONAL DISCRETE FOURIER-TRANSFORM DFT(2N-2)

被引：5
|
作者：
MA, WZ
YANG, DK
机构：
[1] South China Univ of Technology, China
来源：
ELECTRONICS LETTERS | 1989年 / 25卷 / 01期
关键词：
Computer Programming--Algorithms;
D O I：
10.1049/el:19890015
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
We present a new fast algorithm for computing the two-dimensional discrete Fourier transform DFT(2n; 2) using the fast discrete cosine transform algorithm. The algorithm has a lower number of multiplications and additions compared with other published algorithms for computing the two-dimensional DFT. Because it uses only real multiplications, the algorithm is more suitable for real input data.
引用
收藏
页码：21 / 22
页数：2
相关论文
共 50 条
12345