In this paper, we examine the FFT of sequences x„ = xN + „ with period N that satisfy certain symmetric relations. It is known that one can take advantage of these relations in order to reduce the computing time required by the FFT. For example, the time required for the FFT of a real sequence is about half that required for the FFT of a complex sequence. Also, the time required for the FFT of ...

The fast Fourier transform (FFT), which is employed by all commercially available ultrasonic systems, provides a time-frequency representation of Doppler ultrasonic signals obtained from blood flow. The FFT assumes that the signal is stationary within the analysis window. However, the presence of short duration embolic signals invalidates this assumption. For optimal detection of embolic signal...

In this Paper, the architecture and FPGA implementation of a Coordinate Rotation Digital Computer (CORDIC) pipeline Fast Fourier Transform (FFT) processor is presented. Fast Fourier Transforms (FFT) is highly efficient algorithm which uses Divide and Conquer approach for speedy calculation of Discrete Fourier transform (DFT) to obtain the frequency spectrum. CORDIC algorithm which is hardware e...

With the advent of deep submicron very large scale integration technology, the integration of a large fast-Fourier-transform (FFT) network into a single chip is becoming possible. However, a practical FFT chip is normally very big, so effective testing and fault-tolerance techniques usually are required. In this paper, we first propose a C-testable FFT network design. Only 20 test patterns are ...

Overlapped FFT has been proposed as a signal detection scheme in dynamic spectrum access to reduce the variance of the noise and improve the detection probability. However, the improvement of the detection probability in the conventional overlapped FFT is bounded with the upper limit of the overlap ratio. This paper proposes a new overlapped FFT scheme using additional frames. In the proposed s...

In this dissertation, we present a framework for expressing, evaluating and executing dynamic schedules for FFT computation on hierarchical and shared memory multiprocessor / multi-core architectures. The framework employs a two layered optimization methodology to adapt the FFT computation to a given architecture and dataset. At installation time, the code generator adapts to the microprocessor...

This paper presents an eecient data-parallel algorithm for general convolutions, and compares its performance on the CM-5 to FFT frequency ltering. Sequential FFT lters are faster than sequential convo-lutions for windows beyond a very small size, typically 6 6 pixels. Our folded convolution algorithm shifts the convolution/FFT performance crossover to much larger lter sizes. For 256256 images ...

The FFT processor serves as one of core components in numerous DSP-based systems, such as OFDM in modern wireless communication. While creating an FFT processor, key parameters, such as architecture, wordlength, and number format, must be all considered very carefully. In this paper, we propose an optimization flow that properly scales fixed-point numeric values at each butterfly stage to maxim...

The Discrete Fourier Transform (DFT) is used to transform the samples in time domain into frequency domain coefficients. The Fast Fourier Transform (FFT) is a widely used algorithm that computes the Discrete Fourier Transform (DFT) using much less operations than a direct realization of the DFT. FFTs is of great significance to a wide variety of applications such as data compression, spectral a...