Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 207,980,526 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2006

Highly Cited

2006

This paper describes two digital implementations of a new mathematical transform, namely, the second generation curvelet…

Highly Cited

2003

Highly Cited

2003

The fast Fourier transform (FFT) is used widely in signal processing for efficient computation of the FT of finite-length signals…

Highly Cited

1999

Highly Cited

1999

This paper shows how the fast Fourier Transform may be used to value options when the characteristic function of the return is…

Highly Cited

1988

Highly Cited

1988

The Fast Fourier Transform (FFT) is a mathematical method widely used in signal processing. This book focuses on the application…

Highly Cited

1978

Highly Cited

1978

The fast Fourier transform (FFT), a computer algorithm that computes the discrete Fourier transform much faster than other…

Review

1978

Review

1978

This paper makes available a concise review of data windows and their affect on the detection of harmonic signals in the presence…

Highly Cited

1969

Highly Cited

1969

The advent of the fast Fourier transform method has greatly extended our ability to implement Fourier methods on digital…

Highly Cited

1969

Highly Cited

1969

For some time the Fourier transform has served as a bridge between the time domain and the frequency domain. It is now possible…

Highly Cited

1967

Highly Cited

1967

The use of the fast Fourier transform in power spectrum analysis is described. Principal advantages of this method are a…

Highly Cited

1966

Highly Cited

1966

The "Fast Fourier Transform" has now been widely known for about a year. During that time it has had a major effect on several…