{'fraction_non_alphanumeric': 0.015299026425591099, 'fraction_numerical': 0.0, 'mean_word_length': 5.545454545454546, '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 guaranteed-convergence framework for passivity enforcement of linear macromodels

Passivity enforcement is a key step in the extraction of linear macromodels of electrical interconnects and packages for Signal and Power Integrity applications. Most state-of-the-art techniques for passivity enforcement are based on suboptimal or approximate formulations that do not guarantee convergence. We introduce in this paper a new rigorous framework that casts passivity enforcement as a convex non-smooth optimization problem. Thanks to convexity, we are able to prove convergence to the optimal solution within a finite number of steps. The effectiveness of this approach is demonstrated through various numerical examples.