基于Cache优化的大点数FFT在TS201上的实现  

Cache-optimized Implementation of Long Sequences FFT on TS201

作　　者：马潇[1] 高立宁[1] 刘腾飞[1] 金烨[1] 

机构地区：[1]北京理工大学信息与电子学院,北京100081

出　　处：《电子与信息学报》2013年第7期1774-1778,共5页Journal of Electronics & Information Technology

摘　　要：该文针对现有大点数快速傅里叶变换(FFT)在TS201处理器上的实现没有充分考虑Cache丢失对执行效率影响的问题,提出了改进型Winograd算法的实现方法。该改进型方法通过优化行列读取方法,最大程度利用Cache的读写特点,避免了三次显性转置;并通过重构蝶形运算,隐藏了乘铰链因子。实例测试与现有处理方法对比结果表明,Cache优化的大点数FFT执行速度有了明显提高,可用于雷达处理系统中的脉冲压缩的快速实现。This paper proposes an improved method for Winograd algorithm to solve the problem that the existing methods of long sequences Fast Fourier Transform（FFT） on the TS201 processor does not take full account of the Cache＇s miss influence on efficiency.The new method makes maximum use of the Cache＇s advantages in reading and writing by optimizing the access method of rows and columns to avoid three explicitly matrix transposition,and hiding the twiddle factor multiplication by reconfiguration butterfly computation.Test results show that the performance of Cache-optimized implementation of FFT is significantly improved,and it can be used for fast acquisition of pulse-compression in radar system.

关 键 词：雷达信号处理 脉冲压缩 TS201 CACHE Winograd算法 大点数FFT 

分 类 号：TN957.51[电子电信—信号与信息处理]