ComNet'2020 1570599888

1
 
2
 
3
  HARQ performance over massive MIMO channels
4
 
5
 
6
 
using chase combining and CZA pilot
7
 
8
 
decontamination
9
 
10
  Maroua Boudaya Ines Kammoun Mohamed Siala
11
  LETI laboratory LETI laboratory MEDIATRON laboratory
12
  ENIS, University of Sfax ENIS, University of Sfax SUP’COM, University of Carthage
13
  Sfax, Tunisia Sfax, Tunisia Tunisia, Tunisia
14
  maroua.boudaya@enis.tn ines.kammoun@ieee.org mohamed.siala@supcom.tn
15
 
16
 
17
 
18
 
19
  Abstract—Pilot contamination is known to seriously limit the proved in [3] that CZA reaches the single-user performance
20
  performance of massive MIMO systems due to degradation when the numbers of symbols per transmitted frame and of
of channel estimation. Channel Zooming Algorithm (CZA) has
21
  receive antennas are large and that CZA performance degrades
been proposed as an efficient iterative algorithm to ensure the
22
  mitigation of the pilot contamination effect. This algorithm is when the transmitted packets are of lengths [4].
23
  able to zoom through iterations on the signal of the strongest Nevertheless, intelligent terminals such as smart phones and
24
  user by taking advantage of the difference in space signatures tablets produce an increasing number of data packets of
25
  and transmitted data sequences. CZA has been proved to be lengths. A solution to enhance transmission reliability in
26
  efficient for pilot contamination in the massive MIMO systems this case is the use of Automatic Repeat request (ARQ)
in the case of large number of antennas and long data packets.
27
  In this paper, we propose a novel version of CZA that utilizes and hybrid ARQ (HARQ) retransmission protocols. The two
28
  the benefits of retransmitted packets combining. We consider HARQ combining schemes are incremental redundancy (IR),
29
  a truncated Hybrid Automatic Repeat reQuest (HARQ), where where the retransmissions consist of new parity bits from the
30
  the number of retransmissions is limited using Chase combining channel encoder, and Chase combining, where the retransmis-
31
  (CC). We evaluate the Packet Error Rate (PER) performance of sions are identical copies of the original transmission. These
32
  the proposed approach for different order modulations as BPSK,
QPSK, 16-QAM and 64-QAM. Simulation results show that very retransmission schemes have been considered for MIMO and
33
  good performances can be achieved after very few transmission massive MIMO systems in some research works [7-10].
34
  attempts with our HARQ scheme using CC and CZA, despite In [7], a linear multi-user detection algorithm with HARQ with
35
  possible different contamination during each retransmission. incremental redundacy (HARQ-IR) is proposed for MIMO-
36
  Index Terms—Massive MIMO, pilot contamination, Channel systems. Its aim is to improve the throughput and the bit error
37
  Zooming Algorithm, pilot decontamination, automatic repeat
rate (BER) by considering MIMO with a simple retransmission
38
  request, Chase combining
method. In [8], Hybrid schemes with CC and IR have been
39
  considered in the uplink of a multicell multiuser SIMO system
40
  I. I NTRODUCTION
with large-scale antenna arrays at the base station (BS) for
41
  Massive multiple-input multiple-output (MIMO) systems improving the spectral efficiency. In [8], the author showed
42
  are equipped with a large number of antennas at the base that the throughput and the outage performance could be
43
  station (BS), which can significantly improve the spectrum impressively improved when the number of antennas increases
44
  efficiency, system capacity and coverage of the system [1-2]. in massive MIMO. In [9], authors reveal that HARQ with
45
  It is regarded as the most promising technology in the fifth- the adaptation of codeword length or transmit power decrease
46
 
generation (5G) wireless communication system. However, the power consumption. In [10], the authors consider the
47
 
the pilot contamination caused by sharing the pilot sequences three incremental schemes ARQ, HARQ-CC and HARQ-IR
48
 
among users is considered to be a bottleneck of these systems for MIMO systems. They propose energy-efficient adaptive
49
 
[3-4]. To address this problem, several approaches have been power allocation to minimize the outage probability under a
50
 
proposed to mitigate the effect of pilot contamination in constraint on average energy consumption per data packet.
51
 
massive MIMO systems [3-6]. Their study has been evaluated considering small numbers of
52
 
We are interested in this paper on the semi-blind algorithm, transmit and receive antennas.
53
 
proposed in [3], which is called ”Channel Zooming Algo- In this paper, we consider the uplink of massive MIMO
54
 
55
  rithm”, that ensures the mitigation of pilot contamination. The systems and propose a novel HARQ scheme using Chase
56
  idea of this algorithm is to make a zoom, through iterations, on combining and CZA pilot decontamination. Our idea is that
57
  the signal of the strongest user by taking advantage of differ- after a first transmission, the contaminated packet transmitted
60
  ence in received powers from contaminated users. It has been by the strongest user is recovered with CZA. If this fails,
61
 
62
 
63
 
64
 
65
 
1 on June 19,2021 at 08:16:27 UTC from IEEE Xplore. Restrictions apply.
Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded
the receiver combines the retransmitted packets using Chase
combining CC. Since contamination can occur during each
retransmission, we propose a modified version of CZA that
uses the benefits of retransmissions. We evaluate the perfor-
mance of the proposed scheme in term of packet error rate for
different symbol modulations, namely BPSk, QPSK, 16-QAM
and 64-QAM.
The rest of the paper is organized as follows. In section II,
we present the system model. In section III, we introduce the
novel channel zooming algorithm that utilizes the benefits of
retransmission with HARQ scheme with CC. In section IV,
we provide some simulation results. Finally, in section V, we
summarize the main results of this paper and propose some
perspectives.
Notations
The superscripts (.)H , (.)∗ and (.)T denote the Hermitian
transpose operator, the conjugate operator and the transpose
operator, respectively. Moreover, ha, bi denotes the scalar
2
product of two vectors a and b and k.k denotes the Euclidean
square norm of a vector. Each matrix A (respectively vector
a) in the system model will be split into Ad (resp. ad ) for data
part and Ap (resp. ap ) for the part emanating from pilots.
II. S YSTEM MODEL
We consider a multi-cell multi-user massive MIMO system
in uplink transmission. In each cell, we assume that the BS is
equipped with M antennas and serves K single antenna users.
The transmitted signal from each user is arranged into bursts
of N modulated symbols each, comprising Np pilot symbols
and Nd data symbols, with common transmitted energy EkT x
and positions pn = nTs , n = 0, 1, . . . , N − 1, where Ts
is the symbol period. Without loss of generality, we assume
for all users that the beginning of each burst is dedicated to
pilot transmission. Each link between a user and the BS is
assumed to borrow a Rayleigh flat fading channel. Thus, its
coefficients are constant during the transmission of at least
one burst. Let hkj be the propagation channel attenuation
between user k and receive antenna j, j = 0, 1, . . . , M −1. The
channel coefficients hkj are statistically Independent, Identi-
cally Distributed (i.i.d.) complex Gaussian random variables
distributed according to CN (0, 1). We assume that at each
distributed according to CN√(0, N0 ), where N0 is the channel
noise variance. Let xk = E k (xk0 , xk1 , ..., xk,N −1 ) be the
transmitted sequence from user k, where its components xkn
are normalized symbols.
III. P ROPOSED HARQ USING CC AND CZA
In this section, we introduce our approach for retransmission
and combining of unsuccessfully detected packets and pilot
decontamination with CZA.
A. Description of the mechanism for retransmission
We assume that during the first transmission of a given
packet by a user of interest, indexed as user 1, a pilot
contamination occurs between user 1 and U users located
in neighboring cells, indexed as users k, k = 1, . . . , U . The
received signal at the base station from these users, is given
by
U p
p X
y1n = E1 h11 x1n + E2 h1k xkn + b1n , (2)
k=2
for n = 1, . . . , N − 1.
The CZA is applied to recover the packet of user 1. We recall
that the CZA idea is to zoom, through the iterations, on the
signal of the strongest user of interest [3]. We notice that the
contaminating users, which are located in neighboring cells to
the cell of interest, have necessarily less received powers at
the base station of the cell of interest than the user of interest
which is directly connected to the base station of interest and
is located in the cell of interest.
When the CZA algorithm fails in pilot decontamination, the
BS requests a retransmission of the same replica at the next
slot and when the packet of user 1 is retransmitted, it can be
contaminated or not. The worst case is that when it will be
contaminated during its transmission. Then we will propose a
solution for this problem.
0
Let U be the set containing the indices of contaminating users
transmitting during the next slot.
The received signal at the base station at this slot, is given by
U p 0

access opportunity, an arbitrary number of active users, with

indices in a set Λ, access simultaneously the same spectrum
resources at the same time slot. Then, the received signal yn
at time position pn from all active users indexed with k ∈ Λ
is
X√
yn = E k hk xkn + bn ,
k∈Λ
for n = 0, 1, . . . , N − 1, where yn = (yn0 , yn1 , ..., yn,M −1 ) ,
T
hk = (hk0 , hk1 , .., hk,M −1 ) and xkn are the transmitted
symbols from user k. The energy Ek is equal to
Ek = EkT x /(Pk Sk ), where Pk and Sk denote respectively the
pathloss and the shadowing disturbing the transmission from
T
user k to the BS. Here, bn = (bn0 , bn1 , ..., bn,M −1 ) is the
vector of the additive received noise with i.i.d. components,
p X
y2n = E1 h21 x1n + Ek0 h2k0 xk0 n + b2n , (3)
k0
for n = 0, . . . , N − 1.
The BS receiver combines the received signals during the
successive slots and applies a novel modified CZA, which
(1)
will be called CZA-HARQ-CC, that will be introduced in the
following sub-section, in order to recover the packet of the
T
user of interest.
If the first retransmission is still in error, a second retrans-
mission is requested. This procedure is repeated, hopefully
permitting the recovery of the packet of user 1 before the
maximum number L of retransmissions is reached. If after L
retransmissions this packet is still detected with errors, it will
be discarded and retransmitted later on.

2 on June 19,2021 at 08:16:27 UTC from IEEE Xplore. Restrictions apply.

Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded
B. Modified CZA for HARQ scheme for n = 0, 1, . . . , Nd − 1. After that, the algorithm computes
(0)
In this section, we propose a modified CZA that takes into new estimates of hm1 , where m = 1, 2, using rn and the
account the retransmitted packets of user 1. For simplicity received signals y1n and y2n as follows
of presentation, we consider here a simple contamination Nd −1 (0) (0)
!
scenario, where during the first transmission the contamination (1) (1) 1 X r1n + r2n
λm ĥm = ymn , (11)
occurs only between 2 users, with the strongest user indexed Nd n=0 2
as user 1 and the weakest user indexed as user 2 and during the (1)
retransmission the contamination occurs only between user 1 where λm is a multiplicative factor. The choice of this factor
and another weakest user indexed as user 3. We stress the fact aims to simplify the obtained expressions and stabilize the
that the proposed algorithm can straightforwardly be extended underlying numerical calculation. Replacing the expression of
(0)
to more than two interfering users during each retransmission rmn in equation (11), we get
and to more transmission attempts. Equations (2) and (3) 1 E∗
xd1 2 h11 ĥ(0) , h11 + 1 xd2 2 h12 ∗
D
(1) (1)
become λ1 ĥ1 = 1
2Nd 2Nd
p p D E∗ 1 2 D E∗
y1n = E1 h11 x1n + E2 h12 x2n + b1n , (4) (0) x1 h11 ĥ(0) , h21
d
ĥ1 , h12 + 2
2Nd
and Nd −1 E∗
p p 1 X D
(0)
y2n = E1 h21 x1n + E3 h23 x3n + b2n . (5) + b1n ĥ1 , b1n + v,
2Nd n=0
The steps of CZA with HARQ-CC are described in Algo- (12)
rithm 1. where
1
d d  D (0) E∗
Algorithm 1 Proposed CZA-HARQ-CC v= x1 , x2 ĥ1 , h12 h11 +
Input: y1n , y2n , xp ; 2Nd
1
d d  D (0) E∗
(0) (0)
1. Compute first estimate, ĥ1 , of h11 and ĥ2 of h21 ; x1 , x3 ĥ2 , h23 h11
(0) 2Nd
2. Compute first decision variables, rmn , for m=1, 2; E∗
(0) 1
d d D
(0)
3. Compute the average of the decision variables rn = + x2 , x1 h12 ĥ1 , h11 +
(0) (0)
r1n +r2n 2Nd
2 ; 1
d d D
(0)
E∗
4. for l = 1 . . . L do x2 , x1 h12 ĥ2 , h21 +
(l) 2Nd
5. Compute l(th) estimate of hm1 , ĥm , for m=1,2; 1
d d ∗ D
(0)
E∗
6. Compute l (th) (l)
decision variables, rmn ; for m=1 and 2; + x2 , x3 h12 ∗ ĥ2 , h23 +
(l) 2Nd
7. Compute the average of the decision variables rn = E∗ NXd −1
(l−1)
r1n +r2n
(l−1) 1 √ D (0)
2 ; E 1 ĥ1 , h11 x∗1n b1n +
2Nd
8. end for; n=0
9. Compute final channel estimate; E∗ NXd −1
1 √ D (0)
Output: ĥ1 , ĥ2 , x̂1 . E 1 ĥ2 , h21 x∗1n b2n
2Nd n=0
E∗ NXd −1
Following the CZA steps introduced in [3], the first channel 1 √ D (0)
(0) + E 2 ĥ1 , h12 x∗2n b1n +
estimate of ĥm , where m = 1 corresponds to the first 2Nd (13)
n=0
transmission and m = 2 corresponds to the retransmission d −1
NX
is 1 √ D (0) E∗
E 3 ĥ2 , h23 x∗3n b2n +
ĥ(0) P PH 2Nd
m = ymn x (6) n=0
d −1 D
NX E∗
and the first decision variable for user 1 is 1 p (0)
E1 h11 ĥ1 , x1n b1n
(0) Nd
rmn = ĥ(0)
m ymn , (7) n=0
NXd −1 D E∗
1 p (0)
for m = 1, 2 and n = 0, . . . , Nd − 1. We show that + E2 h12 ĥ1 , x2n b1n +
Nd n=0
(0)
ĥ1 = h11 + β1 h12 + z1 (8) NXd −1 D E∗
1 p (0)
and E1 h21 ĥ2 , x1n b2n +
(0)
Nd n=0
ĥ2 = h21 + β2 h23 + z2 , (9)
NXd −1 D E∗
1 p (0)
where β1 = E2 /E1 , β2 = E3 /E1 . Then, we calculate the E2 h23 ĥ2 , x3n b2n
Nd
average first decision variable for user 1 as follows n=0
Nd −1 E∗
(0) (0) 1 X D
(0)
r + r2n + b1n ĥ2 , b2n
rn0 = 1n , (10) Nd n=0
2

3 on June 19,2021 at 08:16:27 UTC from IEEE Xplore. Restrictions apply.

Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded
The data parts of transmitted sequences xk and xk0 , for and
k, k 0 = 1, . . . , 3, with k 0 6= k are quasi orthogonal and then ∗ ∗
the first five terms of v can be neglected. Furthermore, since, (1) N0 z1 + E1 hz1 , h11 i h11 + E2 hz1 , h12 i h12
w1 = 2
the number of data symbols is assumed to be large and the (E1 kh11 k + N0 )
∗ ∗
components of xm are independent from those of bm , we β1 E1 hh11 , h12 i h11 + E2 hh11 , h12 i h12
+
obtain (E1 kh11 k + N0 )
2

Nd −1 ∗ ∗ (20)
1 X E1 hz1 , h21 i h11 + β2 E1 hh23 , h21 i h11
x∗ bmn ≈ 0, (14) + 2
Nd n=0 kn (E1 kh11 k + N0 )
∗
E2 hh23 , h21 i h12
+ 2 .
for k = 1, 2 and 3 and m = 1, 2. (E1 kh11 k + N0 )
Yet again, the next four terms in equation (13) can be
neglected. Moreover, since the vectors h11 , h12 , h21 , h23 By developing (11) for m = 2 to estimate the channel h21
and zm are independent of bmn and 2Nd is large, we can seen by user 1 during the retransmission, we get
neglect the next four terms in v. The last term in v can be (1) (1)
also neglected since b1 and b2 are independant. Therefore, ĥ2 = h21 + ρ2 h23 + w2 , (21)
all the terms in the equation (13) could be neglected, a claim
where
that will also be confirmed through simulation results. Since 
2

the number of data symbols Nd is large and according to the β2 E3 kh23 k + N0
central limit theorem, we have the following approximation ρ2 =   . (22)
2 2
E1 kh21 k + kh11 k + N0
for the fourth term in (12)

Nd −1
At the l-th iteration of the CZA, the channel estimate is
1 X (0)H (0) obtained as follows
b1n (ĥ1 b1n )∗ ≈ N0 ĥ1 . (15)
Nd n=0 Nd −1
1 X
λ(l) (l)
m ĥm = ymn rn(l−1) ∗ (23)
2 Nd n=0
Moreover, we can use the approximations xdk ≈ Ek Nd ,
for k = 1, . . . , 3, since Nd is large. We note that, for phase (l)
modulations, these approximations become equalities. and the decision variable rn on the n-th symbol of the
Then, we get strongest user is improved as follows
P2 (l)
1  m=1 rmn
rn(l)

(1) (1) 2 ∗
λ1 ĥ1 = E1 kh11 k + hz1 , h11 i + β1 hh11 , h12 i h11
∗ = , (24)
2 2
1  2 ∗ ∗

where
+ E2 β1 kh12 k + hz1 , h12 i + hh11 , h12 i h12
2 (l)
1   rmn = ĥ(l) H
m ymn . (25)
2 ∗ ∗
+ E1 kh21 k + hz2 , h21 i + β2 hh21 , h23 i h11
2 (l−1)
N0 After that, by replacing yn and rn by their expressions in
+ (h11 + β1 h12 + z1 ) (23), we show that
2
(16)
By choosing the multiplicative factor λ(1) as (l)
ĥ1 = h11 + ρl1 h12 + w1
(l)
(26)
2 2
E1 kh11 k + E1 kh21 k + N0 and
λ(1) = , (17)
2 (l)
ĥ2 = h21 + ρl2 h23 + w2 ,
(l)
(27)

where λ(1) is a multiplicative factor. The choice of this factor where

aims to simplify the obtained expressions and stabilize the D E∗ D E∗
(l−1) (l−1) (l−1)
underlying numerical calculation. we obtain N0 w1 + E1 w1 , h11 h11 + E2 w1 , h12 h12
(l)
w1 = 2 2
(1) (1) E1 (kh11 k + kh21 k ) + N0
ĥ1 = h11 + ρ1 h12 + w1 , (18) ∗ ∗
ρl−1
1 E1 hh11 , h12 i h11 + E2 hh11 , h12 i h12
+ 2 2
where E1 (kh11 k + kh21 k ) + N0
D E∗
(l−1) ∗

2
 E1 w2 , h21 h11 + ρl−1
2 E1 hh23 , h21 i h11
β1 E2 kh12 k + N0 + .
ρ1 = (19) 2 2

2 2
 E1 (kh11 k + kh21 k ) + N0
E1 kh11 k + kh21 k + N0 (28)

4 on June 19,2021 at 08:16:27 UTC from IEEE Xplore. Restrictions apply.

Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded
and algorithm for recovering the transmitted sequence. For simu-
D E∗ lation results, we will consider an uncoded system in order to
(l−1) (l−1)
N0 w2 + E1 w2 , h21 h21 simply and directly evaluate the performance of our approach.
(l)
w2 = 2 2
E1 (kh11 k + kh21 k ) + N0 IV. SIMULATION RESULTS
D E∗
(l−1) ∗
+E3 w2 , h23 h23 + ρl−11 E1 hh12 , h11 i h21 In this section, we present some simulation results carried
2
E1 (kh11 k + kh21 k ) + N0
2 out in order to evaluate the PER performance of the proposed
(29) HARQ scheme with CC and CZA pilot decontamination.
∗ ∗
ρl−1
2 E1 hh21 , h23 i h21 + E3 hh21 , h23 i h32 Only one retransmission is considered for these simulations.
+ 2 2
E1 (kh11 k + kh21 k ) + N0 The PER curve of CZA without retransmission is used as a
D E∗
+E1 w1
(l−1)
, h11 h21 benchmark. Moreover, different modulations are considered,
+ . namely BPSk, QPSK, 16-QAM and 64-QAM. We assume
2 2
E1 (kh11 k + kh21 k ) + N0 that β12 = β22 and we denote by θ = β12 = β22 .
Since ρ1 ≺ 1 and ρ2 ≺ 1 , where the number of iterations Figure 1 depicts the obtained PER versus the SNR received in
l, goes to infinity, the algorithm is able to zoom on h11 and average by each of the BS receive antennas, for the strongest
(∞) (∞)
h21 , up to additive noise terms w1 and w2 . Following user, considering the number of data symbols N = 1024 and
the demonstration given in the appendix A of [3], we show 512. We consider BPSK modulation, θ = 1/2, Np = N/4
that and M = 500. From Figure 1, we observe that the PER is
∗ ∗ well improved with HARQ using CC and CZA. Moreover,
(∞) hz1 , h11 i h11 E2 hh11 , h12 i h12
w1 = + with retransmission the PER obtained with N = 512 is
2 2 2
2 kh11 k E1 (kh11 k + kh21 k ) + N0 close to the PER obtained with a double length of packets,
(30) N = 1024, and CZA without retransmission.
and Figure 2 shows the effect of the number of iterations on
∗ ∗
(∞) hz2 , h21 i h21 E1 hh21 , h23 i h23 the performance of the CZA-HARQ-CC, considering QPSK
w2 = 2 2+ 2 .
2 kh21 k E2 (kh21 k + kh11 k ) + N0 modulation, the numbers of antennas 500, θ = 1/3 and the
(31) number of data symbols 1024. We observe that the iterative
Then, our final channel estimate of h11 is steps of the proposed CZA-HARQ-CC significantly improve
D
(∞) (0)
E
(∞) the PER performance of the strongest user.
ĥ11 = h̃1 , ĥ1 ĥ1 (32)
Figure 3 represents the obtained PER as a function of the
and of h21 is SNR for the strongest user when symbols are modulated
D E with a 16-QAM. We consider the number of data symbols
(∞) (0) (∞)
ĥ21 = h̃2 , ĥ2 ĥ2 . (33) N = 1024 and 512, θ = 1/3, Np = N/4 and M = 500.
Figure 3 shows that the PER is very well improved for
We show that
16-QAM for both values considered of N .
hh11 , z1 i h11 Figure 4 evaluates the PER performance of the CZA-HARQ-
ĥ1 = h11 + 2 (34)
2 kh11 k CC strategy, considering 64-QAM modulation, N = 1024
and for h21 and the antennas numbers 500 and 300. We observe that the
hh21 , z2 i h21 performance of CZA-HARQ-CC is better than the CZA.
ĥ2 = h21 + 2 . (35)
2 kh21 k
As we can see, the channel estimate ĥm1 is equal to the
desired channel hm1 , where m = 1, 2, of the strongest user
up to an additive term, incurred by noise.

C. Decision metric
For uncoded symbols, the decision on signal x11 is given
simply by
!
1 ĥH 11 d 1 ĥH 21 d
x̂11 = Γ Y + Y , (36)
2 ||ĥ11 ||2 1 2 ||ĥ21 ||2 2
where Γ (.) is the decision function of a threshold de-
d
tector depending on the used modulation and Ym =
(y0 , y1 , . . . , yN −1 ) is the M ∗ N received matrix.
For the coded system, the soft decisions ĥH d
m1 Ym , where
m = 1, 2 can be used by an error-correction Viterbi decoding

5 on June 19,2021 at 08:16:27 UTC from IEEE Xplore. Restrictions apply.

Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded
 100 100
N=1024, CZA-HARQ-CC
N=1024, CZA
N=512, CZA-HARQ-CC
10-1 N=512, CZA

10-2 10-1
PER

PER
10-3

10-4 10-2

10-5 N=1024, CZA-HARQ-CC

N=1024, CZA
N=512,CZA-HARQ-CC
N=512,CZA
10-6 10-3
-20 -19 -18 -17 -16 -15 -14 -8 -7 -6 -5 -4 -3 -2
SNR [dB] SNR [dB]

Fig. 1. PER as a function of SNR for BPSK modulation, θ = 1/2 and Fig. 3. PER as a function of SNR for 16-QAM modulation, θ = 1/3 and
M = 500. M = 500.

100 100

10-1 10-1
PER

PER

10-2 10-2

l=1, CZA-HARQ-CC
10-3 10-3
l=2,CZA-HARQ-CC
l=5, CZA-HARQ-CC M=500, HARQ-CZA
l=1, CZA M=500, CZA
l=2,CZA M=300, HARQ-CZA
l=5, CZA M=300, CZA
10-4 10-4
-19 -18 -17 -16 -15 -14 -13 -12 -11 -8 -7 -6 -5 -4 -3 -2 -1 0 1 2
SNR [dB] SNR [dB]

Fig. 2. PER as a function of SNR for QPSK modulation, θ = 1/3 N = 1024 Fig. 4. PER as a function of SNR for 64-QAM modulation, θ = 1/6 and
and M = 500. N = 1024.

6 on June 19,2021 at 08:16:27 UTC from IEEE Xplore. Restrictions apply.

Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded
 V. C ONCLUSION
In this work, we have proposed a novel HARQ scheme
over massive MIMO channels using CC and channel zooming
algorithm for pilot decontamination. This scheme allows the
data in contaminated packets transmitted by the strongest user
to be received correctly despite different possible contami-
nations during the retransmissions. The performance of the
system in term of packet error rate (PER) was evaluated by
simulation results for different symbol modulations and for
different lengths of packets. Simulations show a significant
improvement in the PER with the proposed algorithm (called
CZA-HARQ-CC) even with one retransmission and even for
high order modulations. As a first perspective, we will compute
the analytical expression of the asymptotic PER, resulting after
a large iteration number of the proposed algorithm and after a
given number of retransmissions. As a second perspective, it
will be interesting to study the impact of other parameters
on CZA-HARQ-CC performances such as the number of
retransmissions, the number of contaminating users and the
energy attenuation factor.
R EFERENCES
[1] F. Boccardi, R. W. Heath, A. Lozano, T. L, ”Marzetta and P. Popovski,
Five disruptive technology directions for 5G,” IEEE Commun. Mag., vol
52.2, pp 74-80, 2014.
[2] T. E. Bogale and L. B. Le, ”Massive MIMO and mmWave for 5G Wireless
HetNet: Potential Benefits and Challenges,” IEEE Vehicular Technology
Magazine, vol. 11, no 1, pp. 64-75, 2016.
[3] M. Boudaya, I. Kammoun and M. Siala, ”Channel Zooming for the
Mitigation of Pilot Contamination in Massive MIMO,” Transactions on
Emerging Telecommunications Technologies. 2017
[4] M. Boudaya, I. Kammoun and M. Siala, ”Analytical description of the
CZA method in the case of several contaminating users in massive MIMO,”
The International Multi-Conference on Systems, Signals and Devices 2018.
[5] W. Mahyiddin, P. Martin, P. Smith ”Pilot contamination reduction us-
ing time-shifted pilots in finite massive MIMO systems” , in Vehicular
Technology Conference (VTC Fall), 2014 IEEE 80th.
[6] H. Wang, Y. Wang, Y. Huang, L. Yang, ”Pilot contamination reduction
in very large MIMO multi-cell TDD systems” J. Signal Process. (Xinhao
Chuli). 29(2), 171,80, 2013
[7] M. Kashif, Z. Ullah, . Iqbal and L. Musavian et others, Multiuser
Detection Using Hybrid ARQ with Incremental Redundancy in Overloaded
MIMO Systems International Conference on Collaborative Computing:
Networking, Applications and Worksharing 2019
[8] M. Jabi, M. Benjillali, L. Szczecinski, and F. Labeau, Energy efficiency
of adaptive HARQ,IEEE Transactions on communications, vol. 64, no. 2,
pp. 818?31, Feb. 2016.
[9] S. H. Kim, T. V. K. Chaitanya, and T. Le-Ngoc, Hybrid ARQ in multicell
MU-SIMO with large-scale antenna arrays,IEEE Transactions on Wireless
Communications, vol. 15, no. 9, pp. 5861,874, Sep. 2016.
[10] T. V. K. Chaitanya and T. Le-Ngoc, Eergy-efficient adaptive power
allocation for incremental MIMO systems, IEEE Transactions on Vehicular
Technology, vol. 65, no. 4, pp. 2820,827, Apr. 2016.

7 on June 19,2021 at 08:16:27 UTC from IEEE Xplore. Restrictions apply.

Authorized licensed use limited to: Univ of Calif Santa Barbara. Downloaded