{'fraction_non_alphanumeric': 0.017942583732057416, 'fraction_numerical': 0.0, 'mean_word_length': 5.438461538461539, '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}}
Hybrid Iterative Fourier Transform and Convex Optimization for Pattern Synthesis of Sparse Linear Arrays

The paper deals with the peak sidelobe level (PSLL) suppression problem with sparse linear array antenna. Firstly, the iterative Fourier transform (IFT) algorithm is utilized to optimally selected a thinned linear array which would meet the predetermined fill factor. With the first-order Taylor expansion of the far field with respect to the element position, the original optimization problem is converted to be convex. Then, the element positions of the thinned arrays are further optimized via a convex optimization algorithm. Compared with the existing method, the proposed one can greatly improve the sidelobe performance. Numerical results indicate the proposed method is effective for sparse array synthesis with low PSLL.