Open AccessLow complexity detector for amplitude phase shift keying‐based differential spatial modulation
Author(s) -
Jose Deepak,
M Sameer S.
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2020.0120
Subject(s) - amplitude and phase shift keying , phase shift keying , quadrature amplitude modulation , algorithm , detector , keying , computer science , amplitude , amplitude modulation , mathematics , amplitude shift keying , computational complexity theory , electronic engineering , pulse amplitude modulation , differential coding , telecommunications , bandwidth (computing) , bit error rate , frequency modulation , decoding methods , physics , optics , engineering , pulse (music)
Differential spatial modulation (DSM) involves the transmission of information through a combination of phase‐modulated symbols and transmit antenna index. For efficient use of the wireless system resources, the amplitude information is also utilised as a part of the transmitted data in amplitude‐phase shift keying‐DSM (APSK‐DSM). Here some of the information bits get encoded as differential amplitude in each of the transmit antennas, whenever they are activated resulting in better bandwidth efficiency than conventional DSM. However, prevailing detectors for APSK‐DSM have high computational complexity. In this work, the authors proposed a low complexity detector for APSK‐based DSM schemes using compressive sensing and an ℓ 2 ‐norm minimisation for detecting the differential amplitude. To decode this amplitude information, the authors have formulated a column by column decomposition of the received symbol in terms of the amplitude‐ and phase‐modulated symbols received from each transmit antenna. The error performance of the proposed detector is nearly identical to that of existing APSK‐based DSM receivers, which use maximum‐likelihood detection but with much lower computational complexity than the latter.