|
Sibirskii Zhurnal Vychislitel'noi Matematiki, 1999, Volume 2, Number 4, Pages 333–349
(Mi sjvm345)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Optimal detection of given number of identical subsequences in quasiperiodic sequence
A. V. Kel'manov, S. A. Khamidullin Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Abstract:
The problem of the detection of given number of identical subsequences in quasiperiodic sequence distorted
by the uncorrelated Gaussian interference with a known dispersion is studied. The aposteriori computing algorithm for the solution to this problem is justified. The case is considered, when the boundaries of an
interval of the beginning and ending of the observations above the distorted sequence do not break the first
and the last subsequence of hidden quasiperiodic sequence into two parts, and the instants of the begining of
the subsequences are the determined values. It is established that the given problem is a particular problem of
the test of the hypothesis about the mean of the Gaussian random vector. The recursion formulas of step by
step discrete optimization ensuring maximum likelihood decsion are obtained. The estimation of temporary
and capacitive of the algorithm is given. The outcomes of the numerical modeling are adduced.
Received: 16.04.1999 Revised: 16.06.1999
Citation:
A. V. Kel'manov, S. A. Khamidullin, “Optimal detection of given number of identical subsequences in quasiperiodic sequence”, Sib. Zh. Vychisl. Mat., 2:4 (1999), 333–349
Linking options:
https://www.mathnet.ru/eng/sjvm345 https://www.mathnet.ru/eng/sjvm/v2/i4/p333
|
Statistics & downloads: |
Abstract page: | 272 | Full-text PDF : | 85 | References: | 45 |
|