Hits:
Indexed by:期刊论文
Date of Publication:2017-06-01
Journal:IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
Included Journals:Scopus、SCIE、EI
Volume:66
Issue:6
Page Number:5473-5477
ISSN No.:0018-9545
Key Words:Computational complexity; detection algorithm; generalized space shift keying (GSSK); maximum likelihood detection; sparse reconstruction (SR)
Abstract:In this paper, we propose a novel generalized space shift keying (GSSK) detection algorithm by exploiting the inherent sparse property of GSSK signal. In particular, we formulate the GSSK detection into a sparse convex optimization problem. The key contribution of the proposed algorithm lies in the strategical adoption and transformation of the sparse reconstruction (SR) from image processing to GSSK detection. The proposed SR detector achieves better performance than all existing suboptimal solutions with comparable computational complexity. In order to further improve the performance of the SR algorithm, we develop another approach, i.e., the iterative SR algorithm, which utilizes the result of the SR algorithm as the start point and enhances the detection performance gradually in each iteration. The simulation results confirm the efficiency of both of the proposed algorithms.