Dynamic partially reconfigurable architecture for fast Fourier transform computation Online publication date: Thu, 31-Jul-2014
by Hung-Lin Chao; Cheng-Chien Wu; Chun-Yang Peng; Chun-Hsien Lu; Jih-Sheng Shen; Pao-Ann Hsiung
International Journal of Embedded Systems (IJES), Vol. 6, No. 2/3, 2014
Abstract: Fast Fourier transform (FFT) is one of the most frequently used computation kernels in modern digital systems, such as in image and signal processing applications. Derivative FFT designs have been proposed for different purposes for a single application. In this work, we propose a novel scalable FFT architecture called dynamic partially reconfigurable fast Fourier transform (DPRFFT) that can support multi-standard applications simultaneously. DPRFFT has multiple pipelines that are time-multiplexed among multiple applications such that significant savings in hardware resources is achieved, under very insignificant performance overhead. DPRFFT performs variable-length FFT from 64 to 8192 points, which cover most of the frequently used modern computing standards.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com