Abstract: The subject of the study is a noise-proof segregation problem for the sequence being the sum of two independent quasiperiodic sequences. The problem is stated for the case when every quasiperiodic sequence is formed from the known number of identical given subsequences-fragments. A posteriori approach to this problem leads to solving an unexplored discrete optimization problem. A polynomial-time algorithm that guarantees the optimal solution to this optimization problem is proposed. Additionally, there are some examples of numerical simulation for illustration.

Cite: Mikhailova L.
One Segregation Problem for the Sum of Two Quasiperiodic Sequences
XIV International Conference Optimization and Applications 18-22 Sep 2023