A novel architecture FFT processor which can carry on 1-D FFT algorithm or 2-D FFT algorithm corresponding different size of FFT is proposed in this paper. The architecture is served as a scalable IP Core which is suitable for the heterogeneous multi-core SoC on chip application. The mixed architecture FFT processor achieves balance between high processing speed and resources. Compared with a c...

The FFT processor is a very important component in Orthogonal Frequency Division Multiplexing(OFDM) communication system. In this paper, we propose an efficient variable-length radix-8/4/2 FFT architecture for OFDM systems. The FFT processor is based on radix-8 FFT algorithm and also supports radix-4 or radix-2 FFT computation. The pipelined radix-8/4/2 butterfly unit computes radix-8 FFT algor...

The Fast Fourier Transform (FFT) is widely used in various digital signal processing applications. The performance requirements for FFT in modern real-time applications has increased dramatically due to the high demand on capacity and performance of modern telecommunication systems, where FFT plays a major role. Software implementations of FFT running on a general purpose computer can no longer...

Fructans are the main storage compound in Lolium perenne. To account for the prevailing neokestose-based fructan synthesis in this species, a cDNA library of L. perenne was screened by using the onion (Allium cepa) fructan:fructan 6G-fructosyltransferase (6G-FFT) as a probe. A full length Lp6G-FFT clone was isolated with significant homologies to vacuolar type fructosyltransferases and invertas...

an important section of range-doppler imaging algorithm in sar systems which needs large number of resources, memories and solution time, is fft on the azimuth dimension. in this paper, by decomposing the fft relation, and converting to smaller dimension ffts, implementation has been simplified. the proposed method, based on removing the extra phase factors reduces the resources, memories and s...

A radix-16 fast Fourier transform (FFT) algorithm suitable for multiply-add instruction is proposed. The proposed radix-16 FFT algorithm requires fewer floating-point instructions than the conventional radix-16 FFT algorithm on processors that have a multiplyadd instruction. Moreover, this algorithm has the advantage of fewer loads and stores than either the radix-2, 4 and 8 FFT algorithms or t...

OBJECTIVE To investigate the effects of frontal facial type (FFT) and sex on preferred chin projection (CP) in three-dimensional (3D) facial images. METHODS Six 3D facial images were acquired using a 3D facial scanner (euryprosopic [Eury-FFT], mesoprosopic [Meso-FFT], and leptoprosopic [Lepto-FFT] for each sex). After normal CP in each 3D facial image was set to 10° of the facial profile angl...

The FFT processor is a critical block in all multi-carrier systems used primarily in the mobile environment. The portability requirement of these systems is mainly responsible for the need of low power FFT architectures. In this study, an efficient addressing scheme for radix-4 64 point FFT processor is presented. It avoids the modulo-r addition in the address generation; hence, the critical pa...

The original Cooley-Tukey FFT was published in 1965 and presented for sequences with length N equal to a power of two. However, in the same paper they noted that their algorithm could be generalized to composite N in which the length of the sequence was a product of small primes. In 1967, Bergland presented an algorithm for composite N and variants of his mixed radix FFT are currently in wide u...