In this paper, we propose a new architecture for the implementation of the N-point Fast Fourier Transform (FFT), based on the Radix-2 Decimation in Frequency algorithm. This architecture is based on a pipeline circuit that can process a stream of samples and produce two FFT transform samples every clock cycle. Compared to existing implementations the architecture proposed achieves double proces...

In this paper, a scaling method for large pipelined FFT implementations is proposed. Compared to existing block scaling methods, like implementations of Convergent Block Floating Point (CBFP), the memory requirements can be reduced while preserving the SNR. The FFT processor is implemented in a 0.35μm standard CMOS technology and is capable of calculating a 2048 complex point FFT or IFFT in 40μ...

Transport Triggered Architecture (TTA) offers a cost-effective tradeoff between the size and performance of ASICs and the programmability of general-purpose processors. This paper presents a study where a high performance, low power TTA processor was customized for a 1024-point complexvalued fast Fourier transform (FFT). The proposed processor consumes only 1.55 μJ of energy for a 1024-point FF...

SVD and FFT are both the efficient tools for image analysis and face recognition. In this paper, we first study the role of SVD and FFT in both filed. Then the decomposition information from SVD and FFT are compared. Next, a new viewpoint that the singular value matrix contains the illumination information of the image is proposed and testified by the experiments based on the ORL face database ...

In this paper, the design of decimation in time Radix-2 FFT processor is presented, which is integrated in FPGA chip, regarding FPGA as design carrier. New butterfly-shaped operation method is proposed based on the traditional FFT algorithm and the analysis of hardware unit, which can reduce multiplication. And it adopted the Look-up table method .The results of hardware test of FFT processor s...

In the Lagrangian approach to 2-dimensional sigma models, B-fields and D-branes contribute topological terms action of worldsheets both open closed strings. We show that these naturally fit into a 2-dimensional, smooth open-closed functorial field theory (FFT) in sense Atiyah, Segal, Stolz-Teichner. give detailed construction this FFT, based on definition suitable bordism category. category, al...

Graphic Processing Units (GPU) has been proved to be a promising platform to accelerate large size Fast Fourier Transform (FFT) computation. However, current GPU-based FFT implementation only uses GPU to compute, but employs CPU as a mere memory-transfer controller. The computation power in today’s high-performance CPU is wasted. In this project, a hybrid optimization framework is proposed to u...