The University of Southampton
University of Southampton Institutional Repository

Reduced-Complexity Coherent Versus Non-Coherent QAM-Aided Space-Time Shift Keying

Reduced-Complexity Coherent Versus Non-Coherent QAM-Aided Space-Time Shift Keying
Reduced-Complexity Coherent Versus Non-Coherent QAM-Aided Space-Time Shift Keying
A novel reduced-complexity near-optimal detection algorithm is proposed for enhancing the recent Coherently-detected Space-Time Shift Keying (CSTSK) scheme employing arbitrary constellations, such as {cal L}-point Phase-Shift Keying (PSK) and Quadrature Amplitude Modulation (QAM). The proposed detector relies on a modified Matched Filter (MF) concept. More specifically, we exploit both the constellation diagram of the modulation scheme employed as well as the Inter-Element-Interference (IEI)-free STSK architecture. Furthermore, we generalize the Pulse Amplitude Modulation (PAM)- or PSK-aided Differentially-encoded STSK (DSTSK) concept and conceive its more bandwidth-efficient QAM-aided counterpart. Then, the proposed reduced-complexity CSTSK detector is applied to the QAM-aided DSTSK scheme, which enables us to carry out low-complexity non-coherent detection, while dispensing with channel estimation. It is revealed that the proposed detector is capable of approaching the optimal Maximum Likelihood (ML) detector's performance, while avoiding the exhaustive ML search. Interestingly, our simulation results also demonstrate that the reduced-complexity detector advocated may achieve the same performance as that of the optimal ML detector for the specific STSK scheme's parameters. Another novelty of this paper is that the star-QAM STSK scheme tends to outperform its square-QAM counterpart, especially for high number of dispersion matrices. Furthermore, we provided both the theoretical analysis and the simulations, in order to support this unexpected fact.
3090-3101
Sugiura, Shinya
4c8665dd-1ad8-4dc0-9298-bf04eded3579
Xu, Chao
349b7322-fd17-4fcd-a49f-c62afe284d50
Ng, Soon
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Sugiura, Shinya
4c8665dd-1ad8-4dc0-9298-bf04eded3579
Xu, Chao
349b7322-fd17-4fcd-a49f-c62afe284d50
Ng, Soon
e19a63b0-0f12-4591-ab5f-554820d5f78c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Sugiura, Shinya, Xu, Chao, Ng, Soon and Hanzo, Lajos (2011) Reduced-Complexity Coherent Versus Non-Coherent QAM-Aided Space-Time Shift Keying. IEEE Transactions on Communications, 59 (11), 3090-3101.

Record type: Article

Abstract

A novel reduced-complexity near-optimal detection algorithm is proposed for enhancing the recent Coherently-detected Space-Time Shift Keying (CSTSK) scheme employing arbitrary constellations, such as {cal L}-point Phase-Shift Keying (PSK) and Quadrature Amplitude Modulation (QAM). The proposed detector relies on a modified Matched Filter (MF) concept. More specifically, we exploit both the constellation diagram of the modulation scheme employed as well as the Inter-Element-Interference (IEI)-free STSK architecture. Furthermore, we generalize the Pulse Amplitude Modulation (PAM)- or PSK-aided Differentially-encoded STSK (DSTSK) concept and conceive its more bandwidth-efficient QAM-aided counterpart. Then, the proposed reduced-complexity CSTSK detector is applied to the QAM-aided DSTSK scheme, which enables us to carry out low-complexity non-coherent detection, while dispensing with channel estimation. It is revealed that the proposed detector is capable of approaching the optimal Maximum Likelihood (ML) detector's performance, while avoiding the exhaustive ML search. Interestingly, our simulation results also demonstrate that the reduced-complexity detector advocated may achieve the same performance as that of the optimal ML detector for the specific STSK scheme's parameters. Another novelty of this paper is that the star-QAM STSK scheme tends to outperform its square-QAM counterpart, especially for high number of dispersion matrices. Furthermore, we provided both the theoretical analysis and the simulations, in order to support this unexpected fact.

Text
06042304.pdf - Other
Download (506kB)

More information

Published date: November 2011
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 273211
URI: http://eprints.soton.ac.uk/id/eprint/273211
PURE UUID: d38a6d3c-8cb7-456e-8969-9234b90a8ae5
ORCID for Soon Ng: ORCID iD orcid.org/0000-0002-0930-7194
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 15 Feb 2012 16:15
Last modified: 07 Oct 2020 05:52

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×