時間抽取情況下的旋轉(zhuǎn)因子合并FFT算法和TMFFT的軟件實現(xiàn)
TWIDDLE FACTOR MERGED TIME-DECIMAL FFT ALGORITHM AND THE SOFTWARE IMPLEMENTATION FOR TMFFT
-
摘要: 馬滕斯(Martens)提出了一種效率高(可與WFTA法和PFA法相比擬)、結(jié)構(gòu)簡單(與FFT法相似)的DFT計算方法RGFA。作者已經(jīng)證明,在基2的情況下,RCFA與旋轉(zhuǎn)因子合并的頻率抽取FFT算法是完全等價的。本文給出了旋轉(zhuǎn)因子合并的時間抽取FFT算法,從而使得在任何條件下,目前使用的FFT算法都可以用外部特性完全相同、內(nèi)部結(jié)構(gòu)基本相同的高效算法旋轉(zhuǎn)因子合并FFT算法來代替。本文還給出了實現(xiàn)旋轉(zhuǎn)因子合并FFT算法的軟件。
-
關(guān)鍵詞:
- FFT算法; 旋轉(zhuǎn)因子合并FFT算法; 軟件實現(xiàn)
Abstract: Martens (1984) proposed a high efficient and simple formed DFT algorithm-RCFA,, whose efficiency can be compared with that of WFTA or that of PFA, and whose structure is similar to that of FFT. The authors have proved that, in the case of radix 2, the RCFA is exactly equivalent to the twiddle factor merged frequency-decial FFT algorithm. The twiddle factor merged time-decimal FFT algoorithm is provided in this paper. Thus, in anycase, the FFT algorithm used currently can be replaced by the more efficient algorithm--the twiddle factor merged FFT algorithm, with exactly the same external property and the similar internal structure. In addition, the software for implementing the twiddle factor merge FFT algorithm (TMFFT) is also provided. -
J. B. Martens, IEEE Trans. on ASSP, ASSP-32(1984), 750.[2]許蔚,陳宗鷺,電子科學(xué)學(xué)刊,9(1987), 229 -234.[3]A. V. Oppenheim, R. W. Schafer, Digital Signalnal Processing, Prentice-Hall Inc., 1975; 董世嘉,楊耀增譯,數(shù)字信號處理,科學(xué)出版社,1980.[4]許蔚,合成孔徑雷達(dá)信號數(shù)字處理,中國科學(xué)技術(shù)大學(xué)六系碩士論文,1984年6月.[5]T. V. Sreenivas, P. V.S. Rao, IEEE Trans. on ASSP, ASSP-28(1980), 254. -
計量
- 文章訪問數(shù): 2647
- HTML全文瀏覽量: 153
- PDF下載量: 832
- 被引次數(shù): 0
下載:
