{'fraction_non_alphanumeric': 0.018844221105527637, 'fraction_numerical': 0.005025125628140704, 'mean_word_length': 5.930434782608696, '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}}
Approximate quasi-delay-insensitive asynchronous adders: Design and analysis

Approximate computing is gaining increasing interest among the VLSI design community due to its potential for enabling low power, high speed, and less area while delivering acceptably correct computation results for many digital signal processing applications. In this context, this paper considers for the first time asynchronous quasi-delay-insensitive (QDI) realizations of approximate adders which are compared with some existing accurate asynchronous QDI adders based on a 32/28nm CMOS technology. The simulation results and analysis show that approximate asynchronous computing is preferable over accurate asynchronous computing when the accuracy may be traded-off to achieve optimizations in the design metrics.