Capacity Bounds and Low-Complexity Constellation Shaping under Mixed Gaussian-Impulsive Noise
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909940563574784 |
|---|---|
| author | Qi, Tianfu Wang, Jun |
| author_facet | Qi, Tianfu Wang, Jun |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_08804 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Capacity Bounds and Low-Complexity Constellation Shaping under Mixed Gaussian-Impulsive Noise Qi, Tianfu Wang, Jun Information Theory Signal Processing 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. |
| title | Capacity Bounds and Low-Complexity Constellation Shaping under Mixed Gaussian-Impulsive Noise |
| topic | Information Theory Signal Processing |
| url | https://arxiv.org/abs/2311.08804 |