{'fraction_non_alphanumeric': 0.03006012024048096, 'fraction_numerical': 0.004676018704074816, 'mean_word_length': 5.2677824267782425, '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 Timing-Driven Synthesis Technique for Arithmetic Product-of-Sum Expressions

The arithmetic product-of-sum (POS) is a frequently used datapath operation in modern integrated circuit designs, especially in digital signal processing (DSP) and graphics applications. Since POS blocks typically incur a significant amount of delay, these blocks often become critical in determining the performance of the entire chip. Hence, to improve the efficiency of this operation, it is desirable to use an architecture with good performance characteristics. This paper presents an architectural optimization approach to synthesize a faster POS block, which can be very useful in reducing the delay of the design without significantly impacting its area. Our architecture for the product-of-sum (POS) block is primarily based on the analysis of the corresponding sum-of-products (SOP) expression or a hybrid combination of the POS and the SOP expressions. In our technique, we extensively use arrival-times of the input signals of the product-of-sum block to determine the suitable architecture of the block. We have tested our approach using a variety of POS blocks implemented under varying timing constraints and technology libraries. Experimental results demonstrate that our proposed solution is 10.92% faster (and 3.54% larger) than the corresponding block generated by a commercially available best-in-class datapath synthesis tool. These improvements were verified on placed-and-routed designs as well.