{'fraction_non_alphanumeric': 0.025668449197860963, 'fraction_numerical': 0.0021390374331550803, 'mean_word_length': 5.36734693877551, '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}}
Power scalable descrambling methods for bit-interleaved TDM networks

A broadcast network in which a sender transmits to several receivers, each receiving different data, is considered. A time division multiplexing scheme based on bit-interleaving, where each receiver is given an allocation of bit positions occurring in periodic intervals within the frame, is assumed. In previous work, bit-interleaving was shown to yield 30× power savings. However, to enable bit-interleaving, a descrambler design capable of operating on the downsampled data corresponding to the receiver's allocation is required. Several efficient methods are presented to accomplish this task both for fixed and variable allocations to the receivers. The proposed methods can be used to implement a power-scalable, low complexity, and low cost descrambler that operates at the receiver's data rate, which is typically far lower than the total transmission rate.