Skip to content
naulon
Not checkedNot checked for notices yet.

Revised linear convolution

Rimantas Pupeikis

Lietuvos Matematikos Rinkinys · 2019

doi:10.15388/lmr.a.2019.14959 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

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 an ordinary convolution as well. The idea is that well-known convolution sum algorithm, used to calculate output signal, should not be recalculated with every new input sample. It is necessary just to modify the algorithm, when the new input sample renew the set of previous samples. Approaches in time and frequency domains are analyzed. An example of computation of the convolution in time area is presented.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.