# Rateless Space Time Block Code for Massive MIMO Systems

Authors: Ali H. Alqahtani; Ahmed Iyanda Sulyman; Abdulhameed Alsanie
Journal: International Journal of Antennas and Propagation
 (2014)

---

## Abstract

This paper presents a rateless space time block code (RSTBC) for massive MIMO systems. The paper illustrates the basis of rateless space time codes deployments in massive MIMO transmissions over wireless erasure channels. In such channels, data may be lost or is not decodable at the receiver due to a variety of factors such as channel fading, interference, or antenna element failure. We show that RSTBC guarantees the reliability of the system in such cases, even when the data loss rate is 25% or more. In such a highly lossy channel, the conventional fixed-rate codes fail to perform well, particularly when channel state information is not available at the transmitter. Simulation results are provided to demonstrate the BER performance and the spectral efficiency of the proposed scheme.


---

## Body

## 1. Introduction and Motivation

Multiple-input multiple-output (MIMO) antenna systems have recently become one of the most significant technologies in modern wireless communications. MIMO wireless communication systems have attracted interests in both academy and industry, due to their ability to increase the systems reliability and capacity. The current fourth generation (4G) wireless standards, like LTE/LTE-A and WiFi (IEEE 802.11n), have used MIMO antenna systems to achieve significantly higher data rates and improve the spectral efficiency. The invention of MIMO system [1] led to the introduction of multiantenna coding scheme, known as space time code (STC) [2]. The scheme has the potential to significantly exploit MIMO gains offered by multiple antenna transmission, as well as coding gain offered by the encoding scheme that is deployed. A number of schemes employing multiple antenna arrays with STC were developed in [3–7]. Space time trellis code (STTC) and space time block code (STBC) are the two main types of STC techniques. Several recent wireless standards have used STBC, due to its low decoding complexity in comparison to STTC. As far as design criteria, it has been shown in [2] that the main code design criterion is the rank criterion, in which the rank of the difference of two distinct codewords has to be maximized. The codebook is said to be fully diverse, if this property is satisfied. Once the difference matrix has full rank, the product of its singular values is nonzero; then the second design criterion is maximizing the coding gain. Extensive work has been done on designing STCs possessing high gains [8, 9].Moving forward to the fifth generation (5G) standards, MIMO techniques will continue to play a key role in further increasing the wireless data rates to the Gigabit range targeted. Demand for wireless communications is projected to grow rapidly over the next few years [10, 11]. A potential technology for meeting this demand is massive MIMO systems (also known as large-scale antenna or large-scale MIMO systems). Massive MIMO is a promising technique for the next generation wireless systems as a multiuser multiple antenna system. The concept of massive MIMO involves the deployment of base stations with a very large number of antenna arrays, using perhaps hundreds of transceiver elements, to increase network capacity, improve reliability, and reduce the overall transmitted power. The distinguishing feature of massive MIMO is that a large number of antennas, possibly hundreds or even thousands, work together to deliver huge amount of data to multiple users on the same time-frequency resources. Moreover, large antenna arrays can focus the radiated energy precisely towards the intended receivers, thereby efficiently reducing interference. This improvement in performance also comes with accompanying enhancements in radiated energy efficiency. Although massive MIMO systems provide better spectral and energy efficiency compared with the existing MIMO systems, their deployments in cellular systems may come with new problems which arise from the difficulty of deploying a very large number of antenna elements and keeping them all in working condition continuously. This is an important practical deployment issue that has not yet been examined. There may arise situations whereby few antenna elements in the field have been damaged (or failed to work properly) and the data fed on to these elements is lost in the wireless transmission medium. This gives rise to the so-called wireless erasure channels.In this work, we examine rateless coding techniques that can be used to solve this problem in the context of massive MIMO system, where a large number of antennas are employed for point-to-point as well as point-to-multipoint communications between a transmitter and a receiver. Unlike the conventional channel code, rateless code does not have a fixed rate, and most of the available work in the literature is an extension of the fountain codes over the erasure channels [12]. The first practical class of rateless codes is called LT (Luby transform) code, which was developed to the well-known Raptor code [13]. For wireless channels, rateless code paradigm was addressed in many works such as [14–16]. A rateless code can operate “universally” over classes of channels and adapt its rate to the specific channel realization. The notion of rateless coding is conceptually similar to the hybrid automatic repeat request (HARQ) schemes [17], but the difference is mainly in the code construction where rateless codes can be considered as a continuous version of the HARQ schemes [14]. Theoretically speaking, based on the general notion of ratelessness, a rateless code generates a potentially infinite supply of encoding packets from the original data and sequentially transmits codeword symbols. Practically, rateless code has to be truncated to a finite number of blocks where each block has a certain likelihood of being decoded to recover the entire message. The receiver keeps trying to decode the message as it receives the codewords. When the receiver successfully decodes the message, it sends back an acknowledgement flag over a feedback channel to inform the transmitter to terminate the current codeword and start transmission of the next message.To our knowledge, only few works have examined rateless space time codes [18]. Most of these works were conducted mainly over additive white Gaussian noise (AWGN) channel. There is not enough research work yet on rateless space time codes, even for the regular MIMO systems. For the case of massive MIMO systems, we are not aware of published work yet examining the combination of rateless STC with massive MIMO schemes. The characteristics of rateless codes and the erasure links that may arise due to failure of antenna elements in massive MIMO systems motivate us to propose the use of rateless coding technique in massive MIMO systems.In this study, we examine the performance of RSTBC employed in massive MIMO systems. We illustrate the effectiveness of the scheme in combating lossy links that may arise during wireless transmissions. Our results show that the proposed system can convert a lossy channel (such as a channel with 25%-loss rate) into a lossless one and provide a reliable robust transmission when very large MIMO dimensions are used.The remainder of the paper is organized as follows. Section2 describes the system model and the basic problem formulation in our work. Performance evaluations of rateless STC over massive MIMO channels are presented in Section 3. Section 4 presents RSTBC for massive multiuser MIMO system. Simulation results for massive SU-MIMO and MU-MIMO systems are presented and analyzed in Section 5. Finally, Section 6 presents the conclusion of the paper.


## 2. System Model and Problem Formulation

### 2.1. Conventional MIMO System

Consider a wireless communication system withN
t transmit and N
r receive antennas as shown in Figure 1. Assume that path gains between individual antenna pairs are independent and identically distributed (i.i.d.) Rayleigh-faded. This means that the maximal diversity gain is N
t
N
r which is equivalent to the total number of fading paths in the MIMO channel.Figure 1
Basic MIMO system.The output of the system can be expressed as(1)
Y
=
E
x
N
o
N
t
H
X
C
+
N
,
where Y
∈
C
N
r
×
T is the matrix of received signals over “T” time slots, H
∈
C
N
r
×
N
t is the channel coefficients matrix whose elements are independent and identically distributed (i.i.d) complex Gaussian random variables (with zero mean and unit variance) given by(2)
H
=
[
h
11
h
12
⋯
h
1
N
t
h
21
h
22
⋯
h
2
N
t
⋮
⋮
⋮
⋮
h
N
r
1
h
N
r
2
⋯
h
N
r
N
t
]
,
and E
x is the energy per symbol at each transmit antenna. The parameter X
C
∈
C
N
t
×
T denote the space time code matrix, while N
∈
C
N
r
×
T is the Gaussian noise matrix (with i.i.d. zero mean and unit variance complex Gaussian elements).


### 2.2. Lossy Channel Model

In this work, we assume a lossy channel in which losses are introduced in the channel transfer matrixH as follows:
(3)
H
⊙
D
=
[
h
11
h
12
⋯
h
1
N
t
h
21
h
22
⋯
h
2
N
t
⋮
⋮
⋮
⋮
h
N
r
1
h
N
r
2
⋯
h
N
r
N
t
]
⊙
[
d
11
d
12
⋯
d
1
N
t
d
21
d
22
⋯
d
2
N
t
⋮
⋮
⋮
⋮
d
N
r
1
d
N
r
2
⋯
d
N
r
N
t
]
,
where D
∈
C
N
r
×
N
t is a matrix of random binary numbers representing losses experienced during transmission (i.e., the dropped links, where zeros represent losses and ones represent lossless links), and ⊙ denotes the elementwise multiplication operation (Hadamard product). Losses may occur when some transmitted symbols are dropped, especially in high volume downloading through broadcasting over noisy wireless networks, or when some transmitter components, such as antenna elements, fail to work. Furthermore, interference from all other transmit antenna elements is considered at the receiver.


### 2.3. Sequential Rateless STBC

The purpose of this subsection is to introduce the mechanism of RSTBC as depicted by the block diagram in Figure2. In this system, each message is encoded into a codeword of L blocks in which each block takes T channel use where T is sufficiently large and the channel coherence time remains constant for the entire codeword length (i.e., up to L blocks) [16]. Then, the system input-output relationship is expressed as
(4)
[
Y
1
Y
2
⋯
Y
L
]
=
E
x
L
N
t
N
o
(
H
⊙
D
)
×
[
X
1
X
2
⋯
X
L
]
+
[
N
1
N
2
⋯
N
L
]
,
where X
l
∈
C
N
t
×
T (l
=
1
,
…
,
L) is the codeword matrix transmitted during the lth block, H
∈
C
N
r
×
N
t is the channel transfer matrix, N
l
∈
C
N
r
×
T is a noise matrix with i.i.d. zero mean and unit variance complex Gaussian elements, and Y
l
∈
C
N
r
×
T is the output signals matrix. The conventional space time codeword matrix X
C is encoded into a rateless ST codeword matrix [
X
1
X
2
⋯
X
L
], where X
l, for example, when T
=
2, can be constructed as
(5)
X
l
=
[
x
1
x
2
*
x
2
-
x
1
*
⋮
⋮
x
N
t
-
1
x
N
t
*
x
N
t
-
x
N
t
-
1
*
]
.
A power constraint on X
l is introduced as
(6)
E
[
1
T
∥
X
l
∥
F
2
]
≤
N
t
for
l
=
1
,
…
,
L
,
where E
[
·
] denotes the expected value.Figure 2
Sequential rateless space time block coded MIMO system.At the receiving end, it is desired to decode a transmitted message of mutual informationS with the codeword [
X
1
X
2
⋯
X
l
]. Let I denote the mutual information after receiving the codeword block X
l. If I
<
S, the receiver remains silent and waits for the next block. This process continues until the receiver collects the sufficient number of blocks that is required to recover the message. When I
≥
S after the lth block, the receiver decodes the received codeword [
X
~
1
X
~
2
⋯
X
~
l
] and sends one-bit feedback to the transmitter to stop transmitting the remaining part of the current codeword and start transmitting the next message immediately [16]. For the MIMO channel model considered in Figure 2, which we call the lossy channel, the decoding process is conducted sequentially, first using X
~
1, then [
X
~
1
X
~
2
] if X
~
1 is not sufficient, and so forth. As a result, to achieve high efficiency, sequential RSTBC requires large delays. Since many applications are more sensitive to delay characteristics, we develop fast RSTBC for massive MIMO channels as described in the following subsection.


### 2.4. Rateless STBC for Massive SU-MIMO System

In this subsection, we present RSTBC in massive single-user MIMO (SU-MIMO) systems. As we have explained, in the rateless coding concept discussed earlier, the codewords{
X
l
}, l
=
1,2
,
…
,
L, are transmitted through different channels that are orthogonal in time. Therefore, sequential RSTBC requires time delay to achieve reliability of the transmission. This delay constraint disallows coding over a large number of blocks. Fortunately, with massive MIMO configurations, in which a lot of antennas are used, the large number of antenna elements available can be exploited to overcome this problem. This can be accomplished by transmitting the entire rateless codeword [
X
1
X
2
⋯
X
L
] simultaneously through different antenna elements. Thus, fast and reliable transmission is achieved.Now, we consider a downlink massive SU-MIMO shown in Figure3. In this scenario, a base station transmitter (BSTx) is equipped with a large number of antennas. We assume that the user is equipped with N
r receiving antennas. The channel is assumed to have lossy characteristics. The input-output relationship can be expressed as
(7)
U
=
E
x
L
N
t
N
o
(
H
⊙
D
)
X
+
N
.
In this equation, U
∈
C
N
r
×
T is the output matrix;  X
=
[
X
1
⋯
X
L
]
T
∈
C
L
N
t
×
T is the codeword transmitted matrix;  N
∈
C
N
r
×
T is the noise matrix; H
∈
C
N
r
×
L
N
t is the channel transfer matrix; and D
∈
C
N
r
×
L
N
t is a matrix of random binary numbers representing losses experienced during transmission (i.e., the dropped links, where zeros represent losses and ones represent reception), and each element in  D at time i is denoted by d
m
n
i (where m
=
1,2
,
…
,
N
r and n
=
1,2
,
…
,
L
N
t). We impose a power constraint on X so that
(8)
E
[
1
T
∥
X
∥
F
2
]
≤
L
N
t
.Figure 3
Rateless space time block code for single-user massive MIMO system.The block diagram in Figure3 depicts the system of (7) in which the BSTx contains large number of antenna elements which are grouped into L groups (each group contains N
t transmit antennas) and the rateless codeword X  is transmitted through L
N
t transmit antennas over T time slots. The user receiver contains N
r receive antennas, where L
N
t
>
N
r so that the system is considered as L
N
t
×
N
r massive SU-MIMO system. The number of antennas selected to transmit X depends on the number of blocks used in rateless coding.To illustrate how the system shown in Figure3 works, at the BSTx, first, the encoder generates L redundant blocks X
=
[
X
1
⋯
X
L
]
T, and then L antenna groups (each of N
t antenna elements) are selected to transmit X simultaneously using a total of L
N
t transmit antennas through lossy channel H. The number of blocks that need to be collected by the user depends on channel conditions; that is, a more lossy channel needs more redundant blocks. Once the underlying message is decoded completely, a feedback is sent from the user to the BSTx to terminate the current transmission and then move on to transmit the next message. Otherwise, the receiver waits for another return of transmission where the number of blocks L is increased and, consequently, the number of selected groups is increased. As we stated before, the BSTx is equipped with a very large number of antennas perhaps hundreds or thousands, so the process continues until a reliable reception is achieved. The receiver collects as many redundancy blocks as needed to decode the message and corresponding received matrix U is used to estimate the transmitted codeword as X
~
=
[
X
~
1
⋯
X
~
L
]
T. The received signal by the user at the mth receiving antenna at time i is expressed in (9), and the maximum likelihood (ML) estimate X
~ is given by (10).


## 2.1. Conventional MIMO System

Consider a wireless communication system withN
t transmit and N
r receive antennas as shown in Figure 1. Assume that path gains between individual antenna pairs are independent and identically distributed (i.i.d.) Rayleigh-faded. This means that the maximal diversity gain is N
t
N
r which is equivalent to the total number of fading paths in the MIMO channel.Figure 1
Basic MIMO system.The output of the system can be expressed as(1)
Y
=
E
x
N
o
N
t
H
X
C
+
N
,
where Y
∈
C
N
r
×
T is the matrix of received signals over “T” time slots, H
∈
C
N
r
×
N
t is the channel coefficients matrix whose elements are independent and identically distributed (i.i.d) complex Gaussian random variables (with zero mean and unit variance) given by(2)
H
=
[
h
11
h
12
⋯
h
1
N
t
h
21
h
22
⋯
h
2
N
t
⋮
⋮
⋮
⋮
h
N
r
1
h
N
r
2
⋯
h
N
r
N
t
]
,
and E
x is the energy per symbol at each transmit antenna. The parameter X
C
∈
C
N
t
×
T denote the space time code matrix, while N
∈
C
N
r
×
T is the Gaussian noise matrix (with i.i.d. zero mean and unit variance complex Gaussian elements).


## 2.2. Lossy Channel Model

In this work, we assume a lossy channel in which losses are introduced in the channel transfer matrixH as follows:
(3)
H
⊙
D
=
[
h
11
h
12
⋯
h
1
N
t
h
21
h
22
⋯
h
2
N
t
⋮
⋮
⋮
⋮
h
N
r
1
h
N
r
2
⋯
h
N
r
N
t
]
⊙
[
d
11
d
12
⋯
d
1
N
t
d
21
d
22
⋯
d
2
N
t
⋮
⋮
⋮
⋮
d
N
r
1
d
N
r
2
⋯
d
N
r
N
t
]
,
where D
∈
C
N
r
×
N
t is a matrix of random binary numbers representing losses experienced during transmission (i.e., the dropped links, where zeros represent losses and ones represent lossless links), and ⊙ denotes the elementwise multiplication operation (Hadamard product). Losses may occur when some transmitted symbols are dropped, especially in high volume downloading through broadcasting over noisy wireless networks, or when some transmitter components, such as antenna elements, fail to work. Furthermore, interference from all other transmit antenna elements is considered at the receiver.


## 2.3. Sequential Rateless STBC

The purpose of this subsection is to introduce the mechanism of RSTBC as depicted by the block diagram in Figure2. In this system, each message is encoded into a codeword of L blocks in which each block takes T channel use where T is sufficiently large and the channel coherence time remains constant for the entire codeword length (i.e., up to L blocks) [16]. Then, the system input-output relationship is expressed as
(4)
[
Y
1
Y
2
⋯
Y
L
]
=
E
x
L
N
t
N
o
(
H
⊙
D
)
×
[
X
1
X
2
⋯
X
L
]
+
[
N
1
N
2
⋯
N
L
]
,
where X
l
∈
C
N
t
×
T (l
=
1
,
…
,
L) is the codeword matrix transmitted during the lth block, H
∈
C
N
r
×
N
t is the channel transfer matrix, N
l
∈
C
N
r
×
T is a noise matrix with i.i.d. zero mean and unit variance complex Gaussian elements, and Y
l
∈
C
N
r
×
T is the output signals matrix. The conventional space time codeword matrix X
C is encoded into a rateless ST codeword matrix [
X
1
X
2
⋯
X
L
], where X
l, for example, when T
=
2, can be constructed as
(5)
X
l
=
[
x
1
x
2
*
x
2
-
x
1
*
⋮
⋮
x
N
t
-
1
x
N
t
*
x
N
t
-
x
N
t
-
1
*
]
.
A power constraint on X
l is introduced as
(6)
E
[
1
T
∥
X
l
∥
F
2
]
≤
N
t
for
l
=
1
,
…
,
L
,
where E
[
·
] denotes the expected value.Figure 2
Sequential rateless space time block coded MIMO system.At the receiving end, it is desired to decode a transmitted message of mutual informationS with the codeword [
X
1
X
2
⋯
X
l
]. Let I denote the mutual information after receiving the codeword block X
l. If I
<
S, the receiver remains silent and waits for the next block. This process continues until the receiver collects the sufficient number of blocks that is required to recover the message. When I
≥
S after the lth block, the receiver decodes the received codeword [
X
~
1
X
~
2
⋯
X
~
l
] and sends one-bit feedback to the transmitter to stop transmitting the remaining part of the current codeword and start transmitting the next message immediately [16]. For the MIMO channel model considered in Figure 2, which we call the lossy channel, the decoding process is conducted sequentially, first using X
~
1, then [
X
~
1
X
~
2
] if X
~
1 is not sufficient, and so forth. As a result, to achieve high efficiency, sequential RSTBC requires large delays. Since many applications are more sensitive to delay characteristics, we develop fast RSTBC for massive MIMO channels as described in the following subsection.


## 2.4. Rateless STBC for Massive SU-MIMO System

In this subsection, we present RSTBC in massive single-user MIMO (SU-MIMO) systems. As we have explained, in the rateless coding concept discussed earlier, the codewords{
X
l
}, l
=
1,2
,
…
,
L, are transmitted through different channels that are orthogonal in time. Therefore, sequential RSTBC requires time delay to achieve reliability of the transmission. This delay constraint disallows coding over a large number of blocks. Fortunately, with massive MIMO configurations, in which a lot of antennas are used, the large number of antenna elements available can be exploited to overcome this problem. This can be accomplished by transmitting the entire rateless codeword [
X
1
X
2
⋯
X
L
] simultaneously through different antenna elements. Thus, fast and reliable transmission is achieved.Now, we consider a downlink massive SU-MIMO shown in Figure3. In this scenario, a base station transmitter (BSTx) is equipped with a large number of antennas. We assume that the user is equipped with N
r receiving antennas. The channel is assumed to have lossy characteristics. The input-output relationship can be expressed as
(7)
U
=
E
x
L
N
t
N
o
(
H
⊙
D
)
X
+
N
.
In this equation, U
∈
C
N
r
×
T is the output matrix;  X
=
[
X
1
⋯
X
L
]
T
∈
C
L
N
t
×
T is the codeword transmitted matrix;  N
∈
C
N
r
×
T is the noise matrix; H
∈
C
N
r
×
L
N
t is the channel transfer matrix; and D
∈
C
N
r
×
L
N
t is a matrix of random binary numbers representing losses experienced during transmission (i.e., the dropped links, where zeros represent losses and ones represent reception), and each element in  D at time i is denoted by d
m
n
i (where m
=
1,2
,
…
,
N
r and n
=
1,2
,
…
,
L
N
t). We impose a power constraint on X so that
(8)
E
[
1
T
∥
X
∥
F
2
]
≤
L
N
t
.Figure 3
Rateless space time block code for single-user massive MIMO system.The block diagram in Figure3 depicts the system of (7) in which the BSTx contains large number of antenna elements which are grouped into L groups (each group contains N
t transmit antennas) and the rateless codeword X  is transmitted through L
N
t transmit antennas over T time slots. The user receiver contains N
r receive antennas, where L
N
t
>
N
r so that the system is considered as L
N
t
×
N
r massive SU-MIMO system. The number of antennas selected to transmit X depends on the number of blocks used in rateless coding.To illustrate how the system shown in Figure3 works, at the BSTx, first, the encoder generates L redundant blocks X
=
[
X
1
⋯
X
L
]
T, and then L antenna groups (each of N
t antenna elements) are selected to transmit X simultaneously using a total of L
N
t transmit antennas through lossy channel H. The number of blocks that need to be collected by the user depends on channel conditions; that is, a more lossy channel needs more redundant blocks. Once the underlying message is decoded completely, a feedback is sent from the user to the BSTx to terminate the current transmission and then move on to transmit the next message. Otherwise, the receiver waits for another return of transmission where the number of blocks L is increased and, consequently, the number of selected groups is increased. As we stated before, the BSTx is equipped with a very large number of antennas perhaps hundreds or thousands, so the process continues until a reliable reception is achieved. The receiver collects as many redundancy blocks as needed to decode the message and corresponding received matrix U is used to estimate the transmitted codeword as X
~
=
[
X
~
1
⋯
X
~
L
]
T. The received signal by the user at the mth receiving antenna at time i is expressed in (9), and the maximum likelihood (ML) estimate X
~ is given by (10).


## 3. Performance Limits and Design Criterion

In this section, we discuss the performance of rateless codes employed in massive MIMO systems and provide limits on the rates and reliability achieved. In addition, design criterion of rateless codes is briefly described.


### 3.1. Probability of Error Performance

Consider the system depicted in Figure3, if L blocks are used at the BSTx; then the received signal by the user at the mth receiving antenna at time i can be expressed as
(9)
u
m
i
=
E
x
L
N
t
N
o
∑
n
=
1
L
N
t
h
m
n
i
d
m
n
i
x
n
i
+
n
m
i
,
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
m
=
1,2
,
…
,
N
r
.
At time i, x
n
i is the signal transmitted by the nth antenna where n
=
1,2
,
…
,
L
N
t; h
m
n
i is the channel coefficient from a transmitting antenna n to a receiving antenna m; and n
m
i is the noise at the mth receiving antenna. Also, losses are introduced by d
m
n
i
∈
{
0,1
} where d
m
n
i
=
0 when there is a loss, and d
m
n
i
=
1 when there is no loss. Throughout this analysis, flat Rayleigh fading channel coefficients are assumed.For decoding, a maximum likelihood (ML) estimate of the transmitted codewordX
~ is computed as
(10)
X
~
=
arg
min
⁡
X
⁡
∥
U
-
E
x
L
N
o
N
t
(
H
⊙
D
)
X
∥
F
2
,
where ∥
·
∥
F
2 denotes the squared Frobenius norm. The conditional probability of transmitting the codeword X and deciding erroneously in favor of X
~ at the decoder is the pairwise error probability (PWEP) given by
(11)
P
⁡
(
X
⟶
X
~
∣
H
)
≤
Q
(
E
x
2
L
N
t
N
o
d
E
2
(
X
,
X
~
)
)
,
where Q denotes the Q function and d
E
2
(
X
,
X
~
) denotes the Euclidean distance between the transmitted rateless space time codeword matrix X and the erroneously received codeword matrix X
~ can be expressed as
(12)
d
E
2
(
X
,
X
~
)
=
∥
(
H
⊙
D
)
(
X
-
X
~
)
∥
F
2
=
∑
i
=
1
T
∑
m
=
1
N
r
|
∑
n
=
1
L
N
t
h
m
n
i
d
m
n
i
(
x
n
i
-
x
~
n
i
)
|
2
.
Invoking the Chernoff bound, Q
(
x
)
≤
(
1
/
2
)
e
-
(
x
2
/
2
), the PWEP in (11) is upper-bounded as
(13)
P
⁡
(
X
⟶
X
~
∣
H
)
≤
1
2
exp
⁡
⁡
(
-
E
x
4
L
N
t
N
o
∥
(
H
⊙
D
)
(
X
-
X
~
)
∥
F
2
)
.Let us define a codeword difference matrixB
=
X
-
X
~ and an L
N
t
×
L
N
t codeword distance matrix A
=
B
·
B
H. Then we can use the singular value decomposition (SVD) theorem to obtain
(14)
A
=
V
H
·
Λ
·
V
,
where (
·
)
H denotes the Hermitian transpose of a matrix; V is a unitary matrix with orthogonal eigenvector columns, and Λ is a diagonal matrix of eigenvalues {
λ
n
}
n
=
1
L
N
t. By assuming slow Rayleigh fading channel, the channel gains do not change during T symbol periods, and hence the time index i can be omitted. If we denote the (m
,
n)th element of H
V by Ω
m
n, then the Euclidean distance can be rewritten as
(15)
∥
(
H
⊙
D
)
B
∥
F
2
=
∑
m
=
1
N
r
∑
n
=
1
L
N
t
λ
n
d
m
n
|
Ω
m
n
|
2
.
From (15), it is easy to observe that when there are losses (due to broken links for example), the Euclidean distance becomes smaller compared to the case without losses since d
m
n
=
0 when there is a loss, and d
m
n
=
1 when there is no loss. Consequently, the PWEP expression in (13) becomes large as the loss rate increases. To compensate for this loss, rateless code is applied by using L redundant blocks. Thus, the expression in (15) becomes large as L increases, thereby enhancing the PWEP performance.


### 3.2. Rate and Reliability Performance

For our proposed scheme, we next examine the rate and reliability achieved which promotes better insight into the performance of the system. For conventional systems, letR denote the average number of bits transmitted per channel use, while r denotes the normalized (with respect to SNR) rate expressed as [19]
(16)
r
=
lim
⁡
SNR
→
∞
R
log
⁡
2
⁡
(
SNR
)
.
Here, the parameter r is also referred to as the spatial-multiplexing gain [20]. For a given r, let the probability of error be denoted as P
e
(
r
); then the diversity gain d
(
r
) which is a measure of the system reliability achieved can be obtained as [19]
(17)
d
(
r
)
=
-
lim
⁡
SNR
→
∞
⁡
log
⁡
2
⁡
P
e
(
r
)
log
⁡
2
⁡
(
SNR
)
.Now, for rateless coding withL blocks, the maximum possible value of the diversity gain d
*
(
r
) at each r is given by [16, 17]
(18)
d
*
(
r
)
=
f
(
r
L
)
,
0
≤
r
≤
min
⁡
{
L
N
t
,
N
r
}
,
where f
(
·
) is the piecewise linear function joining the points (
k
,
(
L
N
t
-
k
)
(
N
r
-
k
)
) for integral k
=
0
,
…
,
min
⁡
{
L
N
t
,
N
r
}. Equation (18) is based on the tradeoff between the diversity and spatial-multiplexing gains (DMG), developed by Zheng and Tse in [19], and gives a type of the diversity-multiplexing-delay (DMD) tradeoff introduced in [17]. This type of tradeoff between diversity and multiplexing gains is a function of the maximum number of blocks L used in rateless coding to recover the original message. In addition, for sequential RSTBC, the maximum delay is L
T transmission slots before being able to decode the transmitted message, while massive MIMO system depicted in Figure 3 utilizes the maximum number of transmit antennas as L
N
t over T time slots.Next, letR
l be the expected value of the realized rate (in bits per channel use) for each transmitted rateless codeword X
l; then R
l can be expressed as
(19)
R
l
=
L
l
R
,
l
=
1,2
,
…
,
L
.
Thus, compared with conventional coding schemes that have rate R, the rateless code achieves multiple rate levels (
R
,
(
L
/
(
L
-
1
)
)
R
,
(
L
/
(
L
-
2
)
)
R
,
…
,
L
R
). In doing so, the effective multiplexing gain of the system can be expressed as [16]
(20)
r
e
=
lim
⁡
SNR
→
∞
⁡
R
l
log
⁡
2
⁡
(
SNR
)
.
As a result, rateless codes also have multiple multiplexing gains as well. The diversity-multiplexing tradeoff (DMT) can then be used to analyze the systems performance for all possible transmission rates, providing performance limits for rateless codes.


### 3.3. Design Criterion for Rateless Codes

Generally speaking, rank criterion and determinant criterion are two different criteria for space time code design [2, 3]. The classical code design criterion for the i.i.d. Rayleigh fading channel is the determinant criterion. However, the code design criterion for rateless codes is quite different from the determinant criterion, even though this criterion is also somewhat involved. It was shown in [16] that the design of rateless codes for MIMO channels follows the principle of approximately universal codes introduced in [21]. The approximately universal criterion ensures that the highest error event probability decays exponentially with SNR given any fading channel. This can be ignored when decoding any lth subset codeword {
X
l
} in the set of all nonoutage events.


## 3.1. Probability of Error Performance

Consider the system depicted in Figure3, if L blocks are used at the BSTx; then the received signal by the user at the mth receiving antenna at time i can be expressed as
(9)
u
m
i
=
E
x
L
N
t
N
o
∑
n
=
1
L
N
t
h
m
n
i
d
m
n
i
x
n
i
+
n
m
i
,
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
m
=
1,2
,
…
,
N
r
.
At time i, x
n
i is the signal transmitted by the nth antenna where n
=
1,2
,
…
,
L
N
t; h
m
n
i is the channel coefficient from a transmitting antenna n to a receiving antenna m; and n
m
i is the noise at the mth receiving antenna. Also, losses are introduced by d
m
n
i
∈
{
0,1
} where d
m
n
i
=
0 when there is a loss, and d
m
n
i
=
1 when there is no loss. Throughout this analysis, flat Rayleigh fading channel coefficients are assumed.For decoding, a maximum likelihood (ML) estimate of the transmitted codewordX
~ is computed as
(10)
X
~
=
arg
min
⁡
X
⁡
∥
U
-
E
x
L
N
o
N
t
(
H
⊙
D
)
X
∥
F
2
,
where ∥
·
∥
F
2 denotes the squared Frobenius norm. The conditional probability of transmitting the codeword X and deciding erroneously in favor of X
~ at the decoder is the pairwise error probability (PWEP) given by
(11)
P
⁡
(
X
⟶
X
~
∣
H
)
≤
Q
(
E
x
2
L
N
t
N
o
d
E
2
(
X
,
X
~
)
)
,
where Q denotes the Q function and d
E
2
(
X
,
X
~
) denotes the Euclidean distance between the transmitted rateless space time codeword matrix X and the erroneously received codeword matrix X
~ can be expressed as
(12)
d
E
2
(
X
,
X
~
)
=
∥
(
H
⊙
D
)
(
X
-
X
~
)
∥
F
2
=
∑
i
=
1
T
∑
m
=
1
N
r
|
∑
n
=
1
L
N
t
h
m
n
i
d
m
n
i
(
x
n
i
-
x
~
n
i
)
|
2
.
Invoking the Chernoff bound, Q
(
x
)
≤
(
1
/
2
)
e
-
(
x
2
/
2
), the PWEP in (11) is upper-bounded as
(13)
P
⁡
(
X
⟶
X
~
∣
H
)
≤
1
2
exp
⁡
⁡
(
-
E
x
4
L
N
t
N
o
∥
(
H
⊙
D
)
(
X
-
X
~
)
∥
F
2
)
.Let us define a codeword difference matrixB
=
X
-
X
~ and an L
N
t
×
L
N
t codeword distance matrix A
=
B
·
B
H. Then we can use the singular value decomposition (SVD) theorem to obtain
(14)
A
=
V
H
·
Λ
·
V
,
where (
·
)
H denotes the Hermitian transpose of a matrix; V is a unitary matrix with orthogonal eigenvector columns, and Λ is a diagonal matrix of eigenvalues {
λ
n
}
n
=
1
L
N
t. By assuming slow Rayleigh fading channel, the channel gains do not change during T symbol periods, and hence the time index i can be omitted. If we denote the (m
,
n)th element of H
V by Ω
m
n, then the Euclidean distance can be rewritten as
(15)
∥
(
H
⊙
D
)
B
∥
F
2
=
∑
m
=
1
N
r
∑
n
=
1
L
N
t
λ
n
d
m
n
|
Ω
m
n
|
2
.
From (15), it is easy to observe that when there are losses (due to broken links for example), the Euclidean distance becomes smaller compared to the case without losses since d
m
n
=
0 when there is a loss, and d
m
n
=
1 when there is no loss. Consequently, the PWEP expression in (13) becomes large as the loss rate increases. To compensate for this loss, rateless code is applied by using L redundant blocks. Thus, the expression in (15) becomes large as L increases, thereby enhancing the PWEP performance.


## 3.2. Rate and Reliability Performance

For our proposed scheme, we next examine the rate and reliability achieved which promotes better insight into the performance of the system. For conventional systems, letR denote the average number of bits transmitted per channel use, while r denotes the normalized (with respect to SNR) rate expressed as [19]
(16)
r
=
lim
⁡
SNR
→
∞
R
log
⁡
2
⁡
(
SNR
)
.
Here, the parameter r is also referred to as the spatial-multiplexing gain [20]. For a given r, let the probability of error be denoted as P
e
(
r
); then the diversity gain d
(
r
) which is a measure of the system reliability achieved can be obtained as [19]
(17)
d
(
r
)
=
-
lim
⁡
SNR
→
∞
⁡
log
⁡
2
⁡
P
e
(
r
)
log
⁡
2
⁡
(
SNR
)
.Now, for rateless coding withL blocks, the maximum possible value of the diversity gain d
*
(
r
) at each r is given by [16, 17]
(18)
d
*
(
r
)
=
f
(
r
L
)
,
0
≤
r
≤
min
⁡
{
L
N
t
,
N
r
}
,
where f
(
·
) is the piecewise linear function joining the points (
k
,
(
L
N
t
-
k
)
(
N
r
-
k
)
) for integral k
=
0
,
…
,
min
⁡
{
L
N
t
,
N
r
}. Equation (18) is based on the tradeoff between the diversity and spatial-multiplexing gains (DMG), developed by Zheng and Tse in [19], and gives a type of the diversity-multiplexing-delay (DMD) tradeoff introduced in [17]. This type of tradeoff between diversity and multiplexing gains is a function of the maximum number of blocks L used in rateless coding to recover the original message. In addition, for sequential RSTBC, the maximum delay is L
T transmission slots before being able to decode the transmitted message, while massive MIMO system depicted in Figure 3 utilizes the maximum number of transmit antennas as L
N
t over T time slots.Next, letR
l be the expected value of the realized rate (in bits per channel use) for each transmitted rateless codeword X
l; then R
l can be expressed as
(19)
R
l
=
L
l
R
,
l
=
1,2
,
…
,
L
.
Thus, compared with conventional coding schemes that have rate R, the rateless code achieves multiple rate levels (
R
,
(
L
/
(
L
-
1
)
)
R
,
(
L
/
(
L
-
2
)
)
R
,
…
,
L
R
). In doing so, the effective multiplexing gain of the system can be expressed as [16]
(20)
r
e
=
lim
⁡
SNR
→
∞
⁡
R
l
log
⁡
2
⁡
(
SNR
)
.
As a result, rateless codes also have multiple multiplexing gains as well. The diversity-multiplexing tradeoff (DMT) can then be used to analyze the systems performance for all possible transmission rates, providing performance limits for rateless codes.


## 3.3. Design Criterion for Rateless Codes

Generally speaking, rank criterion and determinant criterion are two different criteria for space time code design [2, 3]. The classical code design criterion for the i.i.d. Rayleigh fading channel is the determinant criterion. However, the code design criterion for rateless codes is quite different from the determinant criterion, even though this criterion is also somewhat involved. It was shown in [16] that the design of rateless codes for MIMO channels follows the principle of approximately universal codes introduced in [21]. The approximately universal criterion ensures that the highest error event probability decays exponentially with SNR given any fading channel. This can be ignored when decoding any lth subset codeword {
X
l
} in the set of all nonoutage events.


## 4. RSTBC for Massive Multiuser MIMO System

Consider a downlink massive multiuser MIMO (MU-MIMO) system shown in Figure4. In this scenario, a BSTx, equipped with a large number of antennas, communicates simultaneously with K independent users on the same time-frequency resources where each user devise has N
r receiving antennas. The channel is assumed to be uncorrelated and the channel state information (CSI) is known at both the transmitter and receiver. The channel matrix H can be written as
(21)
H
=
[
H
1
H
2
⋮
H
k
]
,
where H
k
∈
C
N
r
×
L
N
t, k
=
1
,
2
,
…
,
K, is the channel matrix corresponding to the kth user. In order to eliminate the effects of the multiuser interference (MUI) at the specific receiving antennas, zero forcing (ZF) precoding is applied at the BSTx with a precoding matrix G given by [22]
(22)
G
=
β
H
k
H
(
H
k
H
k
H
)
-
1
,
where (
·
)
H denotes the conjugate transpose and β is a normalized factor given by
(23)
β
=
L
N
t
tr
⁡
[
(
H
k
H
k
H
)
-
1
]
,
where tr
⁡
[
·
] denotes the trace of a matrix.Figure 4
Rateless space time block code for massive multiuser MIMO system.LetX
∈
C
K
L
N
t
×
T represents the RSTBC matrix constructed at the BSTx for all users over “T” time slots. After the transmitter precoding operations, the resulting transmitted matrix S
∈
C
L
N
t
×
T can be written as
(24)
S
=
G
X
,
where G
∈
C
L
N
t
×
K
L
N
t is the precoding matrix expressed in (22). The received matrix Y
∈
C
K
N
r
×
T may be written as
(25)
Y
=
E
x
L
N
t
N
o
(
H
⊙
D
)
S
+
W
,
where S
∈
C
L
N
t
×
T is the codeword transmitted matrix; W
∈
C
K
N
r
×
T is the noise matrix; H
∈
C
K
N
r
×
L
N
t is the channel transfer matrix; and D
∈
C
K
N
r
×
L
N
t is a matrix of random binary numbers representing losses experienced during transmission as stated earlier. Figure 4 depicts RSTBC employed in massive MU-MIMO system.Now, let the notations
k
m indicates the transmitted symbol to the kth user, and the symbol is precoded at the BSTx such that the fading-free data is received at the mth antenna of the user, m
=
1
,
2
,
…
,
N
r; then the received symbol by the kth user can be described as
(26)
y
k
=
{
β
s
k
j
+
w
k
j
,
if
j
=
m
,
v
k
j
+
w
k
j
,
if
j
≠
m
,
where w
k
j denotes the Gaussian noise for the kth user at the jth receiving antenna, and v
k
j
=
∑
n
L
N
t
h
k
j
n
s
^, j
≠
m, is the effect of channel fading and multiuser interference. For user k, the ML detection operation can be expressed as
(27)
S
~
k
j
=
arg
min
⁡
S
⁡
∥
1
β
Y
k
-
S
k
j
∥
F
2
⁡
,
where S
~
k
j is the estimated matrix at the jth antenna of the kth user.Although, we used precoding to cancel the interference, lossy channel disallows perfect interference cancellation. Therefore, MUI cannot be completely eliminated whenever lossy links are encountered in the data transmission, and hence this should be considered in massive MIMO systems. When losses occur, the precoding matrix expressed in (22) will be affected. Consequently, Euclidian distance given by (27) will be smaller compared to the case without losses, and then the performance of the system degrades. Introducing losses effects in (26), the received symbol by the kth user can now be rewritten as
(28)
y
k
=
{
β
s
k
j
+
w
k
j
+
z
k
j
,
if
j
=
m
,
∑
n
L
N
t
h
k
j
n
s
^
+
w
k
j
,
if
j
≠
m
,
where z
k
j represents the residual interference caused by the lossy channel for the kth user at the jth receiving antenna, due to the fact that the precoding matrix at BSTx is unable to perfectly remove MUI in a lossy link (since the losses in transmission are unknown a priori to the precoder at the BSTx). We show later by simulation that RSTBC with a large number of blocks can adequately combat the effect of this interference from lossy links.


## 5. Simulation Results and Discussion

In this section, we present simulation results for the bit error rate (BER) performance and the corresponding spectral efficiency (in b/s/Hz) of RSTBC utilized in MIMO scheme. In the simulations, we considered QPSK and 16-QAM modulation format. It is assumed that the fading coefficients from each transmit antenna to the receiver are mutually uncorrelated and Rayleigh-distributed. It is also assumed that the receiver has perfect knowledge of the channel. First, simulation results of sequential RSTBC depicted in Figure2 are presented in Subsection 5.1. Next, the results of RSTBC for the massive SU-MIMO system follow in Subsection 5.2. Finally, Subsection 5.3 introduces the results of RSTBC for the massive MU-MIMO system.


### 5.1. Simulation Results of Sequential RSTBC

First, to illustrate the behavior of RSTBC for various numbers of blocks, we present the BER of 2 × 2 MIMO system with QPSK modulation employing RSTBC in Figure5. The simulation results for RSTBC (with L = 1, 2, 4, and 8) in a 25%-loss rate channel are shown in comparison with the conventional Alamouti scheme. As indicated from the figure, it is obvious that when the number of used blocks, L, in RSTBC increases, the BER performance gets better gradually due to compensation introduced by RSTBC for the losses. As a result, the original data can be recovered even when losses occurred. Additionally, it is inferred from the figure that, for each value of L, the BER approaches a fixed value at high SNR because RSTBC, with the current number of blocks, is no longer able to compensate for further losses. Therefore, it is required to increase L to achieve enhancement until all losses are eliminated. At such point in time, one can claim that a lossy channel has been made to become like the conventional system (without losses) by employing RSTBC. Figure 6 illustrates the corresponding spectral efficiency where the maximum value of 2 b/s/Hz for QPSK is achieved, as expected.Figure 5
BER of RSTBC (L = 1, 2, 4, and 8) for MIMO system with QPSK and 25%-loss rate (N
t
=
2, N
r
=
2, T
=
2).Figure 6
Spectral efficiency of RSTBC with (L = 1, 2, 4, and 8) for MIMO system with QPSK and 25%-loss rate (N
t
=
2, N
r
=
2, T
=
2).


### 5.2. Simulation Results of RSTBC for Massive SU-MIMO System

Next, we consider the massive SU-MIMO system depicted in Figure3. We have tested RSTBC for various number of blocks (L = 1, 2, 4, 8, 16, and 32) applied on various massive MIMO configurations based on the block diagram depicted in Figure 3 for 16-QAM modulation format. The channel is assumed to have a 25%-loss rate.As shown in Figure7, it is observed that, by utilizing RSTBC, a massive MIMO system with L
N
t
=
64 is able to convert a 25%-loss rate channel into an approximately lossless one, as the error floor in the BER curve vanishes at this massive antenna configuration. This is a very good result for massive antenna systems. Developers have been trying to find different ways to utilize the large degrees of freedom available in a massive MIMO system. We demonstrate in this simulation that RSTBC with L
=
32 is capable of protecting the wireless transmission system against failures in antenna elements and other losses that may arise up to 25%. The corresponding spectral efficiency is shown in Figure 8 where RSTBC approaches 4 b/s/Hz when 16-QAM is used. It is clear from the figure that RSTBC with L
=
32 effectively improves the efficiency of lossy systems. Therefore, it is shown that the proposed RSTBC, when deployed in such massive MIMO systems, exhibits a capacity-achieving characteristic and effectively combats the problem of lossy links. Table 1 illustrates the BER performance and spectral efficiency (at SNR = 4 dB) as inferred from Figures 7 and 8, respectively.Table 1
BER and spectral efficiency of RSTBC in massive SU-MIMO with 16-QAM at SNR = 4 dB and loss rate = 25%.
L
L
N
t
BER, ×10−3
Spectral efficiency, b/s/Hz
1
2
100
2.8
2
4
54
3.2
4
8
13
3.79
8
16
2.5
3.96
16
32
0.1
4
32
64
0.0008
4Figure 7
BER of RSTBC for massive SU-MIMO up toL
N
t
=
64 with 16-QAM for 25%-loss rate.Figure 8
Spectral efficiency of RSTBC for massive SU-MIMO up toL
N
t
=
64 with 16-QAM for 25%-loss rate.


### 5.3. Simulation Results of RSTBC for Massive MU-MIMO System

In this section, we present simulation results from the BER performance of RSTBC for massive MU-MIMO system described by Figure4. The BER curves are averaged over all users. In the simulation, we considered 16-QAM modulation format. Figure 9 shows the BER performance of a multiuser MIMO system employing RSTBC. In this figure, we considered 2 users, each with N
r
=
2, where the channel loss rate is 25%. The RSTBC is applied with different number of blocks (L = 1, 4, 8, 16, and 32). As shown in the figure, the BER performance gets better when the number of blocks in RSTBC increases, due to the compensation introduced. Hence, we have shown that the RSTBC can be applied to achieve transmission reliability in massive MIMO systems with lossy channels. We note also that the BER curve (for each simulation parameter L, L
N
t) is slightly degraded compared to the corresponding case in the SU-MIMO system shown in Figure 7, as expected.Figure 9
BER of RSTBC for massive MU-MIMO up toL
N
t
=
64   (K
=
2 users) with 16-QAM for 25%-loss rate.


## 5.1. Simulation Results of Sequential RSTBC

First, to illustrate the behavior of RSTBC for various numbers of blocks, we present the BER of 2 × 2 MIMO system with QPSK modulation employing RSTBC in Figure5. The simulation results for RSTBC (with L = 1, 2, 4, and 8) in a 25%-loss rate channel are shown in comparison with the conventional Alamouti scheme. As indicated from the figure, it is obvious that when the number of used blocks, L, in RSTBC increases, the BER performance gets better gradually due to compensation introduced by RSTBC for the losses. As a result, the original data can be recovered even when losses occurred. Additionally, it is inferred from the figure that, for each value of L, the BER approaches a fixed value at high SNR because RSTBC, with the current number of blocks, is no longer able to compensate for further losses. Therefore, it is required to increase L to achieve enhancement until all losses are eliminated. At such point in time, one can claim that a lossy channel has been made to become like the conventional system (without losses) by employing RSTBC. Figure 6 illustrates the corresponding spectral efficiency where the maximum value of 2 b/s/Hz for QPSK is achieved, as expected.Figure 5
BER of RSTBC (L = 1, 2, 4, and 8) for MIMO system with QPSK and 25%-loss rate (N
t
=
2, N
r
=
2, T
=
2).Figure 6
Spectral efficiency of RSTBC with (L = 1, 2, 4, and 8) for MIMO system with QPSK and 25%-loss rate (N
t
=
2, N
r
=
2, T
=
2).


## 5.2. Simulation Results of RSTBC for Massive SU-MIMO System

Next, we consider the massive SU-MIMO system depicted in Figure3. We have tested RSTBC for various number of blocks (L = 1, 2, 4, 8, 16, and 32) applied on various massive MIMO configurations based on the block diagram depicted in Figure 3 for 16-QAM modulation format. The channel is assumed to have a 25%-loss rate.As shown in Figure7, it is observed that, by utilizing RSTBC, a massive MIMO system with L
N
t
=
64 is able to convert a 25%-loss rate channel into an approximately lossless one, as the error floor in the BER curve vanishes at this massive antenna configuration. This is a very good result for massive antenna systems. Developers have been trying to find different ways to utilize the large degrees of freedom available in a massive MIMO system. We demonstrate in this simulation that RSTBC with L
=
32 is capable of protecting the wireless transmission system against failures in antenna elements and other losses that may arise up to 25%. The corresponding spectral efficiency is shown in Figure 8 where RSTBC approaches 4 b/s/Hz when 16-QAM is used. It is clear from the figure that RSTBC with L
=
32 effectively improves the efficiency of lossy systems. Therefore, it is shown that the proposed RSTBC, when deployed in such massive MIMO systems, exhibits a capacity-achieving characteristic and effectively combats the problem of lossy links. Table 1 illustrates the BER performance and spectral efficiency (at SNR = 4 dB) as inferred from Figures 7 and 8, respectively.Table 1
BER and spectral efficiency of RSTBC in massive SU-MIMO with 16-QAM at SNR = 4 dB and loss rate = 25%.
L
L
N
t
BER, ×10−3
Spectral efficiency, b/s/Hz
1
2
100
2.8
2
4
54
3.2
4
8
13
3.79
8
16
2.5
3.96
16
32
0.1
4
32
64
0.0008
4Figure 7
BER of RSTBC for massive SU-MIMO up toL
N
t
=
64 with 16-QAM for 25%-loss rate.Figure 8
Spectral efficiency of RSTBC for massive SU-MIMO up toL
N
t
=
64 with 16-QAM for 25%-loss rate.


## 5.3. Simulation Results of RSTBC for Massive MU-MIMO System

In this section, we present simulation results from the BER performance of RSTBC for massive MU-MIMO system described by Figure4. The BER curves are averaged over all users. In the simulation, we considered 16-QAM modulation format. Figure 9 shows the BER performance of a multiuser MIMO system employing RSTBC. In this figure, we considered 2 users, each with N
r
=
2, where the channel loss rate is 25%. The RSTBC is applied with different number of blocks (L = 1, 4, 8, 16, and 32). As shown in the figure, the BER performance gets better when the number of blocks in RSTBC increases, due to the compensation introduced. Hence, we have shown that the RSTBC can be applied to achieve transmission reliability in massive MIMO systems with lossy channels. We note also that the BER curve (for each simulation parameter L, L
N
t) is slightly degraded compared to the corresponding case in the SU-MIMO system shown in Figure 7, as expected.Figure 9
BER of RSTBC for massive MU-MIMO up toL
N
t
=
64   (K
=
2 users) with 16-QAM for 25%-loss rate.


## 6. Conclusion

This work proposed the use of rateless space time block code (RSTBC) in massive MIMO systems and examined the BER performance and spectral efficiency of the scheme. Massive MIMO systems employ large numbers of antenna elements. Therefore, it is probable that when deployed practically on base stations, frequent cases of antenna element failure may arise resulting in a lossy channel model. A rateless space time code can be used to protect data transmission in such situations and still guarantee the reliability of the system. We conclude that it is possible to recover the original data from a certain amount of encoded data even when the losses are up to 25%, using RSTBC with very large MIMO dimensions.



---

*Source: 154261-2014-08-03.xml*