{'fraction_non_alphanumeric': 0.01225114854517611, 'fraction_numerical': 0.0, 'mean_word_length': 5.88421052631579, '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}}
Effective Nonuniform Fast Fourier Transform for Calculating Sparse Array Patterns

An effective nonuniform fast Fourier transform (NUFFT) is proposed in this paper. Linear interpolation is used to calculate the virtual element excitations by exploiting periodicity in the NUFFT. The use of linear interpolation notably increases the computational efficiency for the calculation of nonuniform antenna array patterns. The computational burden and approximation errors are analyzed, and numerical results for the synthesis of a sparse antenna array through differential evolution are obtained. All results indicate the effectiveness of the proposed method.