Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916308078034944 |
|---|---|
| author | Egger, Maximilian Bitar, Rawad Wachter-Zeh, Antonia Gündüz, Deniz Weinberger, Nir |
| author_facet | Egger, Maximilian Bitar, Rawad Wachter-Zeh, Antonia Gündüz, Deniz Weinberger, Nir |
| contents | Motivated by communication systems with constrained complexity, we consider the problem of input symbol selection for discrete memoryless channels (DMCs). Given a DMC, the goal is to find a subset of its input alphabet, so that the optimal input distribution that is only supported on these symbols maximizes the capacity among all other subsets of the same size (or smaller). We observe that the resulting optimization problem is non-concave and non-submodular, and so generic methods for such cases do not have theoretical guarantees. We derive an analytical upper bound on the capacity loss when selecting a subset of input symbols based only on the properties of the transition matrix of the channel. We propose a selection algorithm that is based on input-symbols clustering, and an appropriate choice of representatives for each cluster, which uses the theoretical bound as a surrogate objective function. We provide numerical experiments to support the findings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_01263 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels Egger, Maximilian Bitar, Rawad Wachter-Zeh, Antonia Gündüz, Deniz Weinberger, Nir Information Theory Motivated by communication systems with constrained complexity, we consider the problem of input symbol selection for discrete memoryless channels (DMCs). Given a DMC, the goal is to find a subset of its input alphabet, so that the optimal input distribution that is only supported on these symbols maximizes the capacity among all other subsets of the same size (or smaller). We observe that the resulting optimization problem is non-concave and non-submodular, and so generic methods for such cases do not have theoretical guarantees. We derive an analytical upper bound on the capacity loss when selecting a subset of input symbols based only on the properties of the transition matrix of the channel. We propose a selection algorithm that is based on input-symbols clustering, and an appropriate choice of representatives for each cluster, which uses the theoretical bound as a surrogate objective function. We provide numerical experiments to support the findings. |
| title | Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels |
| topic | Information Theory |
| url | https://arxiv.org/abs/2407.01263 |