- 0
- 0
- 约小于1千字
- 约 23页
- 2026-05-11 发布于湖北
- 举报
9.8FFTFFT:fastimplementationoftheDFTCommonprincipleoftheFFTalgorithm:ConverttheDFTofalongsequenceintothemergingoftheDFTsofshortersequences.(组合)
N-DFTBasicmergingunitN/2-DFTN/2-DFTN/2No.ofadditionalmultiplications4482421-DFT2-DFT4-DFT8-DFT1111111122221111Stage1Stage3Stage2
(抽取)(基数)
Foreachk,abutterflyisneeded:numberofmultiplication:1;numberofaddition:2
ThetypicalFFTalgorithmconsistsofthreeparts:(p.518)1.Shuffling(重排)theN-dimensionalinputintoNone-dimensionalsignals.2.PerformingNone-pointDFTs.3.Merg
原创力文档

文档评论(0)