## Abstract

Multi-input multi-output (MIMO) technique is attractive for visible light communication (VLC), which exploits the high signal-to-noise ratio (SNR) of a single channel to overcome the capacity limitation due to the small modulation bandwidth of the light emitting diode. This paper establishes a MIMO VLC system under the non-negativity, peak power and dimmable average power constraints. Assume that perfect channel state information at the transmitter is known, the MIMO channel is changed to parallel, non-interfering sub-channels by using the singular value decomposition (SVD). Based on the SVD, the lower bound on the channel capacity for MIMO VLC is derived by employing entropy power inequality and variational method. Moreover, by maximizing the derived lower bound on the capacity under the given constraints, the receiver deployment optimization problem is formulated. The problem is solved by employing the principle of particle swarm optimization. Numerical results verify the derived capacity bound and the proposed deployment optimization scheme.

© 2016 Optical Society of America

## 1. Introduction

Recently, as the light emitting diode (LED) becomes more and more popular, much research has been focused on visible light communications (VLC) [1]. In point-to-point VLC, achieving high transmission rate is challenging simultaneously with illuminating consistently due to the small bandwidth of the LED [2], but the typical illumination levels in VLC offer very high signal-to-noise ratio (SNR) [3]. The availability of a large number of high SNR channels with sufficient bandwidth makes the multi-input multi-output (MIMO) technique be an efficient transmission scheme for VLC to improve system performance significantly.

In VLC, both illumination and communication are simultaneously implemented. Moreover, the input signal is non-negative and the average optical power cannot change with time. Therefore, the derived results in traditional wireless radio frequency communications are not directly applicable to VLC. So far, the channel capacity for the point-to-point VLC is investigated. In [4], the capacity for VLC is analyzed by using the inverse source coding. In [5], the capacity bounds are derived for VLC under non-negativity and average power constraints. Moreover, by adding a peak power constraint, the capacity bounds for VLC are derived in [6]. In [7], the capacity bounds for VLC with input-dependent noise is analyzed. To the best of our knowledge, the capacity bounds for the MIMO VLC have not been discussed yet in open literature.

In addition, the deployment of the transceivers in MIMO VLC is one of the most important problems. The performance of the system can be dramatically improved by planning the positions of the transceivers. For a MIMO VLC system, the received power is derived in [8], and the conditions that the optimal locations of the transmitters satisfied are given. In [9], the received SNR is analyzed, and proposed a deployment scheme for LEDs, i.e., 4 LEDs are deployed in the corners and 12 LEDs are deployed evenly on a circle. In [10], the received SNR and bit error rate under three deployment schemes for LEDs are discussed. Note that [8–10] investigate the deployment for LEDs. By reasonably planning the positions of the LEDs, the received power or SNR in each position on the receive plane can be as large as possible. However, such deployment may not achieve the maximum capacity. Moreover, in practical indoor environment, the receivers are not deployed in every positions of the receive plane, there are only several places are used for deploying receivers. Therefore, when given the positions of LEDs, how to deploy the receivers to achieve maximum capacity should be studied in future.

Motivated by the above literature, this paper investigates the channel capacity and the receiver deployment optimization for MIMO VLC systems. Under the non-negativity, peak power and dimmable average power constraints, the system model for the MIMO VLC is derived. Assume that the perfect channel state information at the transmitter (CSIT) is known, the channel matrix is converted into several parallel, non-interfering sub-channels by using the singular value decomposition (SVD). According to the principle of the entropy power inequality (EPI) and variational methods, the closed-form expression of the lower bound on the channel capacity for MIMO VLC is derived. Based on the theoretical expression of the lower bound of the capacity, the receiver deployment optimization problem is proposed, which has been shown to be a NP-hard problem without computational efficient algorithms to obtain the optimal solution [11]. From an implementation point of view, heuristic optimization algorithms are preferred. As a very promising heuristic optimization algorithm, the particle swarm optimization (PSO) is employed to solve the optimization problem. Numerical results verify the derived capacity bound and the proposed deployment optimization scheme.

The remainder of this paper is organized as follows. The system model is described in Section 2. In Section 3, the channel capacity for the MIMO VLC is analyzed. Section 4 formulates the receiver deployment optimization problem and proposes a scheme to solve the problem. Simulation results are presented in Section 5 before conclusions are drawn in Section 6.

## 2. System Model

#### 2.1. Received Signal

Consider an indoor MIMO VLC system, as shown in Fig. 1, the length, width and height of the room are *a*, *b* and *c*, respectively. At the transmitter, *N*_{T} LEDs are uniformly deployed on the ceiling, and the coordinate of each LED is
$({x}_{j}^{\mathrm{T}},{y}_{j}^{\mathrm{T}},c)$, *j* = 1,2,·⋯, *N*T. At the receiver, *N*_{R} phonodiodes (PDs) are located on a receive plane with the height *c*^{R}, and the coordinate of each PD is
$({x}_{j}^{\mathrm{R}},{y}_{j}^{\mathrm{R}},{c}^{\mathrm{R}})$, *i* = 1,2, ⋯, *N*R. Mathematically, the received *N*_{R} × 1 dimensional signal vector **Y** at the receiver can be written as

**Z**is the additive white Gaussian noise vector, and each element in

**Z**follows a Gaussian distribution with zero mean and variance

*σ*

^{2}.

*r*is the optoelectronic conversion factor.

**G**is the channel matrix, which is given by

*h*represents the channel gain between the

_{i,j}*i*-th PD and the

*j*-th LED.

Because *r* scales the SNR only, without loss of generality, the value of *r* is set to one. Therefore, (1) can be simplified as

#### 2.2. Channel Gain

In (3), the channel gain *h _{i,j}* in (2) can be written as [12]

*m*is the order of the Lambertian emission,

*A*is the receiver area of the PD,

_{r}*T*and

_{s}*g*are the optical filter gain and the concentrator gain of the PD, respectively. Ψ

_{c,}

*is the field of view (FOV) of the*

_{i}*i*-th PD.

*D*,

_{i,j}*φ*and

_{i,j}*ψ*are the distance, the angle of irradiance and the angle of incidence from the

_{i,j}*j*-th LED to the

*i*-th PD, as shown in Fig. 2.

According to Fig. 2, we have

In this paper, each PD employs very large FOV. Assume that no matter where transceiver is located in, 0 ≤ *ψ _{i,j}* ≤ Ψ

_{c,}

*always hold. Therefore, (4) can be rewritten as*

_{i}#### 2.3. Signal Constraints

In VLC, the information is modulated as the instantaneous optical intensity, and thus all signals in **X** should be non-negative. In addition, due to the physical limitation of the LED, the peak optical power constraint should also be considered. Therefore, we have

*A*is the peak optical power of each LED.

Considering the illumination requirement in VLC, the average optical power cannot be changed but can be adjusted according to the users’ requirement (dimming target). Thus, the dimmable average power constraint can be written as

where 0 <*ξ*≤ 1 is the dimming target.

*P*is the nominal optical power of each LED, which satisfies

*P*≤

*A*.

## 3. MIMO Capacity Analysis

#### 3.1. Channel Decomposition

Assume that perfect CSIT is known, and thus the *N*_{R} × *N*_{T} dimensional channel matrix **G** can be converted to min{*N*_{R}, *N*_{T}} parallel, non-interfering sub-channels by using SVD, i.e.,

**U**and

**V**are

*N*

_{R}×

*N*

_{R}dimensional and

*N*

_{T}×

*N*

_{T}dimensional unitary matrixes.

*N*

_{R}×

*N*

_{T}dimensional matrix

**D**= diag(

*λ*

_{1}, ⋯,

*λ*

_{Γ}, 0, ⋯, 0) is a diagonal matrix with non-negative entries, where Γ ≤ min {

*N*

_{R},

*N*

_{T}} is the rank of

**G**.

Let $\tilde{\mathbf{X}}={\mathbf{V}}^{\mathrm{H}}\mathbf{X}$, $\tilde{\mathbf{Y}}={\mathbf{U}}^{\mathrm{H}}\mathbf{Y}$ and $\tilde{\mathbf{Z}}={\mathbf{U}}^{\mathrm{H}}\mathbf{Z}$, and thus the MIMO channel is converted to parallel, non-interfering sub-channels, which can be described as [13]

**Z**. Figure 3 shows the principle diagram of the SVD for MIMO VLC.

Let $\widehat{\mathbf{X}}=\mathbf{D}\tilde{\mathbf{X}}={({\widehat{X}}_{1},\cdots ,{\widehat{X}}_{\mathrm{\Gamma}},0,\cdots 0)}^{\mathrm{T}}={({\lambda}_{1}{\tilde{X}}_{1},\cdots ,{\lambda}_{\mathrm{\Gamma}}{\tilde{X}}_{\mathrm{\Gamma}},0,\cdots ,0)}^{\mathrm{T}}$, we have

*v*,

_{i,j}*u*and

_{i,j}*h*are the

_{i,j}*i*-th row and the

*j*-th column element of matrixes

**V**,

**U**and

**G**, respectively. Therefore, (10) can be transformed as

#### 3.2. Lower Capacity Bounds of Sub-channels

For the *n*-th sub-channel, (12) can be written as a scalar form

According to (11), the relationship between
${\widehat{X}}_{n}$ and *X _{j}* can be expressed as

From (7), we have 0 ≤ *X _{j}* ≤

*A*, ∀

*j*∈ {1,2, ⋯,

*N*

_{T}}, and thus

Therefore, ${\widehat{X}}_{n}$ should satisfy the following constraint

According to (8), the average optical power of the *n*-th element
${\widehat{X}}_{n}$ in
$\widehat{\mathbf{X}}$ can be written as

Furthermore, the mutual information between ${\widehat{X}}_{n}$ and ${\tilde{Y}}_{n}$ can be expressed as

*H*(·) denotes the entropy.

For two mutually independent variables ${\widehat{X}}_{n}$ and ${\tilde{Z}}_{n}$, the following EPI always hold [14]

Therefore, (18) can be further written as

Under the given constraints (16) and (17), maximizing the left hand side of (20) with respect to
${f}_{{\widehat{X}}_{n}}(x)$, the capacity for the *n*-th sub-channel can be derived. However, it is very hard or even impossible to obtain the actual channel capacity for the MIMO VLC. Fortunately, a lower bound on the capacity can be derived by maximizing the right hand side of (20) with respect to
${f}_{{\widehat{X}}_{n}}(x)$ under constraints (16) and (17). To obtain a tight lower bound, we define a functional

And then consider the following functional optimization problem

The functional optimization problem (22) can be solved by using the variational method [15]. Define the average-to-peak-power ratio (APPR) of the *n*-th sub-channel be *α _{n}* =

*ξ P/A*, and the following theorem is derived.

**Theorem 1** *(1) When α _{n}* = 0.5,

*the solution of optimization problem (22) can be derived as*1

*(2) When α _{n}* ≠ 0.5

*and α*∈ (0,

_{n}*P/A*],

*the solution of optimization problem (22) can be derived as*

*where c*′

_{0}

*is the solution to*

**Proof 1** *See* Appendix A.

According to Theorem 1, substituting (23) or (24) into the right hand side of (18), the lower bound on the capacity for the *n*-th sub-channel can be derived, as shown in the following theorem.

**Theorem 2** *(1) When α _{n}* = 0.5,

*the lower capacity bound for the n-th sub-channel is given by*

*(2) When α _{n}* ≠ 0.5

*and α*∈ (0,

_{n}*P/A*],

*the lower capacity bound for the n-th sub-channel is given by*

**Proof 2** *See* Appendix B.

#### 3.3. Lower Capacity Bound of MIMO Channel

After using SVD, the channel capacity for MIMO VLC can be expressed as

Substituting (26) or (27) into (28), the lower capacity bound of the MIMO channel is derived. i.e., when *α _{n}* = 0.5, the lower capacity bound for MIMO VLC can be written as

When *α _{n}* ≠ 0.5 and

*α*∈ (0,

_{n}*P/A*], the lower capacity bound for MIMO VLC is given by

## 4. Receiver Deployment Optimization

#### 4.1. Problem Formulation

Given the positions of the transmitters, this subsection will planning the positions of *N*_{R} receivers by maximizing the lower capacity bound for MIMO VLC. Mathematically, the optimization problem can be formulated as

*N*

_{R}receivers. In problem (31), Γ,

*λ*and

_{n}*v*in the objective function

_{j,n}*C*

_{Low}can be determined by SVD, which are implicit functions of

**W**. Therefore, problem (31) is a non-convex and non-linear optimization problem, which has been shown to be NP-hard [11].

#### 4.2. Problem Solving

In problem (31), *N*_{R} receiver positions have infinite possibility, which make the problem hard to solve. Intuitively, the positions of the receivers can be discretized. Such discretized positions can be taken as the candidate positions of the receivers, the sub-optimal solutions can be obtained by using traversing search. However, the complexity of such method is too high, especially when the number of discrete points is large or when *N*_{R} is large. Therefore, such method is not practical. From an implementation point of view, computationally efficient algorithms are more preferred. In this subsection, a PSO based iterative searching algorithm is proposed to solve the problem (31).

PSO is one of the most important intelligence optimization algorithms, which was originally introduced by J. Eberhart and R. C. Kennedy [16]. A physical analogy might be a swarm of birds searching for a food source. In the analogy, by using its own flying experience and its companions’ flying experience, each particle (i.e. each bird) adjusts its flying to find the best available food source [17]. When employing PSO to solve problem (31), the first step is to map the problem into the structure of the PSO. In PSO, each particle contains two vectors, i.e., position vector and velocity vector. In problem (31), the coordinates of *N*_{R} receivers make up of the position vector, i.e.,
$\mathbf{W}={\left[{x}_{1}^{\mathrm{R}},{x}_{2}^{\mathrm{R}},\cdots ,{x}_{{N}_{\mathrm{R}}}^{\mathrm{R}},{y}_{1}^{\mathrm{R}}{y}_{2}^{\mathrm{R}},\cdots ,{y}_{{N}_{\mathrm{R}}}^{\mathrm{R}}\right]}^{\mathrm{T}}$, where
$\left({x}_{i}^{\mathrm{R}}{y}_{i}^{\mathrm{R}}\right)$ is the coordinate of the *i*-th receiver. According to local best position, global best position and velocity, the current position vector of each particle is updated.

Assume that the swarm contains *K* particles, the velocity and position of the *k*-th particle in the *t*-th iteration can be written as

*k*-th particle in the

*t*-th iteration, respectively.

*c*

_{1}and

*c*

_{2}are learning factors, which are non-negative constant.

*φ*and

*ψ*are two independent random numbers uniformly distributed in the range of [0,1]. ${\mathbf{Q}}_{k}^{\mathrm{L}}$ denotes the current local best position vector of the

*k*-th particle, and

**Q**

^{∗}denotes the current global best position vector.

*ω*is the inertia weight, which can be derived as

_{t}*ω*

_{max}and

*ω*

_{min}denote the maximum and minimum weights.

*T*

_{max}represents the maximum iteration number.

To facilitate finding the solution of problem (31), a specific criterion named fitness will be used to evaluate the newly derived position vector of the swarm. Obviously, the particle with larger capacity bound should have a higher fitness value. Thus, the fitness function is chosen as

where*C*

_{Low}(

**W**

*(*

_{k}*t*)) is determined by (29) or (30).

After each evaluation, for the *k*-th particle, if the fitness of the newly obtained position vector **W*** _{k}*(

*t*) outperforms that of the local best position vector ${\mathbf{Q}}_{k}^{\mathrm{L}}$, ${\mathbf{Q}}_{k}^{\mathrm{L}}$ will be updated to

**W**

*(*

_{k}*t*). Similarly, for the whole swarm, if the position vector of a particle

**W**

*(*

_{l}*t*) outperforms that of the global best position vector

**Q**

^{∗},

**Q**

^{∗}will be updated to

**W**

*(*

_{l}*t*). In most cases, a large number of iterations will be performed. For each iteration, every particle updates the velocity and the position vectors using (32) and (33), respectively, until the specified number of generations is exceeded. To facilitate the understanding, the proposed PSO-based iterative searching algorithm is illustrated as follows.

## 5. Simulation Results

In this section, the derived lower capacity bound and the proposed iterative searching algorithm will be verified through simulations. The main simulation parameters are shown in Table 1.

#### 5.1. Channel Capacity Simulations

In this subsection, when given the positions of the transmitters, the lower capacity bound will be evaluated by some representative simulations. In the simulation, the positions of the receivers are uniformly distributed, the coordinates are set to be (*ja/*(*N _{R}* + 1),

*b/*2,

*c*

^{R}), ∀

*j*= 1, ⋯,

*N*

_{R}.

Figure 4 illustrates the lower capacity bound versus the peak power of the LED *A* for different numbers of the receivers when *A* = 2*P* and *ξ* = 0.3. It can be seen that, with the increase of *A*, the lower capacity bound increases. Moreover, the lower capacity bound also increase with the increase of *N*_{R}. However, with the increase of the number of receivers, the increasing trend of the lower capacity bound becomes more and more slowly.

Figure 5 shows the lower capacity bound versus the dimming target *ξ* for different APPRs when *A* = 60 dB and *N*_{R} = 3. As can be seen, when *A* = *P*, the lower capacity bound increases and then decreases with the increase of *ξ*. Moreover, the curve in this case is completely symmetric with respect to *ξ* = 0.5. When *A* = 1.5*P* and *A* = 2*P*, the lower capacity bound also increases and then decreases with the increase of *ξ*. However, the curve in this case is asymmetric with respect to *ξ* = 0.5. Specifically, when *ξ* = 1 and *A* = *P*, the capacity bound is zero, which indicates that the VLC with full-illumination target (i.e., *ξ* = 1) cannot be used for data transmission. When *ξ* = 1 and *A* ≠ *P*, the capacity bound is not zero, which indicates that the VLC in this case can also be used for data transmission.

#### 5.2. Receiver Deployment Simulations

In this subsection, the performance of the proposed PSO-based iterative searching algorithm will be verified. The simulation parameters for the proposed algorithm are shown in Table 2.

Figure 6 shows the lower capacity bound versus the iteration number in the proposed PSO-based iterative searching algorithm. As is illustrated in Fig. 6, with the increase of the iteration number, the value of the lower capacity bound becomes larger and larger, and tends to be stable finally. This indicates that the lower capacity bound converges to a good solution.

Figure 7 shows the vertical view of LEDs’ and PDs’ distributions in XY-plane when *N*_{R} =1, 2, 3 and 4, respectively. The XY-coordinates of 4 LEDs are fixed as (1.25,1), (1.25,3), (3.75,1) and (3.75,3), while the XY-coordinates of *N*_{R} PDs are determined by using the proposed algorithm. Obviously, when *N*_{R} = 1, to obtain the higher capacity, the PD is not located in the center of the receive plane, but located in (2, 2). According to the symmetry of the receive plane, the position (3,2) can also achieve the same capacity. When *N*_{R} = 2, the two PDs are placed on the center of Y-axis, the coordinates of the two PDs are (1.15, 2) and (3.85, 2). When *N*_{R} = 3, two PDs are almost located underneath the two LEDs, another PD is located on the center of Y-axis. When *N*_{R} = 4, the four PDs are almost located underneath the four LEDs.

Furthermore, Fig. 8 the vertical view of LEDs’ and PDs’ distributions in XY-plane when *N*_{R} =15, 20, 25 and 30, respectively. From Fig. 8, it can be observed that when the number of the PDs are large, the receivers are almost located underneath the LEDs to obtain a large capacity, which provides a certain reference for future location planning in VLC.

## 6. Conclusion

Considering the non-negativity, peak power and dimmable average power constraints, this paper investigates the channel capacity bound and the receiver deployment optimization for MIMO VLC. By using SVD, the MIMO channel is transformed to several parallel, non-interfering sub-channels. After that, the lower bound on the channel capacity is derived by employing the EPI and variational method. To obtain appropriate positions of the receivers, a receiver deployment optimization problem is proposed, and a PSO-based iterative searching algorithm is proposed to solve the problem. Simulation results show that the channel capacity increases with the increase of the number of receivers. Moreover, when the receivers are located underneath the transmitters, the MIMO system can achieve large capacity.

## Appendix A Proof of *Theorem 1*

Assume that ${\tilde{f}}_{{\widehat{X}}_{n}}(x)$ is the solution to problem (22), define a perturbation function ${\tilde{f}}_{{\widehat{X}}_{n}}(x)$ as follows

where*ε*is a variable. The perturbation function ${\tilde{f}}_{{\widehat{X}}_{n}}(x)$ should also satisfy the two constraints in problem (22). Equivalently,

*η*(

*x*) in (36) should satisfy

Define a function *ρ*(*ε*) with respect to *ε* as

Because the minimum value of *ρ*(*ε*) is obtained when *ε* = 0, and we have

Considering the two constraints in (37), the following two equations can be derived as

where*c*

_{0}is an arbitrary constant, and ${c}_{0}^{\prime}$ is a non-zero constant.

Therefore, there may be two solutions for ${f}_{{\widehat{X}}_{n}}(x)$, i.e.,

or- If the PDF of ${\widehat{X}}_{n}$ is (42), substituting (42) into the first constraint of (22), we have Substituting (44) into (42), (23) is derived.
Then, substituting (23) into the second constraint of problem (22), and using the definitions of ${\widehat{A}}_{n}$ and ${\widehat{B}}_{n}$, we have

which can be equivalently expressed as*α*= 0.5._{n} - If the PDF of ${\widehat{X}}_{n}$ is (43), substituting (43) into the first constraint of (22), we have$${\mathrm{e}}^{-1}=\frac{{c}_{0}^{\prime}}{{\mathrm{e}}^{{c}_{0}^{\prime}{\widehat{B}}_{n}}-{\mathrm{e}}^{{c}_{0}^{\prime}{\widehat{A}}_{n}}}$$Substituting (46) into (43), (24) is derived.
Then, substituting (24) into the second constraint of problem (22), we have

$$\frac{{\widehat{B}}_{n}{\mathrm{e}}^{{c}_{0}^{\prime}{\widehat{B}}_{n}}-{\widehat{A}}_{n}{\mathrm{e}}^{{c}_{0}^{\prime}{\widehat{A}}_{n}}}{{\mathrm{e}}^{{c}_{0}^{\prime}{\widehat{B}}_{n}}-{\mathrm{e}}^{{c}_{0}^{\prime}{\widehat{A}}_{n}}}-\frac{1}{{c}_{0}^{\prime}}=\xi P{\lambda}_{n}{\displaystyle \sum _{j=1}^{{N}_{\mathrm{T}}}{v}_{j,n}}$$According to the definitions of ${\widehat{A}}_{n}$ and ${\widehat{B}}_{n}$, we have

## Appendix B Proof of *Theorem 2*

- When
*α*= 0.5, the PDF of ${\widehat{X}}_{n}$ is (23). Therefore, $H({\widehat{X}}_{n})$ can be derived as_{n}Furthermore, the lower bound on the capacity for the

*n*-th channel can be expressed as$${C}_{n}\ge \frac{1}{2}\mathrm{ln}\left(1+\frac{{\left({\widehat{B}}_{n}-{\widehat{A}}_{n}\right)}^{2}}{2\pi \mathrm{e}{\sigma}^{2}}\right)$$According to the definitions of ${\widehat{A}}_{n}$ and ${\widehat{B}}_{n}$, we have

$${\widehat{B}}_{n}-{\widehat{A}}_{n}={\lambda}_{n}A{\displaystyle \sum _{j=1}^{{N}_{\mathrm{T}}}\left|{v}_{j,n}\right|}$$Therefore, by substituting (51) into (50), (26) can be derived.

- When
*α*≠ 0.5 and_{n}*α*∈ (0,_{n}*P/A*], the PDF of ${\widehat{X}}_{n}$ is (24). Therefore, $H({\widehat{X}}_{n})$ is given by$$H({\widehat{X}}_{n})=\mathrm{ln}\left(\frac{{\mathrm{e}}^{{c}_{0}^{\prime}{\widehat{B}}_{n}}-{\mathrm{e}}^{{c}_{0}^{\prime}{\widehat{A}}_{n}}}{{c}_{0}^{\prime}}\right)-{c}_{0}^{\prime}\left(\frac{{\widehat{B}}_{n}{\mathrm{e}}^{{c}_{0}^{\prime}{\widehat{B}}_{n}}-{\widehat{A}}_{n}{\mathrm{e}}^{{c}_{0}^{\prime}{\widehat{A}}_{n}}}{{\mathrm{e}}^{{c}_{0}^{\prime}{\widehat{B}}_{n}}-{\mathrm{e}}^{{c}_{0}^{\prime}{\widehat{A}}_{n}}}-\frac{1}{{c}_{0}^{\prime}}\right)$$Substituting (25) and (48) into (52), we haveAccording to the definitions of ${\widehat{A}}_{n}$ and ${\widehat{B}}_{n}$, (53) can be further written as

$$\begin{array}{l}H({\widehat{X}}_{n})=\mathrm{ln}[(\mathrm{exp}\left(-{c}_{0}^{\prime}\xi P{\lambda}_{n}{\displaystyle \sum _{j=1}^{{N}_{\mathrm{T}}}{v}_{j,n}}\right)\\ \phantom{\rule{3em}{0ex}}\times \frac{\left(\mathrm{exp}\left(-{c}_{0}^{\prime}{\lambda}_{n}A{\displaystyle \sum _{j=1}^{{N}_{\mathrm{T}}}\mathrm{max}\{0,{v}_{j,n}\}}\right)\left(-{c}_{0}^{\prime}{\lambda}_{n}A{\displaystyle \sum _{j=1}^{{N}_{\mathrm{T}}}\mathrm{max}\{0,{v}_{j,n}\}}\right)\right)}{{c}_{0}^{\prime}}\end{array}$$Therefore, the lower bound on the capacity for the

*n*-th channel can be derived as (27).

## Acknowledgments

This work is supported by National 863 High Technology Development Project (2014AA01A701), National Natural Science Foundation of China (61372106, 61223001, 61322112 & 61531166004), Science and Technology Project of Guangdong Province (20140119), and Research Project (2014CB360507).

## References and links

**1. **A. Jovicic, J. Li, and T. Richardson, “Visible light communication: opportunities, challenges and the path to market,” IEEE Commun. Mag. **51**(12), 26–32 (2013). [CrossRef]

**2. **L. Zeng, D. O’Brien, H. Minh, G. Faulkner, K. Lee, D. Jung, Y. Oh, and E. T. Won, “High data rate multiple input multiple output (MIMO) optical wireless communications using white LED lighting,” IEEE J. Sel. Areas Commun. **27**(9), 1654–1662 (2009). [CrossRef]

**3. **L. Hanzo, H. Haas, S. Imre, D. O’Brien, M. Rupp, and L. Gyongyosi, “Wireless myths, realities, and futures: from 3G/4G to optical and quantum wireless,” Proc. IEEE **100**, 1853–1888 (2012). [CrossRef]

**4. **K.-I. Ahn and J. K. Kwon, “Capacity analysis of M-PAM inverse source coding in visible light communication,” J. Lightwave Technol. **30**(10), 1399–1404 (2012). [CrossRef]

**5. **J.-B. Wang, Q.-S. Hu, J. Wang, M. Chen, and J.-Y. Wang, “Tight bound on channel capacity for dimmable visible light communications,” J. Lightwave Technol. **31**(23), 3771–3779 (2013). [CrossRef]

**6. **J.-B. Wang, Q.-S. Hu, J. Wang, M. Chen, Y.-H. Huang, and J.-Y. Wang, “Capacity analysis for dimmable visible light communications,” in IEEE Int. Conf. Commun. (2014).

**7. **J.-Y. Wang, J.-B. Wang, M Chen, and J. Wang, “Capacity bounds for dimmable visible light communications using PIN photodiodes with input-dependent Gaussian noise,” in IEEE Global Commun. Conf. (2014), pp. 2107–2112.

**8. **D. Ding, X. Ke, and L. Xu, “An optimal lights layout scheme for visible-light communication system,” in 8th Int. Conf. Electron. Measurement and Instruments, Xi’an, China, 189–194 (2007).

**9. **Z. Wang, C. Yu, W.-D. Zhong, J. Chen, and W. Chen, “Performance of a novel LED lamp arrangement to reduce SNR fluctuation for multi-user visible light communication systems,” Opt. Express **20**(4), 4564–4573 (2012). [CrossRef] [PubMed]

**10. **S.-I. Choi, “New type of white-light LED lighting for illumination and optical wireless communication under obstacles,” J. Opt. Soc. Korea **16**(3), 203–209 (2012). [CrossRef]

**11. **J.-Y. Wang, J.-B. Wang, X. Song, M. Chen, and J. Zhang, “Network planning for distributed antenna-basedhigh-speed railway mobile communications,” Trans. Emerging Telecommun. Technol. **25**(7), 702–722 (2014).

**12. **T. Komine and M. Nakagawa, “Fundamental analysis for visible-light communication system using LED lights,” IEEE Trans. Consumer Electron ., **50**(1), 100–107 (2004). [CrossRef]

**13. **E. Biglieri, R. Calderbank, A. Constantinides, A. Goldsmith, A. Paulraj, and H. V. Poor, *MIMO Wireless Communications*(Cambridge University Press, 2007). [CrossRef]

**14. **S. Verdu and D. Guo, “A simple proof of the entropy-power inequality,” IEEE Trans. Inf. Theory **52**(5), 2165–2166 (2006). [CrossRef]

**15. **M. reznikov, *Variational Method*, (Lambert Academic Publishing, 2012).

**16. **J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” in IEEE Int. Conf. Neural Netw. (1995), pp. 1942–1948.

**17. **A. E. Forooshani, A. A. Lot-Neyestanak, and D. G. Michelson, “Optimization of antenna placement in distributed MIMO systems for underground mines,” IEEE Trans. Wirel. Commun. **13**(9), 4685–4692 (2014). [CrossRef]