2018
DOI: 10.1109/access.2018.2882544
|View full text |Cite
|
Sign up to set email alerts
|

Linear Optimal Signal Designs for Multi-Color MISO-VLC Systems Adapted to CCT Requirement

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 38 publications
0
5
0
Order By: Relevance
“…RGB-based systems modify the intensity of the different color LEDs according to the information-bearing signal, for instance, using color Shift Keying (CSK) modulation [17] as in [16,[18][19][20][21][22][23][24]. Other RGB system designs allow the RGB system design to adapt to any target color [25][26][27][28][29][30]. Among previous works, the works in [23,24,26,27] deal with MU scenarios.…”
Section: The Channel Input Amplitudementioning
confidence: 99%
“…RGB-based systems modify the intensity of the different color LEDs according to the information-bearing signal, for instance, using color Shift Keying (CSK) modulation [17] as in [16,[18][19][20][21][22][23][24]. Other RGB system designs allow the RGB system design to adapt to any target color [25][26][27][28][29][30]. Among previous works, the works in [23,24,26,27] deal with MU scenarios.…”
Section: The Channel Input Amplitudementioning
confidence: 99%
“…where t is the intersection value of functions (10) and (11), i.e. the value of P opt,p /P opt,e at point (T p,0 , λ e 0 ).…”
Section: B Empirical Optical Model Of Phosphormentioning
confidence: 99%
“…If and only if u . Because the asymptotic complexity of the conventional inter-point method is N 3.5 u [31,32], the complexity of the proposed algorithm is lower than the inter-point method. Input: the information of terminals and Aps Output: the approximate optimal normalized resource ratio factor x i of each terminal for i = 1 : 1 : Nu calculate the break point σ i for terminal i end for j = 1 : 1 : N A do the following steps for Cell j constitute the break point vector σ j sort σ j in descending order and obtain σ j for k = 1 : 1 :…”
Section: Algorithm Description and Asymptotic Complexity Analysismentioning
confidence: 99%
“…We choose the inter-point method in references [31,32], the RDR-PA method in references [16][17][18] and the conventional uniform allocation method in references [21,22] as comparison methods.…”
Section: Conditionsmentioning
confidence: 99%