Recognition of a Quasi-Periodic Sequence Containing an Unknown Number of Nonlinearly Extended Reference Subsequences

A previously unstudied optimization problem induced by noise-proof recognition of a quasi-periodic sequence, namely, by the recognition of a sequence of length generated by a sequence belonging to a given finite set (alphabet) of sequences is considered. Each sequence from generates an exponentially...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computational mathematics and mathematical physics 2021-07, Vol.61 (7), p.1153-1161
Hauptverfasser:	Kel’manov, A. V., Mikhailova, L. V., Ruzankin, P. S., Khamidullin, S. A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Computational Mathematics and Numerical Analysis Electrocardiography Information Science Mathematical analysis Mathematics Mathematics and Statistics Optimization Polynomials Recognition Sequences Signal processing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!