A New Base-6 FFT Algorithm

被引:1
作者
ZHANG Qi YI Qing ming ZHOU Weixian HUANG Junkai Deptof ElectronEng Jinan University Guangzhou CHN Guangzhou Communication Research Institute Guangzhou CHN [1 ,1 ,2 ,1 ,1 ,510632 ,2 ,510310 ]
机构
关键词
Digital signal processing; FFT; DFT; Fourier Transform CLC number:TN911.72Document code:;
D O I
暂无
中图分类号
TN911.7 [信号处理];
学科分类号
0711 ; 080401 ; 080402 ;
摘要
A new FFT algorithm has been deduced, which is called the base-6 FFT algorithm. The amount for calculating the DFT of complex sequence of N =2 r by the base-6 FFT algorithm is M r( N )=14/3· N log 6 N -4 N +4 for multiplication operation of real number and A r( N )=23/3· N log 6 N -2 N +2 for addition operation of real number. The amount for calculating the DFT of real sequence is a half of it with the complex sequence.
引用
收藏
页码:23 / 25
页数:3
相关论文
共 2 条
[1]  
Fast Algorithm. JIANG Zeng-rong,ZENG Yong-hong,YU Pin-neng. . 2000
[2]  
Digital Signal Processing. WANG Shi-yi. . 1997