Twiddle factor memory switching activity analysis of radix-22 and equivalent FFT algorithms
نویسندگان
چکیده
In this paper, we propose equivalent radix-2 algorithms and evaluate them based on twiddle factor switching activity for a single delay feedback pipelined FFT architecture. These equivalent pipeline FFT algorithms have the same number of complex multipliers with the same resolution as the radix2. It is shown that the twiddle factor switching activity of the equivalent algorithms is reduced with up to 40% for some of the equivalent algorithms derived for N = 256.
منابع مشابه
Low- Power Split-radix Fft Processors Using Carry Select
Split-Radix Fast Fourier Transform (SRFFT) is mainly for the implementation of a low-power FFT processor. In FFT algorithms, SRFFT has less number of arithmetic operations. Twiddle factor is required in FFT addressing processors. The signal flow graph of SRFFT is the same as radix-2 FFT and so conventional addressing schemes is used in of SRFFT. However, it has improper arrangement of twiddle f...
متن کاملLow-Power Twiddle Factor Unit for FFT Computation
An integral part of FFT computation are the twiddle factors, which, in software implementations, are typically stored into RAM memory implying large memory footprint and power consumption. In this paper, we propose a novel twiddle factor generator based on reduced ROM tables. The unit supports both radix-4 and mixed-radix-4/2 FFT algorithms and several transform lengths. The unit operates at a ...
متن کاملLow - Power Split - Radix Fft Processors
To design a split radix fast Fourier transform is an ideal person for the implementing of a low-power FFT processor, because it has the lowest number of arithmetic operations among all the FFT algorithms. In the design of such processor, an efficient addressing scheme for FFT data as well as twiddle factors is required. The signal flow of SRFFT is the same as a redix-2 FF, and conventional addr...
متن کاملLong-Point FFT Processing Based on Twiddle Factor Table Reduction
In this paper, we present a new fast Fourier transform (FFT) algorithm to reduce the table size of twiddle factors required in pipelined FFT processing. The table size is large enough to occupy significant area and power consumption in long-point FFT processing. The proposed algorithm can reduce the table size to half, compared to the radix-22 algorithm, while retaining the simple structure. To...
متن کاملA New Approach to Pipeline FFT Processor
A new VLSI architecture for real-time pipeline FFT processor is proposed. A hardware oriented radix-22 algorithm is derived by integrating a twiddle factor decomposition technique in the divide and conquer approach. Radix-22 algorithm has the same multiplicative complexity as radix-4 algorithm, but retains the butterfly structure of radix-2 algorithm. The single-path delay-feedback architecture...
متن کامل