{'fraction_non_alphanumeric': 0.019536019536019536, 'fraction_numerical': 0.0, 'mean_word_length': 5.3565891472868215, '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}}
On using the logarithmic number system for finite wordlength matrix inversion

Matrix inversion is a key operation in for instance adaptive filters and MIMO communication system receivers. For ill-conditioned channel matrices long wordlengths are required for fixed-point implementation of matrix inversion. In this work, the wordlength/error trade-offs for matrix inversion using different algorithms with fixed-point and logarithmic number systems (LNS) are considered. LNS provides higher resolution for small numbers and a larger dynamic range. Also, it will alter the cost of the basic operations in the algorithms. The results show that also the wordlength required to achieve a comparable error differ significantly between different algorithms and for most algorithms is reduced for LNS compared to fixed-point.