Low-complexity sparse detector for generalised space shift keying

Low-complexity sparse detector for generalised space shift keying

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Generalised space shift keying (GSSK) technique proposed for massive multi-input–multi-output systems has a higher information transmission rate due to the activation of multiple antennas at the same time, and also has significant advantage in terms of hardware cost. However, the maximum likelihood detector has a very high complexity which makes it computationally intractable for large-scale GSSK systems. In this Letter, a sparse detector is proposed by exploiting the inherent property of sparsity in GSSK. Different from the existing compressed sensing (CS)-based detectors, the proposed detector utilises Euclidean distance instead of inner product operation for antenna matching. Moreover, it can remove erroneous antenna indices by backtracking to promote the detection performance. The simulation results show that the proposed scheme outperforms the existing CS-based detectors while maintaining low complexity.

Related content

This is a required field
Please enter a valid email address