Period estimation with linear complexity of sparse time varying point processes

Hans-Peter Bernhard, Bernhard Etzlinger, Andreas Springer

Publikation: Konferenzband/Beitrag in Buch/BerichtKonferenzartikelBegutachtung

Abstract

For sparse time-varying point processes we present a period estimator, which is relevant for many applications such as time synchronization of wireless networks in harsh environments. Compared to state-of-the-art methods that are available only for stationary processes, the proposed estimator has a significantly reduced computational complexity while maintaining the same estimation accuracy. The novel approach of estimating the period in time domain, allows to analytically derive the lower bound on the mean square error (MSE), which is presented for the first time. In numerical analysis we show that the proposed algorithm attains the bound.
OriginalspracheEnglisch
TitelConference Record of 51st Asilomar Conference on Signals, Systems and Computers, ACSSC 2017
Herausgeber (Verlag)IEEE Computer Society
Seiten767-771
Seitenumfang5
ISBN (Print)978-1-5386-1824-0
DOIs
PublikationsstatusVeröffentlicht - 10 Apr. 2018
Extern publiziertJa
Veranstaltung2017 51st Asilomar Conference on Signals, Systems, and Computers - Pacific Grove, CA, USA
Dauer: 29 Okt. 20171 Nov. 2017

Publikationsreihe

NameConference Record of 51st Asilomar Conference on Signals, Systems and Computers, ACSSC 2017
Band2017-October

Konferenz

Konferenz2017 51st Asilomar Conference on Signals, Systems, and Computers
Zeitraum29/10/171/11/17

Fingerprint

Untersuchen Sie die Forschungsthemen von „Period estimation with linear complexity of sparse time varying point processes“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren