p.3552
p.3556
p.3560
p.3564
p.3568
p.3575
p.3579
p.3583
p.3588
A Reconfigurable Radix-r FFT Hardware Structure Design
Abstract:
A reconfigurable radix-r FFT structure design is proposed, to reduce the memory and time consumption caused by zero-paddling in traditional radix-2/4 methods. The radix-r FFT computing flow is divided into three iterative steps: rotate factors computation; memory access schedule; butterfly coefficients matrix multiplication. The hardware structure is depicted, in which the memory accessing schedule is implemented by a finite state machine, the rotate factors and butterfly coefficients are calculated by the Taylor series expansion. The time consumption of the proposed structure is analyzed, and with the arbitrary data points, an optimized radix can be used to minimize the computing time. Compared with traditional methods, the proposed design has the advantage of generality, less time consumption and hardware costs.
Info:
Periodical:
Pages:
3568-3574
Citation:
Online since:
September 2014
Authors:
Keywords:
Price:
Сopyright:
© 2014 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: