Improved radix-4 and radix-8 FFT algorithms

S Bouguezel, MO Ahmad… - 2004 IEEE International …, 2004 - ieeexplore.ieee.org
In this paper, improved algorithms for radix-4 and radix-8 FFT are presented. This is
achieved by re-indexing a subset of the output samples resulting from the conventional …

Improved twiddle access for fast fourier transforms

KJ Bowers, RA Lippert, RO Dror… - IEEE transactions on …, 2009 - ieeexplore.ieee.org
Optimizing the number of arithmetic operations required in fast Fourier transform (FFT)
algorithms has been the focus of extensive research, but memory management is of …

Fault Prognosis in Smart Distribution System with Distributed Generation Using Fast Fourier Transform Assisted Machine Learning

A Srivastava, S Jha, S Mishra, SK Parida… - IETE Journal of …, 2024 - Taylor & Francis
The affordability and accessibility of electrical data related to microgrids and active
distribution networks (ADN) have significantly improved due to smart digital relays with …

Instruction scheduling heuristic for an efficient FFT in VLIW processors with balanced resource usage

M Bahtat, S Belkouch, P Elleaume, P Le Gall - EURASIP Journal on …, 2016 - Springer
The fast Fourier transform (FFT) is perhaps today's most ubiquitous algorithm used with
digital data; hence, it is still being studied extensively. Besides the benefit of reducing the …

A methodology for speeding up fast fourier transform focusing on memory architecture utilization

VI Kelefouras, GS Athanasiou… - IEEE Transactions …, 2011 - ieeexplore.ieee.org
Several SOA (state of the art) self-tuning software libraries exist, such as the Fastest Fourier
Transform in the West (FFTW) for fast Fourier transform (FFT). FFT is a highly important …

ASIC implementation of high speed processor for calculating discrete fourier transformation using circular convolution technique

P Saha, A Banerjee, A Dandapat… - WSEAS Transactions on …, 2011 - dl.acm.org
The improvement in speed and power for calculating discrete Fourier transformation using
circular convolution is well established, but all the work so far been reported are at FPGA …

A multistandard FFT processor for wireless system-on-chip implementations

R Chidambaram, R Van Leuken… - … on Circuits and …, 2006 - ieeexplore.ieee.org
This paper presents a high performance FFT ASIP. The resulting programmable solution is
scalable for the order of the FFT and capable of satisfying performance requirements of …

Low-cost parallel FFT processors with conflict-free ROM-based twiddle factor generator for DVB-T2 applications

PC Jui, CL Wey, MT Shiue - 2013 IEEE 56th International …, 2013 - ieeexplore.ieee.org
This paper presents a conflict-free ROM addressing scheme for generating the TF tables.
Basically, the conventional (N/2)-words ROM table for the Radix-2 Memory-Based FFT …

Split step method in the analysis and modeling of optical fiber communication system

SV Siddamal, RM Banakar, BC Jinaga - International Conference on …, 2011 - Springer
The increasing complexity of optical processing algorithm has led to the need of developing
the algorithms specifications using software implementation that became in practice the …

[PDF][PDF] Development & Implementation of Visual Approach and Parallel Distributed Architecture for 2-D DFT & UMRT computation

V Bhadran, R Gopikakumari - 2009 - events.cusat.ac.in
Transform theory plays a key role in signal/image processing, as well as in other areas, as it
allows the processing simple and flexible. The Fourier transform is especially prevalent …