{'fraction_non_alphanumeric': 0.017580144777662874, 'fraction_numerical': 0.0031023784901758012, 'mean_word_length': 5.63013698630137, '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 Practical Methodology to Compress Technology Libraries Using Recursive Polynomial Representation

With the advancement in technology, the libraries used for storing timing, power and other related information of cells have become voluminous. As a result, run-time of loading libraries, that is often governed by I/O or network bottlenecks, has become unacceptably high. Traditionally, this problem is tackled by compressing technology libraries using gzip or other lossless compression technique. In this paper, we propose a practical methodology to compress technology library with a high compression ratio and tolerable errors. The compressed representation is based on representing the discrete functions of the library as suitable polynomials defined recursively with respect to all the independent variables of that function. Our implementation of the proposed methodology shows that the compression ratio of 8-10× can be achieved for realistic error measures.