Ma Xiao, Gao Li-Ning, Liu Teng-Fei, Jin Ye. Cache-optimized Implementation of Long Sequences FFT on TS201[J]. Journal of Electronics & Information Technology, 2013, 35(7): 1774-1778. doi: 10.3724/SP.J.1146.2012.01608
Citation:
Ma Xiao, Gao Li-Ning, Liu Teng-Fei, Jin Ye. Cache-optimized Implementation of Long Sequences FFT on TS201[J]. Journal of Electronics & Information Technology, 2013, 35(7): 1774-1778. doi: 10.3724/SP.J.1146.2012.01608
Ma Xiao, Gao Li-Ning, Liu Teng-Fei, Jin Ye. Cache-optimized Implementation of Long Sequences FFT on TS201[J]. Journal of Electronics & Information Technology, 2013, 35(7): 1774-1778. doi: 10.3724/SP.J.1146.2012.01608
Citation:
Ma Xiao, Gao Li-Ning, Liu Teng-Fei, Jin Ye. Cache-optimized Implementation of Long Sequences FFT on TS201[J]. Journal of Electronics & Information Technology, 2013, 35(7): 1774-1778. doi: 10.3724/SP.J.1146.2012.01608
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 Caches miss influence on efficiency. The new method makes maximum use of the Caches 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.