{'fraction_non_alphanumeric': 0.035227272727272725, 'fraction_numerical': 0.00909090909090909, 'mean_word_length': 5.338129496402877, '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}}
Fast and low roundoff implementation of quadrature mirror filters for subband coding

We propose a fast and low roundoff-noise implementation of alias-free quadrature mirror filters (QMFs) for tree-structured subband coding. When N-tap FIR QMFs are directly utilized, they require 2N multiplications and 2(N-1) additions to obtain a pair of high-band and low-band decimated outputs. Using recursive formulas and the polyphase concept, a QMF implementation is proposed that, for both analysis and synthesis stages, needs only (N/2+2) multiplications and (3N/2+8) additions to compute the same outputs. Furthermore, the proposed algorithm can reduce roundoff error when finite-wordlength processors are used to implement the encoder and decoder. Simulation examples for image coding are also given to demonstrate the differences between the proposed and previously-known algorithms.