Geometrically Shaped Constellation in Short-Packet Visible Light Communications for IIoT Applications
- 12 February 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (11) , 18220-18234
Abstract
Due to the high data rates, license-free operations and inherent security, visible light communication (VLC) is highly valued in industrial Internet of Things (IIoT) applications. Short packet communication, which offers ultra-low latency and efficient resource utilization, is suitable for the low-latency and massive connectivity demand of the IIoT system. It adopts finite blocklength codewords for data transmissions. In this paper, we present a general framework of designing geometrically shaped constellations in short-packet VLC with peak and average intensity constraints for IIoT applications. 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 metric 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.Keywords
Funding Information
- Research Program of National University of Defense Technology (ZK22-44, ZK23-57)
- National Natural Science Foundation of China (62071489, 62101192, 62331024, 62401593)
This publication has 64 references indexed in Scilit:
- Lattice Coding for Signals and Networks2014
- Wireless Optical Communication Systems2005
- Sphere Packings, Lattices and Groups1999
- Shaping and nonequiprobable signaling for intensity-modulated signalsIEEE Transactions on Information Theory, 1999
- Averaging bounds for lattices and linear codesIEEE Transactions on Information Theory, 1997
- The capacity of average and peak-power-limited quadrature Gaussian channelsIEEE Transactions on Information Theory, 1995
- The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructionsIEEE Transactions on Information Theory, 1994
- Optimal shaping properties of the truncated polydiscIEEE Transactions on Information Theory, 1994
- A bounded-distance decoding algorithm for the Leech lattice, with generalizationsIEEE Transactions on Information Theory, 1989
- Coset codes. I. Introduction and geometrical classificationIEEE Transactions on Information Theory, 1988