{'fraction_non_alphanumeric': 0.017937219730941704, 'fraction_numerical': 0.0, 'mean_word_length': 5.158620689655172, '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 novel method for computing element patterns in large/complex periodic circular/cylindrical arrays

As known, element patterns of large planar arrays can be calculated from an infinite array approximation using a Floquet unit cell approach. For large conformal arrays, however, unit cell methods can't be used, and element patterns must be calculated numerically by solving the full boundary value problem, leading to a prohibitively large number of unknowns. In this work we describe a novel method for computing element patterns in large and complex periodic arrays with rotational symmetry. The method is based on phase sequence excitation of the array elements in a radial unit cell, and therefore it is very efficient and reduces the memory requirements. It can be easily implemented using parallel processing, thus it can be interpreted as a domain decomposition method in phase-space.