离散分数阶傅里叶变换快速算法的DSP详细实现  

Implementation of fast algorithm of discrete fractional Fourier transform on DSP

作　　者：陈鹏[1] 侯朝焕[1] 梁亦慧 马晓川[1] 

机构地区：[1]中国科学院声学研究所,北京100080 [2]船舶系统工程部,北京100036

出　　处：《应用光学》2007年第2期146-150,共5页Journal of Applied Optics

基　　金：国家自然科学基金资助(60472101)

摘　　要：为满足在数字信号处理器DSP(digital signal processor)上进行离散分数阶傅里叶变换DFRFT(discrete fractional fourier transform)实时计算的要求,通过对多种DFRFT计算方法进行比较,选择Ozaktas提出的DFRFT快速算法进行基于DSP的详细实现处理。在对该快速算法进行理论分析的基础上,将快速算法的计算过程进行优化配置,并给出完整的计算量统计结果。在保证精度要求的情况下,提出的详细实现方法将快速算法的实数乘法计算量减至最小。工程实际应用表明:该方法满足DSP运算精度和实时性要求。In order to meet the requirement of DFRFT（discrete fractional Fourier transform） real-time computation on DSP（digital signal processor）, several DFRFT computation methods are compared and the Ozaktas＇s DFRFT fast algorithm is chosen to do the implementation processing based on DSP. On the basis of theoretical analysis for the fast algorithm, the computation procedure of fast algorithm is optimized, and the complete statistical result of the implementation is given. The amount of real number multiplication computation can be minimized by the proposed fast algorithm for the given accuracy. Engineering practice proves that this solution meets the accuracy requirement and real-time property of DSP computation.

关 键 词：分数阶傅里叶变换 离散分数阶傅里叶变换 快速傅里叶变换 DSP 

分 类 号：TN911.72[电子电信—通信与信息系统]