3780点FFT处理器的算法研究  

The Algorithm Study of the 3780-point FFT Processor

作　　者：徐晓青[1] 杨霏[1] 李建平[1] 

机构地区：[1]中国传媒大学信息工程学院,北京100024

出　　处：《中国传媒大学学报（自然科学版）》2010年第4期21-24,共4页Journal of Communication University of China：Science and Technology

摘　　要：提出了一种新的3780点FFT处理器的算法分解方式,该种分解方式能够减少一定的运算量和存储空间。同时采用了改进的同址顺序的素因子算法,运算量小,运算速度快,且程序结构规整,利于软、硬件实现。This paper introduces a new decomposed way of algorithm in the design of a 3780-point FFT processor,which can reduce calculation complexity and storage space.It also adopts a modification prime factor algorithm which gives the output both in-place and in-order and saves operation and run time.In addition,the regular program structure of this proposed algorithm is more suitable for implementation in software and hardware.

关 键 词：3780点FFT 素因子算法 同址 顺序 

分 类 号：TP91[自动化与计算机技术]