{'fraction_non_alphanumeric': 0.02619047619047619, 'fraction_numerical': 0.0, 'mean_word_length': 5.229629629629629, '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}}
Sliding windows multiuser detectors for TD-SCDMA system

In CWTS TD-CDMA systems, block-based algorithms adopted in the BTS are well suited for multiuser detection (MUD) in presence of ISI. Block-based algorithms exhibit high computational load for large blocks; usually these algorithms are implemented as sub-optimal ones at the expense of some performance degradation. However, for timevarying channel, block-based MUD introduces a high latency degree and cannot be easily modified to cope with an adaptive receiver design. In this paper, we propose to exploit the sliding window approach to limit the high latency degree common to the block-based algorithms without degrading the performance figures. Both block-based MUD and SWD algorithms are compared in terms of performance, computational complexity and HW/SW implementation issues.