DFT(Discrete Fourier Transformation)是數字信號分析與處理如圖形、語音及圖像等領域的重要變換工具,直接計算DFT的計算量與變換區間長度N的平方成正比.當N較大時,因計算量太大,直接用DFT算法進行譜分析和喜好的實時處理是不切實際的.快速傅里葉變換(Fast Fourier Transformation,簡稱FFT)使DFT運算效率提高1~2個數量級.本文的目的就是研究如何應用FPGA這種大規模可編程邏輯器件實現FFT的算法.本設計主要采用先進的基-4DIT算法研制一個具有實用價值的FFT實時硬件處理器.在FFT實時硬件處理器的設計實現過程中,利用遞歸結構以及成組浮點制運算方式,解決了蝶形計算、數據傳輸和存儲操作協調一致問題.合理地解決了位增長問題.同時,采用并行高密度乘法器和流水線(pipeline)工作方式,并將雙端口RAM、只讀ROM全部內置在FPGA芯片內部,使整個系統的數據交換和處理速度得以很大提高,實際合理地解決了資源和速度之間相互制約的問題.本設計采用Verilog HDL硬件描述語言進行設計,由于在設計中采用Xilinx公司提供的稱為Core的IP功能塊極大地提高了設計效率.
標簽：
FPGA
FFT
數字處理器
硬件實現
上傳時間：
2013-06-20
上傳用戶：小碼農lz
GloptiPoly 3: moments, optimization and
semidefinite programming.
Gloptipoly 3 is intended to solve, or at least approximate, the Generalized Problem of
Moments (GPM), an infinite-dimensional optimization problem which can be viewed as
an extension of the classical problem of moments [8]. From a theoretical viewpoint, the
GPM has developments and impact in various areas of mathematics such as algebra,
Fourier analysis, functional analysis, operator theory, probability and statistics, to cite
a few. In addition, and despite a rather simple and short formulation, the GPM has a
large number of important applications in various fields such as optimization, probability,
finance, control, signal processing, chemistry, cristallography, tomography, etc. For an
account of various methodologies as well as some of potential applications, the interested
reader is referred to [1, 2] and the nice collection of papers [5].
標簽：
optimization
semidefinite
programming
GloptiPoly
上傳時間：
2016-06-05
上傳用戶：lgnf
