Abstract:This paper presents an efficient architecture for performing 128 points to 1M points Fast Fourier Transformation (FFT) based on mixed radix-2/4/8 butterfly unit. The proposed FFT architecture reduces the computation cost by taking the advantage of the radix-8 FFT algorithm while remaining compatible with sequences whose data length is an integral power of 2. Further optimizations for reconfigurable application specified processor are developed. First, we propose a separated radix-2/4/8 butterfly unit which is … Show more
“…However, it requires 12 FPGAs (8 for the FFT computations and 4 for control). If we normalize the number of FFT calculations per second by the number of devices, the proposed approach achieves 222 FFTs/Device/s, which is higher than in [5] and [4].…”
Section: Experimental Results and Comparisonmentioning
confidence: 98%
“…Fig. 5(b) shows the architecture in [5]. It is a memory-based FFT where the FFT is calculated in 2 epocs.…”
Section: Rotations In Fixed-point Arithmeticmentioning
confidence: 99%
“…By combining the use of radix-2 4 or radix-2 5 and the late placement of the W 1M , there exist three alternative algorithms, which are shown in Fig. 7…”
Section: A Selection Of the Fft Algorithmmentioning
confidence: 99%
“…In radio astronomy, large FFTs allow for wide-band high-resolution spectrum analysis [1]- [3] and lead to precise images of all kinds of astronomical objects [4]. In radar, sonar and echo-graphy, large FFTs for pulse compression increase the range resolution and the signal-to-noise ratio [5]. Likewise, large FFT can be used to detect frequency hopping transmissions [6].…”
Section: Introductionmentioning
confidence: 99%
“…Indeed, current implementations of 1 million-point FFTs use various interconnected fieldprogrammable gate arrays (FPGAs) [4]. The alternatives are to resort to application-specific integrated circuits [5] or, if the application allows for it, the use of a sparse FFT [6] instead of a conventional FFT.…”
In this paper, we present the first implementation of a 1 million-point fast Fourier transform (FFT) completely integrated on a single field-programmable gate array (FPGA), without the need for external memory or multiple interconnected FPGAs. The proposed architecture is a pipelined single-delay feedback (SDF) FFT. The architecture includes a specifically designed 1 million-point rotator with high accuracy and a thorough study of the word length at the different FFT stages in order to increase the signal-to-quantization-noise ratio (SQNR) and keep the area low. This also results in low power consumption.
“…However, it requires 12 FPGAs (8 for the FFT computations and 4 for control). If we normalize the number of FFT calculations per second by the number of devices, the proposed approach achieves 222 FFTs/Device/s, which is higher than in [5] and [4].…”
Section: Experimental Results and Comparisonmentioning
confidence: 98%
“…Fig. 5(b) shows the architecture in [5]. It is a memory-based FFT where the FFT is calculated in 2 epocs.…”
Section: Rotations In Fixed-point Arithmeticmentioning
confidence: 99%
“…By combining the use of radix-2 4 or radix-2 5 and the late placement of the W 1M , there exist three alternative algorithms, which are shown in Fig. 7…”
Section: A Selection Of the Fft Algorithmmentioning
confidence: 99%
“…In radio astronomy, large FFTs allow for wide-band high-resolution spectrum analysis [1]- [3] and lead to precise images of all kinds of astronomical objects [4]. In radar, sonar and echo-graphy, large FFTs for pulse compression increase the range resolution and the signal-to-noise ratio [5]. Likewise, large FFT can be used to detect frequency hopping transmissions [6].…”
Section: Introductionmentioning
confidence: 99%
“…Indeed, current implementations of 1 million-point FFTs use various interconnected fieldprogrammable gate arrays (FPGAs) [4]. The alternatives are to resort to application-specific integrated circuits [5] or, if the application allows for it, the use of a sparse FFT [6] instead of a conventional FFT.…”
In this paper, we present the first implementation of a 1 million-point fast Fourier transform (FFT) completely integrated on a single field-programmable gate array (FPGA), without the need for external memory or multiple interconnected FPGAs. The proposed architecture is a pipelined single-delay feedback (SDF) FFT. The architecture includes a specifically designed 1 million-point rotator with high accuracy and a thorough study of the word length at the different FFT stages in order to increase the signal-to-quantization-noise ratio (SQNR) and keep the area low. This also results in low power consumption.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.