Construction of an algorithm in parallel for the Fast Fourier Transform
نویسندگان
چکیده
It has been designed, built and executed a code for the Fast Fourier Transform (FFT), compiled and executed in a cluster of 2n computers under the operating system MacOS and using the routines MacMPI. As practical application, the code has been used to obtain the transformed from an astronomic imagen, to execute a filter on its and with a transformed inverse to recover the image with the variates given by the filter. The computers arrangement are installed in the Observatorio Astronómico National in Colombia under the nameOAN Cluster, and in this has been executed several applications.
منابع مشابه
An Experimental Study on Blinking and Eye Movement Detection via EEG Signals for Human-Robot Interaction Purposes Based on a Spherical 2-DOF Parallel Robot
Blinking and eye movement are one of the most important abilities that most people have, even people with spinal cord problem. By using this ability these people could handle some of their activities such as moving their wheelchair without the help of others. One of the most important fields in Human-Robot Interaction is the development of artificial limbs working with brain signals. The purpos...
متن کاملImproving the RX Anomaly Detection Algorithm for Hyperspectral Images using FFT
Anomaly Detection (AD) has recently become an important application of target detection in hyperspectral images. The Reed-Xialoi (RX) is the most widely used AD algorithm that suffers from “small sample size” problem. The best solution for this problem is to use Dimensionality Reduction (DR) techniques as a pre-processing step for RX detector. Using this method not only improves the detection p...
متن کاملCompensation of Doppler Effect in Direct Acquisition of Global Positioning System using Segmented Zero Padding
Because of the very high chip rate of global positioning system (GPS), P-code acquisition at GPS receiver will be challenging. A variety of methods for increasing the probability of detection and reducing the average time of acquisition have been provided, among which the method of Zero Padding (ZP) is the most essential and the most widely used. The method using the Fast Fourier Transform (FFT...
متن کاملFast Fourier Transform BYLINE
A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) of an input vector. Efficient means that the FFT computes the DFT of an n-element vector in O(n logn) operations in contrast to the O(n2) operations required for computing the DFT by definition. FFTs exist for any vector length n and for real and higher-dimensional data. Parallel FFTs have b...
متن کاملMathematical model of honeycomb construction
We developed a mathematical model and an algorithm for numerical treatment of a model of honeycomb construction in a beehive. The model contains essential features of the bee-bee and bee-wax interactions, and in a qualitative way captures the dynamics of parallel comb construction. The construction is represented by a set of dynamical coupled partial differential equations for the density of be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.DC/0103001 شماره
صفحات -
تاریخ انتشار 2001