Szczegóły publikacji
Opis bibliograficzny
Estimation of varying bandwidth from multiple level crossings of stochastic signals / Dominik RZEPKA, Mirosław Pawlak, Marek MIŚKOWICZ, Dariusz KOŚCIELNIK // W: SampTA'17 [Dokument elektroniczny] : 12th international conference on Sampling Theory and Applications : 3–7 July 2017, Tallin, Estonia / eds. Gholamreza Anbarjafari, Andi Kivinukk, Gert Tamberg. — Wersja do Windows. — Dane tekstowe. — [Piscataway] : Institute of Electrical and Electronics Engineers, cop. 2017. — e-ISBN: 978-1-5386-1565-2. — S. 313–317. — Wymagania systemowe: Adobe Reader. — Bibliogr. s. 317, Abstr. — Publikacja dostępna online od: 2017-09-04
Autorzy (4)
- AGHRzepka Dominik
- Pawlak Mirosław
- AGHMiśkowicz Marek
- AGHKościelnik Dariusz
Dane bibliometryczne
| ID BaDAP | 113240 |
|---|---|
| Data dodania do BaDAP | 2018-04-20 |
| Tekst źródłowy | URL |
| DOI | 10.1109/SAMPTA.2017.8024457 |
| Rok publikacji | 2017 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Wydawca | Institute of Electrical and Electronics Engineers (IEEE) |
| Konferencja | 12th International Conference on Sampling Theory and Applications |
Abstract
This papers examines the problem of a local bandwidth recovery for non-stationary stochastic signals when the only available information is given in terms of level crossings. The use of multiple level crossings is a fundamental paradigm for the recently investigated event-based sampling approach. In fact, level crossings allows us to exploit local signal properties and to avoid unnecessarily fast sampling when the local signal intensity is low. The paper proposes the least-square based method for the local intensity estimation from level crossings for the class of signals being the time-warped version of the stationary and bandlimited Gaussian processes. This result is then related to the concept of the local mean bandwidth and finally to the local power bandwidth. The smooth convolution estimate of the local intensity is proposed and its positivity corrected version is introduced. The latter is achieved by the truncation argument and next by the method of alternating projections onto convex sets.
