Results 281 to 290 of about 340,305 (333)

An FFT chart

Proceedings of the IEEE, 1970
This letter contains a graph paper summarizing many properties of Fourier transforms and fast Fourier transform (FFT) devices. It shows the interrelationships among data block length, frequency resolution sampling rate, FFT stages, and other related variables.
openaire   +1 more source

Generalized FFT algorithm

Proceedings of ICC '93 - IEEE International Conference on Communications, 2002
A novel formulation of the decimation method fast Fourier transform (FFT) algorithm is introduced. This formulation generalizes both the decimation-in-time (DIT) and the decimation-in-frequency (DIF) FFT algorithms for various radices in multidimensions.
openaire   +1 more source

ATON - FFT: Metallrumpf Technologien ökologisch nachhaltig - FFT

Datei-Upload durch ...
openaire   +1 more source

FFT algoritam

2021
U Uvodu je predstavljena tema rada i neke osnovne pojmove. Drugo poglavlje obuhvaća signale i razne podjele signala. Treće poglavlje bavi se Fourierovom analizom, odnosno reprezentacijom signala u frekvencijskoj domeni. U četvrtom poglavlju definira se diskretna Fourierova transformacija i pokazuje njezino računanje.
openaire   +1 more source

FFTW: an adaptive software architecture for the FFT

Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181), 1998
Matteo Frigo, Steven G. Johnson
semanticscholar   +1 more source

Masked FFT registration

2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2010
Registration is a ubiquitous task for image analysis applications. Generally, the requirements of registration algorithms include fast computation and large capture range. For these purposes, registration in the Fourier domain using normalized cross correlation is well suited and has been extensively studied in the literature.
openaire   +1 more source

An FFT-based technique for translation, rotation, and scale-invariant image registration

IEEE Transactions on Image Processing, 1996
B. S. Reddy, B. N. Chatterji
semanticscholar   +1 more source

Interpolation in FFTs

Journal of the Institution of Electronic and Radio Engineers, 1985
In many examples of Fast Fourier Transform processing, a substantial loss arises from the so-called Picket Fence effect or from use of shaped time-windows or both. This paper describes a simple, easily implemented procedure which greatly reduces such loss in certain applications.
openaire   +1 more source

Inside the FFT Black Box: Serial and Parallel Fast Fourier Transform Algorithms

, 2019
E. Chu, A. George
semanticscholar   +1 more source

FFT

2010
Joris C Verster, Thomas M. Tzschentke, Kieran O’Malley, Francis C Colpaert, Bart Ellenbroek, Bart Ellenbroek, R. Hamish McAllister-Williams, Joachim Liepert, Cecilia J. Hillard, Sheldon Preskorn, Megan M Dahmen, Janka Lincoln, Oliver Stiedl, Sven Ove Ögren, E C Warburton, Bernard Le Foll, Mohammed Shoaib, Victoria L Harvey, Tony Dickenson, Ennio Esposito, Roberto William Invernizzi, Ennio Esposito, Robert William Invernizzi, Edoardo Spina, Cyril Höschl, Kim Wolff, Andreas Marneros, Anthony L. Riley, Steve Kohut, Samuel R. Chamberlain, Barbara J. Sahakian, David C.S. Roberts, Joseph Zohar, Seiya Miyamoto, Malcolm Lader, Emma Childs, Lawrence H. Price, Harriet de Wit, Wolfgang Fleischhacker, Lance Richard McMahon, Bernard Le Foll, Bernard Le Foll, Lawrence H. Price, Kieran O’Malley, Kieran O’Malley, Stephen M. Stahl, Meghan M Grady, Stephen C Fowler, Francis C. Colpaert, Alex Hofer, Etienne Sibille, Nicole Edgar, Linda P. Spear, Sam Hutton, Linda Lundstroem, Silvia Gatti McArthur, Will Spooren, Maria Isabel Colado, Richard Green, Marcy J. Bubar, Kathryn A Cunningham, Stephan G. Anagnostaras, Jennifer R Sage, Stephanie A. Carmack, Peter H. Boeijinga, Peter H. Boeijinga, Paul Newhouse, Heather Wilkins, Gary Remington, John Atack, Hilde Lavreysen   +70 more
openaire   +1 more source