{'fraction_non_alphanumeric': 0.011881188118811881, 'fraction_numerical': 0.0, 'mean_word_length': 5.096385542168675, '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}}
An efficient algorithm for FIR filter bank completion

This paper presents an algorithm for designing an FIR paraunitary filter bank when one or several filters are given. The algorithm is based on the properties of the balanced state-space representation of the polyphase matrix. We show that this representation may be computed via a single RQ decomposition thus gaining significant efficiency with respect to previous work. Application of the algorithm to signal-adapted filter banks is also discussed.