mmWave MIMO channel Modelling and estimation

Conventional MIMO Channel estimation

 Consider an N r × N t MIMO channel H , the MIMO channel estimation model is given by

» Y p=H X p+ N p
» Y p= [ y p ( 1 ) y p ( 2 ) y p ( 3 ) ….. y p ( L p ) ]
» X p =[ x p ( 1 ) x p ( 2 ) x p ( 3 ) … .. x p ( L p ) ]
» L p is the number of pilot vectors.
^
» The channel estimation is H=Y H
pX p ¿

» Minimum number of pilot symbols required is N T

 This conventional technique is inefficient for mmWave MIMO channel estimation for
various reasons.

mmWave MIMO channel estimation

 There are fewer multipath components in mmWave MIMO channel due to lower
scattering and higher blockage in the environment. E.g. buildings, human body etc.
 mmWave employs large number of antennas in array (~256 antennas) which leads to
more sparsity in the mmWave channel.
 Conventional beam training for channel state information requires coarse inter-sector
sweep followed by finer intra-sector sweep. It has a drawback of limited resolution.
 mmWave MIMO channel model can be developed by array response vector.
» The phase difference between successive antennas (
j 2 π f c t−
dcosθ
c ) j 2π fc t
−j2π
dcosθ
λ
e =e e
» d is the antenna spacing
» θ is angle of arrival/departure
 Array response vector is the unit vector along angle of arrival/departure

[ ]
1
r
dr cosθl
−j2π
1 e λ
a R (θ l )=
r

√ NR ⋮
dr cos θrl
− j 2 π (N r −1)
λ
e

[ ]
1
t
d t cosθl
− j2 π
1 e λ
a T ( θl )=
t

√ NT ⋮
dr cos θ tl
− j 2 π ( N t −1)
λ
e
 » Each path in the mmWave MIMO channel is characterised by
 Angle of arrival θrl
t
 Angle of departure θl
 Complex gain α l
» Hence contribution of path l is α l aR ( θrl ) a HT ( θtl )
 The mmWave MIMO channel model for L number of multipaths can be written as
L
H=∑ α l a R ( θrl ) aTH ( θtl )
l=1

][ ]
aT ( θ 1 )
H t

[
α1 ⋯ 0
¿ aR ( θr1 ) aR ( θr2 ) ⋯ aR ( θrL ) × ⋮ ⋱ ⋮ × aT ( θ 2 )
H t
[
⏟ ]
A 0 ⋯ αL ⋮
aT ( θ L )
R
H t

⏟
H
AT

 Beam-space channel model represented of

H
H= A R H b A T

[ ][ ]
H
aT (θ1 )
h11 ⋯ h1 G H
¿ [ a R ( θ1 ) a R ( θ2 ) ⋯ aR ( θ G ) ] × ⋮ ⋱ ⋮ × aT (θ2 )
h G 1 ⋯ h¿ ⋮
H
aT (θG )

» H b is the beam-space channel representation and has a huge number of zeros

therefore it is sparse in nature.
» A R∧ A T are receive and transmit array response dictionary matrices
» θi ∈Φ={θ 1 , θ2 , … ,θ G }; where Φ denotes the angular grid.
 For the mmWave MIMO channel estimation the pilot matrix √PIN Beam
T
is used and the
output matrix Y is given as
~
Y = √ P W HBB W HRF H F RF F BB I N + N Beam
T

Applying the vec operator, we will get channel estimation model as

y= (Y⃗ )

¿ ( √ P W BB
H ⃗ F F I )+ (~
W HRF H ⃗
N)
RF BB N Beam
T
 ¿ √ P¿

¿ √ P¿

¿ √ P¿

¿ √ P ( F BB F RF AT ⊗ W BB W RF A R ) h b+ ~n
H H ¿ H H

¿ Q hb + ~
n

» The channel model estimation problem can be formulated as

m∈⁡|¿ hb|¿ 0
subject to y=Q h b
» Where |¿ h b| ¿0 denotes number of non-zero elements of h b.
» Where, channel matrix H is simplified as H= A R H b A TH and applying the vec
operator

⃗ )= A ¿ ⊗ A H⃗
(H ( T R) ( b)

¿
¿ ( AT ⊗ A R ) h b

h b=(H⃗ b) is a sparse vector

Q= √ P F BB F RF A T ⊗W BB W RF A R ; Q has more column than rows

T T ¿ H H

 Orthogonal Matching Pursuit (OMP)

» Orthogonal matching pursuit is a simple algorithm for sparse vector estimation.
» y=Q h b+ ~n
» Q have columns q 1 , q 2 , q 3 , q 4 … , qn
» Correlation with each q 1 , q 2 , q 3 , q 4 … , qn
» Find the maximum correlation i (1 ) =argmax∨q Hj y∨¿
» Form basis matrix Q(1 )=[q i(1) ]
» Find the best approximation to ¿∨ y−Q (1 ) h b∨¿2 by applying least square
estimation
» The estimation in first round is given as h b=¿
» Set the residue as r (1)= y−Q (1) h(1)
b
 ⏟∨q j r (1)∨¿
» Find the maximum correlation of the residue r (1): i (2 )=argmax
H

» Augment basis matrix Q(2 )=[q i(1) qi (2) ]

» Use the suitable stopping criterion that the difference in the consecutive residues
falls below a threshold ∈, such that ¿∨r (n−1) −r (n )∨¿ ≤∈