Generalized space-time shift keying: Randomized bitwise Markov chain Monte Carlo detection and code design

Author

Jianping Zheng ; Yue Sun

Author_Institution

State Key Lab. of ISN, Xidian Univ., Xi´an, China

fYear

2013

fDate

5-8 Aug. 2013

Firstpage

1

Lastpage

4

Abstract

In this paper, the low-complexity near-optimal (LCNO) detector and code design for the generalized space-time shift keying (G-STSK) scheme are studied. First, the LCNO randomized bitwise Markov chain Monte Carlo (R-b-MCMC) detector is presented. Next, the low-density parity-check code is optimized based on the extrinsic-information transfer chart technique. Simulation results are provided to demonstrate the performance of the proposed detector and the optimized code.

Keywords

Markov processes; Monte Carlo methods; parity check codes; random codes; random processes; space-time codes; G-STSK scheme; LCNO detector; R-b-MCMC; code optimization; extrinsic-information transfer chart technique; generalized space-time shift keying scheme; low-complexity near-optimal detector; low-density parity-check code design; randomized bitwise Markov chain Monte Carlo detector; Complexity theory; Detectors; Dispersion; Markov processes; Monte Carlo methods; Parity check codes; Vectors; Code design; Markov chain Monte Carlo; extrinsic-information transfer chart; space-time shift keying;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing, Communication and Computing (ICSPCC), 2013 IEEE International Conference on

Conference_Location

KunMing

Type

conf

DOI

10.1109/ICSPCC.2013.6664095

Filename

6664095