5,364 research outputs found
Sparse Signal Processing Concepts for Efficient 5G System Design
As it becomes increasingly apparent that 4G will not be able to meet the
emerging demands of future mobile communication systems, the question what
could make up a 5G system, what are the crucial challenges and what are the key
drivers is part of intensive, ongoing discussions. Partly due to the advent of
compressive sensing, methods that can optimally exploit sparsity in signals
have received tremendous attention in recent years. In this paper we will
describe a variety of scenarios in which signal sparsity arises naturally in 5G
wireless systems. Signal sparsity and the associated rich collection of tools
and algorithms will thus be a viable source for innovation in 5G wireless
system design. We will discribe applications of this sparse signal processing
paradigm in MIMO random access, cloud radio access networks, compressive
channel-source network coding, and embedded security. We will also emphasize
important open problem that may arise in 5G system design, for which sparsity
will potentially play a key role in their solution.Comment: 18 pages, 5 figures, accepted for publication in IEEE Acces
Directional Modulation via Symbol-Level Precoding: A Way to Enhance Security
Wireless communication provides a wide coverage at the cost of exposing
information to unintended users. As an information-theoretic paradigm, secrecy
rate derives bounds for secure transmission when the channel to the
eavesdropper is known. However, such bounds are shown to be restrictive in
practice and may require exploitation of specialized coding schemes. In this
paper, we employ the concept of directional modulation and follow a signal
processing approach to enhance the security of multi-user MIMO communication
systems when a multi-antenna eavesdropper is present. Enhancing the security is
accomplished by increasing the symbol error rate at the eavesdropper. Unlike
the information-theoretic secrecy rate paradigm, we assume that the legitimate
transmitter is not aware of its channel to the eavesdropper, which is a more
realistic assumption. We examine the applicability of MIMO receiving algorithms
at the eavesdropper. Using the channel knowledge and the intended symbols for
the users, we design security enhancing symbol-level precoders for different
transmitter and eavesdropper antenna configurations. We transform each design
problem to a linearly constrained quadratic program and propose two solutions,
namely the iterative algorithm and one based on non-negative least squares, at
each scenario for a computationally-efficient modulation. Simulation results
verify the analysis and show that the designed precoders outperform the
benchmark scheme in terms of both power efficiency and security enhancement.Comment: This manuscript is submitted to IEEE Journal of Selected Topics in
Signal Processin
Exploiting Amplitude Control in Intelligent Reflecting Surface Aided Wireless Communication with Imperfect CSI
Intelligent reflecting surface (IRS) is a promising new paradigm to achieve
high spectral and energy efficiency for future wireless networks by
reconfiguring the wireless signal propagation via passive reflection. To reap
the potential gains of IRS, channel state information (CSI) is essential,
whereas channel estimation errors are inevitable in practice due to limited
channel training resources. In this paper, in order to optimize the performance
of IRS-aided multiuser systems with imperfect CSI, we propose to jointly design
the active transmit precoding at the access point (AP) and passive reflection
coefficients of IRS, each consisting of not only the conventional phase shift
and also the newly exploited amplitude variation. First, the achievable rate of
each user is derived assuming a practical IRS channel estimation method, which
shows that the interference due to CSI errors is intricately related to the AP
transmit precoders, the channel training power and the IRS reflection
coefficients during both channel training and data transmission. Then, for the
single-user case, by combining the benefits of the penalty method, Dinkelbach
method and block successive upper-bound minimization (BSUM) method, a new
penalized Dinkelbach-BSUM algorithm is proposed to optimize the IRS reflection
coefficients for maximizing the achievable data transmission rate subjected to
CSI errors; while for the multiuser case, a new penalty dual decomposition
(PDD)-based algorithm is proposed to maximize the users' weighted sum-rate.
Simulation results are presented to validate the effectiveness of our proposed
algorithms as compared to benchmark schemes. In particular, useful insights are
drawn to characterize the effect of IRS reflection amplitude control
(with/without the conventional phase shift) on the system performance under
imperfect CSI.Comment: 15 pages, 10 figures, accepted by IEEE Transactions on Communication
Matrix-Monotonic Optimization for MIMO Systems
For MIMO systems, due to the deployment of multiple antennas at both the
transmitter and the receiver, the design variables e.g., precoders, equalizers,
training sequences, etc. are usually matrices. It is well known that matrix
operations are usually more complicated compared to their vector counterparts.
In order to overcome the high complexity resulting from matrix variables, in
this paper we investigate a class of elegant multi-objective optimization
problems, namely matrix-monotonic optimization problems (MMOPs). In our work,
various representative MIMO optimization problems are unified into a framework
of matrix-monotonic optimization, which includes linear transceiver design,
nonlinear transceiver design, training sequence design, radar waveform
optimization, the corresponding robust design and so on as its special cases.
Then exploiting the framework of matrix-monotonic optimization the optimal
structures of the considered matrix variables can be derived first. Based on
the optimal structure, the matrix-variate optimization problems can be greatly
simplified into the ones with only vector variables. In particular, the
dimension of the new vector variable is equal to the minimum number of columns
and rows of the original matrix variable. Finally, we also extend our work to
some more general cases with multiple matrix variables.Comment: 37 Pages, 5 figures, IEEE Transactions on Signal Processing, Final
Versio
- …