ADAPTIVE SPACE-TIME SHIFT KEYING BASED MULTIPLE-INPUT MULTIPLE-OUTPUT SYSTEMS

ELEC6014 RCNSs: Advanced Topic Series S Chen
ELEC6014 RCNSs: Advanced Topic Seminar
Adaptive Space-Time Shift Keying Based

Multiple-Input Multiple-Output Systems
Professor Sheng Chen
School of Electronics and Computer Science
University of Southampton
Southampton SO17 1BJ, UK
E-mail: sqc@ecs.soton.ac.uk
Acknowledgements: Shinya Sugiura, Lajos Hanzo, Peichang Zhang
1
MIMO Landscape
• MIMO: exploits space and time dimensions ⇒ diversity and multiplexing gains
• Vertical Bell Lab layered space-time (V-BLAST)

– Offers high multiplexing gain at high decoding complexity owing to inter-channel
interference (ICI)
• Orthogonal space-time block codes (OSTBCs)

– Maximum diversity gain at expense of bandwidth efficiency
• Linear dispersion codes (LDCs)

– Flexible tradeoff between diversity and multiplexing gains
• Spatial modulation (SM) and space-shift keying (SSK)

– Mainly multiplexing gain, can achieve receive diversity
– No ICI ⇒ low-complexity single-antenna ML detection
2
V-BLAST
• BLAST-type architecture: exploits spatial dimension for multiplexing gain ⇒
high rate
• Inter-antenna interference or inter-channel interference ⇒ prohibitively high

complexity for ML detection
• Assuming NR ≥ NT , NT symbols are mapped to NT transmit antennas for

transmission in tn = 1 time slot
1 1 1
Detection
S/P
P/S
2 2 2
...
...
...
NT NR NT
3
V-BLAST (2)
1 1 1 1
Detection
Precoding
S/P
P/S
2 2 2 2
...
...
...
...
NS NT NR NS
• In general, maximum spatial multiplexing order: NS = min{NT , NR }
• NS symbols are mapped to NT transmit antennas by precoding for transmission

in tn = 1 time slot
• For L-PSK or L-QAM, normalised throughput per time slot
R = Ns · log2(L) [bits/symbol]
4
OSTBCs
• Space-time block codes exploit space and time dimensions ⇒ maximum diversity
gain, at expense of bandwidth efficiency
• Block of K symbols are mapped to NT transmit antennas for transmission in tn

time slots
x1
space−time map
transmit antennas 1 1
x2
t n X NT
time slots
2
S/P
2
...
...
...
matrix
xK
NT
NR
• Thus, STBC is defined by tn × NT complex-valued matrix S ∈ Ctn×NT
• Orthogonal STBCs: advantage of low-complexity ML detection
5
OSTBCs (2)
• For L-PSK or L-QAM, normalised x1 x2 Time slot 1
throughput per time slot −x2* x1* Time slot 2
K
R= · log2(L) [bits/symbol]
tn h2
h1
• Generally, K
<1 n
tn 1
+
n2
• Only one OSTBC, Alamouti code y1 =h1 x1 +h2 x 2+n1
y2 =−h1 x*2 +h2 x*1 +n2

x1 x2 Linear h1 Channel
tn × NT = 2 × 2 : G2 =
−x∗2 x∗1 Combiner Esimator
h2
K x~1 x~2
achieves =1
tn
Maximum ^x
1
Likelihood
• STBCs cannot offer multiplexing gain Detector ^x
2
6
LDCs
• LDCs: “between V-BLAST and STBCs”, more flexible tradeoff between diversity
and multiplexing gains
• Q symbols, {sq = αq + jβq ∈ C}Q

q=1 , are mapped to NT transmit antennas for
transmission in tn time slots
• The tn × NT LDC matrix, S ∈ Ctn×NT , is defined by

Q “
X ”
S= αq Aq + jβq Bq
q=1
Aq , Bq ∈ Ctn×NT are set of dispersion matrices
• For L-PSK or L-QAM, normalised throughput per time slot

Q
R= · log2 (L) [bits/symbol]
tn
• Inter-antenna interference or inter-channel interference ⇒ prohibitively high

complexity for ML detection
7
SM and SSK
• Antenna index conveys bits
• For L-PSK or L-QAM, log2(L) L−PSK or L−QAM

bits: select the symbol to
log 2( L ) bits
ex
transmit
nd
00
ai
nn
• Another log2(NT ) bits: select 01
te
an
the transmit antenna to send 11
the symbol in tn = 1 time slot 10
• Mainly for multiplexing gain log2 (NT) bits

• Normalised throughput per time slot

R = log2 NT · L [bits/symbol]
• No inter-antenna interference or inter-channel interference ⇒ low complexity

“single-antenna” ML detection
8
Unified MIMO Architecture
• Space-time shift keying (STSK): unified MIMO including V-BLAST, STBCs,

LDCs, SM and SSK as special cases
– Fully exploit both spatial and time dimensions
– Flexible diversity versus multiplexing gain tradeoff
– No ICI with low-complexity single-antenna ML detection
• Coherent STSK (CSTSK):

– Better performance and flexible design
– Requires channel state information (CSI)
• Differential STSK:
– Doubling noise power, limited design in modulation scheme and choice of linear
dispersion matrices
– No need for CSI
9
Coherent MIMO
• Ability of an MIMO system to approach its capacity heavily relies on accuracy of

CSI
• Training based schemes: capable of accurately estimating MIMO channel at

expense of large training overhead ⇒ considerable reduction in system throughput
• Blind methods: high complexity and slow convergence, also unavoidable estimation
and decision ambiguities
• Semi-blind methods offer attractive practical means of implementing adaptive

MIMO systems
– Low-complexity ML data detection in STSK ⇒ efficient semi-blind
iterative channel estimation and data detection
10
CSTSK Transmitter
Coherent STSK block
A1
A(i)
Source 1
Channel AQ S (i) Space−time
S/P
coding mapper
L− PSK/ NT
QAM s(i)
• CSTSK (NT , NR, Tn, Q) with L-PSK/QAM:

– NT : number of transmitter antennas
– NR : number of receiver antennas
– Tn: number of time slots per STSK block, block index i
– Q: size of linear dispersion matrices
– L: size of modulation constellation
11
Transmitted Signal
• Each block S(i) ∈ CNT ×Tn is generated from log2(L · Q) bits by
S(i) = s(i)A(i)
• log2(L) bits decides s(i) from L-PSK/QAM modulation scheme
s(i) ∈ S = {sl ∈ C, 1 ≤ l ≤ L}
• log2(Q) bits selects A(i) from set of Q dispersion matrices
A(i) ∈ A = {Aq ∈ CNT ×Tn , 1 ≤ q ≤ Q}

H
Each dispersion matrix meets power constraint tr Aq Aq = Tn
• Normalised throughput per time-slot of this CSTSK scheme is
log2(Q · L)
R= [bits/symbol]
Tn
12
Design
• CSTSK (NT , NR, Tn, Q) with L-PSK/QAM: high degree of design freedom
– Similar to LDCs, strike flexible diversity versus multiplexing gain trade off
– Unlike LDCs, we will show STSK imposes no ICI
– Optimisation: number of transmit and receive antennas as well as the set of
dispersion matrices ⇒ desired diversity and multiplexing gains
• Unlike SM and SSK, STSK fully exploits both spatial and time dimensions
– SM and SSK can be viewed as special case of STSK
– Set tn = 1, Q = NT and choose
     
1 0 0
 0   1   0 
A1 =  .  , A2 = 

.

 ..  , · · · , AQ = 

 ..  ⇒ SM

0 0 1
13
CSTSK Receiver Model
• Received signal matrix Y(i) ∈ CNR×Tn takes MIMO model
Y(i) = H S(i) + V(i)
• Channel matrix H ∈ CNR×NT : each element obeys CN (0, 1)
• Noise matrix V(i) ∈ CNR×Tn : each element obeys CN (0, No)
• Signal to noise ratio (SNR) is defined as
SNR = Es/No
Es is average symbol energy of L-PSK/QAM modulation scheme
• Let vec[·] be vector stacking operator, IM be M × M identity matrix and ⊗ be

Kronecker product
14
Equivalent Signal Model
• Introduce notations
y(i) = vec[Y (i)] ∈ CNR Tn×1 H = ˆITn ⊗ H ∈ CNRTn×N˜T Tn
v(i) = vec[V(i)] ∈ CNR Tn×1 Θ = vec[A1] · · · vec[AQ] ∈ CNT Tn×Q
T Q×1
k(i) = [0
| ·{z
· · 0} s(i) 0
| ·{z
· · 0}] ∈ C
q−1 Q−q
where q is index of dispersion matrix Aq activated
• Equivalent transmitted signal vector k(i) takes value from set

Q×1
K = {kq,l ∈ C , 1 ≤ q ≤ Q, 1 ≤ l ≤ L}
which contains Q · L legitimate transmitted signal vectors

T
kq,l = [0 · · 0} sl 0
| ·{z · · 0}] , 1 ≤ q ≤ Q, 1 ≤ l ≤ L
| ·{z
q−1 Q−q
where sl is the lth symbol in the L-point constellation S
• Equivalent received signal model: y(i) = H Θ k(i) + v(i)
15
Maximum Likelihood Detection
• Free from ICI ⇒ low-complexity single-antenna ML detector, only searching L · Q

points !
• Let (q, l) correspond to specific input bits of ith STSK block, which are mapped
to sl and Aq
• Then ML estimates (q̂, l̂) are given by
ˆ 2
2
(q̂, l) = arg min ky(i) − H Θ kq,lk = arg min ky(i) − sl H Θ q k
1≤q≤Q 1≤q≤Q
1≤l≤L 1≤l≤L

where H Θ q
denotes qth column of the matrix H Θ
• Assume channel’s coherence time lasts the duration of τ STSK blocks. Then
complexity of detecting τ log2(Q · L) bits is

CML ≈ 4QTnNR 3τ L + 2NT [Flops]
16
Complexity Comparison
• For STSK, optimal ML detection of τ × log2(Q · L) bits

– only requires search for a total of τ × (Q · L) points
• For simplicity, assuming NT = NR , full optimal ML detection for conventional

MIMO with the same rate R
– requires search for a total of τ × NRL·Q points, which may become prohibitive
• K-best sphere decoding approximates ML performance with K set to K = L · Q

for conventional MIMO
2
– requires search for a total of τ × L · Q + NR − 1 L · Q points
– while imposing some additional complexity necessitated by Cholesky factorisation
17
Training Based Adaptive CSTSK

• Assume number of available training blocks is M and training data are arranged as

YtM = Y(1) Y(2) · · · Y(M )

StM = S(1) S(2) · · · S(M )
• Least square channel estimate (LSCE) based on (YtM , StM ) is given by

H −1
YtM SH

ĤLSCE = tM StM StM
• In order for StM SH

tM to have full rank of NT , it is necessary that M · Tn ≥ NT and
this requires a minimum of
lN m
T
M= training blocks
Tn
• However, to achieve an accurate channel estimate, large training overhead is

required
18
(4, 4, 2, 4) QPSK Example
• Convolution code with code rate 0

10
2 STSK training blocks
2/3, octally represented generator 30 STSK training blocks
Perfect CSI
polynomials of G1 = [23, 35]8 and −1
10
G1 = [5, 13]8
−2
10
• Hard-input hard-output Viterbi
algorithm decoding
BER
−3
10
• (NT = 4, NR = 4, Tn = 2, Q = 4)
with L = 4 QPSK modulation −4
10
• Frame of 800 information source bits, −5

10
after channel coding, are mapped to
τ = 300 STSK blocks
−6
10
0 2 4 6 8 10 12 14
• Average over 100 channel realisations SNR (dB)
19
Semi-Blind Iterative Algorithm

l m
NT
Use minimum M = training blocks to obtain initial ĤLSCE, and let observation
Tn

data for ML detector be Ydτ = Y(1) Y(2) · · · Y(τ )
1. Set iteration index t = 0 and channel estimate H̃(t) = ĤLSCE;
2. Given H̃(t), perform ML detection on Ydτ and carry out channel decoding on
detected bits. Corresponding detected information bits, after passing through
channel coder again, are re-modulated to yield
Ŝ(t) (t) (t) (t)

eτ = Ŝ (1) Ŝ (2) · · · Ŝ (τ ) ;
3. Update channel estimate with decision-directed LSCE

−1
H H
H̃(t+1) = Ydτ Ŝ(t) Ŝ(t) (t)

eτ eτ Ŝeτ ;
4. Set t = t + 1: If t < Imax, go to Step 2; otherwise, stop.
20
Simulation Settings
• Performance was assessed using estimated mean square error

τ
1 X
JMSE (H̃) = kY (i) − H̃ Ŝ(i)k2
τ · NR · Tn i=1
mean channel estimation error

1
JMCE (H̃) = kH − H̃k2
NR · NT
and BER, where H̃ is channel estimate, Ŝ(i) are ML-detected and re-modulated
data, and H is true MIMO channel matrix
• Performance averaged over 100 channel realisations
• Convolution code with code rate 2/3, octally represented generator polynomials of
G1 = [23, 35]8 and G1 = [5, 13]8
• Hard-input hard-output Viterbi algorithm for channel decoding
21
(4, 4, 2, 4) QPSK (Convergence)

• (NT = 4, NR = 4, Tn = 2, Q = 4) with L = 4 QPSK modulation
• Frame of 800 information source bits, after channel coding, are mapped to τ = 300 STSK blocks
• Semi-blind with M = 2 training STSK blocks
1 1
10 10
SNR=0 dB
SNR=0 dB
SNR=5 dB
SNR=5 dB
0 SNR=10 dB
SNR=10 dB 10
Mean Channel Error

Mean Square Error
−1
10
0
10
−2
10
−3
10
−1 −4
10 10
0 2 4 6 8 10 0 2 4 6 8 10
Iterations Iterations
22
(4, 4, 2, 4) QPSK (Bit Error Rate)

(a) semi-blind with M = 2 training (b) semi-blind with M = 3 training
0 0
10 10
2 STSK training blocks 2 STSK training blocks
−1 −1
10 Semi−blind iterative 10 Perfect CSI
Perfect CSI Semi−blind Iterative
−2 −2
10 10
BER
BER
−3 −3
10 10
−4 −4
10 10
−5 −5
10 10
−6 −6
10 10
0 2 4 6 8 10 12 14 0 2 4 6 8 10 12 14
SNR (dB) SNR (dB)
23
(4, 2, 2, 4) 16QAM (Convergence)

• (NT = 4, NR = 2, Tn = 2, Q = 4) with L = 16 QAM modulation
• Frame of 800 information source bits, after channel coding, are mapped to τ = 200 STSK blocks
• Semi-blind with M = 2 training STSK blocks
SNR=10 dB SNR=10 dB
SNR=15 dB −1 SNR=15 dB
10
SNR=20 dB SNR=20 dB
0
10
Mean Channel Error

Mean Square Error
−2
10
−1
10
−3
10
−2 −4
10 10
0 2 4 6 8 10 0 2 4 6 8 10
Iterations Iterations
24
(4, 2, 2, 4) 16QAM (Bit Error Rate)

Semi-blind with M = 2 0
training
10
Perfect CSI
2 training STSK blocks
10 training STSK blocks
−1
10 Semi−blind iterative
−2
BER 10
−3
10
−4
10
−5
10
−6
10
5 10 15 20 25
SNR (dB)
25
Summary
• Space-time shift keying offers a unified MIMO architecture

1. V-BLAST, OSTBCs, LDCs, SM and SSK are special cases
2. Flexible diversity versus multiplexing gain trade off
3. No ICI and low-complexity single-antenna ML detection
• A semi-blind iterative channel estimation and data detection scheme for coherent
STSK systems
1. Use minimum number of training STSK blocks to provide initial LSCE for aiding
the iterative procedure
2. Proposed semi-blind iterative channel estimation and ML data detection scheme
is inherently low-complexity
3. Typically no more than five iterations to converge to optimal ML detection
performance obtained with perfect CSI
26
References
1. P.W. Wolniansky, G.J. Foschini, G.D. Golden and R.A. Valenzuela, “V-BLAST:
an architecture for realizing very high data rates over the rich-scattering wireless
channel,” in Proc. ISSSE’98 (Pisa, Italy), 1998, pp.295–300.
2. V. Tarokh, N. Seshadri and A.R. Calderbank, “Space-time codes for high data
rate wireless communication: performance criterion and code construction,” IEEE
Trans. Information Theory, Vol.44, No.2, pp.744–765, March 1998.
3. B. Hassibi and B.M. Hochwald, “High-rate codes that are linear in space and time,”
IEEE Trans. Information Theory, Vol.48, No.7, pp.1804–1824, July 2002
4. J. Jeganathan, A. Ghrayeb and L. Szczecinski, “Spatial modulation: optimal

detection and performance analysis,” IEEE Communications Letters, Vol.12, No.8,
pp.545–547, Aug. 2008
5. J. Jeganathan, A. Ghrayeb, L. Szczecinski and A. Ceron, “Space shift keying

modulation for MIMO channels,” IEEE Trans. Wireless Communications, Vol.8,
No.7, pp.3692–3703, July 2009
27
References (2)
1. S. Sugiura, S. Chen and L. Hanzo, “A unified MIMO architecture subsuming

space shift keying, OSTBC, BLAST and LDC,” in Proc. VTC 2010-Fall (Ottawa,
Canada), Sept. 6-9, 2010, 5 pages
2. S. Sugiura, S. Chen and L. Hanzo, “Space-time shift keying: A unified MIMO

architecture,” in Proc. Globecom 2010 (Miami, USA), Dec.6-10, 2010, 5 pages
3. S. Sugiura, S. Chen and L. Hanzo, “Coherent and differential space-time shift

keying: A dispersion matrix approach,” IEEE Trans. Communications, December
Issue, 2010, 12 pages
4. S. Chen, S. Sugiura and L. Hanzo, “Semi-blind joint channel estimation and data
detection for space-time shift keying systems,” IEEE Signal Processing Letters,
Vol.17, No.12, pp.993–996, Dec. 2010.
28

ADAPTIVE SPACE-TIME SHIFT KEYING BASED MULTIPLE-INPUT MULTIPLE-OUTPUT SYSTEMS

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

ADAPTIVE SPACE-TIME SHIFT KEYING BASED MULTIPLE-INPUT MULTIPLE-OUTPUT SYSTEMS

Uploaded by

Copyright:

Available Formats

ELEC6014 RCNSs: Advanced Topic Series S Chen

ELEC6014 RCNSs: Advanced Topic Seminar

Adaptive Space-Time Shift Keying Based

Acknowledgements: Shinya Sugiura, Lajos Hanzo, Peichang Zhang

• Vertical Bell Lab layered space-time (V-BLAST)

• Orthogonal space-time block codes (OSTBCs)

• Linear dispersion codes (LDCs)

• Spatial modulation (SM) and space-shift keying (SSK)

• Inter-antenna interference or inter-channel interference ⇒ prohibitively high

• Assuming NR ≥ NT , NT symbols are mapped to NT transmit antennas for

• In general, maximum spatial multiplexing order: NS = min{NT , NR }

• NS symbols are mapped to NT transmit antennas by precoding for transmission

• For L-PSK or L-QAM, normalised throughput per time slot

• Block of K symbols are mapped to NT transmit antennas for transmission in tn

• Thus, STBC is defined by tn × NT complex-valued matrix S ∈ Ctn×NT

• Orthogonal STBCs: advantage of low-complexity ML detection

• Q symbols, {sq = αq + jβq ∈ C}Q

• The tn × NT LDC matrix, S ∈ Ctn×NT , is defined by

Aq , Bq ∈ Ctn×NT are set of dispersion matrices

• For L-PSK or L-QAM, normalised throughput per time slot

• Inter-antenna interference or inter-channel interference ⇒ prohibitively high

• For L-PSK or L-QAM, log2(L) L−PSK or L−QAM

• Mainly for multiplexing gain log2 (NT) bits

• No inter-antenna interference or inter-channel interference ⇒ low complexity

Unified MIMO Architecture

• Space-time shift keying (STSK): unified MIMO including V-BLAST, STBCs,

• Coherent STSK (CSTSK):

• Ability of an MIMO system to approach its capacity heavily relies on accuracy of

• Training based schemes: capable of accurately estimating MIMO channel at

• Semi-blind methods offer attractive practical means of implementing adaptive

• CSTSK (NT , NR, Tn, Q) with L-PSK/QAM:

• log2(L) bits decides s(i) from L-PSK/QAM modulation scheme

• log2(Q) bits selects A(i) from set of Q dispersion matrices

A(i) ∈ A = {Aq ∈ CNT ×Tn , 1 ≤ q ≤ Q}

• Normalised throughput per time-slot of this CSTSK scheme is

CSTSK Receiver Model

• Received signal matrix Y(i) ∈ CNR×Tn takes MIMO model

Y(i) = H S(i) + V(i)

• Channel matrix H ∈ CNR×NT : each element obeys CN (0, 1)

• Noise matrix V(i) ∈ CNR×Tn : each element obeys CN (0, No)

• Signal to noise ratio (SNR) is defined as

Es is average symbol energy of L-PSK/QAM modulation scheme

• Let vec[·] be vector stacking operator, IM be M × M identity matrix and ⊗ be

Equivalent Signal Model

• Equivalent transmitted signal vector k(i) takes value from set

which contains Q · L legitimate transmitted signal vectors

where sl is the lth symbol in the L-point constellation S

• Equivalent received signal model: y(i) = H Θ k(i) + v(i)

Maximum Likelihood Detection

• Free from ICI ⇒ low-complexity single-antenna ML detector, only searching L · Q

• Then ML estimates (q̂, l̂) are given by

• For STSK, optimal ML detection of τ × log2(Q · L) bits

• For simplicity, assuming NT = NR , full optimal ML detection for conventional

• K-best sphere decoding approximates ML performance with K set to K = L · Q

Training Based Adaptive CSTSK

• Least square channel estimate (LSCE) based on (YtM , StM ) is given by

• In order for StM SH

• However, to achieve an accurate channel estimate, large training overhead is

(4, 4, 2, 4) QPSK Example

• Convolution code with code rate 0

• Frame of 800 information source bits, −5

Semi-Blind Iterative Algorithm

1. Set iteration index t = 0 and channel estimate H̃(t) = ĤLSCE;