FACTOID # 7: Israel enjoys a GDP per capita 21 times that of the Palestinian West Bank and 33 times that of the Gaza Strip. Its military spending per capita tops the world.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

SEARCH ALL

FACTS & STATISTICS    Advanced view

Search encyclopedia, statistics and forums:

 

 

(* = Graphable)

 

 


Encyclopedia > FFTW

FFTW, for "Fastest Fourier Transform in the West," is a software library for computing discrete Fourier transforms (DFTs), developed by Matteo Frigo and Steven G. Johnson at the MIT Laboratory for Computer Science. Illustration of an application which may use libvorbisfile. ... In mathematics, the discrete Fourier transform (DFT), sometimes called the finite Fourier transform, is a Fourier transform widely employed in signal processing and related fields to analyze the frequencies contained in a sampled signal, solve partial differential equations, and to perform other operations such as convolutions. ... The Massachusetts Institute of Technology, or MIT, is a research and educational institution located in the city of Cambridge, Massachusetts, USA. MIT is a widely renowned leader in science and technology, as well as in many other fields, including engineering systems, management, economics, linguistics, political science, and philosophy. ... Project MAC, later the MIT Laboratory for Computer Science (LCS), was a research laboratory at MIT. Project MAC would become famous for groundbreaking research in operating systems, artificial intelligence, and the theory of computation. ...


FFTW is known as the fastest free software implementation of the Fast Fourier transform (FFT) algorithm. However, there has been some controversy concerning the benchmarks used to determine this, spurred by Daniel J. Bernstein (the author of another FFT library, djbfft). Free software, as defined by the Free Software Foundation, is software which can be used, copied, studied, modified and redistributed without restriction. ... A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. ... A benchmark is a point of reference for a measurement. ... Daniel Julius Bernstein (sometimes known simply as djb; born 1971-10-29) is a professor at the University of Illinois at Chicago, a mathematician, a cryptologist, and a programmer. ...


In 1999, FFTW won the J. H. Wilkinson Prize for Numerical Software. 1999 (MCMXCIX) is a common year starting on Friday, and was designated the International Year of Older Persons by the United Nations. ...


External link


  Results from FactBites:
 
FFTW - Introduction (937 words)
FFTW is a comprehensive collection of fast C routines for computing the discrete Fourier transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size.
Indeed, FFTW is unique in that it automatically adapts itself to your machine, your cache, the size of your memory, the number of registers, and all the other factors that normally make it impossible to optimize a program for more than one machine.
FFTW does not used a fixed algorithm for computing the transform, but it can adapt the DFT algorithm to details of the underlying hardware in order to achieve best performance.
  More results at FactBites »


 
 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms, 1022, m