• Publications
• Influence
The Fourier Transform and its Applications.
• Computer Science, Mathematics
• 1 June 1966
This paper analyses Fourier transform used for spectral analysis of periodical signals and emphasizes some of its properties. Expand
• 3,381
• 106
• PDF
Discrete Hartley transform
The discrete Hartley transform (DHT) resembles the discrete Fourier transform (DFT) but is free from two characteristics of the DFT that are sometimes computationally undesirable. The inverse DHT isExpand
• 469
• 31
The Fourier Transform and Its Applications
1 Introduction 2 Groundwork 3 Convolution 4 Notation for Some Useful Functions 5 The Impulse Symbol 6 The Basic Theorems 7 Obtaining Transforms 8 The Two Domains 9 Waveforms, Spectra, Filters andExpand
• 2,568
• 29
The Hartley transform
Fast Fourier Transform is a fast algorithm he discovered for spectral analysis. Expand
• 424
• 28
The Fourier transform.
To calculate a transform, just listen. The ear automatically performs the calculation, which the intellect can execute only after years of mathematical education. The ear formulates a transform byExpand
• 495
• 18
• PDF
When a celestial source of radio waves is scanned with an aerial beam which is much longer than the source in one direction but suitably narrow in the other, the transformation from the trueExpand
• 597
• 16
Two-dimensional imaging
1. Introduction. 2. The Image Plane. 3. Two Dimensional Impulses. 4. The Two Dimensional Fourier Transform. 5. Two Dimensional Convolution. 6. The Convolution Theorem. 7. Sampling and InterpolationExpand
• 329
• 13
Fourier Analysis and Imaging
1 Introduction.- Summary of the Chapters.- Notation.- Teaching a Course from This Book.- The Problems.- Aspects of Imaging.- Computer Code.- Literature References.- Recommendation.- 2 The ImageExpand
• 127
• 9