{'fraction_non_alphanumeric': 0.01794453507340946, 'fraction_numerical': 0.0, 'mean_word_length': 5.292307692307692, '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}}
Spectrum sensing in cognitive radios: Design of DFT filter banks achieving maximal time-frequency resolution

Filter banks facilitate an estimation of the power spectral density of broad-band non-stationary signals, an operation required in many cognitive radio systems. The samples at the filter bank output may serve as a basis for an estimation of the input signal energy within any time-frequency (TF) region of interest. In order to achieve a high resolution in both time and frequency, the prototype window underlying a Discrete Fourier Transform (DFT) filter bank needs to exhibit high TF concentration. Moreover, in order to provide uncorrelated samples in case of white input processes, the TF-translated versions of the prototype window that underlie the elementary filtering operations need to constitute an orthogonal set. In this paper we present a technique to design DFT filter banks that possess these two required properties in an optimal manner. The numerical optimization procedure takes advantage of a parametrization of paraunitary filter banks and relies on semidefinite programming. We analyze the residual leakage of our optimized filter banks and draw a comparison against Thomson's multitaper method.