{'fraction_non_alphanumeric': 0.018915510718789406, 'fraction_numerical': 0.0, 'mean_word_length': 4.925373134328358, '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}}
Minimax envelope constrained filter for radar and communications applications

The envelope constrained filter (ECF) is a useful approach to filter design. The authors of the original concept have proposed algorithms for solving the ECF design problem as well. These algorithms use the tools of nonlinear programming. They are based on a feasible solution assumption. In other words, they perform well when the solution can be found. In most radar applications, and in a great number of communications applications, this is not the case. The paper presents novel algorithms for ECF design, based on minimax algorithms: the minimax algorithms are modified in order to solve the ECF design problem. The main feature of the new approach is a better error control in the nonfeasible solution case.