返回
Implementation of FFT on FPGA using Verilog HDL

Implementation of FFT on FPGA using Verilog HDL

ID：39970707

大小：1.00 MB

页数：21页

时间：2019-07-16

Implementation of FFT on FPGA using Verilog HDL_第1页
Implementation of FFT on FPGA using Verilog HDL_第2页
Implementation of FFT on FPGA using Verilog HDL_第3页
Implementation of FFT on FPGA using Verilog HDL_第4页
Implementation of FFT on FPGA using Verilog HDL_第5页
资源描述：

《Implementation of FFT on FPGA using Verilog HDL》由会员上传分享，免费在线阅读，更多相关内容在学术论文-天天文库。

1、ImplementationofFastFourierTransform(FFT)onFPGAusingVerilogHDLAnAdvanced-VLSI-Design-Lab(AVDL)Term-Project,VLSIEngineeringCourse,Autumn2004-05,Deptt.OfElectronics&ElectricalCommunication,IndianInstituteofTechnologyKharagpurUndertheguidanceofProf.Swapn

2、aBanerjeeDeptt.OfElectronics&ElectricalCommunicationEngg.IndianInstituteofTechnologyKharagpur.SubmittedbyAbhishekKesh(02EC1014)ChintanS.Thakkar(02EC3010)RachitGupta(02EC3012)SiddharthS.Seth(02EC1032)T.Anish(02EC3014)1ACKNOWLEDGEMENTSItiswithgreatrever

3、encethatwewishtoexpressourdeepgratitudetowardsourVLSIEngineeringProfessorandFacultyAdvisor,Prof.SwapnaBanerjee,DepartmentofElectronics&ElectricalCommunication,IndianInstituteofTechnologyKharagpur,underwhosesupervisionwecompletedourwork.Herastuteguidan

4、ce,invaluablesuggestions,enlighteningcommentsandconstructivecriticismalwayskeptourspiritsupduringourwork.WewouldbeaccusedofingratitudeifwefailedtomentiontheconsistentencouragementandhelpextendedbyMr.KailashChandraRay,GraduateResearchAssistant,duringou

5、rTerm-Projectwork.ThebrainstormingsessionsatAVDLspentdiscussingvariouspossiblearchitecturesfortheFFTwereveryeducativeforusnoviceVLSIstudents.Ourexperienceinworkingtogetherhasbeenwonderful.Wehopethattheknowledge,practicalandtheoretical,thatwehavegained

6、throughthistermprojectwillhelpusinourfutureendeavoursinthefieldofVLSI.AbhishekKeshChintanS.ThakkarRachitGuptaSiddharthS.SethT.Anish21.FASTFOURIERTRANSFORMSThenumberofcomplexmultiplicationandadditionoperationsrequiredbythesimpleformsboththeDiscreteFour

7、ierTransform(DFT)andInverseDiscreteFourierTransform2(IDFT)isoforderNasthereareNdatapointstocalculate,eachofwhichrequiresNcomplexarithmeticoperations.Forlengthninputvectorx,theDFTisalengthnvectorX,withnelements:2Incomputersciencejargon,wemaysaytheyhave

8、algorithmiccomplexityO(N)andhenceisnotaveryefficientmethod.Ifwecan'tdoanybetterthanthisthentheDFTwillnotbeveryusefulforthemajorityofpracticalDSPapplications.However,thereareanumberofdifferent'FastFourierTransform'(FFT)algorithmsthatenabletheca

当前文档最多预览五页，下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页，下载文档查看全文
温馨提示：
1. 部分包含数学公式或PPT动画的文件，查看预览时可能会显示错乱或异常，文件下载后无此问题，请放心下载。
2. 本文档由用户上传，版权归属用户，天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容，确认文档内容符合您的需求后进行下载，若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误，付费完成后未能成功下载的用户请联系客服处理。