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 tN rN t) complexity, outperforming the O(N rN tN nt t}) complexity in the ML detector, at the cost of slight fidelity degradation. Simulations are conducted to substantiate the analytical derivation and the detection accuracy.