Comments on, "A note on the computational complexity of the arithmetic Fourier transform" by N. Tepedelenlioglu
- 1 July 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 37 (7) , 1147-1148
- https://doi.org/10.1109/29.32292
Abstract
The commenter states that, because of the use of Farey sequences the result stated by N. Tepedelenlioglu (ibid., vol.37, no.7, p.1146-7, 1989) becomes a statement about D/sub N/, the number of elements in a Farey sequence of order N. Tepedelenlioglu's formula is then equivalent to a formula about Farey sequences given by M.R. Schroder (1986) C.M. Rader (1977). Thus, for example, while a standard FTT algorithm requires 1024 samples to yield 1024 spectral components, AFT would take more than 300000 samples to do the same job.Keywords
This publication has 5 references indexed in Scilit:
- Iterative Realization of the Arithmetic Fourier TransformIEEE Transactions on Signal Processing, 1993
- Fourier analysis and signal processing by use of the Mobius inversion formulaIEEE Transactions on Acoustics, Speech, and Signal Processing, 1990
- Finite Fields for Computer Scientists and EngineersPublished by Springer Nature ,1987
- Number Theory in Science and CommunicationPublished by Springer Nature ,1986
- Recovery of undersampled periodic waveformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977