快速傅立葉變換算法研究與設(shè)計(jì).pdf

1、華中科技大學(xué)碩士學(xué)位論文快速傅立葉變換算法研究與設(shè)計(jì)姓名：許偉濤申請學(xué)位級別：碩士專業(yè)：系統(tǒng)分析與集成指導(dǎo)教師：王乘20050507IIAbstractFastFourierTransfm(FFT)processsarewidelyusedindifferentapplicationareassuchascommunicationsradarsimagingwirelesswketc.Enhancingtheperfmanceofthe

2、FFTisamajconcernfresearchers.Previouslyresearchhasconcentratedonspeedenhancementhoweverwiththeadventofptablecomputationareaspeciallypowerconsumptionhavebecomeofspecialinterest.TomeasurethecomplexityefficiencyofanFFTalgit

3、hmdependsonboththeavailabletechnologytheintendedapplications.Wecanseethatthereisamemyaccessproblemwithpreviouslyproposedapproaches.FinstanceunlesstheprocesswheretheFFTrunsprovidesalargenumberofregistersrepeatedaccesstoth

4、ememytoloadsametwiddlefactsisunavoidable.Ithasbeenrecognizedthatmemyaccessisexpensiveduetolonglatencyhighpowerconsumption.SomemyaddressingisakeyresearchconcernfenhancingtheperfmanceofFFTprocesss.Inthispaperwesimplydiscus

5、stheradix2algithmtheaddressgenerationfbutterflyoperations.WealsodiscussthearchitectureoftheFFT’smemyaneffectivememyaddressingscheme.WepresentanovelFFTalgithmtoreducethefrequencyofmemyaccessaswellasmultiplicationoperation

6、s.OurwkistomakeitpossibletoimprovetheperfmanceofFFTprocesssreducethedelayofaddressgenerationtominimum.Weanalysisthehardwarecomplexitytheprocessingtimeoftheproposedschemecompareitwiththeotherexistingschemes.Afterthiswedes

7、igntheFFTwiththetwodistinctsections:(1)Thecoefficientmemycanbecuttoalmostafactoffour(N8).(2)Allthebutterfliessharingthesamecoefficientwillbeclusteredcomputedtogether.Inthiswayredundantmemyaccesstoloadcoefficientsisavoide