location: Current position: Home >> Scientific Research >> Paper Publications

Low-complexity sparse detector for generalised space shift keying

Hits:

Indexed by:期刊论文

Date of Publication:2019-03-07

Journal:ELECTRONICS LETTERS

Included Journals:SCIE、EI

Volume:55

Issue:5

Page Number:268-269

ISSN No.:0013-5194

Key Words:Compressed sensing; Maximum likelihood; MIMO systems; Multiplexing equipment, Antenna matching; Compressive sensing; Detection performance; Euclidean distance; Information transmission; Maximum likelihood detectors; Multi input multi output systems; Space-shift keying, Antennas

Abstract: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.

Pre One:Stock price forecasting based on a combined model of ARMA and BP neural network and markov model

Next One:基于动态算法的触感网广播树构建技术