Fast Fourier transform revisited
Rimantas Pupeikis
Vilnius University
Published 2015-12-15


digital signal processing (DSP)
discrete Fourier transform (DFT)

How to Cite

Pupeikis R. (2015) “Fast Fourier transform revisited”, Lietuvos matematikos rinkinys, 56(A), pp. 113–118. doi: 10.15388/LMR.A.2015.20.


Using FFT (fast Fourier transform), it is assumed, that some signal samples in a respective period N are updated by a sensor in real time. It is urgent for every new signal sample to have new frequency samples (f.s.). The idea is that FFT should not be recalculated with every new signal sample, it is needed just to modify it, when the new sample replaces the old one.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy