Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Simultaneous channel estimation and signal detection in wireless ultraviolet communications combating inter-symbol-interference

Open Access Open Access

Abstract

One primary challenge in wireless ultraviolet communications (UVCs) is the inter-symbol-interference (ISI), which may block the detection of current informative signal, especially when channel-related characteristics are unknown. In this paper, we propose a UV channel-related Bayesian scheme that can simultaneously estimate the channel characteristics and detect informative signals, which therefore can address the ISI disturbance. By investigating the UV single-scattering photon model, the dynamic behaviors of the channel state information (CSI), which involve the uncertain signal and the unknown channel parameters are formulated. Hence, a sequential Bayesian process is suggested to estimate the UV CSI. Numerical analysis shows that the proposed scheme can obtain a promising estimation performance (i.e., the relative errors are less than 4%), and gain an extra 4dB detection performance compared with imperfect maximum-likelihood sequence detection (MLSD) scheme.

© 2018 Optical Society of America under the terms of the OSA Open Access Publishing Agreement

1. Introduction

Recent advances in constructing low-cost and reliable ultraviolet (UV) transceivers, as well as its inherent advantages (e.g., solar-blind [1–4] and non-line-of-sight (NLOS) [1, 2, 5]), have made the ultraviolet communications (UVCs) a promising supplement to the traditional wireless communications. From academic perspectives, increasing efforts have been spent on model formulations [2, 6–8], and scheme designs [9–12], which aim to enhance the accuracy of informative signal detections, or monitor the parameters of interest, e.g., transmission distance, apex or directional angles. In practice, detecting signals and estimating channels may be severely affected by the inter-symbol-interference (ISI), which needs to be addressed.

In the context of UVCs, signal detections and channel estimations can be viewed as a mixed detection and estimation (MDE) problem. The detection of informative signals and the estimations of channel characteristics may mutually interact with each other. To be specific, one erroneous signal detection may mislead the inference of channel characteristics, which in turns may affect the next-round detection. Most existing works focusing on either channel estimation or signal detection unfortunately, did not consider this coupling interactions between estimation and detection, thereby becoming less attractive in applications. For instance, [11,13,14] providing effective UV channel codes under known channel characteristics, may not perform as expected if the channel impulse response (CIR) is unattainable, let alone the aforementioned interactions. Similarly, with assuming a perfectly known CIR, [15,16] proposing receivers and detectors to combat ISI, although theoretically significant, may not function well if the channel parameters are unknown. Channel estimation schemes in [17] can derive precise channel estimations via a designed pilot sequence, however may not be able to pursue estimations from the random informative signals, e.g., random on/off keying (OOK) signals. To the best knowledge, [9] was the first to consider both channel estimations and signal detections, designing a UV channel-related pilot sequence to acquire the CIR, which will then be used in maximum-likelihood sequence detection (MLSD) for acquisition of signal stream. However, sending and processing pilot sequences may cost extra time and energy. Besides, the time-delay may be underestimated in acquisitions of real-time channel characteristics. As such, by exploiting the imperfectly known UV channel parameters, the detection performance of the MLSD (referred as imperfect MLSD) may be subsequently compromised, and therefore simultaneously pursuing channel estimation as well as signal detection is of necessity.

The MDE problem has been widely studied in the traditional wireless communications [18–22]. The term deep sensing was first proposed in [21, 22], to detect a primary-user’s spectrum utilization, and estimate its time-varying channel in cognitive radio scenarios. However, there is little research on how to cope with the MDE problem in the UVC scenarios, especially when encountering the specific UV ISI driven by the photon scattering phenomenon.

In this paper, to combat the ISI effect on the MDE problem, we focus on devising an UV channel-related Bayesian scheme, which can detect informative signals and estimate the channel characteristics simultaneously. To sum up, the main contributions are listed as follows:

  1. By investigating the UV single-scattering channel model, the dynamic UV channel information state (CSI) involving the unknown channel parameters and informative signals is formulated. Hence, the MDE problem in UVCs is equivalent with the acquisition of accurate UV CSIs. Moreover, we construct a transitional density in order to characterize the evolution of the UV CSI. Relying on this transitional density, we can derive a priori that is important for the inference of the current CSI from the ISI contaminated signal.
  2. Given the prior density and the current contaminated signal, a sequential Bayesian framework is considered to derive the UV CSIs. In this view, we devise a particle filter (PF)-based algorithm, incorporating with the UV channel-related characteristics, to realize the framework. By operating UV channel-related particles, this PF-based algorithm makes the Bayesian framework feasible for the UVC scenarios, and hence is capable of obtaining the requested UV CSI.
  3. We evaluate the detection and estimation performance of the proposed UV channel-related Bayesian scheme. It is shown from the numerical analysis that, by inferring the UV CSI via the proposed scheme, the performance of detecting informative signals and channel estimations can be significantly improved, as opposed to the MLSD under imperfectly known CIR (i.e., the imperfect MLSD). Moreover, the computational complexity of the proposed scheme is much lower than that of MLSD. By casting the accurate acquisition of both the signal detections and channel estimations into an energy-efficient pattern, the proposed scheme provides a great promise to the future applications of UVCs.

2. UV single-scattering model and problem formulation

In general UVC scenarios, a transmitter and a receiver is deployed as shown in Fig. 1. As for the receiver, we assume we know most of the channel parameters (i.e., the emitted energy in terms of the photons number NT, the atmospheric coefficients ke and ka, the receiver half-field of view θR, and the receiver apex angle βR), except for parameters that are relevant with the transmitter (i.e., the transmission distance r, the transmitter beam divergence θT, the transmitter apex angle βT). Here, we assume the atmospheric coefficients ke and ka are constants within the detection and estimation period (or at least remain unchanged with a coherence time in the order of 100ms compared with signal interval Tb in the order of μs) [23]. The formula of CIR, denoted as h(t, r, θT, βT) is known from [6], referred as single-scatter photon model (see in Fig. 1).

 figure: Fig. 1

Fig. 1 UV system structure. a) gives the UVC system with channel parameters, i.e., the transmission distance r, the transmitter beam divergence θT, the transmitter apex angle βT, the receiver half-field of view θR, and the receiver apex angle βR. b) illustrates the CIR h(t) under conditions of the emitted photons number NT = 1.7 × 1013, the atmospheric coefficients ka = 5 × 10−4m−1 and ks = 4.9 × 10−4m−1, and channel parameters illustrated in (a), i.e., r = 250m, βT = βR = π/4, and θT = θR = π/12. When Tb = 0.1μs, we have M = 7 and the value of qm.

Download Full Size | PDF

For each discrete time-slot k, we characterize the average number of received photons, denoted as λk, as follows :

λk=NT(xkq0+m=1Mxkmqm)
where xk denotes the current informative signal, and gives the useful signal. Here we adopt the OOK signal, which randomly takes from the binary set {0, 1}. And other sophisticated signal types are also applicable. xkM:k−1 ≜ [xkM, xkM+1, ..., xk−1]T is the previous informative signals which contribute the ISI component. M is the ISI memory determined by the CIR and the signal interval Tb [2]. qm is the probability of receiving a photon emitted at the (km)th time-slot. Given the CIR and the signal interval Tb (e.g., as illustrated by Fig. 1) where Tb = 0.1μs), we can firstly determine qm by:
qm=mTb(m+1)Tbh(t,r,θT,βT)dt
Then, based on Eq. (2), we can compute the ISI memory M, i.e. M = arg minm∈ℕ+ |qmγ|, where γ is a predefined constant approaching to 0 i.e. γ → 0, suggesting that we consider the M + 1 ISI components with relatively large qm, 0 ⩽ mM, and omit certain ISI if their qm → 0. Note from Eq. (2) that qm and M may be incorrectly computed if the unknown parameters r, θT and βT are erroneous, which will lead to false detection of current signal.

The number of received photons (i.e., nk ∈ ℕ+), modeled as a Poisson random variable with average λk [2,24], will be measured in terms of the voltage measurement, denoted as zk, i.e. [3]:

zk=Ahνnk+k
where A is the simplified amplification parameter. h = 6.626 × 10−34Js is the Plunk constant. ν = 3.77 × 106GHz is the frequency of UV beam. k represents the additive Gaussian thermal noise, governed by expectation μ and variance σ2, i.e., kN(μ, σ2).

3. UV channel-related Bayesian scheme

In this section, we will elaborate the UV channel-related Bayesian scheme, aiming to simultaneously detect the informative signal xk, as well as estimate unknown channel parameters i.e., the transmission distance r, the transmitter beam divergence θT, and the transmitter apex angle βT. To this end, we firstly construct the UV CSI, denoted as uk which involves informative signal and the parameters of our interest. Then, a transitional probability matrix (TPM) of the UV CSI in order to describe the dynamic evolution from uk−1 to uk is provided. Relying on the TPM, the sequential Bayesian process is suggested to sequentially estimate the requested CSI. Finally, the signal and channel parameters will be inferred from the derived CSI.

3.1. Construction of UV CSI

In order to characterize the random informative signals and unknown channel parameters, we build an union UV CSI, defined as uk ≜ [xkM:k, r, θT, βT]T which contains the elements waiting to be inferred.

It is noteworthy that uk and uk−1 have an overlapping part, suggesting an evolution of uk from uk−1. In other words, by defining the space of the UV CSI as uk ∈ 𝕊 ≜ {s1, s2..., sL}, L = 2M+1, we construct the transitional TPM, denoted as P to characterize the CSI evolution from (k − 1)th to kth time-slot, i.e.:

P=[P11P1LPL1PLL]
where Plj represents the transitional UV CSI probability of uk = sj moving from uk−1 = sl, i.e.:
PljPr{uk=sj|uk1=sl}
Relying on Eqs. (4) and (5), we can further derive a transitional PDF of the UV CSI uk from uk−1, denoted as ξk(uk|uk−1), i.e. ξk(uk = sj|uk−1 = sl) = Plj, which will be used in the Bayesian estimating process.

For the likelihood density of the UV CSI, denoted as φk(zk|uk), we measure uk in terms of the λk given by Eqs. (1) and (2), i.e.:

φk(zk|uk)=nkPr(nk)p(zk|nk)=12πσ2nk+(λk)nk(nk)!exp(λk(zkAhνnkμ)22σ2)

3.2. Bayesian framework

Given the transitional PDF of the CSI as ξk(uk|uk−1), its likelihood density, φk(zk|uk), and the measurement vector i.e., z1:k ≜ [z1, z2, ..., zk]T, we consider the Bayesian framework in order to derive the UV CSI, i.e.:

ϱk|k1(uk|z1:k1)=ξk(uk|uk1)ϱk1|k1(uk|z1:k1)duk1
ϱk|k(uk|z1:k)=φk(zk|uk)ϱk|k1(uk|z1:k1)φk(zk|uk)ϱk|k1(uk|z1:k1)duk
where the Eq. (7) refers to the predict-stage, and the Eq. (8) accounts for the update-stage. For the predict-stage, the predicted density ϱk|k−1(uk|z1:k−1) is constructed by evolving the previously posterior density ϱk−1|k−1(uk−1|z1:k−1) via the transitional PDF ξk(uk|uk−1). For the update-stage, the posterior PDF, denoted as ϱk|k (uk|z1:k) is derived via updating the predicted PDF through the likelihood density.

After the acquisition of the posterior density, the estimated CSI, denoted as ûk can be derived by maximizing the posteriori, i.e.:

u^k=argmaxuk𝕊{ϱk|k(uk|z1:k)}

With the help of the obtainment of ûk, we can subsequently derive the k, , θ̂T, and β̂T.

3.3. Particle filter realization of Bayesian framework

Note from Eqs. (7) and (8), the derivation of predicted density ϱk|k−1(uk|z1:k−1) relies on the complicated integral computations, which will lead to computational infeasibility for the UVCs. In order to cope with this difficulty, we design the PF-based algorithm to implement the Bayesian framework. In essence, PF uses a group of random discrete particles, denoted as u(i), i = 1, 2, ..., I with evolving probability weights, denoted as w(i) to approximate the complex distribution, (e.g., ϱ(u)i=1Iδ(uu(i))×w(i)).

For this UVC scenarios, we assign the particles as the UV CSI, i.e., uk(i)=[xkM:k(i),r(i),θT(i),βT(i)]T, which will be then propagated to approximate the predict and update stages of the Bayesian framework.

3.3.1. Implementation for predict-stage

At the beginning of the kth time-slot, the initial particles are drawn from the posterior PDF at (k − 1)th time-slot, i.e.:

uk1|k1(i)~ϱk1|k1(uk1(i)|z1:k1)
whose corresponding weight wk1|k1(i) satisfies:
ϱk1|k1(uk1|z1:k1)i=1Iwk1|k1(i)δ(uk1uk1|k1(i))

With the initial particles and their weights, the predict-stage can be pursued by simulating the transitional evolutions of particles at (k − 1)th time-slot, i.e.:

uk|k1(i)={[xkM:k1(i),xk(i)=0,r(i),θT(i),βT(i)]Tw.p.0.5[xkM:k1(i),xk(i)=1,r(i),θT(i),βT(i)]Tw.p.0.5
whose weights remain unchanged, i.e.:
wk|k1(i)wk1|k1(i)
Since the evolution of particles uk|k1(i) in Eq. (12) follows the TPM in Eq. (4), the approximation of the predicted PDF i.e., ϱk|k1(uk|z1:k1)i=1Iwk|k1(i)δ(ukuk|k1(i)) is reasonable.

3.3.2. Implementation for update-stage

As we acquire the predicted particles and their weights, i.e., {uk|k1(i),wk|k1(i)}i=1I, the update-stage will be performed by updating the weights, i.e.:

wk|k(i)=φk(zk|uk|k(i))wk|k1(i)i=1Iφk(zk|uk|k(i))wk|k1(i)
whose particles remains, i.e.:
uk|k(i)uk|k1(i)

Note that in Eq. (14), the likelihood PDF, φk(zk|uk|k(i)) is relevant with particle uk|k(i), so we need to compute it by considering the specific elements of the particle. In this view, the likelihood for particle uk|k(i) is derived by taking λk|k(i) into Eq. (6). Here, λk|k(i) is the intermediate dependent with the current CSI uk|k(i), i.e.:

λk|k(i)=NT(xk|k(i)q0(i)+m=1Mxkm|km(i)qm(i))
where qm(i) is computed by r(i), θT(i), and βT(i) from the CSI uk|k(i), i.e.:
qm(i)=mTb(m+1)Tbh(t,r(i),θT(i),βT(i))dt

With the help of Eqs. (16) and (17) to obtain the updated particles and their weights in Eqs. (14) and (15), the posterior PDF can be therefore approximated as:

ϱk|k(uk|z1:k)i=1Iwk|k(i)δ(ukuk|k(i))
Relying on the proximate posterior PDF in Eq. (18), the current estimation of the UV CSI will be then derived by maximizing the posteriori.

After the acquisition of the posterior PDF and the estimative result, re-sample process should be pursued in order to eliminate particles with negligible weights and reproduce those whose weights are of importance [22,25,26]. Finally, as the accomplishment of the re-sample process, all particles remained are of identical importance, and should be assigned as identical weights, which will be used for the next-round (i.e. (k + 1)th time-slot) PF algorithm.

3.4. Algorithm flow of the UV channel-related Bayesian scheme

With the help of the PF-based algorithm, a schematic flow of the UV channel-related Bayesian scheme is illustrated by Algorithm 1.

Tables Icon

Algorithm 1. PF-based UV channel-related Bayesian scheme

At the kth time-slot, the particles uk1|k1(i) and their weights wk1|k1(i) at the (k − 1)th time-slot, as well as the current measurement zk serve as the input. Step 1–2 derive the predicted particles and their weights, which will be used to obtain the updated particles and the corresponding weights in step 3–4. Step 5 computes the approximated posterior PDF. Step 6 acquires the estimative UV CSI by maximizing the posteriori. Step 7 gives the re-sample process, which will reproduce particles with relatively large weights, and eliminate those whose weights are trivial. Step 8 finally normalizes the weights as wk|k(i)=1/I. The outputs are estimative CSI, and the posterior particles that will be used for the next-round Bayesian scheme.

4. Numerical analysis

In this section, we evaluate the performance of the proposed UV channel-related Bayesian scheme on detecting informative signals and estimating channel parameters, as well as the computational complexity.

Configurations in this analysis are assigned as follows. The number of emitted photons for each time-slot is assigned as NT = 1.7 × 1013. The atmospheric coefficients are ka = 5 × 10−4m−1 and ks = 4.9 × 10−4m−1 respectively [6]. The transmitter beam divergence and the receiver half-field of view are assigned as θT = θR = π/12, while the transmitter and receiver apex angles are βT = βR = π/4. The transmission distance is r = 250m. As aforementioned, we do not know r, θT and βT at the receiver. We assign signal interval Tb for four different cases, i.e., Tb = 0.4μs, Tb = 0.3μs, Tb = 0.2μs, and Tb = 0.1μs. As the Tb decreases, the ISI memory are respectively M = 1, M = 3, M = 4 and M = 7, suggesting the gradually deteriorating ISI contamination.

As for the measurement function, we use signal-to-noise ratio (SNR) to describe the thermal noise level, i.e.:

SNR=NThνq0A2σ2
which ranges from [0dB, 20dB]. The expectation of thermal noise is assigned as μ = 0.02.

4.1. Performance of proposed scheme on UV channel estimations

We firstly examine the performance of the proposed scheme on estimating channel parameters (i.e., r, θT, βT), in terms of the relative error (RE), i.e.:

RE(r)=𝔼{|r^r|}r
RE(θT)=𝔼{|θ^TθT|}θT
RE(βT)=𝔼{|β^TβT|}βT

It is observed in Fig. 2 that RE(r), RE(θT) and RE(βT) decrease with either the increment of signal-noise ratio (SNR) or the augment of Tb (indicating the dwindle of ISI memory M), suggesting that the measurement noise and the ISI are the two factors that affect the estimation performance. For instance, given a fixed Tb = 0.1μs, RE(r) decreases from 11% to 2%, as SNR rises from 0dB to 20dB. Then, if we fix the SNR as 10dB, RE(r) decreases from 6% to 4% with the changes of Tb from 0.1μs to 0.4μs. Similarly, as we assign Tb = 0.4μs, RE(θT) and RE(βT) will both decrease from 10% to nearly 0.1% with the rise of SNR from 0dB to 20dB. Then, given the SNR as 10dB, RE(θT) and RE(βT) will decline from 6% to 4%, and from 4% to 2% respectively, as we rise Tb from 0.1μs to 0.4μs.

 figure: Fig. 2

Fig. 2 Performance of proposed scheme on UV channel estimation, where Tb represents the signal interval, r is the transmission distance, θT is the transmitter’s beam divergence, and βT is the transmitter’s apex angle.

Download Full Size | PDF

Secondly, we can observe that the proposed scheme gains a promising estimation performance. Although the errors increase as the ISI and measurement noise grow stronger, the REs are still tolerant. For instance given Tb = 0.1μs, RE(r) is no more than 12%, which will be even lower if the SNR gets larger. At a fixed SNR as 10dB, our scheme can determine θT, and βT respectively, within RE(θT) < 6% and RE(βT) < 4.5%.

4.2. Performance of proposed scheme on signal detections

In the second experiment, we illustrate the performance of the proposed scheme on signal detections, in contrast with the imperfect MLSD (i.e., the MLSD algorithm with imperfectly known channel parameters r, θT, and βT). Here, we use the bit error rate (BER) to represent the detection performance.

We can firstly observe from Fig. 3 that the BER becomes higher as the SNR becomes lower, suggesting that the measurement noise can deteriorate the communication performance. For instance, under a fixed Tb = 0.4μs, when the SNR decreases from 15dB to 10dB, the BER of the proposed scheme increases from 10−8 to 10−3. Besides, as the Tb decreases (which indicates the stronger effect of the ISI), the BER will also get larger, showing that the ISI can also severely disturb the detection performance. For instance, given the SNR=15dB, the BER derived from the proposed scheme increases from 10−8 to nearly 9 × 10−3, when Tb declines from 0.4μs to 0.1μs. This can be explained as that the decrease of bit interval Tb will make the ISI memory M increase, which will subsequently impact more on the signal detection process.

 figure: Fig. 3

Fig. 3 Performance of proposed scheme on signal detections.

Download Full Size | PDF

Secondly, it is noticeable from Fig. 3 that the proposed scheme outperforms the MLSD when the channel estimations are not perfect. For instance, given Tb = 0.1μs and SNR= 20dB, the BER of the proposed scheme is nearly 10−7, while the value derived from the MLSD is above 10−6. Then, as the Tb grows to 0.2μs, the proposed scheme gains nearly 4dB in contrast with the imperfect MLSD. This gain will be further increasing as the Tb gets larger. For instance, when Tb = 0.4μs, the BER of the proposed scheme approaches to nearly 10−8 at the point SNR=15dB, whereas the imperfect MLSD needs extra 5dB SNR in order to get a BER as 10−8. Hence, the numerical analysis shows that the detection performance of the proposed UV channel-related Bayesian scheme is better than the one of the imperfect MLSD. This may be attributed to that the proposed scheme can estimate the UV channel parameters (i.e., transmission distance r, transmitter’s beam divergence θT, and transmitter’s apex angle βT as shown in Fig. 2), which if remaining unknown, will deteriorate the signal detection process.

4.3. Complexity analysis

We further evaluate the computational complexity of the proposed scheme, in contrast with the imperfect MLSD.

In general, the complexity of Bayesian scheme is roughly measured by the total times of likelihood density computations, each of which has been given as ϑ [27], which is related with the representative precision and various adopted algorithms. For our proposed UV channel-related Bayesian scheme, the times of computations are proportional to the size of simulated particles (i.e., I) of the PF algorithm. Therefore, the total complexity of the proposed scheme can be described as O(I · ϑ).

By contrast, the complexity of the MLSD scheme (which is also measured by the total times of the likelihood computations) depends on the discretion of λk. For each possible λk, one likelihood will be computed. Therefore, by enumerating all possible λk from the L = 2M+1-dimension space 𝕊, the complexity can be subsequently computed as L × ϑ.

Given a requested BER as 10−6, and SNR=20dB, we compare the times of likelihood computations between the proposed scheme and the imperfect MLSD, related to the ISI memory M. It is seen from Fig. 4 that as the ISI memory M increases from M = 4 to M = 9, both the computation times from the proposed scheme and the MLSD are rising in order to approach the requested BER. For instance, the times of the proposed scheme increases from 50 to 500, whereas the times of the MLSD grows from 32 to 1024. Moreover, we can observe that the times from the MLSD grows exponentially, much quicker than that of the proposed scheme. For instance, when M = 8, we need only I = 300 computations for the proposed scheme, as opposed to nearly L = 500 computations in the MLSD scheme.

 figure: Fig. 4

Fig. 4 Complexity of proposed scheme as opposed to imperfect MLSD.

Download Full Size | PDF

Therefore, numerical analysis demonstrates that our proposed UV channel-related Bayesian scheme, by simultaneously estimating the channel and detecting signals, can outperform the MLSD in the cases when channel characteristics are unknown (as shown in Fig. 3). Meanwhile, the proposed scheme consumes less energy as opposed to the MLSD scheme. These two suggest that the proposed scheme can gain the detection and estimation performance in an energy-efficient pattern.

5. Conclusion

For most communication applications, it is significant to obtain channel characteristics and acquire informative signals. As far as the UVC scenarios are concerned, acquisition of such two features becomes a core challenge when encountering the ISI disturbance. To address this, we have proposed the UV channel-related Bayesian scheme which can simultaneously derive both the channel characteristics and the informative signals. Numerical analysis indicates our proposed scheme, which gains an extra 4dB detection performance in contrast with that of the imperfect MLSD, and derives an estimation performance under 4% relative errors. Our new scheme, therefore, may provide a great promise to the future UVC scenarios.

Funding

National Natural Science Foundation of China (NSFC) (61471061); NSFC (61471052); Shenzhen Technology Creation and Research Foundation (20160080).

References and links

1. R. J. Drost and B. M. Sadler, “Survey of ultraviolet non-line-of-sight communications,” Semicond. Sci. Tech. 29, 8 (2014). [CrossRef]  

2. M. A. El-Shimy and S. Hranilovic, “Binary-input non-line-of-sight solar-blind uv channels: Modeling, capacity and coding,” J. Opt. Commun. Netw. 4(12), 1008–1017 (2012). [CrossRef]  

3. Z. Xu and B. M. Sadler, “Ultraviolet communications: potential and state-of-the-art,” IEEE Commun. Mag. 46, 5 (2008).

4. D. Kedar and S. Arnon, “Subsea ultraviolet solar-blind broadband free-space optics communication,” Opt. Eng. 48(4), 046001 (2009). [CrossRef]  

5. S. Arnon and D. Kedar, “Non-line-of-sight underwater optical wireless communication network,” J. Opt. Soc. Am. A 26(3), 530–539 (2009). [CrossRef]  

6. M. R. Luettgen, D. M. Reilly, and J. H. Shapiro, “Non-line-of-sight single-scatter propagation model,” J. Opt. Soc. Am. A 8(12), 1964–1972 (1991). [CrossRef]  

7. R. J. Drost, T. J. Moore, and B. M. Sadler, “Ultraviolet scattering propagation modeling: analysis of path loss versus range,” J. Opt. Soc. Am. A 30(11), 2259–2265 (2013). [CrossRef]  

8. M. A. Elshimy and S. Hranilovic, “Impact of finite receiver-aperture size in a non-line-of-sight single-scatter propagation model,” J. Opt. Soc. Am. A 28(12), 2568–2576 (2011). [CrossRef]  

9. C. Gong and Z. Xu, “Channel estimation and signal detection for optical wireless scattering communication with inter-symbol interference,” IEEE Trans. Wireless Commun. 14(10), 5326–5337 (2015). [CrossRef]  

10. D. Zou, C. Gong, and Z. Xu, “Signal detection under short-interval sampling of continuous waveforms for optical wireless scattering communication,” arXiv preprint arXiv:1612.04058, (2016).

11. H. Qin, Y. Zuo, F. Li, R. Cong, L. Meng, and J. Wu, “Analytical link bandwidth model based square array reception for non-line-of-sight ultraviolet communication,” Opt. Express 25(19), 22693–22703 (2017). [CrossRef]   [PubMed]  

12. N. D. Chatzidiamantis, G. K. Karagiannidis, and M. Uysal, “Generalized maximum-likelihood sequence detection for photon-counting free space optical systems,” IEEE Trans. Commun. 58(12), 3381–3385 (2010). [CrossRef]  

13. M. Wu, D. Han, X. Zhang, F. Zhang, M. Zhang, and G. Yue, “Experimental research and comparison of ldpc and rs channel coding in ultraviolet communication systems,” Opt. Express 22(5), 5422–5430 (2014). [CrossRef]   [PubMed]  

14. W. Hu, M. Zhang, D. Han, Q. Chen, L. Ai, Q. Li, and Z. Ghassemlooy, “Research on channel-related polar code with an optimum code length for wireless ultraviolet communications,” Opt. Express 25, 28630–28642 (2017). [CrossRef]  

15. L. Wang, Q. He, Z. Xu, and B. M. Sadler, “Performance of non-line-of-sight ultraviolet communication receiver in isi channel,” Proc. SPIE 7814, 781409 (2010). [CrossRef]  

16. M. B. Lindner, S. Elstein, E. Panitkova, B. Perlmutter, and P. Lindner, “Uv devices for solar blind and background limited detection,” 10th Meeting on Optical Engineering in Israel, pp. 527–535.

17. C. Gong and Z. Xu, “Particle stream channel modeling and estimation for non-line of sight optical wireless communication,” 2014 IEEE Global Communications Conference (Globecom2014), pp. 2114–2118. [CrossRef]  

18. Q. Zhou, D. Li, S. Kar, L. M. Huie, H. V. Poor, and S. Cui, “Learning-based distributed detection-estimation in sensor networks with unknown sensor defects,” IEEE Trans. Signal Process. 65(1), 130–145 (2017). [CrossRef]  

19. Y. Yilmaz, S. Li, and X. Wang, “Sequential joint detection and estimation: Optimum tests and applications,” IEEE Trans. Signal Process. 64(20), 5311–5326 (2016). [CrossRef]  

20. R. Prasad, C. R. Murthy, and B. D. Rao, “Joint channel estimation and data detection in mimo-ofdm systems: A sparse bayesian learning approach,” IEEE Trans. Signal Process. 63(20), 5369–5382 (2015). [CrossRef]  

21. B. Li, S. Li, A. Nallanathan, and C. Zhao, “Deep sensing for future spectrum and location awareness 5g communications,” IEEE J. Sel. Area Commun. 33(7), 1331–1344 (2015). [CrossRef]  

22. B. Li, J. Hou, X. Li, Y. Nan, A. Nallanathan, and C. Zhao, “Deep sensing for space-time doubly selective channels: When a primary user is mobile and the channel is flat rayleigh fading,” IEEE Trans. Signal Process. 64(13), 3362–3375 (2016). [CrossRef]  

23. K. Wang, C. Gong, D. Zou, and Z. Xu, “Turbulence Channel Modeling and Non-Parametric Estimation for Optical Wireless Scattering Communication,” IEEE J. Lightwave Technol. 35(13), 2746–2756 (2017). [CrossRef]  

24. R. J. Drost, L. Y. Paul, K. S. Chan, and B. M. Sadler, “Physical-layer authentication for poisson channels,” in 2012 Photonics Society Summer Topical Meeting Series, pp. 69–70.

25. B. Ristic, B. T. Vo, B. N. Vo, and A. Farina, “A tutorial on bernoulli filters: Theory, implementation and applications,” IEEE Trans. Signal Process. 61(13), 3406–3430 (2013). [CrossRef]  

26. P. M. Djuric, J. H. Kotecha, J. Zhang, Y. Huang, T. Ghirmai, M. F. Bugallo, and J. Miguez, “Particle filtering,” IEEE Signal Process. Mag. 20(5), 19–38 (2003). [CrossRef]  

27. J. M. Borwein and P. B. Borwein, “Pi and the agm: a study in the analytic number theory and computational complexity,” Math. Comput. 50(181), 723–729 (1998).

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (4)

Fig. 1
Fig. 1 UV system structure. a) gives the UVC system with channel parameters, i.e., the transmission distance r, the transmitter beam divergence θT, the transmitter apex angle βT, the receiver half-field of view θR, and the receiver apex angle βR. b) illustrates the CIR h(t) under conditions of the emitted photons number NT = 1.7 × 1013, the atmospheric coefficients ka = 5 × 10−4m−1 and ks = 4.9 × 10−4m−1, and channel parameters illustrated in (a), i.e., r = 250m, βT = βR = π/4, and θT = θR = π/12. When Tb = 0.1μs, we have M = 7 and the value of qm.
Fig. 2
Fig. 2 Performance of proposed scheme on UV channel estimation, where Tb represents the signal interval, r is the transmission distance, θT is the transmitter’s beam divergence, and βT is the transmitter’s apex angle.
Fig. 3
Fig. 3 Performance of proposed scheme on signal detections.
Fig. 4
Fig. 4 Complexity of proposed scheme as opposed to imperfect MLSD.

Tables (1)

Tables Icon

Algorithm 1 PF-based UV channel-related Bayesian scheme

Equations (22)

Equations on this page are rendered with MathJax. Learn more.

λ k = N T ( x k q 0 + m = 1 M x k m q m )
q m = m T b ( m + 1 ) T b h ( t , r , θ T , β T ) d t
z k = A h ν n k + k
P = [ P 1 1 P 1 L P L 1 P L L ]
P l j Pr { u k = s j | u k 1 = s l }
φ k ( z k | u k ) = n k Pr ( n k ) p ( z k | n k ) = 1 2 π σ 2 n k + ( λ k ) n k ( n k ) ! exp ( λ k ( z k A h ν n k μ ) 2 2 σ 2 )
ϱ k | k 1 ( u k | z 1 : k 1 ) = ξ k ( u k | u k 1 ) ϱ k 1 | k 1 ( u k | z 1 : k 1 ) d u k 1
ϱ k | k ( u k | z 1 : k ) = φ k ( z k | u k ) ϱ k | k 1 ( u k | z 1 : k 1 ) φ k ( z k | u k ) ϱ k | k 1 ( u k | z 1 : k 1 ) d u k
u ^ k = argmax u k 𝕊 { ϱ k | k ( u k | z 1 : k ) }
u k 1 | k 1 ( i ) ~ ϱ k 1 | k 1 ( u k 1 ( i ) | z 1 : k 1 )
ϱ k 1 | k 1 ( u k 1 | z 1 : k 1 ) i = 1 I w k 1 | k 1 ( i ) δ ( u k 1 u k 1 | k 1 ( i ) )
u k | k 1 ( i ) = { [ x k M : k 1 ( i ) , x k ( i ) = 0 , r ( i ) , θ T ( i ) , β T ( i ) ] T w . p . 0.5 [ x k M : k 1 ( i ) , x k ( i ) = 1 , r ( i ) , θ T ( i ) , β T ( i ) ] T w . p . 0.5
w k | k 1 ( i ) w k 1 | k 1 ( i )
w k | k ( i ) = φ k ( z k | u k | k ( i ) ) w k | k 1 ( i ) i = 1 I φ k ( z k | u k | k ( i ) ) w k | k 1 ( i )
u k | k ( i ) u k | k 1 ( i )
λ k | k ( i ) = N T ( x k | k ( i ) q 0 ( i ) + m = 1 M x k m | k m ( i ) q m ( i ) )
q m ( i ) = m T b ( m + 1 ) T b h ( t , r ( i ) , θ T ( i ) , β T ( i ) ) d t
ϱ k | k ( u k | z 1 : k ) i = 1 I w k | k ( i ) δ ( u k u k | k ( i ) )
SNR = N T h ν q 0 A 2 σ 2
RE ( r ) = 𝔼 { | r ^ r | } r
RE ( θ T ) = 𝔼 { | θ ^ T θ T | } θ T
RE ( β T ) = 𝔼 { | β ^ T β T | } β T
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.