We Are Intechopen, The World'S Leading Publisher of Open Access Books Built by Scientists, For Scientists
We Are Intechopen, The World'S Leading Publisher of Open Access Books Built by Scientists, For Scientists
7,200
Open access books available
192,000
International authors and editors
210M Downloads
154
Countries delivered to
TOP 1%
most cited scientists
14%
Contributors from top 500 universities
Abstract
1. Introduction
In recent years, the demand for high-speed wireless communication has grown
exponentially, driven by the proliferation of smart devices, the Internet of Things
(IoT), and the increasing need for reliable and efficient data transmission [1]. To meet
these demands, multiple-input multiple-output (MIMO) technology has emerged as a
promising solution, offering significant improvements in spectral efficiency, capacity,
and reliability. In this chapter, we will explore the concept of spatial multiplexing in
MIMO communications, focusing on precoding design for both traditional small-scale
MIMO systems and massive MIMO systems.
MIMO communication systems employ multiple antennas at both the transmitter
and receiver ends to exploit the spatial domain, enabling the simultaneous transmis-
sion of multiple data streams over the same frequency band [2]. This spatial
multiplexing capability is the key factor in achieving the high data rates and improved
link reliability that MIMO systems offer. Precoding is a crucial technique in MIMO
communications, as it allows the transmitter to pre-process the signals before
1
MIMO Communications – Fundamental Theory, Propagation Channels, and Antenna Systems
Due to the increasing demand for higher data rates and reliability for wireless
networks, MIMO techniques have appeared and received extensive research attention.
To support spatial multiplexing, parallel data streams can be transmitted simulta-
neously with multiple antennas deployed at the BS. To improve reliability, space-time
coding techniques can be employed by sending copies of the same information across
the antenna array. In this section, we present an overview of the fundamental con-
cepts of multi-antenna technology, which serves as a foundation for the subsequent
discussion on precoding. Given that spatial multiplexing is the primary focus of this
chapter, our attention is primarily directed toward multi-user multi-input single-
output (MU-MISO) systems.
where yk denotes the k-th user’s received signal, hk ∈ N t 1 denotes the k-th user’s
channel vector, x ∈ N t 1 denotes the transmit signal vector, and nk denotes
the2
additive noise vector which follows the complex Gaussian distribution ℂℕ 0, σ k I
with the zero mean and σ 2k noise power. The combining process is eliminated at the
receiver side, for the single-antenna configuration. Based on (2), the transmission
process in MU-MISO can be reorganized into a matrix form, as shown below:
y ¼ Hx þ n, (3)
Figure 1.
A block diagram of MU-MISO systems.
3
MIMO Communications – Fundamental Theory, Propagation Channels, and Antenna Systems
T
with y ¼ y1 , y2 , … , yK , H ¼ ½h1 , h2 , … , hK T , and n ¼ ½n1 , n2 , … , nK T .
3.2.1 BER
Bit Error Rate (BER) refers to the proportion of erroneously transmitted bits to the
total number of transmitted bits during the transmission process and is the most
commonly used performance metric to evaluate the reliability of digital communica-
tion systems. Its mathematical definition can be given as
Ne
Pb ¼ , (4)
Nb
where N e denotes the erroneous transmitted bits, and N b denotes the total trans-
mitted bits.
where C denotes the channel capacity, and I (x; y) denotes the mutual information
between x and y. For SISO systems, when both the transmitter and receiver have
perfect Channel State Information (CSI), the channel capacity can be obtained as
C ¼ B log 2 ð1 þ γ Þ, (6)
4
Spatial Multiplexing for MIMO/Massive MIMO
DOI: http://dx.doi.org/10.5772/intechopen.112041
where B denotes the system bandwidth, and γ denotes the receive SNR. The
physical interpretation of (8) has been discussed in ref. [2].
In the context of MIMO systems, it is feasible to decompose the channel into a sum
of multiple SISO channels via singular value decomposition (SVD) [2]. Subsequently,
utilizing “water-filling” power allocation strategy [2], it is possible to harness the full
potential of the system and achieve channel capacity. In an ideal scenario where both
the transmitter and receiver possess perfect CSI, the channel capacity of an N r N t
MIMO channel can be captured precisely using the following equation:
ρ H
C ¼ log 2 det INr þ HH , (7)
Nr
specific, traditional MIMO systems equip each antenna with radio frequency (RF)
chains and high-resolution digital-to-analog converters (DACs), causing significant
power loss when the antenna array is large. In such a scenario, the advanced signal
processing mechanisms required to handle a large number of antennas for signal
transmission and reception are generally more complex, necessitating much more
energy consumption than traditional wireless communication systems. From this
perspective, hardware-efficient precoding techniques hold significant research value
and promising application prospects.
4. Traditional precoding
First, we will introduce the preliminaries of the precoding process in the downlink
MIMO system, as the basis of further discussion.
Without loss of generality, we mainly consider a downlink MU-MISO system,
where K single-antenna users are served by a common base station with N t transmit
antennas at the same time. Considering that users are generally separated spatially,
based on CSI, the BS needs to employ signal processing techniques before transmis-
sion such that the destructive effect of channel fading and inter-user interference can
be eliminated as much as possible. This is the initial motivation for precoding. Math-
ematically, the precoding process can be expressed as
K
X
x¼ wk sk ¼ Ws, (8)
k¼1
where wk ∈ N t 1 denotes the k-th user’s precoding vector and sk is the k-th
user’s data symbol, which is drawn from a specific modulation constellation. Based on
that, with the general precoding matrix W ¼ ½w1 , w2 , … , wK ∈ N t K and date sym-
bol vector s ¼ ½s1 , s2 , … , sK T ∈ K1 , the received signal for the k-th user can be
expressed as
where yk is the received signal for the k-th user, hk ∈ N t 1 is the complex channel
vector between the BS and the k-th user, and nk ℂℕð0, σ 2 Þ is the additive Gaussian
noise with zero mean and σ 2 noise power. Based on that, the transmission process can
be given as
y ¼ HWs þ n, (10)
6
Spatial Multiplexing for MIMO/Massive MIMO
DOI: http://dx.doi.org/10.5772/intechopen.112041
where y ∈ K1 denotes the received signal vector, H ∈ KN t denotes the channel
matrix, and n ∈ K1 denotes the additive noise vector.
In traditional communication systems, the presence of interference can signifi-
cantly degrade the quality of the received signal. This is particularly true in multi-user
systems, where signals for different users are superimposed over the spatial channel.
In such scenarios, the transmitted signals from different users can interfere with each
other, leading to reduced signal quality at the receiver.
The insight of precoding is to design the precoding matrix W such that the
received signal y can approach the data symbol vector s as much as possible. In the
following subsections, we will introduce linear closed-form block-level precoding,
which is a classical type of precoding.
The classical linear block-level precoding schemes have been widely used in prac-
tical engineering systems since they can ensure satisfactory communication perfor-
mance with low computational complexity. In this subsection, we will mainly discuss
the specific linear closed-form precoding, including MRT, ZF, and RZF, to show the
principle of precoding design and the physical mechanism of the precoding effect.
Specifically, the precoding matrix of MRT can be given as [4].
sffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
1 P0
WMRT ¼ HH ¼ H
HH , (11)
f MRT tr HH
rffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
trfHHH g
where f MRT ¼ P0 denotes the normalization factor to ensure the satisfaction
of the transmit power constraint, and P0 denotes the total transmit power. Consider-
ing that MRT can maximize the signal gain at the intended user, its performance is
promising in noise-limited scenarios (low SNR regimes or large-scale MIMO scenar-
ios), while its performance is limited in interference-limited scenarios.
Zero-Forcing (ZF) precoding is another classical precoding method that has been
extensively used in practical applications [8]. By employing a Moore-Penrose inverse
of the channel matrix H as the precoding matrix, ZF precoding can create an ideal
environment where each user’s effective channel is orthogonal with each other. Based
on that, inter-user interference can be eliminated as much as possible. The ZF
precoding matrix can be expressed as
vffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
1 1
u P0 1
HH HHH oHH HHH , N t ≥ K,
WZF ¼ ¼ t n (12)
u
f ZF 1
tr HHH
rffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
1
tr ðHHH Þ
where f ZF ¼ P0 denotes the normalization factor for ZF precoding. ZF
precoding is shown to achieve improved performance over MRT in the high SNR
regime. The main idea of ZF precoding is to create orthogonal effective channels
among all the users to fully eliminate inter-user interference. For its low computa-
tional complexity, ZF precoding has been widely used in practical engineering sys-
tems. However, the noise amplification effect limits its performance, especially in low
SNR regions, which has been improved by RZF precoding.
7
MIMO Communications – Fundamental Theory, Propagation Channels, and Antenna Systems
1 1
HH HHH þ α I
WRZF ¼
f RZF
v ffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
u P0 1
oHH HHH þ α I ,
¼ t n
u
1 1
tr HHH þ α I HHH HHH þ α I
(13)
rffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
1 1
tr ðHHH þαIÞ HHH ðHHH þαIÞ
where f RZF ¼ P0 denotes the normalization factor for
RZF precoding, and α denotes the regularization factor whose optimal value is
α ∗ ¼ Kσ 2 .
Compared with linear precoding, non-linear precoding can achieve better perfor-
mance by employing more sophisticated precoding techniques, at the cost of relatively
high computational complexity. Generally speaking, based on CSI and the data sym-
bol, non-linear precoding manipulates signal at the symbol level, which leads to a
better communication performance but higher processing complexity. The transmit-
ted signal of non-linear precoding is no longer a linearly weighted combination of
symbol vectors. In this subsection, we will introduce classical non-linear precoding
schemes to show their working mechanism.
Dirty Paper Coding (DPC) is able to reduce the destructive effect of inter-user
interference and further achieve channel capacity in MIMO systems [10]. However,
assuming perfect CSI and that interference information can be obtained at the trans-
mitter, the capacity-achieving DPC requires an infinite-length coding and a high-
complexity searching algorithm, which limits its application in practical systems.
Considering the high complexity of DPC, Tomlinson-Harashima Precoding
(THP) has been proposed as an alternating near-capacity scheme whose computa-
tional complexity is relatively acceptable in practice. The basic idea of THP is to pre-
distort the symbols before they are transmitted over the communication channel [11].
This pre-distortion is achieved by adding a feedback loop to the transmitting system,
which modifies the symbols based on the previous symbols that have been transmit-
ted. The feedback loop effectively cancels out the distortion introduced by the com-
munication channel, leading to a higher quality and more reliable signal at the
receiver. Figure 2 shows the architecture of the THP precoding system.
Specifically, THP first decomposes the channel matrix into
H ¼ LFH , (14)
with a lower-triangle matrix L and a unitary matrix F. Based on that, the trans-
mitted signal vector x for THP can be further expressed as
xTHP ,
xTHP ¼ F~ (15)
8
Spatial Multiplexing for MIMO/Massive MIMO
DOI: http://dx.doi.org/10.5772/intechopen.112041
Figure 2.
The geometrical representation of THP.
where x
~ can be obtained by
( )
k 1
X
~ THP k ¼ modτ sk
½x ~ THP l , ∀k ∈ f1, 2, ⋯, K g:
½Bk,l ½x (16)
l¼1
where τ denotes the modulo basis and ⌊⌋ denotes the floor approximating func-
tion. Based on the analysis above, the effective THP channel can be expressed as
B ¼ GHF, (18)
1
g k ¼ ½Gk,k ¼ : (19)
½Lk,k
At the receiver side, the scaling compensation operation and the modulo operation
are also required prior to the demodulation.
Considering that the performance of ZF precoding is mainly limited by its noise
amplification effect, the Vector- Perturbation (VP) precoding [12] has been pro-
posed as an improvement [12]. Based on the ZF precoding, VP precoding introduces a
perturbation vector to the symbol vector, resulting in a transmitted signal that aligns
better with the main eigenvector direction of the channel inverse matrix. This reduces
the noise amplification factor and further lowers the noise amplification effect of ZF.
Therefore, compared to ZF, VP can achieve significant performance gains. To be more
specific, the VP precoding process can be expressed as
1 1
HH HHH ðs þ τ lÞ,
xVP ¼ (20)
f VP
constellation point, and Δ is the minimum distance among the constellation points.
l ∈ ℂℤK1 denotes the complex integer perturbation vector, given as
1 2
l ¼ arg min HH HHH ðs þ τ lÞ ,
(21)
2
l ∈ ℂℤK1
which can be obtained by the sphere decoder. Based on that, the normalization
factor of VP precoding can be obtained by
1 1
yk ¼ hk xVP þ nk ¼ ðsk þ τlk Þ þ nk , (22)
f VP f VP
where lk denotes the k-th element of the perturbation vector l. In order to elimi-
nate the perturbation component τlk at the receiver side, the receiver needs to accom-
plish the module operation after the power compensation, as shown below:
rk ¼ modτ f VP yk
n o
¼ modτ sk þ τlk þ f VPnk (23)
^k ,
¼ sk þ f VP n
5. Optimization-based precoding
5.1.1 Preliminary
Based on the analysis above, due to the linear relationship between the transmitted
signal vector x, the symbol vector s, and the precoding matrix W, the transmitted signal
x can be regarded as a linear weighted combination of the precoding matrix W, where
the weighting coefficients are given by the symbol vector s. Therefore, the wireless
transmission process of (7) and (8) can be reformulated in the following form:
K
X K
X
yk ¼ hk wi si þ nk ¼ hk wk sk þ hk w i si þ n k , (24)
i¼1 i6¼k
where the first component denotes the expected received signal of the k-th user,
the second component denotes the interference, and the third component denotes the
additive noise. Based on that, the received SINR of the k-th user can be given as
10
Spatial Multiplexing for MIMO/Massive MIMO
DOI: http://dx.doi.org/10.5772/intechopen.112041
jhk wk j2
γ k ¼ PK 2
: (25)
2
i6¼k jhk wi j þ σ
Based on the analysis above, there are two main schemes for optimization-based
block-level precoding, as discussed in the following.
K
X
P 1 : min
wi
kwi k2F
i¼1
(26)
jhk wk j2
s:t: PK 2
≥ Γk , ∀k ∈ f1, 2, ⋯, K g
i6¼k jhk wi j þ σ2
where Γk denotes the SINR threshold for the k-th user. It is proved that P 1 is
convex which can be solved via convex optimization algorithms efficiently. In addi-
tion to conventional convex optimization algorithms, literature has revealed an
uplink-downlink duality in ref. [14], which has led to the development of an efficient
iterative algorithm for solving downlink precoding optimization. Meanwhile, after
transforming PM optimization into a semi-definite programming (SDP) problem, the
semi-definite relaxation (SDR) approach [15–17] can be used to design the precoding
matrix efficiently.
1
It is noted that in this chapter the term ‘beamforming’ and ‘precoding’ are interchangeable.
11
MIMO Communications – Fundamental Theory, Propagation Channels, and Antenna Systems
P2 : max wi min k γ k
jhk wk j2
s:t: γ k ¼ PK 2
, ∀k ∈ f1, 2, ⋯, K g (27)
2
i6¼k jhk wi j þ σ
XK
i¼1
kwi k2F ≤ P0
Figure 3.
The geometrical representation of CI and DI.
from the detection threshold of BPSK when compared to the original data symbol u.
Here Projd ðxÞ denotes the projection of vector x on the direction of d. In this situa-
tion, the interfering signal is actually constructive and contributes to the useful signal
power. Given a fixed noise power, ~y ¼ ~r þ n is more likely to be detected correctly
than the interference-free case y0 ¼ hu u þ n: Thus, we can expect improved perfor-
mance.
On the other hand, in the second case, when i < 0, as shown in Figure 3(b), the
interfering signal causes the received signal r to move closer to the detection thresh-
old. In this case, the interfering signal reduces the useful signal power and is therefore
destructive. The noiseless received signal r ¼ hu u þ hi i is more susceptible to noise
than r0 ¼ u in this scenario.
In summary, symbol-level precoding offers more precise interference management
and control, with the added benefit of improved performance through beneficial
interference. This makes it a better communication performance option compared to
traditional block-level precoding. Next, we will introduce the design principles of
symbol-level precoding by discussing classical CI-SLP precoding methods.
Figure 4.
CI-SLP, ‘phase-rotation’ metric, 8-PSK.
13
MIMO Communications – Fundamental Theory, Propagation Channels, and Antenna Systems
The SLP matrix W is designed to maximize the distance between the worst user’s
constructive region and the detection threshold, thereby improving the transmission
performance. Masouros [21] first proposed the “phase rotation” metric for PSK mod-
ulated systems. Based on this metric, the noise-free receive signal can be expressed as
follows [22]:
!
OA ¼ hTk Ws ¼ λk sk : (28)
P 3 : min ∥Ws∥2F
w
s:t:hk Ws ¼ λk sk , ∀k ∈ f1, 2, ⋯, K g (30)
h pffiffiffiffiffiffiffiffiffiffii
λℛ
k Γk σ 2 tan θt ≥ ΓIk , ∀k ∈ f1, 2, ⋯, K g,
where ΓIk denotes the Quality of Serves (QoS) threshold of the k-th user.
The convexity of P 3 can be proven, similar to the traditional PM problem, enabling
the use of several convex optimization algorithms to solve this problem conveniently.
Similarly, the CI-SLP design problem based on the SB criterion can be formulated as
P4 : max W,t t
s:t: hk Ws ¼ λk sk , ∀k ∈ f1, 2, ⋯, K g
(31)
t tan θt ≥ λIk , ∀k ∈ f1, 2, ⋯, K g
ℛ
λk
∥Ws∥2F ≤ P0 :
It is worth noting that the convexity of the equation shown above can also be
proven, which distinguishes it from the traditional SB problem and renders it more
mathematically tractable.
Figure 5.
CI-SLP, ‘symbol-scaling’ metric, 16-QAM.
imaginary parts, respectively. Group D0 represents signal points that exploit interfer-
ence in both the real and imaginary parts, resulting in full interference exploitation.
The interference exploitation procedure via the “symbol-scaling” [23] metric and
decomposition of the noiseless receive signal of the k-th user can be described as
follows:
where
ℬ T ℬ T
αk ¼ αA , sk ¼ sA
k , αk k , sk (33)
with
sA
k ¼ ℜðsk Þ, sk ¼ ℑðsk Þ, k ¼ 1, 2, … , K:
ℬ
(34)
P 5 : max W,Ωk ,t t
s:t: hTk Ws ¼ αTk sk , ∀k ∈ K
t ≤ αO O
m , ∀αm ∈ O (35)
t ¼ αIn , ∀αIn ∈ I
∥Ws∥22 ≤ p0 :
symbol in group C0 , and both the real and imaginary parts of the symbol in group A’. It
follows that O and I satisfy the following relationship:
O∪I ¼ K, O∩I ¼ ∅,
(36)
cardfOg þ cardfI g ¼ 2K:
The definitions of the sets O and I reveal the difference between the phase
rotation criterion and the symbol scaling criterion. The former exploits interference
unconditionally, i.e., all constellation points participate in interference exploitation,
while the latter exploits interference conditionally. For QAM modulation systems, the
inner constellation points do not participate in interference exploitation, and benefi-
cial interference only results in performance gains for the outer constellation points.
This difference arises from the inherent properties of QAM and PSK modulation
schemes. In PSK modulation, the amplitude of the constellation points does not carry
any information, and therefore, any constellation point can be exploited for interfer-
ence without adversely affecting the detection of other constellation points. However,
for the inner constellation points in QAM modulation, interference vectors that push
the noiseless receive signal points in any direction will adversely affect the error
decision of other constellation points. It is worth noting that these two design criteria
only differ in their description of the interference exploitation process and are essen-
tially equivalent. Li et al. [23] has proven that under PSK modulation, the symbol
scaling criterion and the phase rotation criterion are equivalent, as depicted in
Figure 4, where the symbol-scaling metric is also applicable. Therefore, the symbol
scaling criterion is more universal in this sense.
6. Hardware-efficient precoding
The use of technologies such as General Artificial Intelligence (AI), has led to a
surge in users’ demand for mobile data traffic. One way to address this issue is to
utilize massive MIMO systems, which employ a large number of antennas at the
base station to improve data rate and link reliability. This approach allows signals to
be dynamically adjusted in both horizontal and vertical directions, reducing
interference between small areas and enabling more accurate pointing toward specific
users. However, directly applying Massive MIMO technology to traditional commu-
nication system architectures can result in new problems [3]. To be more specific,
traditional MIMO systems equip each antenna with RF chains and high-resolution
DACs, causing significant power loss when the antenna array is large. To solve this
issue, there are three general approaches: reducing the number of RF chains,
lowering the resolution of the DACs, or employing power-efficient nonlinear
power amplifiers. However, these hardware-efficient architectures introduce new
challenges to precoding designs, which will be explained in more detail in the
following.
Fully-digital precoders can be used in traditional sub-6 GHz bands, but for milli-
meter wave (mmWave) communications, the cost and power consumption of hard-
ware components make this approach impractical. To solve this issue, researchers
16
Spatial Multiplexing for MIMO/Massive MIMO
DOI: http://dx.doi.org/10.5772/intechopen.112041
have developed the hybrid analog-digital structure, which provides a promising trade-
off between the cost, complexity, and capacity of the mmWave network. This struc-
ture reduces hardware complexity and power consumption by reducing the total
number of RF chains. Specifically, the mmWave transceivers first process data
streams with a low-dimension digital precoder, followed by high-dimension analog
precoding using low-cost phase shifters, switches [24], or lens [25]. While the
performance of the hybrid precoder is usually inferior to that of a fully-digital
precoder, it offers a cost-efficient and energy-efficient solution for mmWave
communication.
In an MU-MIMO system illustrated in Figure 6, N t transmit antennas are utilized
by the BS to serve K single-antenna users simultaneously. The transmitter has N tRF RF
chains, where N tRF ≪ N t . In this subsection, we use phase shifter-based hybrid archi-
tecture as an illustrative example, without loss of generality.
Based on that, the transmit symbol vector x can be expressed as
where FRF ∈ N tRF N t denotes the hybrid precoding matrix, FBB ∈ KN tRF denotes
the digital baseband precoding matrix, and s ∈ K1 denotes the data symbol vector
with ssH ¼ K1 IK , respectively. Considering that the hybrid precoding matrix is the
mathematical description of phase shifters, we have the constant-module constraint
for the hybrid precoder, as shown below:
yk ¼ hH
k FRF FBB s þ nk , (40)
where hk ∈N t 1 denotes the complex channel matrix for the k-th user, and
nk CN 0, σ 2k denotes the additive Gaussian noise vector for the k-th user with the
zero-mean and σ 2k noise power.
Aimed at maximizing the spectral efficiency, a common HAD precoding design
problem can be formulated as [26].
Figure 6.
The HAD MIMO system.
17
MIMO Communications – Fundamental Theory, Propagation Channels, and Antenna Systems
2
0 1
BB
K
X hH
k FRF f k
P 6 : max log 2 @1 þ P
B C
2 A
FRF , f BB BB
k k¼1
i6¼k hH
k FRF f i þ σ 2k
(41)
s:t: FRF ∈ ℱ, ∀1 ≤ k ≤ K,
h i 2
FRF f BB
1 , f BB
2 , … , f BB
K ¼ P0 ,
F
Figure 7.
The architecture of low-bit MIMO system.
18
Spatial Multiplexing for MIMO/Massive MIMO
DOI: http://dx.doi.org/10.5772/intechopen.112041
consumption at the BS. Furthermore, 1-bit DACs generate CE signals, which facilitate
the use of power-efficient amplifiers, further reducing hardware complexity. The
common low-bit precoding design problem can be formulated as [34].
The optimization problem P 7 seeks to minimize the MSE between transmitted and
received symbols using low-resolution DACs. For 1-bit DACs, the set of output
n qffiffiffiffiffiffi qffiffiffiffiffiffi o
P0 P0
signals is denoted as X DAC ¼ 2N t
2N t
j . In ref. [35], a non-linear precoding
method based on a biconvex relaxation framework achieved promising performance
with a low computational cost. Its corresponding VLSI design architectures were
illustrated in refs. [36]. Alternatively, Jacobsson et al. [37] proposed several 1-bit
precoding schemes based on SDR, sphere encoding, and squared l∞ -norm relaxation,
while Landau and de Lamare [38] described a 1-bit precoding method based on the
branch-and-bound framework that can theoretically achieve optimal performance.
Other downlink precoding designs for low-resolution DACs include SER minimization
in refs. [39, 40] and alternating minimization in ref. [34]. Nonlinear precoding
designs tend to outperform linear methods when low-resolution DACs are used at the
transmitter. For example, CI-based symbol-level precoding design has been discussed
in low-resolution DACs systems [41–43]. Several efficient solutions [43–45] have
been proposed for the NP-hard optimization problem, both for 1-bit and few-bit
DACs systems.
Figure 8.
The nonlinearity-aware precoding system.
where Pt denotes the maximum transmit power constraint. The problem has been
addressed through the introduction of a distortion-aware beamforming (DAB) algo-
rithm as proposed by [48]. This method adopts an iterative approach to optimize data
rate while minimizing the effect of distortions. In addition, several other precoding
strategies have been developed with a focus on accounting for nonlinearity in the
system. Specifically, Aghdam et al. [49] studied a precoding scheme that incorporates
power amplifier effects in massive MU-MIMO downlink systems and put forth a
robust algorithm to mitigate interference and nonlinearity resulting from power
amplifiers. Moreover, Zayani et al. [50] presented a power control mechanism and a
precoding scheme for SU-MISO communication systems that utilize nonlinear power
amplifiers at the base station. The proposed method maximizes the received SINR
while utilizing an iterative precoding algorithm. Finally, Jee et al. [51] optimized both
precoding and power allocation strategies jointly to maximize the achievable sum rate
of MU-MIMO systems.
7. Conclusions
Nomenclature
21
MIMO Communications – Fundamental Theory, Propagation Channels, and Antenna Systems
Author details
© 2023 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of
the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0),
which permits unrestricted use, distribution, and reproduction in any medium, provided
the original work is properly cited.
22
Spatial Multiplexing for MIMO/Massive MIMO
DOI: http://dx.doi.org/10.5772/intechopen.112041
References
[1] Andrews JG, Buzzi S, Choi W, et al. equalizers for MIMO systems: An In-
What will 5G Be? IEEE Journal on depth study of the high SNR regime.
Selected Areas in Communications. IEEE Transactions on Information
2014;32(6):1065-1082. DOI: 10.1109/ Theory. 2011;57(4):2008-2026. DOI:
JSAC.2014.2328098 10.1109/TIT.2011.2112070
23
MIMO Communications – Fundamental Theory, Propagation Channels, and Antenna Systems
[18] Wiesel A, Eldar YC, Shamai S. Linear [25] Brady J, Behdad N, Sayeed AM.
precoding via conic optimization for Beamspace MIMO for Millimeter-wave
fixed MIMO receivers. IEEE communications: System architecture,
Transactions on Signal Processing. 2005; Modeling, analysis, and measurements.
54(1):161-176. DOI: 10.1109/ IEEE Transactions on Antennas and
TSP.2005.861073 Propagation. 2013;61(7):3814-3827.
DOI: 10.1109/TAP.2013.2254442
[19] Li A, Spano D, Krivochiza J, et al. A
tutorial on interference exploitation via [26] El Ayach O, Rajagopal S, Abu-Surra S,
symbol-level precoding: Overview, et al. Spatially sparse precoding in
state-of-the-art and future directions. Millimeter wave MIMO systems.
IEEE Communications Surveys & IEEE Transactions on Wireless
Tutorials. 2020;22(2):796-839. Communications. 2014;13(3):1499-1513.
DOI: 10.1109/COMST.2020.2980570 DOI: 10.1109/TWC.2014.011714.130846
[28] Sohrabi F, Yu W. Hybrid digital and algorithm for 1-bit massive MIMO. In:
Analog beamforming Design for Large- 2017 IEEE International Conference on
Scale Antenna Arrays. IEEE Journal of Acoustics, Speech and Signal Processing
Selected Topics in Signal Processing. (ICASSP’17), 5-9 March, 2017; New
2016;10(3):501-513. DOI: 10.1109/ Orleans, LA, USA. New York: IEEE;
JSTSP.2016.2520912 2017. pp. 3464-3468. DOI: 10.1109/
ICASSP.2017.7952800
[29] Gao X, Dai L, Han S, et al. Energy-
efficient hybrid Analog and digital [36] Castañeda O, Jacobsson S, Durisi G,
precoding for mmWave MIMO systems et al. 1-bit massive MU-MIMO precoding
with large antenna arrays. IEEE Journal in VLSI. IEEE Journal on Emerging and
on Selected Areas in Communications. Selected Topics in Circuits and Systems.
2016;34(4):998-1009. DOI: 10.1109/ 2017;7(4):508-522. DOI: 10.1109/
JSAC.2016.2549418 JETCAS.2017.2772191
[30] Liang L, Xu W, Dong X. Low-
complexity hybrid precoding in massive [37] Jacobsson S, Durisi G, Coldrey M,
multiuser MIMO systems. IEEE Wireless et al. Quantized precoding for massive
Communications Letters. 2014;3(6): MU-MIMO. IEEE Transactions on
653-656. DOI: 10.1109/LWC.2014. Communications. 2017;65(11):
2363831 4670-4684. DOI: 10.1109/TCOMM.
2017.2723000
[31] Li A, Masouros C. Hybrid Analog-
digital Millimeter-wave MU-MIMO [38] Landau LTN, de Lamare RC. Branch-
transmission with virtual path selection. and-bound precoding for multiuser
IEEE Communications Letters. 2016; MIMO systems with 1-bit quantization.
21(2):438-441. DOI: 10.1109/LCOMM. IEEE Wireless Communications Letters.
2016.2621741 2017;6(6):770-773. DOI: 10.1109/
LWC.2017.2740386
[32] Li A, Masouros C. Hybrid precoding
and combining Design for Millimeter- [39] Swindlehurst A, Saxena A,
Wave Multi-User MIMO based on SVD. Mezghani A, et al. Minimum probability-
In: 2017 IEEE International Conference on of-error perturbation precoding for the
Communications (ICC’17), 21-25 May one-bit massive MIMO downlink. In:
2017; Paris. New York: IEEE; 2017. pp. 1-6. 2017 IEEE International Conference on
DOI: 10.1109/ICC.2017.7996970 Acoustics, Speech and Signal Processing
(ICASSP’17), 5-9 March, 2017; New
[33] Allen PE, Dobkin R, Holberg DR. Orleans, LA, USA. New York: IEEE;
CMOS Analog Circuit Design. 2017. pp. 6483-6487. DOI: 10.1109/
Amsterdam: Elsevier; 2011 ICASSP.2017.7953405