{'fraction_non_alphanumeric': 0.021395348837209303, 'fraction_numerical': 0.0, 'mean_word_length': 4.977777777777778, '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}}
Capacity of Fading Broadcast Channels with Limited-Rate Feedback

In this paper, we study a fading broadcast channel (BC) with perfect channel state information at the receiver (CSIR) and only a quantized version of it at the transmitter due to limited-rate links for channel feedback at each user. We find an achievable region for the fading BC under this condition using super-position coding and show that it is sumrate optimal. We also derive a closed-form expression for finding channel partitioning, which turns out to be the same in form as that for water-filling of power over time in fading channels. Using the derived closed form expression with temporal waterfilling of power at the transmitter in an iterative manner, we show numerically that a single iteration is adequate to achieve most of the capacity. Thus the complexity of finding the optimal (global maximum) or close to optimal (local maximum) channel partitioning is greatly reduced as compared to using a searchbased k-mean clustering algorithm like Lloyd’s algorithm that requires multiple iterations.