A Practical Consideration on Convex Mutual Information

TL;DR

This paper investigates convex mutual information in multilevel coding over AWGN channels, revealing that achievable rates can exceed mutual information in the convex region, supported by theoretical analysis and simulations.

Contribution

It provides new insights into the behavior of convex mutual information and achievable rates in multilevel coding schemes over AWGN channels.

Findings

Achievable rates can surpass mutual information in the convex region.

Theoretical analysis supports the possibility of rates exceeding mutual information.

Simulation results confirm the theoretical findings.

Abstract

In this paper, we focus on the convex mutual information, which was found at the lowest level split in multilevel coding schemes with communications over the additive white Gaussian noise (AWGN) channel. Theoretical analysis shows that communication achievable rates (ARs) do not necessarily below mutual information in the convex region. In addition, simulation results are provided as an evidence.