The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
A recurrence algorithm of FFT
Author(s): 
Pages: 20-23
Year: Issue:  2
Journal: JOURNAL OF YUNAN NORMAL UNIVERSITY(NATURAL SCIENCES EDITION)

Keyword:  离散Fourier变换快速Fourier变换位运算递推算法;
Abstract: 本文对快速Fourier变换算法进行了有益的改进,使得在变换过程中只需利用一个简单的递推表达式a(j)k=a(j-1)x+a(j-1)yωp计算,而其中x,y及p可用位运算得到,易于硬件实现.
Related Articles
No related articles found