Trellis-Based Postprocessing for Short Delay Measurement Using NDFT

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F19%3A43957481" target="_blank" >RIV/49777513:23520/19:43957481 - isvavai.cz</a>

Výsledek na webu

<a href="https://rdcu.be/bLwKA" target="_blank" >https://rdcu.be/bLwKA</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3103/S0146411619030039" target="_blank" >10.3103/S0146411619030039</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Trellis-Based Postprocessing for Short Delay Measurement Using NDFT

Popis výsledku v původním jazyce

For digital measurement of short delays between fast analogues signals can be used phase shift method with non-uniform sampling and non-uniform Fourier transform (NDFT), but if the signals are short, non-uniform sampling causes random spurious peaks in the spectrum. In case we have sequence of spectrograms with slow frequency change, correct peaks could be found using evaluation of such sequence. Our new Trellis-based postprocessing selects several greatest peaks from each spectrogram in the sequence and interprets them as nodes of an acyclic directed graph. These nodes are weighted and correct ones are found by graph algorithm. Experiments showed that our method provides correct results in cases when ordinary peak detection is not able to distinguish correct and spurious peaks.

Název v anglickém jazyce

Trellis-Based Postprocessing for Short Delay Measurement Using NDFT

Popis výsledku anglicky

For digital measurement of short delays between fast analogues signals can be used phase shift method with non-uniform sampling and non-uniform Fourier transform (NDFT), but if the signals are short, non-uniform sampling causes random spurious peaks in the spectrum. In case we have sequence of spectrograms with slow frequency change, correct peaks could be found using evaluation of such sequence. Our new Trellis-based postprocessing selects several greatest peaks from each spectrogram in the sequence and interprets them as nodes of an acyclic directed graph. These nodes are weighted and correct ones are found by graph algorithm. Experiments showed that our method provides correct results in cases when ordinary peak detection is not able to distinguish correct and spurious peaks.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Automatic Control and Computer Sciences

ISSN

0146-4116

e-ISSN

—

Svazek periodika

53

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

11

Strana od-do

270-280

Kód UT WoS článku

000477023000008

EID výsledku v databázi Scopus

2-s2.0-85069529010