2019
DOI: 10.1109/twc.2018.2878585
|View full text |Cite
|
Sign up to set email alerts
|

Capacity Bounds and Interference Management for Interference Channel in Visible Light Communication Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
24
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(24 citation statements)
references
References 40 publications
0
24
0
Order By: Relevance
“…Due to technical limitations, such a communication method has not drawn much attention for a long period. With the fast development of light-emitting diodes (LEDs), visible light communications (VLC) has attracted considerable interest recently [3], [4]. As a compelling alternative technology for radio frequency (RF) communications, VLC is free from RF interference and is license-free [5].…”
Section: Introductionmentioning
confidence: 99%
“…Due to technical limitations, such a communication method has not drawn much attention for a long period. With the fast development of light-emitting diodes (LEDs), visible light communications (VLC) has attracted considerable interest recently [3], [4]. As a compelling alternative technology for radio frequency (RF) communications, VLC is free from RF interference and is license-free [5].…”
Section: Introductionmentioning
confidence: 99%
“…The authors of [30] consider the problem of optimizing the beamforming vectors through minimizing the transmit power subject to QoS constraints in NOMA-MISO multi-user dynamic and static systems. The authors in [31] extend the work of [30] for multi-cell system model and develop centralized and distributed interference management schemes for VLC systems. Recently, the authors in [32] investigate the outage capacity for a limited system model, consisting of one VLC AP and two users (one is covered, while the other is out of the coverage).…”
Section: B Related Workmentioning
confidence: 96%
“…are given by (28) and (29), or given by (30) and (31), respectively. In addition, the constraints (27) are linear, which shows that problem (27) is convex.…”
Section: Appendix B Proof Of Propositionmentioning
confidence: 99%
“…After that, we develop an iterative algorithm to solve the approximate problem by checking the feasibilities of a series of SOCP problems. • To facilitate the algorithm's implementation, we further recast the SOCP problem such that it fits into the alternating direction method of multipliers (ADMMs) framework [29][30][31][32]. Finally, we devise a user-level distributed algorithm to iteratively solve the SOCP problem.…”
Section: Contributions Of Our Workmentioning
confidence: 99%