Search arXivSearch

arXiv · 1701.03253

Achievable Rate Region of the Zero-Forcing Precoder in a 2 X 2 MU-MISO Broadcast VLC Channel with Per-LED Peak Power Constraint and Dimming Control

Abstract

In this paper, we consider the 2 X 2 multi-user multiple-input-single-output (MU-MISO) broadcast visible light communication (VLC) channel with two light emitting diodes (LEDs) at the transmitter and a single photo diode (PD) at each of the two users. We propose an achievable rate region of the Zero-Forcing (ZF) precoder in this 2 X 2 MU-MISO VLC channel under a per-LED peak and average power constraint, where the average optical power emitted from each LED is fixed for constant lighting, but is controllable (referred to as dimming control in IEEE 802.15.7 standard on VLC). We analytically characterize the proposed rate region boundary and show that it is Pareto-optimal. Further analysis reveals that the largest rate region is achieved when the fixed per-LED average optical power is half of the allowed per-LED peak optical power. We also propose a novel transceiver architecture where the channel encoder and dimming control are separated which greatly simplifies the complexity of the transceiver. A case study of an indoor VLC channel with the proposed transceiver reveals that the achievable information rates are sensitive to the placement of the LEDs and the PDs. An interesting observation is that for a given placement of LEDs in a 5 m X 5 m X 3 m room, even with a substantial displacement of the users from their optimum placement, reduction in the achievable rates is not significant. This observation could therefore be used to define "coverage zones" within a room where the reduction in the information rates to the two users is within an acceptable tolerance limit.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amit Agarwal, Saif Khan Mohammed. 2017-01-12. Achievable Rate Region of the Zero-Forcing Precoder in a 2 X 2 MU-MISO Broadcast VLC Channel with Per-LED Peak Power Constraint and Dimming Control. https://doi.org/10.1109/jlt.2017.2719920

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT