A high-speed low-complexity modified radix-25 FFT processor for gigabit WPAN applications

T Cho, H Lee, J Park, C Park - 2011 IEEE international …, 2011 - ieeexplore.ieee.org
T Cho, H Lee, J Park, C Park
2011 IEEE international symposium of circuits and systems (ISCAS), 2011ieeexplore.ieee.org
In this paper, we present a novel modified radix-2 5 algorithm for 512-point fast Fourier
transform (FFT) computation and high-speed eight-parallel data-path architecture for multi-
gigabit wireless personal area network (WPAN) systems. The proposed FFT processor can
provide a high data throughput and low hardware complexity by using eight-parallel data-
path and multi-path delay-feedback (MDF) structure. The modified radix-2 5 FFT algorithm is
also realized in our processor to reduce the number of complex multiplications and twiddle …
In this paper, we present a novel modified radix-2 5 algorithm for 512-point fast Fourier transform (FFT) computation and high-speed eight-parallel data-path architecture for multi-gigabit wireless personal area network (WPAN) systems. The proposed FFT processor can provide a high data throughput and low hardware complexity by using eight-parallel data-path and multi-path delay-feedback (MDF) structure. The modified radix-2 5 FFT algorithm is also realized in our processor to reduce the number of complex multiplications and twiddle factor look-up tables. The proposed FFT processor has been designed and implemented with 90nm CMOS technology in a supply voltage of 1.2V. The proposed 512-point modified radix-2 5 FFT/IFFT processor has a throughput rate of up to 2.8 GS/s at 350 MHz while requiring much smaller hardware complexity and low power consumption.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果