{'fraction_non_alphanumeric': 0.02053388090349076, 'fraction_numerical': 0.0, 'mean_word_length': 5.09375, '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 LUT-Based Digital Predistortion Block With New Pruning Method

Generalized memory polynomial (GMP) model is widely used to build and compensate for the nonlinearity of power amplifier (PA). To reduce the complexity of the GMP model, a pruning method represented by the doubly orthogonal matching pursuit (OMP) algorithm was proposed. Lookup table (LUT) based predistortion blocks for compensating PAs are widely used. The minimum complexity of the GMP model does not represent the minimum complexity of LUT. To address this issue, this letter proposes one new pruning method to reduce the complexity of digital predistortion (DPD) block based on LUT. This method first classifies and selects the basis functions according to the memory effect and then optimizes the structure of LUT. Experimental results show that the proposed method can obtain the low complexity of DPD block based on LUT and ensure high precision compensation for the nonlinearity of PA.