268 research outputs found
Bayesian Hypothesis Testing for Block Sparse Signal Recovery
This letter presents a novel Block Bayesian Hypothesis Testing Algorithm
(Block-BHTA) for reconstructing block sparse signals with unknown block
structures. The Block-BHTA comprises the detection and recovery of the
supports, and the estimation of the amplitudes of the block sparse signal. The
support detection and recovery is performed using a Bayesian hypothesis
testing. Then, based on the detected and reconstructed supports, the nonzero
amplitudes are estimated by linear MMSE. The effectiveness of Block-BHTA is
demonstrated by numerical experiments.Comment: 5 pages, 2 figures. arXiv admin note: text overlap with
arXiv:1412.231
Sub-Nyquist Sampling: Bridging Theory and Practice
Sampling theory encompasses all aspects related to the conversion of
continuous-time signals to discrete streams of numbers. The famous
Shannon-Nyquist theorem has become a landmark in the development of digital
signal processing. In modern applications, an increasingly number of functions
is being pushed forward to sophisticated software algorithms, leaving only
those delicate finely-tuned tasks for the circuit level.
In this paper, we review sampling strategies which target reduction of the
ADC rate below Nyquist. Our survey covers classic works from the early 50's of
the previous century through recent publications from the past several years.
The prime focus is bridging theory and practice, that is to pinpoint the
potential of sub-Nyquist strategies to emerge from the math to the hardware. In
that spirit, we integrate contemporary theoretical viewpoints, which study
signal modeling in a union of subspaces, together with a taste of practical
aspects, namely how the avant-garde modalities boil down to concrete signal
processing systems. Our hope is that this presentation style will attract the
interest of both researchers and engineers in the hope of promoting the
sub-Nyquist premise into practical applications, and encouraging further
research into this exciting new frontier.Comment: 48 pages, 18 figures, to appear in IEEE Signal Processing Magazin
Structured Compressed Sensing: From Theory to Applications
Compressed sensing (CS) is an emerging field that has attracted considerable
research interest over the past few years. Previous review articles in CS limit
their scope to standard discrete-to-discrete measurement architectures using
matrices of randomized nature and signal models based on standard sparsity. In
recent years, CS has worked its way into several new application areas. This,
in turn, necessitates a fresh look on many of the basics of CS. The random
matrix measurement operator must be replaced by more structured sensing
architectures that correspond to the characteristics of feasible acquisition
hardware. The standard sparsity prior has to be extended to include a much
richer class of signals and to encode broader data models, including
continuous-time signals. In our overview, the theme is exploiting signal and
measurement structure in compressive sensing. The prime focus is bridging
theory and practice; that is, to pinpoint the potential of structured CS
strategies to emerge from the math to the hardware. Our summary highlights new
directions as well as relations to more traditional CS, with the hope of
serving both as a review to practitioners wanting to join this emerging field,
and as a reference for researchers that attempts to put some of the existing
ideas in perspective of practical applications.Comment: To appear as an overview paper in IEEE Transactions on Signal
Processin
- …