{'fraction_non_alphanumeric': 0.024691358024691357, 'fraction_numerical': 0.0012345679012345679, 'mean_word_length': 5.3858267716535435, '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}}
Balance testing of logic circuits

The authors propose a new method for testing logic circuits, termed balance testing, which requires no explicit signatures and is particularly attractive for built-in self-testing. It exploits the balance property possessed by many useful Boolean functions: f(X) is balanced if f(X) = 1 for half its input combinations. The authors analyze balance testing by deriving necessary and sufficient conditions for the detectability of single stuck-line, multiple stuck-line, and bridging faults. These conditions help the designer identify individual faults that remain undetected by balance testing. The analysis also obviates the need for error models that are often difficult to validate. Some feasible design techniques to make logic circuits balance testable are demonstrated.