Performance of Spatial Diversity DCO-OFDM in a Weak Turbulence Underwater Visible Light Communication Channel

The performance of underwater visible light communication (UVLC) system is severely affected by absorption, scattering and turbulence. In this article, we study the performance of spectral efficient DC-biased optical orthogonal frequency division multiplexing (DCO-OFDM) in combination with the transceiver spatial diversity in turbulence channel. Based on the approximation of the weighted sum of lognormal random variables (RVs), we derived a theoretical exact bit error rate (BER) for DCO-OFDM systems with spatial diversity. The simulation results are compared with the analytical prediction, confirming the validity of the analysis. It is shown that spatial diversity can effectively reduce the turbulence-induced channel fading. The obtained results can be useful for designing, predicting, and evaluating the DCO-OFDM UVLC system in a weak oceanic turbulence condition

Low Complexity Blind Equalization for OFDM Systems with General Constellations

This paper proposes a low-complexity algorithm for blind equalization of data in OFDM-based wireless systems with general constellations. The proposed algorithm is able to recover data even when the channel changes on a symbol-by-symbol basis, making it suitable for fast fading channels. The proposed algorithm does not require any statistical information of the channel and thus does not suffer from latency normally associated with blind methods. We also demonstrate how to reduce the complexity of the algorithm, which becomes especially low at high SNR. Specifically, we show that in the high SNR regime, the number of operations is of the order O(LN), where L is the cyclic prefix length and N is the total number of subcarriers. Simulation results confirm the favorable performance of our algorithm

Subspace-Based Blind Channel Identification for Cyclic Prefix Systems Using Few Received Blocks

In this paper, a novel generalization of subspace-based blind channel identification methods in cyclic prefix (CP) systems is proposed. For the generalization, a new system parameter called repetition index is introduced whose value is unity for previously reported special cases. By choosing a repetition index larger than unity, the number of received blocks needed for blind identification is significantly reduced compared to all previously reported methods. This feature makes the method more realistic especially in wireless environments where the channel state is usually fast-varying. Given the number of received blocks available, the minimum value of repetition index is derived. Theoretical limit allows the proposed method to perform blind identification using only three received blocks in absence of noise. In practice, the number of received blocks needed to yield a satisfactory bit-error-rate (BER) performance is usually on the order of half the block size. Simulation results not only demonstrate the capability of the algorithm to perform blind identification using fewer received blocks, but also show that in some cases system performance can be improved by choosing a repetition index larger than needed. Simulation of the proposed method over time-varying channels clearly demonstrates the improvement over previously reported methods