{'fraction_non_alphanumeric': 0.020460358056265986, 'fraction_numerical': 0.0, 'mean_word_length': 5.6923076923076925, '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}}
A high-performance low-power asynchronous matrix-vector multiplier for discrete cosine transform

This paper proposes a high-performance low-power asynchronous architecture for matrix-vector multipliers of a constant matrix by a vector which are typically used in discrete cosine transform (DCT) and inverse discrete cosine transform (IDCT) applications. The architecture takes advantage of the statistics of DCT and IDCT data that suggest that the input data have mostly zero or small values. It avoids unnecessary arithmetic operations by quickly terminating multiplication by zero and significantly reduces power and delay when operating on a small-valued data by adaptively controlling effective word lengths using fine-grain bit-partitioning and speculative completion sensing.