{'fraction_non_alphanumeric': 0.018583042973286876, 'fraction_numerical': 0.008130081300813009, 'mean_word_length': 5.385185185185185, '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}}
Filter bank representation of complementary sequence pairs

A unique decomposition of arbitrary pairs of complementary sequences (including binary, polyphase and QAM) based on paraunitary matrices is presented. This decomposition allows us to describe the internal structure of any sequence pair of length N using basic paraunitary matrices defined by N complex coefficients named omega vector. When the omega vector is sparse a particularly compact canonic form exists and leads to an efficient implementation of a generator-correlator. The equivalence of paraunitary matrices and Z transforms of complementary sequences allows us to apply the rich results from the theory of perfect reconstruction filter-banks to the field of sequence design. Based on this equivalence a new algorithm for generating/correlating 16-, 64-, and 256-QAM sequences is introduced.