{'fraction_non_alphanumeric': 0.02023121387283237, 'fraction_numerical': 0.0, 'mean_word_length': 5.3, '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}}
Synthesis of Multiple-Pattern Planar Arrays by the Multitask Bayesian Compressive Sensing

Recently, the multitask Bayesian compressive sensing has been successfully applied to the synthesis of single-pattern sparse planar arrays. The aim of this letter is to extend MT-BCS to the synthesis of multiple-pattern planar arrays. To obtain satisfactory results, the spacing of candidate elements predetermined by MT-BCS may be small, which may make the synthesized results impossible to achieve physically. To solve this problem, we merge the elements with small spacing according to their excitations. The convex optimization method is used to recalculate the excitations of the merged elements.