Revised fast convolution
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 outpu...
Main Author: | Rimantas Pupeikis |
---|---|
Format: | Article |
Language: | English |
Published: |
Vilnius University Press
2016-12-01
|
Series: | Lietuvos Matematikos Rinkinys |
Subjects: | |
Online Access: | https://www.journals.vu.lt/LMR/article/view/14964 |
Similar Items
-
Revised linear convolution
by: Rimantas Pupeikis
Published: (2019-11-01) -
Preamble Design Problematic with 802.11a IEEE Standard (Minn’s Training Sequence Approach)
by: R. R. A. Oni
Published: (2008-09-01) -
Fast 10-Point DFT Algorithm for Power System Harmonic Analysis
by: Janusz P. Paplinski, et al.
Published: (2021-07-01) -
On-line Approach for Fast Convolution over Sensor Networks
by: Dalius, et al.
Published: (2018-05-01) -
Fast Fourier transform revisited
by: Rimantas Pupeikis
Published: (2015-12-01)