旋轉(zhuǎn)因子合并的頻率抽取FFT算法RCFA的新解釋
TWIDDLE FACTOR MERGED FREQUENCY-DECIMAL FFT ALGORITHMA NEW EXPLANATION FOR RCFA
-
摘要: 對頻率抽取FFT算法進(jìn)行修改,將兩級旋轉(zhuǎn)因子進(jìn)行合并,得到旋轉(zhuǎn)因子合并的頻率抽取FFT算法。它與馬滕斯(Martens)利用多項(xiàng)式代數(shù)理論導(dǎo)出的遞歸割圓因式分解算法(RCFA)結(jié)果完全相同,具有結(jié)構(gòu)簡單、計(jì)算效率高的優(yōu)點(diǎn)。與RCFA相比,它便于被工程技術(shù)人員理解和使用,還很容易被推廣到時(shí)間抽取的情況。
-
關(guān)鍵詞:
Abstract: Merging the widdle factors in two neighbouring stages for frequency-decimal FFT algorithm, we can obtain the twiddle factor merged frequency-decimal FFT algorithm. Its result is exactly the same as that of the rescursive cyclotomic factorization algorithm (RCFA) which Martens (1984) proposed by using polynomial algebra theory. So it has the advantages of simple structure and high efficiency. It is much easier to be understood and used by engineers than RCFA, and it is also easy to be generalized for the time-decimal case. -
J. B. Martens, IEEE Trans. on ASSP, ASSP-32(1984), 750.[2]A. V. Oppenheim and R. W. Schafer, Digital Siginal Processing, Prentice-Hall Inc., 1975.[3]董士嘉、楊耀增譯,數(shù)字信號處理,科學(xué)出版社,1980. -
計(jì)量
- 文章訪問數(shù): 2383
- HTML全文瀏覽量: 151
- PDF下載量: 941
- 被引次數(shù): 0
下載:
