Relevant bibliographies by topics / Fast Fourier Transform (Fft) Algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Fast Fourier Transform (Fft) Algorithm'

Author: Grafiati
Published: 11 September 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Fast Fourier Transform (Fft) Algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Fast Fourier Transform (Fft) Algorithm"

1

Chandra Yadav, Subhash, Pradeep Juneja, and R. G. Varshney. "Optimization of Resource Utilization of Fast Fourier Transform." International Journal of Reconfigurable and Embedded Systems (IJRES) 6, no. 3 (May 28, 2018): 186. http://dx.doi.org/10.11591/ijres.v6.i3.pp186-190.

Full text
Abstract:
<span style="font-size: 9pt; font-family: 'Times New Roman', serif;" lang="EN-IN">This paper considers the optimization of resource utilization for three FFT algorithms, as it pertains not to the input samples or output modes, but to the <em>twiddle factors </em>that arise in Cooley-Tukey FFT algorithms. Twiddle factors are a set of complex roots of unity, fixed by the transform order for the particular algorithm. This paper shows the comparison between three known FFT algorithms, DIT-FFT, DIF-FFT and G<sup>T</sup> algorithm. All these algorithms are implemented on FPGA (Spartan-3 XC3S4000l-4fg900) with XILINX 10.1 ISE.</span>
APA, Harvard, Vancouver, ISO, and other styles
2

Byun, Keun-Yung, Chun-Su Park, Jee-Young Sun, and Sung-Jea Ko. "Vector Radix 2 × 2 Sliding Fast Fourier Transform." Mathematical Problems in Engineering 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/2416286.

Full text
Abstract:
The two-dimensional (2D) discrete Fourier transform (DFT) in the sliding window scenario has been successfully used for numerous applications requiring consecutive spectrum analysis of input signals. However, the results of conventional sliding DFT algorithms are potentially unstable because of the accumulated numerical errors caused by recursive strategy. In this letter, a stable 2D sliding fast Fourier transform (FFT) algorithm based on the vector radix (VR) 2 × 2 FFT is presented. In the VR-2 × 2 FFT algorithm, each 2D DFT bin is hierarchically decomposed into four sub-DFT bins until the size of the sub-DFT bins is reduced to 2 × 2; the output DFT bins are calculated using the linear combination of the sub-DFT bins. Because the sub-DFT bins for the overlapped input signals between the previous and current window are the same, the proposed algorithm reduces the computational complexity of the VR-2 × 2 FFT algorithm by reusing previously calculated sub-DFT bins in the sliding window scenario. Moreover, because the resultant DFT bins are identical to those of the VR-2 × 2 FFT algorithm, numerical errors do not arise; therefore, unconditional stability is guaranteed. Theoretical analysis shows that the proposed algorithm has the lowest computational requirements among the existing stable sliding DFT algorithms.
APA, Harvard, Vancouver, ISO, and other styles
3

Philipov, Ph, and V. Lazarov. "Investigation of the Indirect Hypercube as Natural Architecture for Parallel Algorithms of a Transpose Type for FFT and Other Fourier-Related Transforms." Information Technologies and Control 11, no. 2 (October 2, 2014): 29–44. http://dx.doi.org/10.2478/itc-2013-0010.

Full text
Abstract:
Abstract The natural architectures are architectures, derived from the signal graph of the corresponding algorithm. That is why they are considered to be the most appropriate architectures for parallel realization of this algorithm. For Fast Fourier Transform algorithm (FFT) two types of natural architectures are known – the direct and the indirect hypercube. The direct hypercube has been investigated and analyzed a long time ago. The development of the concept of Indirect Hypercube, although quite old, is too difficult, controversal and still unfinished. Fast Hartley transform (FHT)/Real-valued Fast Fourier transform (RFFT) algorithms are important Fourier-related transforms, because they lower twice the operational and memory requirements when the input data is real-valued. These types of algorithms, however, have an irregular computational structure, which makes their parallel implementation a very difficult task. The aim of this paper is, based on the results achieved so far, to present further development of the concept Indirect Hypercube. A method of parametric synthesis of an indirect hypercube is described as a model of parallel FFT algorithms of a transpose type with different granularity/radix. This method is generalized for relevant RFFT/FHT and FCT algorithms. Two types of SIMD array architectures are described (radix-2 and radix-4), based on the indirect hypercube concept. These architectures are implemented as fast FFT/RFFT/FHT processors for real time applications. The performance estimation, as well as the estimation of resource utilization is carried out.
APA, Harvard, Vancouver, ISO, and other styles
4

Andersson, Fredrik, and Johan Robertsson. "Fast τ-p transforms by chirp modulation." GEOPHYSICS 84, no. 1 (January 1, 2019): A13—A17. http://dx.doi.org/10.1190/geo2018-0380.1.

Full text
Abstract:
We have developed simple, fast, and accurate algorithms for the linear Radon ([Formula: see text]-[Formula: see text]) transform and its inverse. The algorithms have an [Formula: see text] computational complexity in contrast to the [Formula: see text] cost of a direct implementation in 2D and an [Formula: see text] computational complexity compared to the [Formula: see text] cost of a direct implementation in 3D. The methods use Bluestein’s algorithm to evaluate discrete nonstandard Fourier sums, and they need, apart from the fast Fourier transform (FFT), only multiplication of chirp functions and their Fourier transforms. The computational cost and accuracy are thus reduced to that inherited by the FFT. Fully working algorithms can be implemented in a couple of lines of code. Moreover, we find that efficient graphics processing unit (GPU) implementations could achieve processing speeds of approximately [Formula: see text], implying that the algorithms are I/O bound rather than compute bound.
APA, Harvard, Vancouver, ISO, and other styles
5

HAMMERSLEY, ANDREW. "Parallelisation of a 2-D Fast Fourier Transform Algorithm." International Journal of Modern Physics C 02, no. 01 (March 1991): 363–66. http://dx.doi.org/10.1142/s0129183191000494.

Full text
Abstract:
The calculation of two and higher-dimension Fast Fourier Transforms (FFT’s) are of great importance in many areas of data analysis and computational physics. The two-dimensional FFT is implemented for a parallel network using a master-slave approach. In-place performance is good, but the use of this technique as an “accelerator” is limited by the communications time between the host and the network. The total time is reduced by performing the host-master communications in parallel with the master-slave communications. Results for the calculation of the two-dimensional FFT of real-valued datasets are presented.
APA, Harvard, Vancouver, ISO, and other styles
6

Singhal, Akarshika, Anjana Goen, and Tanu Trushna Mohapatrara. "Design and Implementation of Fast Fourier Transform (FFT) using VHDL Code." International Journal of Emerging Research in Management and Technology 6, no. 8 (June 25, 2018): 268. http://dx.doi.org/10.23956/ijermt.v6i8.150.

Full text
Abstract:
The Discrete Fourier Transform (DFT) can be implemented very fast using Fast Fourier Transform (FFT). It is one of the finest operation in the area of digital signal and image processing. FFT is a luxurious operation in terms of MAC. To achieve FFT calculation with a many points and with maximum number of samples the MACs requirement could not be matched by efficient hardware’s like DSP. A parallel and pipelined Fast Fourier Transform (FFT) processor for use in the Orthogonal Frequency division Multiplexer (OFDM) and WLAN, unlike being stored in the traditional ROM. The twiddle factors in our pipelined FFT processor can be accessed directly. In this paper, we present the implementation of fast algorithms for the DFT for evaluating their performance. The performance of this algorithm by implementing them on the Xillinx 9.2i Spartan 3E FPGAs by developing our own FFT processor architecture.
APA, Harvard, Vancouver, ISO, and other styles
7

Amannah and Bakpo. "SIMPLIFIED BLUESTEIN NUMERICAL FAST FOURIER TRANSFORMS ALGORITHM FOR DSP AND ASP." International Journal of Research -GRANTHAALAYAH 3, no. 11 (November 30, 2015): 153–63. http://dx.doi.org/10.29121/granthaalayah.v3.i11.2015.2925.

Full text
Abstract:
This research was designed to develop a simplified Bluestein numerical FFT algorithm necessary for the processing of digital signals. The simplified numerical algorithm developed in this study is abbreviated with SBNADSP. The methodology adopted in this work was iterative and incremental development design. The major technology used in this work is the Bluestein numerical FFT algorithm. The study set the pace for its goal by re-indexing, decomposing, and simplifying the default Fast Fourier Transform Algorithms (the Bluestein FFT Algorithm). The improved efficiency of the Bluestein FFT algorithm is accounted for by the obvious reduction in the number of operations and operators in the simplified Bluestein algorithms. The SBTNADSP is designed to have four products, and three exponentiations against the default Bluestein FFT algorithm which has six exponentiations and eight products. Since the increase in the number of operators increases the length of operation, it is therefore reasonable to infer that the algorithm with the less number of operators will run shorter execution time than the one with greater operators. In line with this, we conclude that SBNADSP is of greater efficiency than the Bluestein numerical algorithm.The result of this study showed that a faster numerical algorithm other than the Bluestein fftalgorithms is possible for the processing of digital signals.
APA, Harvard, Vancouver, ISO, and other styles
8

Powell, Harold R. "The Rossmann Fourier autoindexing algorithm inMOSFLM." Acta Crystallographica Section D Biological Crystallography 55, no. 10 (October 1, 1999): 1690–95. http://dx.doi.org/10.1107/s0907444999009506.

Full text
Abstract:
The fast Fourier transform (FFT) autoindexing routines written by the Rossmann group at Purdue University have been incorporated inMOSFLM, providing a rapid and reliable method of indexing oscillation images. This is a procedure which extracts direct-space information about the unit cell from the FFT. The method and its implementation inMOSFLMare discussed.
APA, Harvard, Vancouver, ISO, and other styles
9

Raftery, J., L. Sawyer, and G. S. Pawley. "A fast Fourier transformation algorithm for parallel computers." Journal of Applied Crystallography 18, no. 6 (December 1, 1985): 424–29. http://dx.doi.org/10.1107/s0021889885010652.

Full text
Abstract:
A new algorithm is presented for using the fast Fourier transform (FFT) in a very efficient mode. This algorithm is ideal for a parallel computer such as the ICL Distributed Array Processor (DAP), though it can be used with benefit on any serial computer. For a two- or three-dimensional electron density Fourier map the Fourier coefficients are arranged in a one-dimensional vector form of the chosen length and the whole map is obtained by a single FFT operation. To obtain a higher density of calculated points in the map a number of FFT operations is required, each entailing a phase modification of the one-dimensional Fourier coefficients. A three-dimensional map using 1429 crystal reflections and giving the density at 32768 points takes roughly 2 s in the ICL DAP.
APA, Harvard, Vancouver, ISO, and other styles
10

Peng, Yan Qing, Feng Wang, Ji Zhang, Jia Li, and Da Min Zhang. "Research of a New Power Quality Detection System Based on ARM." Applied Mechanics and Materials 568-570 (June 2014): 1825–33. http://dx.doi.org/10.4028/www.scientific.net/amm.568-570.1825.

Full text
Abstract:
Based on the comparative analysis of the fast Fourier transform (FFT), the short-time Fourier transform (STFT), the wavelet transform (WT) and other power quality detection algorithms, this paper puts forward to a new power quality detection algorithm which combines the Fourier transform with the wavelet transform. The transient as well as the steady state signals are separated on the basis that the wavelet transform is sensitive to the singular signals. The presented algorithm detects a variety of harmonic parameters of the gird after the separation of steady state signals is finished by fast Fourier transform. A new power quality detection system is then designed based on the core chip of S3C2440A, and the algorithm which is ARM-9 based is transplanted into the embedded Linux operating system to carry out the experiments. Analysis of the experimental data shows the detection algorithm is reliable by Fourier transform and wavelet transform.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Fast Fourier Transform (Fft) Algorithm"

1

Mirza, Ameen Baig. "Parallel Computation of the Interleaved Fast Fourier Transform with MPI." University of Akron / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=akron1226941684.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lo, Buglio Dario. "La trasformata veloce di Fourier (FFT): analisi e implementazione in C++." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8866/.

Full text
Abstract:
La trasformata di Fourier (FT) è uno strumento molto potente implementato, oggi, in un enorme numero di tecnologie. Il suo primo esempio di applicazione fu proprio il campionamento e la digitalizzazione di segnali analogici. Nel tempo l'utilizzo della FT è stato ampliato a più orizzonti in ambito digitale, basti pensare che il formato di compressione '.jpg' utilizza una FT bidimensionale, mentre uno degli ultimi esempi di applicazione si ha nell'imaging digitale in ambito medico (risonanza magnetica nucleare, tomografia assiale computerizzata TAC ecc...). Nonostante gli utilizzi della FT siano molto diversificati il suo basilare funzionamento non è mai cambiato: essa non fa altro che modificare il dominio di una funzione del tempo (un segnale) in un dominio delle frequenze, permettendo così lo studio della composizione in termini di frequenza, ampiezza e fase del segnale stesso. Parallelamente all'evoluzione in termini di applicazioni si è sviluppato uno studio volto a migliorare e ottimizzare la computazione della stessa, data l'esponenziale crescita del suo utilizzo. In questa trattazione si vuole analizzare uno degli algoritmi di ottimizzazione più celebri e utilizzati in tal senso: la trasformata veloce di Fourier (Fast Fourier Transformation o FFT). Si delineeranno quindi le caratteristiche salienti della FT, e verrà introdotto l'algoritmo di computazione tramite linguaggio C++ dedicando particolare attenzione ai limiti di applicazione di tale algoritmo e a come poter modificare opportunamente la nostra funzione in modo da ricondurci entro i limiti di validità.
APA, Harvard, Vancouver, ISO, and other styles
3

Bowlyn, Kevin Nathaniel. "IMPLEMENTATION OF A NOVEL INTEGRATED DISTRIBUTED ARITHMETIC AND COMPLEX BINARY NUMBER SYSTEM IN FAST FOURIER TRANSFORM ALGORITHM." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/dissertations/1470.

Full text
Abstract:
This research focuses on a novel integrated approach for computing and representing complex numbers as a single entity without the use of any dedicated multiplier for calculating the fast Fourier transform algorithm (FFT), using the Distributed Arithmetic (DA) technique and Complex Binary Number Systems (CBNS). The FFT algorithm is one of the most used and implemented technique employed in many Digital Signal Processing (DSP) applications in the field of science, engineering, and mathematics. The DA approach is a technique that is used to compute the inner dot product between two vectors without the use of any dedicated multipliers. These dedicated multipliers are fast but they consume a large amount of hardware and are quite costly. The DA multiplier process is accomplished by shifting and adding only without the need of any dedicated multiplier. In today's technology, complex numbers are computed using the divide and conquer approach in which complex numbers are divided into two parts: the real and imaginary. The CBNS technique however, allows for each complex addition and multiplication to be computed in one single step instead of two. With the combined DA-CBNS approach for computing the FFT algorithm, those dedicated multipliers are being replaced with a DA system that utilize a Rom-based memory for storing the twiddle factor 'wn' value and the complex arithmetic operations being represented as a single entity, not two, with the CBNS approach. This architectural design was implemented by coding in a very high speed integrated circuit (VHSIC) hardware description language (VHDL) using Xilinx ISE design suite software program version 14.2. This computer aided tool allows for the design to be synthesized to a logic gate level in order to be further implemented onto a Field Programmable Gate Array (FPGA) device. The VHDL code used to build this architecture was downloaded on a Nexys 4 DDR Artix-7 FPGA board for further testing and analysis. This novel technique resulted in the use of no dedicated multipliers and required half the amount of complex arithmetic computations needed for calculating an FFT structure compared with its current traditional approach. Finally, the results showed that for the proposed architecture design, for a 32 bit, 8-point DA-CBNS FFT structure, the results showed a 32% area reduction, 41% power reduction, 59% reduction in run-time, 42% reduction in logic gate cost, and 66% increase in speed. For a 28 bit, 16-point DA-CBNS FFT structure, its area size, power consumption, run-time, and logic gate, were also found to be reduced at approximately 30%, 37%, 60%, and 39%, respectively, with an increase of speed of approximately 67% when compared to the traditional approach that employs dedicated multipliers and computes its complex arithmetic as two separate entities: the real and imaginary.
APA, Harvard, Vancouver, ISO, and other styles
4

Pippig, Michael, and Daniel Potts. "Parallel Three-Dimensional Nonequispaced Fast Fourier Transforms and Their Application to Particle Simulation." Universitätsbibliothek Chemnitz, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-94926.

Full text
Abstract:
In this paper we describe a parallel algorithm for calculating nonequispaced fast Fourier transforms on massively parallel distributed memory architectures. These algorithms are implemented in an open source software library called PNFFT. Furthermore, we derive a parallel fast algorithm for the computation of the Coulomb potentials and forces in a charged particle system, which is based on the parallel nonequispaced fast Fourier transform. To prove the high scalability of our algorithms we provide performance results on a BlueGene/P system using up to 65536 cores.
APA, Harvard, Vancouver, ISO, and other styles
5

Movin, Andreas, and Jonathan Jilg. "Kan datorer höra fåglar?" Thesis, KTH, Skolan för teknikvetenskap (SCI), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254800.

Full text
Abstract:
Ljudigenkänning möjliggörs genom spektralanalys, som beräknas av den snabba fouriertransformen (FFT), och har under senare år nått stora genombrott i samband med ökningen av datorprestanda och artificiell intelligens. Tekniken är nu allmänt förekommande, i synnerhet inom bioakustik för identifiering av djurarter, en viktig del av miljöövervakning. Det är fortfarande ett växande vetenskapsområde och särskilt igenkänning av fågelsång som återstår som en svårlöst utmaning. Även de främsta algoritmer i området är långt ifrån felfria. I detta kandidatexamensarbete implementerades och utvärderades enkla algoritmer för att para ihop ljud med en ljuddatabas. En filtreringsmetod utvecklades för att urskilja de karaktäristiska frekvenserna vid fem tidsramar som utgjorde basen för jämförelsen och proceduren för ihopparning. Ljuden som användes var förinspelad fågelsång (koltrast, näktergal, kråka och fiskmås) så väl som egeninspelad mänsklig röst (4 unga svenska män). Våra resultat visar att framgångsgraden normalt är 50–70%, den lägsta var fiskmåsen med 30% för en liten databas och den högsta var koltrasten med 90% för en stor databas. Rösterna var svårare för algoritmen att särskilja, men de hade överlag framgångsgrader mellan 50% och 80%. Dock gav en ökning av databasstorleken generellt inte en ökning av framgångsgraden. Sammanfattningsvis visar detta kandidatexamensarbete konceptbeviset bakom fågelsångigenkänning och illustrerar såväl styrkorna som bristerna av dessa enkla algoritmer som har utvecklats. Algoritmerna gav högre framgångsgrad än slumpen (25%) men det finns ändå utrymme för förbättring eftersom algoritmen vilseleddes av ljud av samma frekvenser. Ytterligare studier behövs för att bedöma den utvecklade algoritmens förmåga att identifiera ännu fler fåglar och röster.
Sound recognition is made possible through spectral analysis, computed by the fast Fourier transform (FFT), and has in recent years made major breakthroughs along with the rise of computational power and artificial intelligence. The technology is now used ubiquitously and in particular in the field of bioacoustics for identification of animal species, an important task for wildlife monitoring. It is still a growing field of science and especially the recognition of bird song which remains a hard-solved challenge. Even state-of-the-art algorithms are far from error-free. In this thesis, simple algorithms to match sounds to a sound database were implemented and assessed. A filtering method was developed to pick out characteristic frequencies at five time frames which were the basis for comparison and the matching procedure. The sounds used were pre-recorded bird songs (blackbird, nightingale, crow and seagull) as well as human voices (4 young Swedish males) that we recorded. Our findings show success rates typically at 50–70%, the lowest being the seagull of 30% for a small database and the highest being the blackbird at 90% for a large database. The voices were more difficult for the algorithms to distinguish, but they still had an overall success rate between 50% and 80%. Furthermore, increasing the database size did not improve success rates in general. In conclusion, this thesis shows the proof of concept and illustrates both the strengths as well as short-comings of the simple algorithms developed. The algorithms gave better success rates than pure chance of 25% but there is room for improvement since the algorithms were easily misled by sounds of the same frequencies. Further research will be needed to assess the devised algorithms' ability to identify even more birds and voices.
APA, Harvard, Vancouver, ISO, and other styles
6

Hedman, Fredrik. "Algorithms for Molecular Dynamics Simulations." Doctoral thesis, Stockholm University, Department of Physical, Inorganic and Structural Chemistry, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-1008.

Full text
Abstract:

Methods for performing large-scale parallel Molecular Dynamics(MD) simulations are investigated. A perspective on the field of parallel MD simulations is given. Hardware and software aspects are characterized and the interplay between the two is briefly discussed.

A method for performing ab initio MD is described; the method essentially recomputes the interaction potential at each time-step. It has been tested on a system of liquid water by comparing results with other simulation methods and experimental results. Different strategies for parallelization are explored.

Furthermore, data-parallel methods for short-range and long-range interactions on massively parallel platforms are described and compared.

Next, a method for treating electrostatic interactions in MD simulations is developed. It combines the traditional Ewald summation technique with the nonuniform Fast Fourier transform---ENUF for short. The method scales as N log N, where N is the number of charges in the system. ENUF has a behavior very similar to Ewald summation and can be easily and efficiently implemented in existing simulation programs.

Finally, an outlook is given and some directions for further developments are suggested.

APA, Harvard, Vancouver, ISO, and other styles
7

Palmer, Joseph M. "The Hybrid Architecture Parallel Fast Fourier Transform (HAPFFT)." BYU ScholarsArchive, 2005. https://scholarsarchive.byu.edu/etd/555.

Full text
Abstract:
The FFT is an efficient algorithm for computing the DFT. It drastically reduces the cost of implementing the DFT on digital computing systems. Nevertheless, the FFT is still computationally intensive, and continued technological advances of computers demand larger and faster implementations of this algorithm. Past attempts at producing high-performance, and small FFT implementations, have focused on custom hardware (ASICs and FPGAs). Ultimately, the most efficient have been single-chipped, streaming I/O, pipelined FFT architectures. These architectures increase computational concurrency through the use of hardware pipelining. Streaming I/O, pipelined FFT architectures are capable of accepting a single data sample every clock cycle. In principle, the maximum clock frequency of such a circuit is limited only by its critical delay path. The delay of the critical path may be decreased by the addition of pipeline registers. Nevertheless this solution gives diminishing returns. Thus, the streaming I/O, pipelined FFT is ultimately limited in the maximum performance it can provide. Attempts have been made to map the Parallel FFT algorithm to custom hardware. Yet, the Parallel FFT was formulated and optimized to execute on a machine with multiple, identical, processing elements. When executed on such a machine, the FFT requires a large expense on communications. Therefore, a direct mapping of the Parallel FFT to custom hardware results in a circuit with complex control and global data movement. This thesis proposes the Hybrid Architecture Parallel FFT (HAPFFT) as an alternative. The HAPFFT is an improved formulation for building Parallel FFT custom hardware modules. It provides improved performance, efficient resource utilization, and reduced design time. The HAPFFT is modular in nature. It includes a custom front-end parallel processing unit which produces intermediate results. The intermediate results are sent to multiple, independent FFT modules. These independent modules form the back-end of the HAPFFT, and are generic, meaning that any prexisting FFT architecture may be used. With P back-end modules a speedup of P will be achieved, in comparison to an FFT module composed solely of a single module. Furthermore, the HAPFFT defines the front-end processing unit as a function of P. It hides the high communication costs typically seen in Parallel FFTs. Reductions in control complexity, memory demands, and logical resources, are achieved. An extraordinary result of the HAPFFT formulation is a sublinear area-time growth. This phenomenon is often also called superlinear speedup. Sublinear area-time growth and superlinear speedup are equivalent terms. This thesis will subsequently use the term superlinear speedup to refer to the HAPFFT's outstanding speedup behavior. A further benefit resulting from the HAPFFT formulation is reduced design time. Because the HAPFFT defines only the front-end module, and because the back-end parallel modules may be composed of any preexisting FFT modules, total design time for a HAPFFT is greatly reduced
APA, Harvard, Vancouver, ISO, and other styles
8

Beyene, Joseph. "Uses of the fast Fourier transform (FFT) in exact statistical inference." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/NQ63594.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Breimyer, Paul. "The Fast Fourier Transform in the MPEG encoding algorithm." Diss., Connect to the thesis, 2001. http://hdl.handle.net/10066/1488.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Volkmer, Toni. "Taylor and rank-1 lattice based nonequispaced fast Fourier transform." Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-106489.

Full text
Abstract:
The nonequispaced fast Fourier transform (NFFT) allows the fast approximate evaluation of trigonometric polynomials with frequencies supported on full box-shaped grids at arbitrary sampling nodes. Due to the curse of dimensionality, the total number of frequencies and thus, the total arithmetic complexity can already be very large for small refinements at medium dimensions. In this paper, we present an approach for the fast approximate evaluation of trigonometric polynomials with frequencies supported on an arbitrary subset of the full grid at arbitrary sampling nodes, which is based on Taylor expansion and rank-1 lattice methods. For the special case of symmetric hyperbolic cross index sets in frequency domain, we present error estimates and numerical results.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Fast Fourier Transform (Fft) Algorithm"

1

Inside the FFT Black Box: Serial and Parallel Fast Fourier Transform Algorithms (Computational Mathematics Series). CRC, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bisseling, Rob H. Parallel Scientific Computation. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198788348.001.0001.

Full text
Abstract:
This book explains how to use the bulk synchronous parallel (BSP) model to design and implement parallel algorithms in the areas of scientific computing and big data. Furthermore, it presents a hybrid BSP approach towards new hardware developments such as hierarchical architectures with both shared and distributed memory. The book provides a full treatment of core problems in scientific computing and big data, starting from a high-level problem description, via a sequential solution algorithm to a parallel solution algorithm and an actual parallel program written in the communication library BSPlib. Numerical experiments are presented for parallel programs on modern parallel computers ranging from desktop computers to massively parallel supercomputers. The introductory chapter of the book gives a complete overview of BSPlib, so that the reader already at an early stage is able to write his/her own parallel programs. Furthermore, it treats BSP benchmarking and parallel sorting by regular sampling. The next three chapters treat basic numerical linear algebra problems such as linear system solving by LU decomposition, sparse matrix-vector multiplication (SpMV), and the fast Fourier transform (FFT). The final chapter explores parallel algorithms for big data problems such as graph matching. The book is accompanied by a software package BSPedupack, freely available online from the author’s homepage, which contains all programs of the book and a set of test programs.
APA, Harvard, Vancouver, ISO, and other styles
3

Research Institute for Advanced Computer Science (U.S.), ed. Fast fourier transform algorithm design and tradeoffs. [Moffett Field, Calif.?]: Research Institute for Advanced Computer Science, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Beyene, Joseph. Uses of the fast fourier transform (FFT) in exact statistical inference. 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wei, Chʻen, and United States. National Aeronautics and Space Administration., eds. Report on the NASA FFT project: Feasibility study, software design, layout and simulation of a two-dimensional fast Fourier transform machine for use in optical array interferometry. [Washington, DC: National Aeronautics and Space Administration, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Fast Fourier Transform (Fft) Algorithm"

1

Kozen, Dexter C. "The Fast Fourier Transform (FFT)." In The Design and Analysis of Algorithms, 186–90. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4612-4400-4_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rao, K. R., D. N. Kim, and J. J. Hwang. "Vector-Radix 2D-FFT Algorithms." In Fast Fourier Transform - Algorithms and Applications, 185–93. Dordrecht: Springer Netherlands, 2010. http://dx.doi.org/10.1007/978-1-4020-6629-0_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Franchetti, Franz, and Markus Püschel. "FFT (Fast Fourier Transform)." In Encyclopedia of Parallel Computing, 658–71. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_243.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Iizuka, Keigo. "The Fast Fourier Transform (FFT)." In Springer Series in Optical Sciences, 169–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-540-36808-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Iizuka, Keigo. "The Fast Fourier Transform (FFT)." In Engineering Optics, 183–201. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-69251-7_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tiedemann, Anne, Catherine Sherrington, Daina L. Sturnieks, Stephen R. Lord, Mark W. Rogers, Marie-Laure Mille, Paavo V. Komi, et al. "Fast Fourier Transform (FFT) Analyses." In Encyclopedia of Exercise Medicine in Health and Disease, 337. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-540-29807-6_2393.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Iizuka, Keigo. "The Fast Fourier Transform (FFT)." In Engineering Optics, 169–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/978-3-662-07032-1_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ukidave, Yash, Gunar Schirner, and David Kaeli. "Fast Fourier Transform (FFT) on GPUs." In Numerical Computations with GPUs, 339–61. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-06548-9_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Fitrio, David, Jugdutt Singh, and Aleksandar Stojcevski. "Dynamic Voltage Scaling for Power Aware Fast Fourier Transform (FFT) Processor." In Advances in Computer Systems Architecture, 52–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11572961_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rathkanthiwar, Shubhangi, Sandeep Kakde, Rajesh Thakare, Rahul Kamdi, and Shailesh Kamble. "High Performance DFT Architectures Using Winograd Fast Fourier Transform Algorithm." In Advances in Intelligent Systems and Computing, 559–67. New Delhi: Springer India, 2016. http://dx.doi.org/10.1007/978-81-322-2755-7_58.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Fast Fourier Transform (Fft) Algorithm"

1

Aditya, Krishna, and Chee-Hung H. Chu. "Fast Fourier transform (FFT) based fast architecture and algorithm for discrete wavelet transforms." In SPIE's 1995 Symposium on OE/Aerospace Sensing and Dual Use Photonics, edited by Harold H. Szu. SPIE, 1995. http://dx.doi.org/10.1117/12.205461.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jamaludin, Nur Fadhilah, and Ahamad Farid Abidin. "Flicker power algorithm based on Fast Fourier Transform (FFT) demodulation." In 2013 IEEE 3rd International Conference on System Engineering and Technology (ICSET). IEEE, 2013. http://dx.doi.org/10.1109/icsengt.2013.6650180.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bashar, Syed Khairul. "An efficient approach to the computation of fast fourier transform(FFT) by Radix-3 algorithm." In 2013 2nd International Conference on Informatics, Electronics and Vision (ICIEV). IEEE, 2013. http://dx.doi.org/10.1109/iciev.2013.6572680.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kim, Wan-Sik, Shuangbiao Liu, Q. Jane Wang, and Leon M. Keer. "Thermo-Electro-Mechanical Simulation of Aluminum-Steel Imperfect Electrical Contact With Extremely High Interfacial Temperature." In World Tribology Congress III. ASMEDC, 2005. http://dx.doi.org/10.1115/wtc2005-63369.

Full text
Abstract:
This paper introduces the frequency response function (FRF)-based continuous convolution and fast Fourier transform (CC-FFT) algorithm to simulate a periodically large contact area rather than the influence coefficient (IC)-based discrete convolution fast Fourier transform (DC-FFT). The former and the latter may be called as a periodic boundary condition (PBC) and a non-periodic boundary condition (nPBC) based on their periodicity. In the calculation, the contact pressure, surface displacement, and surface temperature are analyzed and compared by means of PBC CC-FFT and nPBC DC-FFT.
APA, Harvard, Vancouver, ISO, and other styles
5

ONG, E. T., H. P. LEE, K. H. LEE, and K. M. LIM. "A FAST ALGORITHM FOR THREE-DIMENSIONAL ELECTROSTATIC ANALYSIS: FAST FOURIER TRANSFORM ON MULTIPOLE (FFTM)." In Proceedings of the International Conference on Scientific and Engineering Computation (IC-SEC) 2002. PUBLISHED BY IMPERIAL COLLEGE PRESS AND DISTRIBUTED BY WORLD SCIENTIFIC PUBLISHING CO., 2002. http://dx.doi.org/10.1142/9781860949524_0083.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jin, Xiaoqing, Leon M. Keer, and Qian Wang. "Note on the FFT Based Computational Code and Its Application." In STLE/ASME 2008 International Joint Tribology Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/ijtc2008-71216.

Full text
Abstract:
The discrete convolution based Fast Fourier Transform algorithm (DC-FFT) has been successfully applied in numerical simulation of contact problems. The algorithm is revisited from a mathematical point of view, equivalent to a Toeplitz matrix multiplied by a vector. The nature of the convolution property permits one to implement the algorithm with fewer constraints in choosing the computational domains. This advantageous feature is explored in the present work, and is expected to be beneficial to many tribological studies.
APA, Harvard, Vancouver, ISO, and other styles
7

Zheng, Xiang Yuan, Torgeir Moan, and Ser Tong Quek. "Numerical Simulation of Non-Gaussian Wave Elevation and Kinematics Based on Two-Dimensional Fourier Transform." In 25th International Conference on Offshore Mechanics and Arctic Engineering. ASMEDC, 2006. http://dx.doi.org/10.1115/omae2006-92014.

Full text
Abstract:
The one-dimensional Fast Fourier Transform (FFT) has been extensively applied to efficiently simulate Gaussian wave elevation and water particle kinematics. The actual sea elevation/kinematics exhibit non-Gaussianities that mathematically can be represented by the second-order random wave theory. The elevation/kinematics formulation contains double-summation frequency sum and difference terms which in computation make the dynamic analysis of offshore structural response prohibitive. This study aims at a direct and efficient two-dimensional FFT algorithm for simulating the frequency sum terms. For the frequency difference terms, inverse FFT and FFT are respectively implemented across the two dimensions of the wave interaction matrix. Given specified wave conditions, not only the wave elevation but kinematics and associated Morison force are simulated. Favorable agreements are achieved when the statistics of elevation/kinematics are compared with not only the empirical fits but the analytical solutions developed based on modified eigenvalue/eigenvector approach, while the computation effort is very limited. In addition, the stochastic analyses in both time-and frequency domains show that the near-surface Morison force and induced linear oscillator response exhibits stronger non-Gaussianities by involving the second-order wave effects.
APA, Harvard, Vancouver, ISO, and other styles
8

Wahbi, Azeddine, Ahmed Roukhe, and Laamari Hlou. "Enhancing the quality of voice communications by acoustic noise cancellation (ANC) using a low cost adaptive algorithm based Fast Fourier Transform (FFT) and circular convolution." In 2014 9th International Conference on Intelligent Systems: Theories and Applications (SITA). IEEE, 2014. http://dx.doi.org/10.1109/sita.2014.6847310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Suprock, Christopher A., and John T. Roth. "Directionally Independent Failure Prediction of End Mill Cutting Tools: An Investigation of Noise Reduction Using Higher Dimensional Real Fourier Analysis." In ASME 2006 International Mechanical Engineering Congress and Exposition. ASMEDC, 2006. http://dx.doi.org/10.1115/imece2006-14968.

Full text
Abstract:
Accurate on-line forecasting of a tool's condition during end-milling operations is advantageous to the functionality and reliability of automated industrial processes. The ability to disengage the tool prior to catastrophic failure reduces manufacturing costs, excessive machine deterioration, and personnel hazards. Rapid computational feedback describing the system's state is critical for realizing a practical failure forecasting model. To this end, spectral analysis by fast Fourier type algorithms allows a rapid computational response. The research described herein explores the development of nontraditional real FFT (Discrete Cosine Transform) based algorithms performed in unique higher-dimensional states of observed datasets. The developed Fourier algorithm is novel since it quantifies chaotic noise rather than relying on the more traditional observation of system energy. By increasing the vector dimensionality of the DCT, the respective linear transform basis will more effectively cross-correlate the transform data into fewer (more significant) transform coefficients. Thus, a single vector in orthogonally higher-dimensional space is observed instead of multiple orthogonal vectors in single-dimensional space. More specifically, a novel noise reduction technique is utilized to track trends measured from tri-axial force dynamometer signals. This transformation effectively achieves both system noise reduction and directional independence by observing the chaotic noise instead of system energy. Algorithm output trends from six end-milling life-tests are tracked from both linear and pocketing maneuvers in order to demonstrate the technique's capabilities. In all six tests, the algorithm predicts impending tool failure with sufficient time for tool removal.
APA, Harvard, Vancouver, ISO, and other styles
10

Yousuf, Louay S., and Dan B. Marghitu. "Lyapunov Exponent for a Globoidal Cam With a Roller Follower Mechanism Using Wolf Algorithm." In ASME 2020 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/imece2020-23606.

Full text
Abstract:
Abstract A globoidal cam and roller follower system is analyzed and discussed for non-periodic motion of the follower. Wolf algorithm is used to calculate the largest Lyapunov exponent. The impact between the cam, follower and the two guides is occurred due to the impulse and momentum phenomenon. The effect of the internal dimension of the follower guide on the non-periodic motion of the follower is considered at distinct angular velocity of the cam. The numerical simulation has been done using SolidWorks software. Follower movement is processed experimentally through an infrared 3-D camera device. Phase plane diagram is used to explain the variation in follower motion. Phase-plane diagram and Fast Fourier Transform (FFT) are used to investigate follower non-periodicity. The follower motion is non-periodic when the orbit of phase-plane diagram diverges with no limit of spiral cycles.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Fast Fourier Transform (Fft) Algorithm"

1

Giorla, Alain B. Development of Fast Fourier Transform (FFT) micro-mechanical simulations of concrete specimens characterized by micro-X-ray fluorescence. Office of Scientific and Technical Information (OSTI), August 2017. http://dx.doi.org/10.2172/1415919.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Fast Fourier Transform (Fft) Algorithm' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography