Sorry, you need to enable JavaScript to visit this website.

In this short note we propose a new approach for the design and analysis of randomized gossip algorithms which can be used to solve the average consensus problem. We show how the Randomized Block Kaczmarz (RBK) method—a method for solving linear systems—works as gossip algorithm when applied to a special system encoding the underlying network. The famous pairwise gossip algorithm arises as a special case.

In this short note we propose a new approach for the design and analysis of randomized gossip algorithms which can be used to solve the average consensus problem. We show how the Randomized Block Kaczmarz (RBK) method—a method for solving linear systems—works as gossip algorithm when applied to a special system encoding the underlying network. The famous pairwise gossip algorithm arises as a special case.

In this short note we propose a new approach for the design and analysis of randomized gossip algorithms which can be used to solve the average consensus problem. We show how the Randomized Block Kaczmarz (RBK) method—a method for solving linear systems—works as gossip algorithm when applied to a special system encoding the underlying network. The famous pairwise gossip algorithm arises as a special case.

In this paper, we study mixing sequences of modulated wideband converters (MWC). The MWC is a sub-Nyquist sampling system which mixes an input analog signal by multiple numbers of fast mixing sequences in parallel. When the mixing sequences are random cyclic shifts of a base sequence for a memory efficiency, the system turns into random partial Fourier structured MWC (RPFMWC). In RPFMWC, the spectrum distribution of a base sequence is important in reconstruction of the input signal.

In this paper, we address the problem of robust adaptive beamforming of signals received by a linear array. The challenge associated with the beamforming problem is twofold. Firstly, the process requires the inversion of the usually ill-conditioned covariance matrix of the received signals. Secondly, the steering vector pertaining to the direction of arrival of the signal of interest is not known precisely. To tackle these two challenges, the standard capon beamformer is manipulated to a form where the beamformer output is obtained as a scaled version of the inner product of two vectors.

In this paper, we propose an iterative algorithm based on hard thresholding
for demixing a pair of signals from nonlinear observations of
their superposition. We focus on the under-determined case where
the number of available observations is far less than the ambient dimension
of the signals. We derive nearly-tight upper bounds on the
sample complexity of the algorithm to achieve stable recovery of the
component signals. Moreover, we show that the algorithm enjoys
a linear convergence rate. We provide a range of simulations to illustrate

In this paper, three sparse models for the human auditory system are proposed. Biological studies shows that the haircells in the inner ear of the auditory system generate sparse codes from the output of cochlea filterbank. Here, we employ two mathematical sparse representation methods, which are Orthogonal Matching Pursuit (OMP) and K Singular Value Decomposition (K-SVD), in three different strategies for sparse representation of the output of cochlea filterbank that is modeled by a Gammatone filterbank.

We address the inter-cell interference coordination for the indoor multi-color visible light communication (VLC) network under lighting constraints. In the multi-color VLC system, soft frequency reuse-based interference coordination is adopted, which adjusts the AC powers of the cell-edge components and the cell-center components. To further improve the system throughput in the environment of dense LED deployment, we propose the dynamic scheduler for the inter-cell interference coordination.

This paper studies the achievable rate of a relay- assisted optical wireless communication channel, and presents a novel discrete signaling method by our proposed symbol-number filling algorithm. Unlike the radio frequency counterpart, the signaling is designed subject to nonnegative, peak and average power constraints, taking the input-dependent Gaussian shot noise into account. Decode and forward (DF) protocol is adopted by the relay, and is shown to outperform the direct transmission (DT) protocol.

Submodular maximization problems belong to the family of combinatorial optimization problems and enjoy wide applications. In this paper, we focus on the problem of maximizing a monotone submodular function subject to a d-knapsack constraint, for which we propose a streaming algorithm that
achieves a (1/1+2d − ε) -approximation of the optimal value,