{'fraction_non_alphanumeric': 0.014095536413469069, 'fraction_numerical': 0.0015661707126076742, 'mean_word_length': 4.782805429864253, '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}}
Peak power constrained test sets: generation heuristics and experiments

Life-cycle and reliability of an electronic device are strictly related to the maximum (or peak) power the device dissipates in a single clock cycle. Particular care in situations of peak power violations should be taken in the testing phase of the design process. In such phase, the correctness of the circuit is checked by applying at its primary inputs a set of patterns properly selected with the purpose of detecting the presence of some faults. In a previous work we have addressed the problem of minimizing the peak power of a given combinational test set. The solution we have proposed generates test sets that guarantee a reduced peak power consumption at no penalty in fault coverage. In this paper, we present heuristic variants to the algorithm mentioned above. Such variants aim at increasing the efficiency of the test set, that is, they help better in controlling the size of the modified test set. We also investigate the impact of some of the parameters of the algorithm on the quality of the modified test set, and we support the conclusions we have drawn from the discussion with a large set of experimental data that we have collected on the Iscas'85 combinational benchmark circuits.