IEEE Symposium on FPGAs for Custom Computing Machines

Keyword(s):  
1988 ◽  
Vol 53 (2) ◽  
pp. 669
Author(s):  
William J. Rapaport ◽  
Nimrod Megiddo ◽  
Avi Wigderson ◽  
Haim Gaifman ◽  
Silvio Micali ◽  
...  

2000 ◽  
Vol 103 (3-4) ◽  
pp. 225-227 ◽  
Author(s):  
William L. Jorgensen

2019 ◽  
Vol 103 (556) ◽  
pp. 117-127
Author(s):  
Peter Shiu

This Article is on the discrete Fourier transform (DFT) and the fast Fourier transform (FFT). As we shall see, FFT is a slight misnomer, causing confusion to beginners. The idiosyncratic title will be clarified in §4.Computing machines are highly efficient nowadays, and much of the efficiency is based on the use of the FFT to speed up calculations in ultrahigh precision arithmetic. The algorithm is now an indispensable tool for solving problems that involve a large amount of computation, resulting in many useful and important applications: for example, in signal processing, data compression and photo-images in general, and WiFi, mobile phones, CT scanners and MR imaging in particular.


1996 ◽  
Vol 13 (2) ◽  
pp. 229-266 ◽  
Author(s):  
James H. Fetzer

Perhaps no technological innovation has so dominated the second half of the twentieth century as has the introduction of the programmable computer. It is quite difficult if not impossible to imagine how contemporary affairs—in business and science, communications and transportation, governmental and military activities, for example—could be conducted without the use of computing machines, whose principal contribution has been to relieve us of the necessity for certain kinds of mental exertion. The computer revolution has reduced our mental labors by means of these machines, just as the Industrial Revolution reduced our physical labor by means of other machines.


2003 ◽  
Vol 13 (5) ◽  
pp. 771-798 ◽  
Author(s):  
PHILIPPE MATHERAT ◽  
MARC-THIERRY JAEKEL

1954 ◽  
Vol 117 (1) ◽  
pp. 106
Author(s):  
K. D. Tocher ◽  
B. V. Bowden
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document