{'fraction_non_alphanumeric': 0.006299212598425197, 'fraction_numerical': 0.0, 'mean_word_length': 4.888888888888889, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Subspace approach to identification of linear repetitive processes

The aim of this paper is to propose a new approach to the identification of the LRPs based on subspace algorithms. The order of a LRP and the unknown process matrices are determined based on the input and output sequences of the actual pass and the output sequence of the previous pass. The proposed approach can be very useful not only for time invariant LRPs but also for processes with slowly evolving dynamics or processes which dynamics changes rapidly from pass to pass. Simulation examples are provided to illustrate the effectiveness of the proposed approach.