{'fraction_non_alphanumeric': 0.021739130434782608, 'fraction_numerical': 0.0017391304347826088, 'mean_word_length': 5.324175824175824, '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}}
Applying the CBFM-enhanced domain Green's function method to the analysis of large disjoint subarray antennas

This paper considers the efficient numerical analysis of large, finite antenna arrays comprising of disjoint subarrays by using the Domain Green's Function Method (DGFM) [1] in conjunction with the Characteristic Basis Function Method (CBFM) [2]. In the CBFM-enhanced DGFM we consider large arrays consisting of multiple disjoint subarrays and impose the infinite array type assumption, i.e. that the currents on subarrays are identical except for a complex-valued scaling factor. Scan impedance matrices are then constructed for each of the subarrays from the block-partitioned CBFM reduced impedance matrix which account for the mutual coupling in the array environment. Runtime and memory usage scale efficiently for the CBFM-enhanced DGFM as we limit the computational complexity to that required to analyse a single subarray. The paper discusses the hybridisation of the DGFM with the CBFM, and illustrates the results of applying the proposed solution technique to an example consisting of a large finite array of disjoint subarrays.