The University of Southampton
University of Southampton Institutional Repository

Reduced-complexity near-capacity joint channel estimation and three-stage turbo detection for coherent space-time shift keying

Reduced-complexity near-capacity joint channel estimation and three-stage turbo detection for coherent space-time shift keying
Reduced-complexity near-capacity joint channel estimation and three-stage turbo detection for coherent space-time shift keying
We propose a low-complexity joint channel estimation (CE) and three-stage iterative demapping-decoding scheme for near-capacity coherent space-time shift keying (CSTSK) based multiple-input multiple-output (MIMO) systems. In the proposed scheme, only a minimum number of space-time shift keying training blocks are employed for generating an initial least square channel estimate, which is then used for initial data detection. As usual, the detected soft information is first exchanged a number of times within the inner turbo loop between the unity-rate-code (URC) decoder and the CSTSK soft-demapper, and the information gleaned from the inner URC decoder is then iteratively exchanged with the outer decoder in the outer turbo loop. Our CE scheme is embedded into the outer turbo loop, which exploits the a posteriori information produced by the CSTSK soft-demapper to select a sufficient number of high-quality decisions only for CE. Since the CE is embedded into the iterative three-stage demapping-decoding process, no additional iterative loop is required for exchanging information between the decision-directed channel estimator and the three-stage turbo detector. Hence, the computational complexity of the proposed joint CE and three-stage turbo detection remains similar to that of the three-stage turbo detection-decoding scheme with the given channel estimate. Moreover, our proposed low-complexity semiblind scheme is capable of approaching the optimal maximum likelihood turbo detection performance attained with the aid of perfect channel state information, with the same low number of turbo iterations as the latter, as confirmed by our extensive simulation results
1902-1913
Zhang, Peichang
e87b4adb-ec8a-47e9-a73e-5b9140f5dc9d
Chen, Sheng
9310a111-f79a-48b8-98c7-383ca93cbb80
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Zhang, Peichang
e87b4adb-ec8a-47e9-a73e-5b9140f5dc9d
Chen, Sheng
9310a111-f79a-48b8-98c7-383ca93cbb80
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Zhang, Peichang, Chen, Sheng and Hanzo, Lajos (2013) Reduced-complexity near-capacity joint channel estimation and three-stage turbo detection for coherent space-time shift keying. IEEE Transactions on Communications, 61 (5), 1902-1913.

Record type: Article

Abstract

We propose a low-complexity joint channel estimation (CE) and three-stage iterative demapping-decoding scheme for near-capacity coherent space-time shift keying (CSTSK) based multiple-input multiple-output (MIMO) systems. In the proposed scheme, only a minimum number of space-time shift keying training blocks are employed for generating an initial least square channel estimate, which is then used for initial data detection. As usual, the detected soft information is first exchanged a number of times within the inner turbo loop between the unity-rate-code (URC) decoder and the CSTSK soft-demapper, and the information gleaned from the inner URC decoder is then iteratively exchanged with the outer decoder in the outer turbo loop. Our CE scheme is embedded into the outer turbo loop, which exploits the a posteriori information produced by the CSTSK soft-demapper to select a sufficient number of high-quality decisions only for CE. Since the CE is embedded into the iterative three-stage demapping-decoding process, no additional iterative loop is required for exchanging information between the decision-directed channel estimator and the three-stage turbo detector. Hence, the computational complexity of the proposed joint CE and three-stage turbo detection remains similar to that of the three-stage turbo detection-decoding scheme with the given channel estimate. Moreover, our proposed low-complexity semiblind scheme is capable of approaching the optimal maximum likelihood turbo detection performance attained with the aid of perfect channel state information, with the same low number of turbo iterations as the latter, as confirmed by our extensive simulation results

Text
TCOM2013-May-1.pdf - Version of Record
Restricted to Repository staff only
Request a copy

More information

e-pub ahead of print date: May 2013
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 353236
URI: http://eprints.soton.ac.uk/id/eprint/353236
PURE UUID: a580878f-41e0-4324-92a1-cfb9476afe5e
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 03 Jun 2013 12:53
Last modified: 17 Dec 2019 02:03

Export record

Contributors

Author: Peichang Zhang
Author: Sheng Chen
Author: Lajos Hanzo ORCID iD

University divisions

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.

×