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 output...
| Main Author: | |
|---|---|
| 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 |
| _version_ | 1811275741215588352 |
|---|---|
| author | Rimantas Pupeikis |
| author_facet | Rimantas Pupeikis |
| author_sort | Rimantas Pupeikis |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-12T23:43:15Z |
| format | Article |
| id | doaj.art-031b54810cb54fdda5010e48964d2ec9 |
| institution | Directory Open Access Journal |
| issn | 0132-2818 2335-898X |
| language | English |
| last_indexed | 2024-04-12T23:43:15Z |
| publishDate | 2016-12-01 |
| publisher | Vilnius University Press |
| record_format | Article |
| series | Lietuvos Matematikos Rinkinys |
| spelling | doaj.art-031b54810cb54fdda5010e48964d2ec92022-12-22T03:11:55ZengVilnius University PressLietuvos Matematikos Rinkinys0132-28182335-898X2016-12-0157A10.15388/LMR.A.2016.18Revised fast convolutionRimantas Pupeikis0Vilnius UniversityIt 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.https://www.journals.vu.lt/LMR/article/view/14964LTI systemDFTIDFTFFTconvolution |
| spellingShingle | Rimantas Pupeikis Revised fast convolution Lietuvos Matematikos Rinkinys LTI system DFT IDFT FFT convolution |
| title | Revised fast convolution |
| title_full | Revised fast convolution |
| title_fullStr | Revised fast convolution |
| title_full_unstemmed | Revised fast convolution |
| title_short | Revised fast convolution |
| title_sort | revised fast convolution |
| topic | LTI system DFT IDFT FFT convolution |
| url | https://www.journals.vu.lt/LMR/article/view/14964 |
| work_keys_str_mv | AT rimantaspupeikis revisedfastconvolution |