Efficient algorithm for 2-D arithmetic Fourier transform

被引：2

作者：

Ge, XJ ^{[1
]}

Chen, NX ^{[1
]}

Chen, ZD ^{[1
]}

机构：

[1] CCAST,WORLD LAB,BEIJING 100080,PEOPLES R CHINA

来源：

IEEE TRANSACTIONS ON SIGNAL PROCESSING | 1997年 / 45卷 / 08期

关键词：

D O I：

10.1109/78.611235

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This correspondence presents an efficient algorithm for the two-dimensional (2-D) arithmetic Fourier transform (AFT) based on the Mobius inversion formula of odd number series. It requires fewer multiplications and has less complexity over previous algorithms. In addition, a technique is proposed to carry out the on-axis Fourier coefficients. A parallel VLSI architecture is developed for the new algorithm.

引用

页码：2136 / 2140

页数：5

共 9 条

[1] BRUNS H, 1903, GRUNDLINIEN WISSENSC
[2] Hua L.-K., 1982, INTRO NUMBER THEORY
[3] EFFICIENT VLSI ARCHITECTURES FOR THE ARITHMETIC FOURIER-TRANSFORM (AFT)
KELLEY, BT
MADISETTI, VK
[J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1993, 41 (01) : 365 - 384
[4] FOURIER-ANALYSIS AND SIGNAL-PROCESSING BY USE OF THE MOBIUS-INVERSION FORMULA
REED, IS
TUFTS, DW
YU, XL
TRUONG, TK
SHIH, MT
YIN, XW
[J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1990, 38 (03): : 458 - 470
[5] REED IS, P SPIE INT SOC OPT E, P54
[6] SHIH MT, 1992, IEEE T SIGNAL PROCES, V40, P1122
[7] TEPEDELENLIOGLU N, 1989, IEEE T ACOUST SPEECH, V37, P1146, DOI 10.1109/29.32291
[8] TUFTS DW, 1988, IEEE ASSP MAG, P13
[9] TUFTS DW, 1989, SPIE HIGH SPEED COMP, V1058, P46

← 1 →