Robust and Energy Efficient Sparse-Coded OFDM-DCSK System via Matrix Recovery

Abstract

In this paper, we devise a sparse-coded orthogonal frequency division multiplexing (OFDM) differential chaos shift keying (DCSK) communication system based on low-rank matrix recovery which can handle Gaussian background noise and outlier-contaminated symbols simultaneously. As the noise-free OFDM-DCSK symbol matrix has rank 1, we exploit the vector outer product for its modeling, while sparse coding is also applied to reduce the transmission energy. To demodulate information bits from the sparse-coded signal, we formulate an objective function which consists of a sum of Frobenius norm for rank-1 matrix recovery and ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> -norm for identifying the possibly outlier-contaminated symbols, with a self-adaptive weight parameter. The resultant optimization problem is solved iteratively via block coordinate descent, and the Laplacian kernel with the Silverman’s rule is adopted for outlier detection. Theoretical analysis including convergence of the objective function, bit error rate (BER), energy efficiency and computational complexity, are provided. Simulation results show that the proposed system has comparable mean square error and BER performance with the ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><i>p</i></sub> -norm minimization based matrix recovery approach at <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</i> = 2 in additive white Gaussian noise, and is superior to that of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</i> = 1 in Middleton class A noise, even when sparse coding is applied. Moreover, compared with other binary DCSK systems, our system achieves higher energy efficiency thanks to the sparse coding.