{'fraction_non_alphanumeric': 0.029863481228668942, 'fraction_numerical': 0.0017064846416382253, 'mean_word_length': 5.141361256544503, '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}}
Antenna Selection for uplink CoMP in dense small-cell clusters

We consider a small-cell cluster consisting of N receive radio-heads connected to a Remote Central Processor (RCP), which jointly decodes K users. Linear filtering across receive antennas is assumed, where the filters are estimated from pilot symbols according to a Least Squares Error (LSE) criterion. Given a limited number of pilot symbols, the Antenna Selection (AS) problem is to determine the subset of radio-heads to include in the filter to maximize the user's Signal-to-Interference-plus-Noise Ratio (SINR). We introduce L1 and L2-norm constraints on the linear filter and show that there can be a substantial performance loss relative to an exhaustive search over the filter order. We then introduce a weighted-norm constraint, which biases the antenna selection towards those with higher path-gain. The optimized weighting profile is characterized numerically, and the performance is observed to be close to exhaustive search. Finally, we present an algorithm for sequentially adding antennas according to decreasing path-gain, which incurs a modest performance loss relative to exhaustive search.