Four Parallel Channels Radix-4 FFT with Single Floating-Point Butterfly

Article Preview

Abstract:

An efficient design method of four parallel channels in-order FFT with single floating-point butterfly is proposed, to reduce the resource consumption and improve the real-time calculation ability. The radix-4 FFT is deduced to calculate the access address for four channel data parallel. The hardware architecture of the proposed FFT is presented, and the single precision floating-point adder and multiplier are also depicted. The proposed architecture of a four channels 1024 points radix-4 FFT with single butterfly is implemented in FPGA, and the performance is compared with previous literatures and some EDA corporations IP cores, which shows the correctness and effectiveness of the proposed method.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

708-711

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] H. H. Dam, S. Nordebo, L. K. Teo, FIR design over discrete coefficients and least square error, IEE Proceddings on Vision, Image and Signal Processing, vol. 147, no. 6, p.543–548, (2000).

DOI: 10.1049/ip-vis:20000598

Google Scholar

[2] D. L. Brandon, C. Boyd and N. Govindaraju, Fast computation of general Fourier transforms on GPUs, IEEE Intl. Conf. on Multimedia and Expo, pp.5-8, (2008).

DOI: 10.1109/icme.2008.4607357

Google Scholar

[3] J. -Y. Yu, Y. Li, D. Huang, Design and implementation of high speed single precision floating-point radix-3 butterfly unit, Chinese Journal of Scientific Instrument, vol. 31, no. 12, pp.2675-2681, (2010).

Google Scholar

[4] S. Mou, X. Yang, Design of a high-speed FPGA-based 32-bit floating-point FFT processor, 8th ACIS Intl. Conf. on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, vol. 1, pp.84-87, (2007).

DOI: 10.1109/snpd.2007.46

Google Scholar

[5] Z. Liu, Z. Zhou, Y. Han, Tracking radar digital matched-filter ASIC design and its error analysis, Asia-Pacific Conf. on Circuits and Systems, vol. 1, pp.491-496, (2002).

DOI: 10.1109/apccas.2002.1115039

Google Scholar

[6] Y. -C. Jia, S. -L. Wu, Error analysis of fast Fourier transform, Transactions of Beijing Institute of Technology, vol. 25, no. 6, pp.739-742, (2005).

Google Scholar

[7] Y. -N. Chang, An efficient VLSI architecture for normal I/O order pipeline FFT design, IEEE Trans. on Circuits and Systems-II: Express Briefs, vol. 55, no. 12, pp.1234-1238, (2008).

DOI: 10.1109/tcsii.2008.2008074

Google Scholar

[8] B. -L. Zhu, J. Kong, FPGA Implementation of High Efficiency Pipeline Butterflies, Journal of Electronic Measurement and Instrumrnt, vol. 19, no. 4, pp.77-80, (2005).

Google Scholar

[9] H. Chen, Z. -W. Zhao, ASIC design of floating-point FFT processo, Journal of Beijing Institute of Technology (English Edition), vol. 13, no. 4, pp.389-393, (2004).

Google Scholar

[10] Floating-Point FFT Processor (IEEE 754 Single Precision) Cores, , http: /www. altera. com. cn/produ cts/ip/dsp/transforms/m-ham-fft-float. html.

Google Scholar

[11] Floating Point FFT/IFFT IP Core, , http: /www. dilloneng. com/documents/fpfft_fact. pdf/view.

Google Scholar