6,965 research outputs found
A greedy algorithm with learned statistics for sparse signal reconstruction
We address the problem of sparse signal reconstruction from a few noisy samples. Recently, a Covariance-Assisted Matching Pursuit (CAMP) algorithm has been proposed, improving the sparse coefficient update step of the classic Orthogonal Matching Pursuit (OMP) algorithm. CAMP allows the a-priori mean and covariance of the non-zero coefficients to be considered in the coefficient update step. In this paper, we analyze CAMP, which leads to a new interpretation of the update step as a maximum-a-posteriori (MAP) estimation of the non-zero coefficients at each step. We then propose to leverage this idea, by finding a MAP estimate of the sparse reconstruction problem, in a greedy OMP-like way. Our approach allows the statistical dependencies between sparse coefficients to be modelled, while keeping the practicality of OMP. Experiments show improved performance when reconstructing the signal from a few noisy samples
Compressive Identification of Active OFDM Subcarriers in Presence of Timing Offset
In this paper we study the problem of identifying active subcarriers in an
OFDM signal from compressive measurements sampled at sub-Nyquist rate. The
problem is of importance in Cognitive Radio systems when secondary users (SUs)
are looking for available spectrum opportunities to communicate over them while
sensing at Nyquist rate sampling can be costly or even impractical in case of
very wide bandwidth. We first study the effect of timing offset and derive the
necessary and sufficient conditions for signal recovery in the oracle-assisted
case when the true active sub-carriers are assumed known. Then we propose an
Orthogonal Matching Pursuit (OMP)-based joint sparse recovery method for
identifying active subcarriers when the timing offset is known. Finally we
extend the problem to the case of unknown timing offset and develop a joint
dictionary learning and sparse approximation algorithm, where in the dictionary
learning phase the timing offset is estimated and in the sparse approximation
phase active subcarriers are identified. The obtained results demonstrate that
active subcarrier identification can be carried out reliably, by using the
developed framework.Comment: To appear in the proceedings of the IEEE Global Communications
Conference (GLOBECOM) 201
Wireless Communications in the Era of Big Data
The rapidly growing wave of wireless data service is pushing against the
boundary of our communication network's processing power. The pervasive and
exponentially increasing data traffic present imminent challenges to all the
aspects of the wireless system design, such as spectrum efficiency, computing
capabilities and fronthaul/backhaul link capacity. In this article, we discuss
the challenges and opportunities in the design of scalable wireless systems to
embrace such a "bigdata" era. On one hand, we review the state-of-the-art
networking architectures and signal processing techniques adaptable for
managing the bigdata traffic in wireless networks. On the other hand, instead
of viewing mobile bigdata as a unwanted burden, we introduce methods to
capitalize from the vast data traffic, for building a bigdata-aware wireless
network with better wireless service quality and new mobile applications. We
highlight several promising future research directions for wireless
communications in the mobile bigdata era.Comment: This article is accepted and to appear in IEEE Communications
Magazin
- …