Vol.7, No.2, May 2018.                                                                                                                                                                             ISSN: 2217-8309

                                                                                                                                                                                                                eISSN: 2217-8333


TEM Journal



Association for Information Communication Technology Education and Science

On-line Approach for Fast Convolution over Sensor Networks


Dalius Navakauskas, Rimantas Pupeikis


© 2018 Rimantas Pupeikis, published by UIKTEN. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License. (CC BY-NC-ND 4.0)


Citation Information: TEM Journal. Volume 7, Issue 2, Pages 243-249, ISSN 2217-8309, DOI: 10.18421/TEM72-01, May 2018.


Received: 18 November 2017
Accepted: 26 February 2018
Published: 25 May 2018




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.


Keywords – system, response, signal, convolution, filtering.



Full text PDF >  



Copyright © 2012-2018 UIKTEN, All Rights reserved
Copyright licence: All articles are licenced via Creative Commons CC BY-NC-ND 4.0 licence