11,825 research outputs found
Distributed Low-Rank Adaptive Algorithms Based on Alternating Optimization and Applications
This paper presents a novel distributed low-rank scheme and adaptive
algorithms for distributed estimation over wireless networks. The proposed
distributed scheme is based on a transformation that performs dimensionality
reduction at each agent of the network followed by transmission of a reduced
set of parameters to other agents and reduced-dimension parameter estimation.
Distributed low-rank joint iterative estimation algorithms based on alternating
optimization strategies are developed, which can achieve significantly reduced
communication overhead and improved performance when compared with existing
techniques. A computational complexity analysis of the proposed and existing
low-rank algorithms is presented along with an analysis of the convergence of
the proposed techniques. Simulations illustrate the performance of the proposed
strategies in applications of wireless sensor networks and smart grids.Comment: 12 figures, 13 pages. arXiv admin note: text overlap with
arXiv:1411.112
Study of Joint MSINR and Relay Selection Algorithms for Distributed Beamforming
This paper presents joint maximum signal-to-interference-plus-noise ratio
(MSINR) and relay selection algorithms for distributed beamforming. We propose
a joint MSINR and restricted greedy search relay selection (RGSRS) algorithm
with a total relay transmit power constraint that iteratively optimizes both
the beamforming weights at the relays nodes, maximizing the SINR at the
destination. Specifically, we devise a relay selection scheme that based on
greedy search and compare it to other schemes like restricted random relay
selection (RRRS) and restricted exhaustive search relay selection (RESRS). A
complexity analysis is provided and simulation results show that the proposed
joint MSINR and RGSRS algorithm achieves excellent bit error rate (BER) and
SINR performances.Comment: 7 pages, 2 figures. arXiv admin note: text overlap with
arXiv:1707.0095
Study of Robust Distributed Beamforming Based on Cross-Correlation and Subspace Projection Techniques
In this work, we present a novel robust distributed beamforming (RDB)
approach to mitigate the effects of channel errors on wireless networks
equipped with relays based on the exploitation of the cross-correlation between
the received data from the relays at the destination and the system output. The
proposed RDB method, denoted cross-correlation and subspace projection (CCSP)
RDB, considers a total relay transmit power constraint in the system and the
objective of maximizing the output signal-to-interference-plus-noise ratio
(SINR). The relay nodes are equipped with an amplify-and-forward (AF) protocol
and we assume that the channel state information (CSI) is imperfectly known at
the relays and there is no direct link between the sources and the destination.
The CCSP does not require any costly optimization procedure and simulations
show an excellent performance as compared to previously reported algorithms.Comment: 3 figures, 7 pages. arXiv admin note: text overlap with
arXiv:1707.00953
Study of Efficient Robust Adaptive Beamforming Algorithms Based on Shrinkage Techniques
This paper proposes low-complexity robust adaptive beamforming (RAB)
techniques based on shrinkage methods. We firstly briefly review a
Low-Complexity Shrinkage-Based Mismatch Estimation (LOCSME) batch algorithm to
estimate the desired signal steering vector mismatch, in which the
interference-plus-noise covariance (INC) matrix is also estimated with a
recursive matrix shrinkage method. Then we develop low complexity adaptive
robust version of the conjugate gradient (CG) algorithm to both estimate the
steering vector mismatch and update the beamforming weights. A computational
complexity study of the proposed and existing algorithms is carried out.
Simulations are conducted in local scattering scenarios and comparisons to
existing RAB techniques are provided.Comment: 9 pages, 2 figures. arXiv admin note: text overlap with
arXiv:1505.0678
Sparsity-Based STAP Design Based on Alternating Direction Method with Gain/Phase Errors
We present a novel sparsity-based space-time adaptive processing (STAP)
technique based on the alternating direction method to overcome the severe
performance degradation caused by array gain/phase (GP) errors. The proposed
algorithm reformulates the STAP problem as a joint optimization problem of the
spatio-Doppler profile and GP errors in both single and multiple snapshots, and
introduces a target detector using the reconstructed spatio-Doppler profiles.
Simulations are conducted to illustrate the benefits of the proposed algorithm.Comment: 7 figures, 1 tabl
Study of Opportunistic Cooperation Techniques using Jamming and Relays for Physical-Layer Security in Buffer-aided Relay Networks
In this paper, we investigate opportunistic relay and jammer cooperation
schemes in multiple-input multiple-output (MIMO) buffer-aided relay networks.
The network consists of one source, an arbitrary number of relay nodes,
legitimate users and eavesdroppers, with the constraints of physical layer
security. We propose an algorithm to select a set of relay nodes to enhance the
legitimate users' transmission and another set of relay nodes to perform
jamming of the eavesdroppers. With Inter-Relay interference (IRI) taken into
account, interference cancellation can be implemented to assist the
transmission of the legitimate users. Secondly, IRI can also be used to further
increase the level of harm of the jamming signal to the eavesdroppers. By
exploiting the fact that the jamming signal can be stored at the relay nodes,
we also propose a hybrid algorithm to set a signal-to-interference and noise
ratio (SINR) threshold at the node to determine the type of signal stored at
the relay node. With this separation, the signals with high SINR are delivered
to the users as conventional relay systems and the low SINR performance signals
are stored as potential jamming signals. Simulation results show that the
proposed techniques obtain a significant improvement in secrecy rate over
previously reported algorithms.Comment: 8 pages, 3 figure
Study of BEM-Type Channel Estimation Techniques for 5G Multicarrier Systems
In this paper, we investigate channel estimation techniques for 5G
multicarrier systems. Due to the characteristics of the 5G application
scenarios, channel estimation techniques have been tested in Orthogonal
Frequency Division Multiplexing (OFDM) and Generalized Frequency Division
Multiplexing (GFDM) systems. The orthogonality between subcarriers in OFDM
systems permits inserting and extracting pilots without interference. However,
due to pulse shaping, subcarriers in GFDM are no longer orthogonal and
interfere with each other. Due to such interference, the channel estimation for
GFDM is not trivial. A robust and low-complexity channel estimator can be
obtained by combining a minimum mean-square error (MMSE) regularization and the
basis expansion model (BEM) approach. In this work, we develop a BEM-type
channel estimator along with a strategy to obtain the covariance matrix of the
BEM coefficients. Simulations show that the BEM-type channel estimation shows
performance close to that of the linear MMSE (LMMSE), even though there is no
need to know the channel power delay profile, and its complexity is low.Comment: 2 figures, 7 page
Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniques
This work presents cost-effective low-rank techniques for designing robust
adaptive beamforming (RAB) algorithms. The proposed algorithms are based on the
exploitation of the cross-correlation between the array observation data and
the output of the beamformer. Firstly, we construct a general linear equation
considered in large dimensions whose solution yields the steering vector
mismatch. Then, we employ the idea of the full orthogonalization method (FOM),
an orthogonal Krylov subspace based method, to iteratively estimate the
steering vector mismatch in a reduced-dimensional subspace, resulting in the
proposed orthogonal Krylov subspace projection mismatch estimation (OKSPME)
method. We also devise adaptive algorithms based on stochastic gradient (SG)
and conjugate gradient (CG) techniques to update the beamforming weights with
low complexity and avoid any costly matrix inversion. The main advantages of
the proposed low-rank and mismatch estimation techniques are their
cost-effectiveness when dealing with high dimension subspaces or large sensor
arrays. Simulations results show excellent performance in terms of the output
signal-to-interference-plus-noise ratio (SINR) of the beamformer among all the
compared RAB methods.Comment: 11 figures, 12 page
Flexible Widely-Linear Multi-Branch Decision Feedback Detection Algorithms for Massive MIMO Systems
This paper presents widely-linear multi-branch decision feedback detection
techniques for large-scale multiuser multiple-antenna systems. We consider a
scenario with impairments in the radio-frequency chain in which the in-phase
(I) and quadrature (Q) components exhibit an imbalance, which degrades the
receiver performance and originates non-circular signals. A widely-linear
multi-branch decision feedback receiver is developed to mitigate both the
multiuser interference and the I/Q imbalance effects. An iterative detection
and decoding scheme with the proposed receiver and convolutional codes is also
devised. Simulation results show that the proposed techniques outperform
existing algorithms.Comment: 3 figures, 9 pages. arXiv admin note: text overlap with
arXiv:1308.272
Decentralized learning for wireless communications and networking
This chapter deals with decentralized learning algorithms for in-network
processing of graph-valued data. A generic learning problem is formulated and
recast into a separable form, which is iteratively minimized using the
alternating-direction method of multipliers (ADMM) so as to gain the desired
degree of parallelization. Without exchanging elements from the distributed
training sets and keeping inter-node communications at affordable levels, the
local (per-node) learners consent to the desired quantity inferred globally,
meaning the one obtained if the entire training data set were centrally
available. Impact of the decentralized learning framework to contemporary
wireless communications and networking tasks is illustrated through case
studies including target tracking using wireless sensor networks, unveiling
Internet traffic anomalies, power system state estimation, as well as spectrum
cartography for wireless cognitive radio networks.Comment: Contributed chapter to appear in Splitting Methods in Communication
and Imaging, Science and Engineering, R. Glowinski, S. Osher, and W. Yin,
Editors, New York, Springer, 201
- …