Compressed Sensing Detector Design for Space Shift Keying in MIMO Systems

Abstract

Space shift keying (SSK) modulation and its extension, the generalized SSK (GSSK), present an attractive framework for the emerging large-scale MIMO systems in reducing hardware costs. In SSK, the maximum likelihood (ML) detector incurs considerable computational complexities. We propose a compressed sensing based detector, NCS, by formulating the SSK-type detection criterion as a convex optimization problem. The proposed NCS requires only O(n <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</sub> N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</sub> N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</sub> ) complexity, outperforming the O(N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</sub> N <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</sub> <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">nt</sup> ) complexity in the ML detector, at the cost of slight fidelity degradation. Simulations are conducted to substantiate the analytical derivation and the detection accuracy.