Capacity Bounds and Low-Complexity Constellation Shaping under Mixed Gaussian-Impulsive Noise

TL;DR

This paper derives tight bounds on channel capacity under mixed Gaussian-impulsive noise and introduces a low-complexity constellation shaping method that maximizes mutual information without iterative procedures.

Contribution

It provides the first asymptotic capacity bounds for channels with mixed noise and proposes a novel, non-iterative constellation shaping technique.

Findings

Derived tight capacity bounds that converge asymptotically.

Proposed constellation shaping achieves highest mutual information.

Simulation confirms bounds' accuracy and shaping method's effectiveness.

Abstract

This paper investigates the bounds on channel capacity and constellation shaping under memoryless mixed noise, which is composed of impulsive noise (IN) and white Gaussian noise (WGN). The capacity bounds are derived using the entropy power inequality and the dual expression of capacity. It is then shown that the proposed lower and upper bounds asymptotically converge to the true channel capacity, and the analytic asymptotic capacity expression is obtained. Leveraging this property, we design a low-complexity constellation shaping method that operates without iterative procedures. Simulation results demonstrate that the derived bounds are remarkably tight, and the shaped constellation achieves the highest mutual information among all considered baseline schemes.