基于TMS320C6201的离散分数阶傅立叶变换快速算法详细实现

Detailed Implementations of Discrete Fractional Fourier Transform's Fast Algorithm

各种离散分数阶傅立叶变换DFRFT(Discrete Fractional Fourier Transform)算法的发展促进了分数阶傅立叶变换FRFT(Fractional Fourier Transform)在数字信号处理领域的应用。本文首先介绍了FRFT的定义和特性,并给出了几种DFRFT计算方法的比较。在对Ozaktas提出的DFRFT快速算法理论分析基础上,本文给出了基于TMS320C6201定点数字信号处理器DSP(Digital Signal Processor)的快速算法详细实现。该详细充分利用FFT计算和数学处理来有效降低算法的运算量。

The development of various DFRFT（ Discrete Fractional Fourier Transform） algorithms accelerate the applications of FRFT （ Fractional Fourier Transform） in the domain of digital signal processing. This article introduces the definition and properties of FRFT firstly, and gives the comparisons of several algorithms used in DFRFT computation. On the basis of theoretical analysis to Ozaktas＇ s DFRFT fast algorithm, this thesis gives the detailed implementations of fast algorithm based on TMS320C6201 fixed - point DSP（ Digital Signal Processor）. This detailed implementation uses FFT operation and mathematical processing to reduce the computation burden efficiently.