{'fraction_non_alphanumeric': 0.02773497688751926, 'fraction_numerical': 0.0, 'mean_word_length': 5.565656565656566, '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}}
A Low-Complex Virtual Sub-Carrier Reservation Algorithm for PAPR Reduction

Orthogonal Frequency Division Multiplexing (OFDM) as the leading technology for future mobile communication, PAPR reduction is an important research subject which still needs to be researched on. Aiming at solving the problem that complexity of partial transmitting sequence (PTS) method, we propose a low-complex improved algorithm-- iterative PTS based on the traditional PTS, and furthermore, a low complex Virtual sub-carrier Reservation algorithm is proposed according to reduction PAPR by virtual sub-carriers. Simulation results show the effectiveness of the method.