Relevant bibliographies by topics / Fast Fourier Transform(FFT)

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)'

Author: Grafiati
Published: 4 June 2021
Last updated: 6 September 2023

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).'

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)"

1

Hu, Jiatu, Fuge Jia, and Wenzhe Liu. "Application of Fast Fourier Transform." Highlights in Science, Engineering and Technology 38 (March 16, 2023): 590–97. http://dx.doi.org/10.54097/hset.v38i.5888.

Full text
Abstract:
Fourier analysis is most frequently used as a univariate approach for either modeling or simplifying data. It may also be used as a method for multivariate data analysis. There are various connections between Fourier analysis and trend analysis. It takes a fresh look at how data sets are related. In the case of Fourier analysis, the technique clarifies the time dimension variable in the data set. The most fundamental kind of Fourier analysis works under the idea that many events have a periodic nature and that fluctuations in other variables brought on by this periodicity may be eliminated using Fourier transforms. By using the residual (i.e., time-independent) variance from other variables, Fourier-transformed data may be subjected to more powerful analysis.Based on differential matrices and semidiscrete Fourier transforms, this paper summarizes the key problems in Fourier analysis, FFT. Secondly, this paper points out the application of F FT in the field of modern science and technology and the main progress of current FFT research, and on this basis, the research prospects of FFT law are prospected.
APA, Harvard, Vancouver, ISO, and other styles
2

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
3

Langs, D. A. "FAST: a compact general crystallographic fast Fourier transform (FFT)." Journal of Applied Crystallography 29, no. 4 (August 1, 1996): 481–83. http://dx.doi.org/10.1107/s0021889896003056.

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

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
5

Chen, Yulin, You Lv, Xinyue Jiang, Haotian Huang, and Yuan Zhu. "Fast Fourier transform Ångström method for fast thermal measurements of microfibers." Review of Scientific Instruments 94, no. 1 (January 1, 2023): 014901. http://dx.doi.org/10.1063/5.0125726.

Full text
Abstract:
The Ångström method is a promising thermal diffusivity measurement method for microfibers. Based on the heat-loss Ångström method and micro-Ångström method, the FFT (Fast Fourier Transform) Ångström method can be used to shorten the testing time and enhance the testing robustness of thermal conductivity. The FFT Ångström uses multi-frequency superimposed input signals and then uses the FFT for frequency division analysis. Since different frequencies are input at the same time, the measuring time is greatly reduced. Moreover, because different frequencies are input in the same environment, the random and environmental perturbations of the frequencies are the same, enhancing the fitting robustness. In contrast, the single feeding strategy is relatively time-consuming, and its measurement homogeneity for different frequencies cannot be guaranteed. By comparing the measurement results from a multi-frequency input and separated single-frequency input, the FFT shows good feasibility and robustness. It may also have great potential in other types of thermal wave measurements.
APA, Harvard, Vancouver, ISO, and other styles
6

Rufo, Montaña, Antonio Jiménez, Jesús M. Paniagua, and Alberto González-Mohíno. "Ultrasound Assessment of Honey Using Fast Fourier Transform." Sensors 21, no. 20 (October 11, 2021): 6748. http://dx.doi.org/10.3390/s21206748.

Full text
Abstract:
Ultrasound inspection permits the characteristics of some foodstuffs to be determined easily and cheaply. This experimental study included the determination of various ultrasound parameters provided by the fast Fourier transform (FFT) which had not previously been considered in testing the physical properties of different varieties of honey. These parameters are practically independent of the criteria adopted for their calculation, unlike other ultrasound variables such as pulse velocity or attenuation whose determination can vary depending on those criteria. The study was carried out on four varieties of honey (Eucalyptus, Heather, Thyme, and Thousand Flowers) using 500-kHz transducers. A simultaneously performed honey texture analysis (Texture Profile Analysis-TPA) showed significant linear correlations between the ultrasound variables provided by FFT and the texture parameters. The FFT parameters distinguished between each of the four honey varieties studied.
APA, Harvard, Vancouver, ISO, and other styles
7

Alamsyah, Derry. "Maximum Likelihood Classification with Fast Fourier Transform Feature Extraction for Car Recognition." Jurnal Teknologi dan Sistem Komputer 6, no. 1 (January 31, 2018): 32–36. http://dx.doi.org/10.14710/jtsiskom.6.1.2018.32-36.

Full text
Abstract:
The car recognition is part of the field of traffic surveillance on the image. In general, the car recognition using the form-based feature as a unique feature. Another feature in object recognition is the frequency feature. One feature of frequency is the Fourier feature, this feature is obtained by using Fast Fourier Transform (FFT) method. The object recognition can be done by determining the maximum value of likelihood and classifying it with Maximum Likelihood Classification (MLC). The use of FFT and MLC in the car object recognition has never been used. The results of both are in a good accuracy that is 76%.
APA, Harvard, Vancouver, ISO, and other styles
8

Ibrahim, Siti Nur Iqmal, John G. O'Hara, and Nick Constantinou. "Pricing Extendible Options Using the Fast Fourier Transform." Mathematical Problems in Engineering 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/831470.

Full text
Abstract:
This paper applies the fast Fourier transform (FFT) approach, within the Black-Scholes framework, to the valuation of options whose time to maturity can be extended to a future date (extendible options). We determine the valuation of the extendible options as sums of expectations of indicator functions, leading to a semianalytic expression for the value of the options over a range of strikes. Compared to Monte Carlo simulation, numerical examples demonstrate that the FFT is both computationally more efficient and higher in accuracy.
APA, Harvard, Vancouver, ISO, and other styles
9

Mirfarshbafan, Seyed Hadi, Sueda Taner, and Christoph Studer. "SMUL-FFT: A Streaming Multiplierless Fast Fourier Transform." IEEE Transactions on Circuits and Systems II: Express Briefs 68, no. 5 (May 2021): 1715–19. http://dx.doi.org/10.1109/tcsii.2021.3064238.

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

Kurnia, Rani, and Riki Mukhaiyar. "Pemantauan Flicker Tengangan Menggunakan Fast fourier transform (FFT)." Voteteknika (Vocational Teknik Elektronika dan Informatika) 9, no. 3 (September 1, 2021): 1. http://dx.doi.org/10.24036/voteteknika.v9i3.112034.

Full text
Abstract:
Laju elektrifikasi Sumatera Barat 92,96%. Jumlah ini akan terus meningkat setiap tahun, dan dengan meningkatnya laju elektrifikasi di Sumatera Barat maka kualitas daya yang dibutuhkan akan meningkat. Di sisi lain, peningkatan kecepatan pengisian menyebabkan penurunan kualitas daya. Kualitas daya sistem tenaga dipengaruhi oleh gangguan. Dengan kata lain, sistem tenaga gagal, mengakibatkan kualitas daya yang buruk. Gangguan memanifestasikan dirinya dalam bentuk faktor eksternal dan internal. Faktor eksternal termasuk petir dan pohon tumbang, dan faktor internal termasuk pemadaman listrik sementara, fluktuasi tegangan, transien tegangan dan arus, serta kedipan tegangan. Kami akan fokus pada gangguan flicker tegangan yang disebabkan oleh gangguan ini. Kedipan tegangan memiliki berbagai efek seperti kegagalan relai pelindung, fluktuasi tegangan yang dapat menyebabkan lampu berkedip terang dan redup. Tujuan dari proyek akhir ini adalah membuat alat yang mendeteksi adanya tegangan jitter dengan metode Fast Fourier Transform (FFT), sehingga Anda dapat mengamati getaran akibat gelombang FFT pada aplikasi Matlab.Kata kunci : Monitoring, Voltage Flicker, Fast Fourier Transform
APA, Harvard, Vancouver, ISO, and other styles
More sources

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

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

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
3

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
4

Khan, Aman Ullah. "Parallel computation of fast Fourier transforms." Thesis, Cardiff University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340239.

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

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
6

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
7

Sajabi, Cyprian D. "FPGA FREQUENCY DOMAIN BASED GPS COARSE ACQUISITION PROCESSOR USING FFT." Wright State University / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=wright1150916512.

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

Rosenthal, Glenn, and Thomas Salley. "USING THE FFT FOR DSP SPECTRUM ANALYSIS: A TELEMETRY ENGINEERING APPROACH." International Foundation for Telemetering, 1990. http://hdl.handle.net/10150/613797.

Full text
Abstract:
International Telemetering Conference Proceedings / October 29-November 02, 1990 / Riviera Hotel and Convention Center, Las Vegas, Nevada
The Fast Fourier Transform (FFT) converts digitally sampled time domain data into the frequency domain. This paper will provide an advanced introduction for the telemetry engineer to basic FFT theory and then present and explain the different user preprocessing options that are available when using the FFT. These options include: using windowing functions, “zero filling” for frequency data interpolation, and setting the frequency resolution of the FFT resultant spectrum,
APA, Harvard, Vancouver, ISO, and other styles
9

Wilson, Huon. "Computing fast and accurate convolutions." Thesis, The University of Sydney, 2016. http://hdl.handle.net/2123/15169.

Full text
Abstract:
The analysis of data often models random components as a sum of in- dependent random variables (RVs). These RVs are often assumed to be lattice-valued, either implied by the problem or for computational efficiency. Thus, such analysis typically requires computing, or, more commonly, ap- proximating a portion of the distribution of that sum. Computing the underlying distribution without approximations falls un- der the area of exact tests. These are becoming more popular with continuing increases in both computing power and the size of data sets. For the RVs above, exactly computing the underlying distribution is done via a convolu- tion of their probability mass functions, which reduces to convolving pairs of non-negative vectors. This is conceptually simple, but practical implementations must care- fully consider both speed and accuracy. Such implementations fall prey to the round-off error inherent to floating point arithmetic, risking large rela- tive errors in computed results. There are two main existing algorithms for computing convolutions of vectors: naive convolution (NC) has small bounds on the relative error of each element of the result but has quadratic runtime; while Fast Fourier Transform-based convolution (FFT-C) has almost linear runtime but does not control the relative error of each element, due to the accumulation of round-off error. This essay introduces two novel algorithms for these problems: aFFT-C for computing convolution of two non-negative vectors, and sisFFT for com- puting p-values of sums of independent and identically-distributed lattice- valued RVs. Through a rigorous analysis of round-off error and its accumula- tion, both aFFT-C and sisFFT provide control of the relative error similar to NC, but are typically closer in speed to FFT-C by careful use of FFT-based convolutions and by aggressively discarding irrelevant values. Both accuracy and performance are demonstrated empirically with a variety of examples.
APA, Harvard, Vancouver, ISO, and other styles
10

Sandström, Tobias. "Condition Monitoring of Ceramic Ball Bearings in an Engine Testing Dynamometer." Thesis, KTH, Maskinkonstruktion (Inst.), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-183126.

Full text
Abstract:
The choice of the topic addressed in this thesis aims to improve the service and maintenance on ceramic ball bearings in a specific test dynamometer and through an engineering approach develop tools for condition monitoring. The company connected to this thesis, AVL, is the world's largest privately owned company for development, simulation and testing technology of powertrains for passenger cars, trucks and large engines. Engine testing is a critical part of the business at AVL Sweden and unexpected bearing failure can result in long repair times and great economic losses due to loss of the testing time. In short terms, the methodological approach followed the following steps; first a thorough information retrieval regarding bearings and analysis was conducted. The search was deepened around areas such as hybrid ball bearings, bearing failure mechanisms, bearing defect frequencies, signal analysis and condition monitoring. After this a table for bearing damage detection was developed and a “step by step” guidance for condition monitoring. The tools where afterwards verified by simple testing to detect complications within the chosen system. The existing condition monitoring system that is used today revealed weaknesses as it lacked the feature of taking preventive measures. The system that is based on temperature measurements isn’t satisfactory enough, especially when it’s missing visual clarity. Service and maintenance according to specifications from the manufacturer should be scheduled to ensure operational and guarantees. Currently mounted accelerometers on the housing of the Dynas3 engine should be connected for collecting data and the total sum of energy should be calculated for simple monitoring of historical progression. This should be done by following the guidance in order to ensure proper data acquisition. The best way to implement condition monitoring showed to be by performing multi-parameter monitoring. The design of the condition monitoring system is highly connected to what to monitor and at what stage. One main consideration to keep in mind is that it’s very rare that manufacturing defects are the reason for bearing failure. Instead it derives from improper storage, transport, handling or dimensional errors and even in some cases by improperly implemented force analysis prior to bearing selection.
Huvudämnet som behandlas i detta examensarbete syftar till att förbättra service och underhåll på keramiska kullager i en viss testdynamometer och genom ett ingenjörsmässigt tillvägagångsätt utveckla verktyg för tillståndsövervakning. Företaget som är ansluten till detta examensarbete är AVL som är världens största privatägda företag för utveckling, simulering och testteknik för drivlinor för personbilar, lastbilar och stora motorer. Motorprovning är en viktig del av verksamheten vid AVL Sverige, och ett oväntat lagerhaveri kan leda till långa reparationstider och stora ekonomiska förluster på grund av utebliven test tid. I korta termer följde den metod som använts följande steg, först genomfördes en grundlig informationssökning om lager och tillhörande analyser. Efter det fördjupades sökande kring områden som hybrida kullager, lagerskademekanismer, frekvenser kopplade till lagerskador, signalanalys och tillståndsövervakning. Efter detta framställdes en tabell för detektering av lagerskador, samt en ”steg för steg” guide för tillståndsövervakning. Verktygen för tillståndsövervakning kontrolleras efteråt, genom att enkla tester genomfördes för att upptäcka komplikationer inom det valda systemet. Det övervakningssystem som används idag avslöjade svagheter genom att sakna funktionen att vidta förebyggande åtgärder. System som är baserat på temperaturmätningar är inte tillräckligt tillfredsställande, speciellt när det saknar en visuell tydlighet. Den service och underhåll som enligt tillverkarens föreskrifter påvisas bör planeras för att säkerställa drift och garantier. Nuvarande monterade accelerometrar fästa vid motorhöljet bör anslutas för att insamla data, och den totala summan av energin bör beräknas för en enkel övervakning av det historiska utvecklingsförloppet. Detta bör göras genom att följa de riktlinjer som framställts för att säkerställa korrekt datainsamling. Det bäst passande sättet att genomföra tillståndsövervakning på i detta fall visade sig vara att utföra multiparameterövervakning. Framställningen av tillståndsövervakningssystemet är starkt förknippat med vad som skall övervakas och i vilket skede. En huvudsaklig bidragande faktor att komma ihåg är att det är mycket ovanligt att fabrikationsfel är orsaken till lagerhaveri. Istället härstammar haveriet från felaktig förvaring, transportering, hantering eller dimensioneringsfel och i vissa fall av felaktigt genomförd kraftanalys inför lagerval.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Fast Fourier Transform(FFT)"

1

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
2

Sorensen, Henrik V. Fast fourier transform database. Boston: PWS Publishing, 1995.

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

Sorensen, Henrik V. Fast Fourier transform database. Boston, MA: PWS Pub., 1995.

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

Pollock, D. S. G. A mixed-radix fast Fourier transform and a Base-2 fast Fourier transform. London: QueenMary and Westfield College, Department of Economics, 1989.

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

Rao, K. R., D. N. Kim, and J. J. Hwang. Fast Fourier Transform - Algorithms and Applications. Dordrecht: Springer Netherlands, 2010. http://dx.doi.org/10.1007/978-1-4020-6629-0.

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

Rao, K. R. Fast Fourier Transform: Algorithms and Applications. Dordrecht: Springer Science+Business Media B.V., 2010.

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

Brigham, E. Oran. The fast Fourier transform and its applications. Englewood Cliffs, NJ: Prentice-Hall International, 1988.

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

The fast Fourier transform and its applications. Englewood Cliffs, N.J: Prentice Hall, 1988.

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

Loan, Charles Van. Computational frameworks for the fast fourier transform. Philadelphia: SIAM, 1992.

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

Takahashi, Daisuke. Fast Fourier Transform Algorithms for Parallel Computers. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-9965-7.

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

Book chapters on the topic "Fast Fourier Transform(FFT)"

1

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
2

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
3

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
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, 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
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

Keydana, Sigrid. "The Fast Fourier Transform (FFT)." In Deep Learning and Scientific Computing with R torch, 343–60. Boca Raton: Chapman and Hall/CRC, 2023. http://dx.doi.org/10.1201/9781003275923-27.

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

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
9

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
10

Palani, S. "Discrete and Fast Fourier Transforms (DFT and FFT)." In Principles of Digital Signal Processing, 81–248. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96322-4_2.

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

Conference papers on the topic "Fast Fourier Transform(FFT)"

1

Hassan, Siti Lailatul Mohd, Nasri Sulaiman, Ili Shairah Abdul Halim, A'zraa Ahfzan Ab Rahim, and Noor Ezan Abdullah. "Pipelined Fast Fourier Transform (FFT) Processor Power Optimization." In 2019 IEEE 7th Conference on Systems, Process and Control (ICSPC). IEEE, 2019. http://dx.doi.org/10.1109/icspc47137.2019.9068069.

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

Ahsan, Muhammad, Ehtsham Elahi, and Waqas Ahmad Farooqi. "Superscalar power efficient Fast Fourier Transform FFT architecture." In 2009 2nd International Conference on Computer, Control and Communication (IC$). IEEE, 2009. http://dx.doi.org/10.1109/ic4.2009.4909270.

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

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
4

Cui, You-xiang, Jian-xin You, and Feng Luo. "Applying fast Fourier transform (FFT) to statistic quality control." In EM). IEEE, 2010. http://dx.doi.org/10.1109/ieem.2010.5674543.

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

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
6

Gandhi, Vaibhav, Hongqiang Wang, and Alex Bourd. "Optimization of Fast Fourier Transform (FFT) on Qualcomm Adreno GPU." In IWOCL'19: International Workshop on OpenCL. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3318170.3319372.

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

Murugappan, M., Subbulakshmi Murugappan, Balaganapathy, and Celestin Gerard. "Wireless EEG signals based Neuromarketing system using Fast Fourier Transform (FFT)." In 2014 IEEE 10th International Colloquium on Signal Processing & its Applications (CSPA). IEEE, 2014. http://dx.doi.org/10.1109/cspa.2014.6805714.

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

Abrahamsen, P., V. Kvernelv, and D. Barker. "Simulation Of Gaussian Random Fields Using The Fast Fourier Transform (Fft)." In ECMOR XVI - 16th European Conference on the Mathematics of Oil Recovery. Netherlands: EAGE Publications BV, 2018. http://dx.doi.org/10.3997/2214-4609.201802134.

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

Le Huy, Nguyen, Pham Chi Thanh, Tran Duc Linh, and Alex Stojcevski. "Design and simulation of a novel clockless Fast Fourier Transform (FFT) circuit." In 2017 Seventh International Conference on Information Science and Technology (ICIST). IEEE, 2017. http://dx.doi.org/10.1109/icist.2017.7926775.

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

Jamaludin, Nur Fadhilah, and Ahamad Farid Abidin. "The used of Fast-Fourier Transform (FFT) demodulation for flicker source identification." In 2014 IEEE 8th International Power Engineering and Optimization Conference (PEOCO). IEEE, 2014. http://dx.doi.org/10.1109/peoco.2014.6814487.

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

Reports on the topic "Fast Fourier Transform(FFT)"

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
2

Nuttall, Albert H. Weighted Least Squares Fit of a Real Tone to Discrete Data, by Means of an Efficient Fast Fourier Transform Search. Fort Belvoir, VA: Defense Technical Information Center, August 1986. http://dx.doi.org/10.21236/ada185910.

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

Nagy, D. Fast Fourier transform and applications. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 1985. http://dx.doi.org/10.4095/315252.

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

Steinbach, Arden L., and Cynthia H. Warner. A Modified Fast Fourier Transform. Fort Belvoir, VA: Defense Technical Information Center, January 1990. http://dx.doi.org/10.21236/ada220567.

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

McCallen, R. Power spectrum calculations using the fast Fourier transform. Office of Scientific and Technical Information (OSTI), December 1995. http://dx.doi.org/10.2172/188886.

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

Anderson, Gerald L., and Kalman Peleg. Precision Cropping by Remotely Sensed Prorotype Plots and Calibration in the Complex Domain. United States Department of Agriculture, December 2002. http://dx.doi.org/10.32747/2002.7585193.bard.

Full text
Abstract:
This research report describes a methodology whereby multi-spectral and hyperspectral imagery from remote sensing, is used for deriving predicted field maps of selected plant growth attributes which are required for precision cropping. A major task in precision cropping is to establish areas of the field that differ from the rest of the field and share a common characteristic. Yield distribution f maps can be prepared by yield monitors, which are available for some harvester types. Other field attributes of interest in precision cropping, e.g. soil properties, leaf Nitrate, biomass etc. are obtained by manual sampling of the filed in a grid pattern. Maps of various field attributes are then prepared from these samples by the "Inverse Distance" interpolation method or by Kriging. An improved interpolation method was developed which is based on minimizing the overall curvature of the resulting map. Such maps are the ground truth reference, used for training the algorithm that generates the predicted field maps from remote sensing imagery. Both the reference and the predicted maps are stratified into "Prototype Plots", e.g. 15xl5 blocks of 2m pixels whereby the block size is 30x30m. This averaging reduces the datasets to manageable size and significantly improves the typically poor repeatability of remote sensing imaging systems. In the first two years of the project we used the Normalized Difference Vegetation Index (NDVI), for generating predicted yield maps of sugar beets and com. The NDVI was computed from image cubes of three spectral bands, generated by an optically filtered three camera video imaging system. A two dimensional FFT based regression model Y=f(X), was used wherein Y was the reference map and X=NDVI was the predictor. The FFT regression method applies the "Wavelet Based", "Pixel Block" and "Image Rotation" transforms to the reference and remote images, prior to the Fast - Fourier Transform (FFT) Regression method with the "Phase Lock" option. A complex domain based map Yfft is derived by least squares minimization between the amplitude matrices of X and Y, via the 2D FFT. For one time predictions, the phase matrix of Y is combined with the amplitude matrix ofYfft, whereby an improved predicted map Yplock is formed. Usually, the residuals of Y plock versus Y are about half of the values of Yfft versus Y. For long term predictions, the phase matrix of a "field mask" is combined with the amplitude matrices of the reference image Y and the predicted image Yfft. The field mask is a binary image of a pre-selected region of interest in X and Y. The resultant maps Ypref and Ypred aremodified versions of Y and Yfft respectively. The residuals of Ypred versus Ypref are even lower than the residuals of Yplock versus Y. The maps, Ypref and Ypred represent a close consensus of two independent imaging methods which "view" the same target. In the last two years of the project our remote sensing capability was expanded by addition of a CASI II airborne hyperspectral imaging system and an ASD hyperspectral radiometer. Unfortunately, the cross-noice and poor repeatability problem we had in multi-spectral imaging was exasperated in hyperspectral imaging. We have been able to overcome this problem by over-flying each field twice in rapid succession and developing the Repeatability Index (RI). The RI quantifies the repeatability of each spectral band in the hyperspectral image cube. Thereby, it is possible to select the bands of higher repeatability for inclusion in the prediction model while bands of low repeatability are excluded. Further segregation of high and low repeatability bands takes place in the prediction model algorithm, which is based on a combination of a "Genetic Algorithm" and Partial Least Squares", (PLS-GA). In summary, modus operandi was developed, for deriving important plant growth attribute maps (yield, leaf nitrate, biomass and sugar percent in beets), from remote sensing imagery, with sufficient accuracy for precision cropping applications. This achievement is remarkable, given the inherently high cross-noice between the reference and remote imagery as well as the highly non-repeatable nature of remote sensing systems. The above methodologies may be readily adopted by commercial companies, which specialize in proving remotely sensed data to farmers.
APA, Harvard, Vancouver, ISO, and other styles
7

Sweet, R., and J. Wilson. Development of out-of-core fast Fourier transform software for the connection machine. Final report. Office of Scientific and Technical Information (OSTI), October 1995. http://dx.doi.org/10.2172/113993.

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

Ritchie, A. B., and M. E. Riley. An implicit fast Fourier transform method for integration of the time dependent Schrodinger or diffusion equation. Office of Scientific and Technical Information (OSTI), June 1997. http://dx.doi.org/10.2172/491602.

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

Patterson, P. E. The Complete Fast Fourier Transform and Cascaded Transition-Band Filters to Reduce the Noise of Deconvolution. Office of Scientific and Technical Information (OSTI), January 2000. http://dx.doi.org/10.2172/776348.

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)' for particular source types:
Journal articles Dissertations / Theses Books
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