Title Revised fast convolution /
Translation of Title Patikslinta greitoji sąsūka.
Authors Pupeikis, Rimantas
DOI 10.15388/LMR.A.2016.18
Full Text Download
Is Part of Lietuvos matematikos rinkinys. Ser. A.. Vilnius : Vilniaus Universiteto Matematikos ir informatikos institutas. 2016, t. 57, p. 97-102.. ISSN 0132-2818. eISSN 2335-898X
Keywords [eng] LTI system ; DFT ; IDFT ; FFT ; convolution
Abstract [eng] It is assumed that linear time-invariant (LTI) system input signal samples are updated by a sensor in real time. It is urgent for every new input sample or for small part of new samples to update a convolution as well. The idea is that fast Fourier transform (FFT) algorithm, used to calculate output frequency samples (f.s.), should not be recalculated with every new input sample. It is needed just to modify the convolution algorithm, when the new input sample replaces the old one. An example of computation of the convolution with ordinary and modified 8-point Fourier code matrix is presented.
Published Vilnius : Vilniaus Universiteto Matematikos ir informatikos institutas
Type Journal article
Language English
Publication date 2016
CC license CC license description