High-Speed Visible Light Indoor Networks Based on Optical Orthogonal Codes and Combinatorial Designs

Interconnecting devices in an indoor environment using the illumination system and white light emitting diodes (LED) requires adaptive networking techniques that can provide network access for multiple users. Two techniques based on multilevel signaling and optical orthogonal codes (OOC) are explored in this paper in order to provide simultaneous multiple access in an indoor multiuser network. Balanced incomplete block designs (BIBD) are used to construct multilevel symbols for M-ary signaling. Using these multilevel symbols we are able to control the optical peak to average power ratio (PAPR) in the system, and hereby control the dimming level. In the first technique, the M-ary data of each user is first encoded using the OOC codeword that is assigned to that user, and then it is fed into a BIBD encoder to generate a multilevel signal. The second multiple access method uses sub-sets of a BIBD code to apply multilevel expurgated pulse-position modulation (MEPPM) to the data of each user. While the first approach has a larger Hamming distance between the symbols of each user, the latter can provide higher bit-rates for users in VLC systems with bandwidth-limited LEDs

Scalable Hash-Based Estimation of Divergence Measures

We propose a scalable divergence estimation method based on hashing. Consider two continuous random variables $X$ and $Y$ whose densities have bounded support. We consider a particular locality sensitive random hashing, and consider the ratio of samples in each hash bin having non-zero numbers of Y samples. We prove that the weighted average of these ratios over all of the hash bins converges to f-divergences between the two samples sets. We show that the proposed estimator is optimal in terms of both MSE rate and computational complexity. We derive the MSE rates for two families of smooth functions; the H\"{o}lder smoothness class and differentiable functions. In particular, it is proved that if the density functions have bounded derivatives up to the order $d/2$, where $d$ is the dimension of samples, the optimal parametric MSE rate of $O(1/N)$ can be achieved. The computational complexity is shown to be $O(N)$, which is optimal. To the best of our knowledge, this is the first empirical divergence estimator that has optimal computational complexity and achieves the optimal parametric MSE estimation rate.Comment: 11 pages, Proceedings of the 21st International Conference on Artificial Intelligence and Statistics (AISTATS) 2018, Lanzarote, Spai

Low-Complexity Stochastic Generalized Belief Propagation

The generalized belief propagation (GBP), introduced by Yedidia et al., is an extension of the belief propagation (BP) algorithm, which is widely used in different problems involved in calculating exact or approximate marginals of probability distributions. In many problems, it has been observed that the accuracy of GBP considerably outperforms that of BP. However, because in general the computational complexity of GBP is higher than BP, its application is limited in practice. In this paper, we introduce a stochastic version of GBP called stochastic generalized belief propagation (SGBP) that can be considered as an extension to the stochastic BP (SBP) algorithm introduced by Noorshams et al. They have shown that SBP reduces the complexity per iteration of BP by an order of magnitude in alphabet size. In contrast to SBP, SGBP can reduce the computation complexity if certain topological conditions are met by the region graph associated to a graphical model. However, this reduction can be larger than only one order of magnitude in alphabet size. In this paper, we characterize these conditions and the amount of computation gain that we can obtain by using SGBP. Finally, using similar proof techniques employed by Noorshams et al., for general graphical models satisfy contraction conditions, we prove the asymptotic convergence of SGBP to the unique GBP fixed point, as well as providing non-asymptotic upper bounds on the mean square error and on the high probability error.Comment: 18 pages, 11 figures, a shorter version of this paper was accepted in ISIT'1

Application of Expurgated PPM to Indoor Visible Light Communications - Part I: Single-User Systems

Visible light communications (VLC) in indoor environments suffer from the limited bandwidth of LEDs as well as from the inter-symbol interference (ISI) imposed by multipath. In this work, transmission schemes to improve the performance of indoor optical wireless communication (OWC) systems are introduced. Expurgated pulse-position modulation (EPPM) is proposed for this application since it can provide a wide range of peak to average power ratios (PAPR) needed for dimming of the indoor illumination. A correlation decoder used at the receiver is shown to be optimal for indoor VLC systems, which are shot noise and background-light limited. Interleaving applied on EPPM in order to decrease the ISI effect in dispersive VLC channels can significantly decrease the error probability. The proposed interleaving technique makes EPPM a better modulation option compared to PPM for VLC systems or any other dispersive OWC system. An overlapped EPPM pulse technique is proposed to increase the transmission rate when bandwidth-limited white LEDs are used as sources.Comment: Journal of Lightwave Technolog

Application of Expurgated PPM to Indoor Visible Light Communications - Part II: Access Networks

Providing network access for multiple users in a visible light communication (VLC) system that utilizes white light emitting diodes (LED) as sources requires new networking techniques adapted to the lighting features. In this paper we introduce two multiple access techniques using expurgated PPM (EPPM) that can be implemented using LEDs and support lighting features such as dimming. Multilevel symbols are used to provide M-ary signaling for multiple users using multilevel EPPM (MEPPM). Using these multiple-access schemes we are able to control the optical peak to average power ratio (PAPR) in the system, and hereby control the dimming level. In the first technique, the M-ary data of each user is first encoded using an optical orthogonal code (OOC) assigned to the user, and the result is fed into a EPPM encoder to generate a multilevel signal. The second multiple access method uses sub-sets of the EPPM constellation to apply MEPPM to the data of each user. While the first approach has a larger Hamming distance between the symbols of each user, the latter can provide higher bit-rates for users in VLC systems using bandwidth-limited LEDs.Comment: Journal of Lightwave Technology. arXiv admin note: substantial text overlap with arXiv:1308.074