{'fraction_non_alphanumeric': 0.01447876447876448, 'fraction_numerical': 0.0, 'mean_word_length': 5.647435897435898, '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}}
Tools for Regularizing Array Designs

The theory of synthesis for designing regular array architectures has been established for some time and design tools which automate some of the design steps have been developed. However, the design process is complicated by the lack of high level tools for regularizing a design. A tool for regularizing systems of affine recurrence equations (SARE) into uniform recurrence format is presented in this article. Such formats are suitable for direct application of synthesis techniques for designing regular array architectures. The main difficulties in regularizing a design such as choosing regularization vectors verifying the consistency of the transformed system are overcome through a set of high-level transformations. These transformations, which are currently lacking in design environments, simplify the designer's task of specifying algorithms for synthesizing regular arrays. Examples are presented to illustrate the use of these high-level transformations in regularizing array designs.