Реферат: We consider an unexplored discrete optimization problem of summing the elements of two numerical sequences. One of them belongs to the given set (alphabet) of sequences, while another one is given. We have to minimize the sum of M terms (M is unknown), each of them being the difference between the unweighted auto-convolution of the first sequence stretched to some length and the weighted convolution of this stretched sequence with the subsequence of the second one.We show that this problem is equivalent to the problem of recognizing a quasiperiodic sequence as a sequence induced by some sequence U from the given alphabet. We have constructed the algorithm which finds the exact solution to this problem in polynomial time. The numerical simulation demonstrates that this algorithm can be used to solve modeled applied problems of noise-proof processing of quasiperiodic signals

Библиографическая ссылка: Khamidullin S. , Mikhailova L.
One Problem of the Sum of Weighted Convolution Differences Minimization, Induced by the Quasiperiodic Sequence Recognition Problem
Communications in Computer and Information Science. 2020. P.51-56. DOI: 10.1007/978-3-030-58657-7_6 Scopus OpenAlex

Идентификаторы БД:

Scopus:	2-s2.0-85092105530
OpenAlex:	W3086071134

Цитирование в БД:

БД	Цитирований
OpenAlex	1

Альметрики: