{'fraction_non_alphanumeric': 0.03122497998398719, 'fraction_numerical': 0.006405124099279423, 'mean_word_length': 5.097560975609756, '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 separation of L sources from M mixtures of speech signals

In many real‐world applications of blind source separation, the number of mixture signals, L, available for analysis often differs from the number of sources, M, which may be present. In this paper, we extend a successful and efficient kurtosis maximization algorithm used in speech separation of two sources from two linear mixtures for use in problems with arbitrary numbers of sources and mixtures. We examine three cases: underdetermined (M L). In each of these cases, we present simulation results (using the TIMIT speech corpus) and discuss separation matrix initialization issues and observed algorithm limitations. We find that in the critically determined case, the algorithm performs well (20–40 dB SIR) at separating four sources from four mixtures. For the other cases, our results are mixed. In the overdetermined case (two sources, three mixtures), the algorithm performs well (20–40 dB SIR) and we find that the extra mixtures do not result in better SIR measurements. In the underdetermined case (three sources, two mixtures), we are able to separate out at least one source (sometimes two) with the other output signals each containing pairs of the remaining sources.