Joint Sum Rate and Error Probability Optimization: Finite Blocklength Analysis
Mahdi Haghifam, Mohammad Robat Mili, Behrooz Makki, Masoumeh Nasiri‐Kenari, Tommy Svensson · Chalmers Publication Library (Chalmers University of Technology) · 2017
We study the tradeoff between the sum rate and the error probability in downlink of wireless networks. Using the recent results on the achievable rates of finite-length codewords, the problem is cast as a joint optimization of the network sum rate and the per-user error probability. We develop an efficient algorithm based on the divide-and-conquer technique to simultaneously maximize the network sum rate and minimize the maximum users’ error probability and to evaluate the effect of the codeword length on the system performance. The results show that, in delay-constrained scenarios, optimizing the per-user error probability plays a key role in achieving high throughput.