arXiv subjects

Longguang Li

Publications and source records attributed to Longguang Li.

12 recordsLinked to original sources

arXiv2026

Capacity Bounds and High-SNR Characterization for MIMO-OWC Channels Under Average-Power Constraint

This paper investigates the capacity of multipleinput multiple-output (MIMO) optical wireless communication (OWC) channels under a total average-power constraint. Since different nonnegative input vectors can be mapped to the same image vector and thus induce the same output distribution, we formulate a nonnegative basis pursuit (NN-BP) problem to identify the minimum-l1-norm input vector for each image vector. Based on the NN-BP characterization, we derive an equivalent expression for the channel capacity in terms of the image-vector distribution. We then establish computable lower and upper capacity bounds for both nT >= nR and nT < nR cases, and prove that the proposed bounds are asymptotically tight in the high signal-to-noise ratio (SNR) regime. Numerical results for indoor and outdoor OWC scenarios demonstrate that the proposed bounds improve upon existing ones and close the constant gap in the high-SNR regime.

cs.IT↗

arXiv2026

Secrecy Capacity Analysis and Beamforming Optimization for MIMO-VLC Wiretap Channels

This paper investigates a multiple-input multipleoutput (MIMO) visible light communication (VLC) wiretap channel consisting of a transmitter, a legitimate receiver, and an eavesdropper. The optical input is subject to both peakand average-intensity constraints. By applying the generalized entropy-power inequality to truncated exponential inputs, we derive a novel closed-form expression for the achievable secrecy rate for general MIMO VLC configurations. To enhance transmission confidentiality, a fully-connected beamforming scheme is proposed, along with a low-complexity sub-connected alternative. Although the resulting beamforming design problems are nonconvex, they are efficiently addressed by transforming them into a sequence of convex subproblems solvable via the successive convex approximation framework. Numerical results demonstrate that the proposed schemes achieve significant secrecy performance improvements compared with the benchmark scheme.

cs.IT↗

arXiv2024

Capacity Results for Multiple-Input Multiple-Output Optical Wireless Communication With Per-Antenna Intensity Constraints

In this paper, we investigate the capacity of a multiple-input multiple-output (MIMO) optical intensity channel (OIC) under per-antenna peak- and average-intensity constraints. We first consider the case where the average intensities of input are required to be equal to preassigned constants due to the requirement of illumination quality and color temperature. When the channel graph of the MIMO OIC is strongly connected, we prove that the strongest eigen-subchannel must have positive channel gains, which simplifies the capacity analysis. Then we derive various capacity bounds by utilizing linear precoding, generalized entropy power inequality, and QR decomposition, etc. These bounds are numerically verified to approach the capacity in the low or high signal-to-noise ratio regime. Specifically, when the channel rank is one less than the number of transmit antennas, we derive an equivalent capacity expression from the perspective of convex geometry, and new lower bounds are derived based on this equivalent expression. Finally, the developed results are extended to the more general case where the average intensities of input are required to be no larger than preassigned constants.

cs.IT↗

arXiv2023

Geometrically-Shaped Constellation for Visible Light Communications at Short Blocklength

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.

cs.IT↗

arXiv2023

On the Low-SNR Asymptotic Capacity of Two Types of Optical Wireless Channels under Average-Intensity Constraints

In this paper, we study two types of optical wireless channels under average-intensity constraints. One is called the Gaussian optical intensity channel, where the channel output models the converted electrical current corrupted by additive white Gaussian noise. The other one is the Poisson optical intensity channel, where the channel output models the number of received photons corrupted by a dark current. When the average input intensity $\mathcal{E}$ is small, the capacity of the Gaussian optical intensity channel is shown to scale as $\mathcal{E}\sqrt{\frac{\log\frac{1}{\mathcal{E}}}{2}}$, and the capacity of the Poisson optical intensity channel as $\mathcal{E}\log\log\frac{1}{\mathcal{E}}$. This closes the existing capacity gaps in these two channels.

cs.IT↗

arXiv2023

Distribution Decomposition and Sum-Capacity Results of Two-User Optical Intensity Multiple Access Channels

This paper investigates the sum-capacity of two-user optical intensity multiple access channels with per-user peak- or/and average-intensity constraints. By leveraging tools from the decomposition of certain maxentropic distributions, we derive several lower bounds on the sum-capacity. In the high signal-to-noise ratio (SNR) regime, some bounds asymptotically match or approach the sum-capacity, thus closing or reducing the existing gaps to the high-SNR asymptotic sum-capacity. At moderate SNR, some bounds are also fairly close to the sum-capacity.

cs.IT↗

arXiv2023

On the Capacity Region of Optical Intensity Broadcast Channels

This paper investigates the capacity region of the optical intensity broadcast channels (OI-BCs), where the input is subject to a peak-intensity constraint, an average-intensity constraint, or both. By leveraging the decomposition results of several random variables, i.e., uniform, exponential, and truncated exponential random variables, and adopting a superposition coding (SC) scheme, the inner bound on the capacity region is derived. Then, the outer bound is derived by applying the conditional entropy power inequality (EPI). In the high signal-to-noise ratio (SNR) regime, the inner bound asymptotically matches the outer bound, thus characterizing the high-SNR asymptotic capacity region. The bounds are also extended to the general K-user BCs without loss of high-SNR asymptotic optimality.

cs.IT↗

arXiv2021

On the Capacity of MISO Optical Intensity Channels With Per-Antenna Intensity Constraints

This paper investigates the capacity of general multiple-input single-output (MISO) optical intensity channels (OICs) under per-antenna peak- and average-intensity constraints. We first consider the MISO equal-cost constrained OIC (EC-OIC), where, apart from the peak-intensity constraint, average intensities of inputs are equal to arbitrarily preassigned constants. The second model of our interest is the MISO bounded-cost constrained OIC (BC-OIC), where, as compared with the EC-OIC, average intensities of inputs are no larger than arbitrarily preassigned constants. By leveraging tools from quantile functions, stop-loss transform and convex ordering of nonnegative random variables, we prove two decomposition theorems for bounded and nonnegative random variables, based on which we equivalently transform both the EC-OIC and the BC-OIC into respective single-input single-output channels under a peak-intensity and several stop-loss mean constraints. Capacity lower and upper bounds for both channels are established, based on which the asymptotic capacity at high and low signal-to-noise-ratio are determined.

cs.IT↗

arXiv2021

Tradeoff between Diversity and Multiplexing Gains in Block Fading Optical Wireless Channels

The diversity-multiplexing tradeoff (DMT) provides a fundamental performance metric for different multiple-input multiple-output (MIMO) schemes in wireless communications. In this paper, we explore the block fading optical wireless communication (OWC) channels and characterize the DMT in the presence of both optical peak- and average-power constraints. Three different fading distributions are considered, which reflect different channel conditions. In each channel condition, we obtain the optimal DMT when the block length is sufficiently large, and we also derive the lower and upper bounds of the DMT curve when the block length is small. These results are dramatically different from the existing DMT results in radio-frequency (RF) channels. These differences may be due to the fact that the optical input signal is real and bounded, while its RF counterpart is usually complex and unbounded.

cs.IT↗

arXiv2020

On the Capacity of MIMO Optical Wireless Channels

This paper studies the capacity of a general multiple-input multiple-output (MIMO) free-space optical intensity channel under a per-input-antenna peak-power constraint and a total average-power constraint over all input antennas. The focus is on the scenario with more transmit than receive antennas. In this scenario, different input vectors can yield identical distributions at the output, when they result in the same image vector under multiplication by the channel matrix. We first determine the most energy-efficient input vectors that attain each of these image vectors. Based on this, we derive an equivalent capacity expression in terms of the image vector, and establish new lower and upper bounds on the capacity of this channel. The bounds match when the signal-to-noise ratio (SNR) tends to infinity, establishing the high-SNR asymptotic capacity. We also characterize the low-SNR slope of the capacity of this channel.

cs.IT↗

arXiv2018

On the Capacity of Fading Channels with Peak and Average Power Constraints at Low SNR

The capacity of fading channels under peak and average power constraints in the low-SNR regime is investigated. We show that the capacity scales essentially as ${C \approx A \ \text{SNR} \int_{1- \frac{1}{A}}^1 F^{-1}\left(t\right)dt}$, where $A$ is the peak to average power ratio (PAPR), and $F(\cdot)$ is the cumulative distribution function of the fading channel. We also prove that an On-Off power scheme is sufficient to asymptotically achieve the capacity. Furthermore, by considering the variable PAPR scenario, we generalize the scalability of the capacity and derive the asymptotic expression for the capacity in the low-SNR regime.

eess.SP↗

arXiv2017

Second Order Asymptotics for Communication under Strong Asynchronism

The capacity under strong asynchronism was recently shown to be essentially unaffected by the imposed output sampling rate $ρ$ and decoding delay $d$---the elapsed time between when information is available at the transmitter and when it is decoded. This paper examines this result in the finite blocklength regime and shows that, by contrast with capacity, the second order term in the rate expansion is sensitive to both parameters. When the receiver must exactly locate the sent codeword, that is $d=n$ where $n$ denotes blocklength, the second order term in the rate expansion is of order $Θ(1/ρ)$ for any $ρ=O(1/\sqrt{n})$---and $ρ=ω(1/n)$ for otherwise reliable communication is impossible. However, if $ρ=ω(1/\sqrt{n})$ then the second order term is the same as under full sampling and is given by a standard $O(\sqrt{n})$ term whose dispersion constant only depends on the level of asynchronism. This second order term also corresponds to the case of the slightly relaxed delay constraint $d\leq n(1+o(1))$ for any $ρ=ω(1/n)$.

cs.IT↗