On-line Approach for Fast Convolution over Sensor Networks

It is assumed that at some time moment, in wireless sensor networks the new set of current samples of input and system impulse response enter a digital memory replacing the previous samples. It is urgent for each new sample or for a small part of new samples to update a convolution as well. Therefor...

Full description

Bibliographic Details
Main Authors: Dalius, Pupeikis
Format: Article
Language:English
Published: UIKTEN 2018-05-01
Series:TEM Journal
Subjects:
Online Access:http://www.temjournal.com/content/72/TemJournalMay2018_243_249.pdf
id doaj-8149b14466734d49a555fe447d30489d
record_format Article
spelling doaj-8149b14466734d49a555fe447d30489d2020-11-24T20:45:56ZengUIKTENTEM Journal2217-83092217-83332018-05-017224324910.18421/TEM72-01On-line Approach for Fast Convolution over Sensor NetworksDalius0Pupeikis1NavakauskasRimantasIt is assumed that at some time moment, in wireless sensor networks the new set of current samples of input and system impulse response enter a digital memory replacing the previous samples. It is urgent for each new sample or for a small part of new samples to update a convolution as well. Therefore, a recursive fast convolution algorithm is proposed here to solve a linear filtering problem for a nonstationary system. The calculation operations are reduced because most columns of Fourier code matrices and respective rows of the right-hand side vectors were deleted for equal previous and current samples. An example with the ordinary and modified 8-point Fourier code matrices is presented for a nonstationary linear system. The amounts of operations, necessary for recursive and fast Fourier transform algorithms, are calculated. Results are discussed, and the conclusion is given.http://www.temjournal.com/content/72/TemJournalMay2018_243_249.pdfsystemresponsesignalconvolutionfiltering
collection DOAJ
language English
format Article
sources DOAJ
author Dalius
Pupeikis
spellingShingle Dalius
Pupeikis
On-line Approach for Fast Convolution over Sensor Networks
TEM Journal
system
response
signal
convolution
filtering
author_facet Dalius
Pupeikis
author_sort Dalius
title On-line Approach for Fast Convolution over Sensor Networks
title_short On-line Approach for Fast Convolution over Sensor Networks
title_full On-line Approach for Fast Convolution over Sensor Networks
title_fullStr On-line Approach for Fast Convolution over Sensor Networks
title_full_unstemmed On-line Approach for Fast Convolution over Sensor Networks
title_sort on-line approach for fast convolution over sensor networks
publisher UIKTEN
series TEM Journal
issn 2217-8309
2217-8333
publishDate 2018-05-01
description It is assumed that at some time moment, in wireless sensor networks the new set of current samples of input and system impulse response enter a digital memory replacing the previous samples. It is urgent for each new sample or for a small part of new samples to update a convolution as well. Therefore, a recursive fast convolution algorithm is proposed here to solve a linear filtering problem for a nonstationary system. The calculation operations are reduced because most columns of Fourier code matrices and respective rows of the right-hand side vectors were deleted for equal previous and current samples. An example with the ordinary and modified 8-point Fourier code matrices is presented for a nonstationary linear system. The amounts of operations, necessary for recursive and fast Fourier transform algorithms, are calculated. Results are discussed, and the conclusion is given.
topic system
response
signal
convolution
filtering
url http://www.temjournal.com/content/72/TemJournalMay2018_243_249.pdf
work_keys_str_mv AT dalius onlineapproachforfastconvolutionoversensornetworks
AT pupeikis onlineapproachforfastconvolutionoversensornetworks
_version_ 1716813668455284736