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

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

Probabilistic Shaping for Finite Blocklengths: Distribution Matching and Sphere Shaping

In this paper, we provide for the first time a systematic comparison of distribution matching (DM) and sphere shaping (SpSh) algorithms for short blocklength probabilistic amplitude shaping. For asymptotically large blocklengths, constant composition distribution matching (CCDM) is known to generate the target capacity-achieving distribution. As the blocklength decreases, however, the resulting rate loss diminishes the efficiency of CCDM. We claim that for such short blocklengths and over the additive white Gaussian channel (AWGN), the objective of shaping should be reformulated as obtaining the most energy-efficient signal space for a given rate (rather than matching distributions). In light of this interpretation, multiset-partition DM (MPDM), enumerative sphere shaping (ESS) and shell mapping (SM), are reviewed as energy-efficient shaping techniques. Numerical results show that MPDM and SpSh have smaller rate losses than CCDM. SpSh--whose sole objective is to maximize the energy efficiency--is shown to have the minimum rate loss amongst all. We provide simulation results of the end-to-end decoding performance showing that up to 1 dB improvement in power efficiency over uniform signaling can be obtained with MPDM and SpSh at blocklengths around 200. Finally, we present a discussion on the complexity of these algorithms from the perspective of latency, storage and computations.Comment: 18 pages, 10 figure

On the MIMO Channel Capacity of Multi-Dimensional Signal Sets

In this contribution we evaluate the capacity of Multi-Input Multi-Output (MIMO) systems using multi-dimensional PSK/QAM signal sets. It was shown that transmit diversity is capable of narrowing the gap between the capacity of the Rayleigh-fading channel and the AWGN channel. However, since this gap becomes narrower when the receiver diversity order is increased, for higher-order receiver diversity the performance advantage of transmit diversity diminishes. A MIMO system having full multiplexing gain has a higher achievable throughput than the corresponding MIMO system designed for full diversity gain, although this is attained at the cost of a higher complexity and a higher SNR. The tradeoffs between diversity gain, multiplexing gain, complexity and bandwidth are studied

Time-Frequency Packing for High Capacity Coherent Optical Links

We consider realistic long-haul optical links, with linear and nonlinear impairments, and investigate the application of time-frequency packing with low-order constellations as a possible solution to increase the spectral efficiency. A detailed comparison with available techniques from the literature will be also performed. We will see that this technique represents a feasible solution to overcome the relevant theoretical and technological issues related to this spectral efficiency increase and could be more effective than the simple adoption of high-order modulation formats.Comment: 10 pages, 9 figures. arXiv admin note: text overlap with arXiv:1406.5685 by other author

Noncoherent Space-Time Coding: An Algebraic Perspective

Cataloged from PDF version of article.The design of space–time signals for noncoherent block-fading channels where the channel state information is not known a priori at the transmitter and the receiver is considered. In particular, a new algebraic formulation for the diversity advantage design criterion is developed. The new criterion encompasses, as a special case, the well-known diversity advantage for unitary space–time signals and, more importantly, applies to arbitrary signaling schemes and arbitrary channel distributions. This criterion is used to establish the optimal diversity-versus-rate tradeoff for training based schemes in block-fading channels. Our results are then specialized to the class of affine space–time signals which allows for a low complexity decoder. Within this class, space–time constellations based on the threaded algebraic space–time (TAST) architecture are considered. These constellations achieve the optimal diversity-versus-rate tradeoff over noncoherent block-fading channels and outperform previously proposed codes in the considered scenarios as demonstrated by the numerical results. Using the analytical and numerical results developed in this paper, nonunitary space–time codes are argued to offer certain advantages in block-fading channels where the appropriate use of coherent space–time codes is shown to offer a very efficient solution to the noncoherent space–time communication paradigm

Construction of Capacity-Achieving Lattice Codes: Polar Lattices

In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity \frac{1}{2}\log(1+\SNR) of the additive white Gaussian-noise (AWGN) channel. Our construction follows the multilevel approach of Forney \textit{et al.}, where we construct a capacity-achieving polar code on each level. The component polar codes are shown to be naturally nested, thereby fulfilling the requirement of the multilevel lattice construction. We prove that polar lattices are \emph{AWGN-good}. Furthermore, using the technique of source polarization, we propose discrete Gaussian shaping over the polar lattice to satisfy the power constraint. Both the construction and shaping are explicit, and the overall complexity of encoding and decoding is $O(N\log N)$ for any fixed target error probability.Comment: full version of the paper to appear in IEEE Trans. Communication