A new fast algorithm is presented for the multidimensional discrete Fourier transform (DFT). This algorithm is derived using an interesting technique called "vector coding" (VC), and we call it the vector-coding fast Fourier transform (VC-FFT) algorithm. Since the VC-FFT is an extension of the Coole
โฆ LIBER โฆ
Fourier transform algorithms for interferometry
โ Scribed by Horst Ziegler
- Publisher
- Elsevier Science
- Year
- 1975
- Weight
- 492 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0020-0891
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Vector coding algorithms for multidimens
โ
Zhaodou Chen; Lijing Zhang
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 186 KB
New algorithms for calculating discrete
โ
A.M. Grigoryan
๐
Article
๐
1986
๐
Elsevier Science
โ 516 KB
A Fourier transform technique to obtain
โ
Gopalakrishna K. Bhat
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 883 KB
Algorithms for solving Hermite interpola
โ
Elรญas Berriochoa; Alicia Cachafeiro
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 297 KB
We present a method for computing the Hermite interpolation polynomial based on equally spaced nodes on the unit circle with an arbitrary number of derivatives in the case of algebraic and Laurent polynomials. It is an adaptation of the method of the Fast Fourier Transform (FFT) for this type of pro
General equations for the determination
โ
D.D. Honijk; W.F. Passchier; M. Mandel
๐
Article
๐
1972
๐
Elsevier Science
โ 302 KB
A new fast Fourier transform algorithm
โ
I.E. Kaporin
๐
Article
๐
1980
๐
Elsevier Science
โ 367 KB