Production costing using mixed-radix and Winograd Fourier transforms
نویسندگان
چکیده
The application of the mixed-radix fast Fourier transform algorithm and the Winograd Fourier transform algorithm for solving a probabilistic production costing problem is proposed. The two algorithms are used to estimate the energy generated by each unit of a generation system directly in the Fourier domain which saves a considerable amount of computational time. A comparison between the two algorithms is provided; both have been applied to the IEEE reliability test system. The results obtained are found to be in close agreement with the results obtained by the basic recursive approach. Sensitivity analysis has been carried out to study the relative efficiency of the two algorithms.
منابع مشابه
Invited Paper Fast Fourier Transforms: a Tutorial Review and a State of the Art
The publication of the Cooley-Tukey fast Fourier transform (FIT) algorithm in 1965 has opened a new area in digital signal processing by reducing the order of complexity of some crucial computational tasks like Fourier transform and convolution from N 2 to N log2 N, where N is the problem size. The development of the major algorithms (Cooley-Tukey and split-radix FFT, prime factor algorithm and...
متن کاملIn-place in-order mixed radix fast Hartley transforms
This paper presents two Fortran programs that calculate the mixed radix discrete Hartley transform (DHT) using a general odd length p-point DHT module and several short length Winograd DHT (WDHT) modules. Each program has its own advantages such as simplicity for implementation or minimum arithmetic complexity. New efficient radix-3, odd radix-p FHT algorithms and short WDHT modules have been d...
متن کاملDesign and Simulation of 32-Point FFT Using Mixed Radix Algorithm for FPGA Implementation
This paper focus on the development of the fast Fourier transform (FFT), based on Decimation-In-Time (DIT) domain by using Mixed-Radix algorithm (Radix-4 and Radix-8).Fast Fourier transforms, popularly known as FFTs, have become an integral part of any type of digital communication system and a wide variety of approaches have been tried in order to optimize the algorithm for a variety of parame...
متن کاملA generator of memory-based, runtime-reconfigurable 2N3M5K FFT engines
Runtime-reconfigurable, mixed-radix FFT/IFFT engines are essential for modern wireless communication systems. To comply with varying standards requirements, these engines are customized for each modem. The Chisel hardware construction language has been used in this work to create a generator of runtimereconfigurable 235 FFT engines targeting software-defined radios (SDR) for modern communicatio...
متن کاملOptimized FFT Algorithm and its Application to Fast GPS Signal Acquisition
The essence of GPS signal acquisition is a two-dimensional search process for the carrier Doppler and code phase, generally including correlator, signal capture device, and logic control module. The disposal efficiency of correlator would affect the capture speed of the whole acquisition process. Because of the corresponding relation between frequencydomain multiplication and time-domain convol...
متن کامل