{'fraction_non_alphanumeric': 0.016597510373443983, 'fraction_numerical': 0.005186721991701245, 'mean_word_length': 5.476510067114094, '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}}
Spatial-temporal Transformation of Sorting Algorithm with "Perfect Interleaving"

The optimal binary number sorting algorithms for hardware realization are analyzed. Spatial-temporal synthesis of the parallel structure of the sorting algorithm of 16th binary numbers by the method of "perfect interleaving" with the use of spatial and temporal graphs has been carried out. Stream, conveyor and recursive structures of binary number sorting devices are constructed. The analytical expressions for determining of the hardware and time complexity of these devices were obtained and their comparative analysis was carried out. As a result of the theoretical studies, it has been shown that the recursive sorting device has 10,8 times less hardware complexity than the conveyor structure. In the practical implementation of these devices in the VHDL language of and their synthesis on the FPGA, the results of experimental studies are close to theoretical calculations.