{'fraction_non_alphanumeric': 0.029132791327913278, 'fraction_numerical': 0.0040650406504065045, 'mean_word_length': 4.955645161290323, '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 Complexity PAPR Reduction Algorithm for ATSC 3.0 Transmitters

Tone Reservation (TR) is one of the common algorithms proposed for peak-to-average power ratio (PAPR) reduction in next generation American digital video broadcasting (ATSC 3.0) transmitters. Recently, a quasi-optimal TR technique with a novel kernel definition named as grouped individual carrier multiple peaks (GICMP) scheme has been proposed. In GICMP, firstly, the reserved tones are partitioned into G groups, which also equals to the number of iterations. Then, a comb-like kernel is constructed with each group and it is adjusted to cancel a given set of peaks of data signal at each iteration. This scheme not only offers good performance/complexity trade-off but also compatible with ATSC 3.0 standard. Based on same kernel definition, we have proposed a new method, named as grouped carrier peak windowing (GCPW), which requires less hardware resources, compared to GICMP. Instead of choosing a set of peaks, this new method introduces a peak window to consider a given number of signal samples that exceed the predetermined threshold. This new method aims of reducing first peaks falling within the window, while leaving out higher peaks that may occur later. The simulation results show that the proposed low-complexity GCPW has less hardware memory requirements and with a good choice of threshold, window size and groups, offers quasi-optimal PAPR reduction performance same as that of GICMP.