{'fraction_non_alphanumeric': 0.014965986394557823, 'fraction_numerical': 0.0027210884353741495, 'mean_word_length': 5.6909090909090905, '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}}
Combination Selection Counter for Gaussian Distribution Applications

We present a novel combination selection counter structure for effective search in Gaussian distribution applications. The proposed structure is designed to be used in certain mismatch compensation circuit. However, it can be also used in other applications, where some bit combinations are more probable than others. This counter enables remarkable savings in the switching activity of the calibration stages. In combination selection, the proposed counter enables on average 17% lower switching activity, than traditional Gray counter. The effect of lower switching is emphasized when the counter is used in large array structures with high coupling capacitances.