Geometrically-Shaped Constellation for Visible Light Communications at Short Blocklength
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917651984416768 |
|---|---|
| author | Guo, Jia-Ning Chen, Ru-Han Zhang, Jian Li, Longguang Yang, Xu Zhou, Jing |
| author_facet | Guo, Jia-Ning Chen, Ru-Han Zhang, Jian Li, Longguang Yang, Xu Zhou, Jing |
| contents | In this paper, we present a general framework of designing geometrically shaped constellations for short-packet visible light communications with a peak- and an average-intensity constraints. By leveraging tools from large deviation theory, we first characterize the second-order asymptotics of the optimal constellation shaping region under aforementioned intensity constraints, which serves as a good performance measure for the best geometric shaping in finite blocklength. To further incorporate a sufficiently large coding gain and a nearly-maximum shaping gain, we construct multidimensional constellations by the nested structure of Construction B lattices, where the constellation shaping is implemented by controlling the boundary of the embedded sublattice, i.e., a strategy called coarsely shaping and finely coding. Fast algorithms for constellation mapping and demodulation are presented as well. As an illustrative example, we present an energy-efficient $24$-dimensional constellation design based on the Leech lattice, whose superiority over existing constellation designs is verified by numerical results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_02865 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Geometrically-Shaped Constellation for Visible Light Communications at Short Blocklength Guo, Jia-Ning Chen, Ru-Han Zhang, Jian Li, Longguang Yang, Xu Zhou, Jing Information Theory Signal Processing In this paper, we present a general framework of designing geometrically shaped constellations for short-packet visible light communications with a peak- and an average-intensity constraints. By leveraging tools from large deviation theory, we first characterize the second-order asymptotics of the optimal constellation shaping region under aforementioned intensity constraints, which serves as a good performance measure for the best geometric shaping in finite blocklength. To further incorporate a sufficiently large coding gain and a nearly-maximum shaping gain, we construct multidimensional constellations by the nested structure of Construction B lattices, where the constellation shaping is implemented by controlling the boundary of the embedded sublattice, i.e., a strategy called coarsely shaping and finely coding. Fast algorithms for constellation mapping and demodulation are presented as well. As an illustrative example, we present an energy-efficient $24$-dimensional constellation design based on the Leech lattice, whose superiority over existing constellation designs is verified by numerical results. |
| title | Geometrically-Shaped Constellation for Visible Light Communications at Short Blocklength |
| topic | Information Theory Signal Processing |
| url | https://arxiv.org/abs/2311.02865 |