{'fraction_non_alphanumeric': 0.014056224899598393, 'fraction_numerical': 0.0, 'mean_word_length': 5.782312925170068, '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}}
Blind deconvolution with minimum Renyi's entropy

Blind techniques attract the attention of many researchers due to their numerous promising applications in different fields of signal processing, from communications to control systems. Blind deconvolution is a problem that has been investigated in detail over the last two decades. Many approaches adopting various optimization criteria have been proposed to determine the inverse of the unknown channel filter. Minimum entropy deconvolution, as summarized by Donoho, provides an effective tool for determining the deconvolving filter using only the observed data. Recently, we have proposed an estimator for Renyi's entropy based on Parzen windowing, and demonstrated its superior performance over other entropy estimators in blind source separation and other problems. In this paper, we present a blind deconvolution algorithm based on the minimization of this entropy estimator and investigate its performance through Monte Carlo simulations.