# Rakeness in the Design of Analog-to-Information Conversion of Sparse and Localized Signals

@article{Mangia2012RakenessIT,
title={Rakeness in the Design of Analog-to-Information Conversion of Sparse and Localized Signals},
author={Mauro Mangia and Riccardo Rovatti and Gianluca Setti},
journal={IEEE Transactions on Circuits and Systems I: Regular Papers},
year={2012},
volume={59},
pages={1001-1014}
}
• Published 24 April 2012
• Computer Science
• IEEE Transactions on Circuits and Systems I: Regular Papers
Design of random modulation preintegration systems based on the restricted-isometry property may be suboptimal when the energy of the signals to be acquired is not evenly distributed, i.e., when they are both sparse and localized. To counter this, we introduce an additional design criterion, that we call rakeness, accounting for the amount of energy that the measurements capture from the signal to be acquired. Hence, for localized signals a proper system tuning increases the rakeness as well as…

## Figures and Tables from this paper

### Correlation tuning in compressive sensing based on rakeness: A case study

• Computer Science
2013 IEEE 20th International Conference on Electronics, Circuits, and Systems (ICECS)
• 2013
This paper makes two additional and non-restrictive hypotheses to ensure a good behavior of the system and can compute an upper and a lower bound for the parameter r used to control the statistical matching level.

### Rakeness-Based Design of Low-Complexity Compressed Sensing

• Computer Science
IEEE Transactions on Circuits and Systems I: Regular Papers
• 2017
This work exploits CS as a simple early-digital compression stage that performs a multiplication of the signal by a matrix and yields an extremely lightweight stage implemented by a very small number of possibly signed sums with an excellent compression performance.

### A Low-Power Architecture for Punctured Compressed Sensing and Estimation in Wireless Sensor-Nodes

• Computer Science
IEEE Transactions on Circuits and Systems I: Regular Papers
• 2015
It is found that conventional CS acquisition can be made more energy-efficient as it tolerates a certain amount of random puncturing, and that more substantial power savings can be achieved when estimation is the target and undersampling is optimized by a suitable algorithm.

### A rakeness-based design flow for Analog-to-Information conversion by Compressive Sensing

• Computer Science
2013 IEEE International Symposium on Circuits and Systems (ISCAS2013)
• 2013
A complete and extremely simple design flow is defined that quantifies the statistical dependencies in projection matrices allowing the exploitation of non-uniformities in the distribution of the energy of the input signal.

### Antipodal random sequences with prescribed second-order statistics: application to Compressive Sensing and UWB system based on DS-CDMA

This thesis presents a new approach that tries to achieve high compression by design the second order statistics of a set of additional waveforms involved in the signal acquisition/compression stage and shows that, when spreading sequence statistical properties are suitably designed, performance improvements are possible with respect to a system exploiting chaos-based sequences minimizing MAI only.

### Hardware-Algorithms Co-Design and Implementation of an Analog-to-Information Converter for Biosignals Based on Compressed Sensing

• Computer Science
IEEE Transactions on Biomedical Circuits and Systems
• 2016
The design and implementation of an Analog-to-Information Converter based on Compressed Sensing (CS) is reported, which is able to adapt itself to the energy distribution of the input by exploiting the so-called rakeness to maximize the amount of information contained in the measurements.

### From Universal to Adapted Acquisition: Rake That Signal!

• Computer Science
• 2018
Some of the empirical observations in the previous chapter are used here to formalize a design flow that allows to increase the performance of acquisition systems based on CS. This is done by

### Sparse multiband signal spectrum sensing with asynchronous coprime sampling

• Computer Science
Cluster Computing
• 2018
This paper proposes an asynchronous coprime sampling technique for capturing and reconstructing of sparse multiband signals that occupy a small part of a given broad frequency band by exploiting a low-dimensional representation of the original high-dimensional signal.

### Deep Neural Oracles for Short-Window Optimized Compressed Sensing of Biosignals

• Computer Science
IEEE Transactions on Biomedical Circuits and Systems
• 2020
This architecture allows the definition of an encoding-decoding scheme with state-of-the-art recovery capabilities when applied to biological signals such as ECG and EEG, thus allowing extremely low-complex encoders and self-assessment capability, which is unique in the CS literature.

### A Pragmatic Look at Some Compressive Sensing Architectures With Saturation and Quantization

• Computer Science
IEEE Journal on Emerging and Selected Topics in Circuits and Systems
• 2012
It is shown that the (Random Modulation Pre-Integration) RMPI architecture and its recently proposed adjustments are probably the most versatile approach though not always the most economic to implement and that when 1-bit quantization is sought, dynamically mixing quantization and integration in a randomized ΔΣ architecture help bringing the performance much closer to that of multi-bit approaches.

## References

SHOWING 1-10 OF 34 REFERENCES

### Compressive sensing of localized signals: Application to Analog-to-Information conversion

• Computer Science
Proceedings of 2010 IEEE International Symposium on Circuits and Systems
• 2010
If the sparse signal to be acquired is known to concentrate its energy along a known subspace, an additional “rakeness” criterion arises for the design and optimization of the measurement basis and for signals localized in the frequency domain.

### Analog-to-information conversion of sparse and non-white signals: Statistical design of sensing waveforms

• Computer Science
2011 IEEE International Symposium of Circuits and Systems (ISCAS)
• 2011
This work will assume that the signal is not only sparse but also localized in a given domain, so that its energy is concentrated in a subspace.

### Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

• Computer Science
IEEE Transactions on Information Theory
• 2006
If the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f to within very high accuracy from a small number of random measurements by solving a simple linear program.

### Memory-m antipodal processes: Spectral analysis and synthesis

• Mathematics
IEEE Transactions on Circuits and Systems I: Regular Papers
• 2009
A general analytic formula is given here for the spectrum of stochastic antipodal processes with finite memory, derived within a generalized Markov framework and depends on the eigenstructure of a suitably defined transition matrix that is also exploited to give ergodicity conditions.

### Theory and Implementation of an Analog-to-Information Converter using Random Demodulation

• Computer Science
2007 IEEE International Symposium on Circuits and Systems
• 2007
The new theory of compressive sensing enables direct analog-to-information conversion of compressible signals at sub-Nyquist acquisition rates and proves the concept under the effect of circuit nonidealities.

### Compressed Sensing and Redundant Dictionaries

• Computer Science
IEEE Transactions on Information Theory
• 2008
It is shown that a matrix, which is a composition of a random matrix of certain type and a deterministic dictionary, has small restricted isometry constants, and signals that are sparse with respect to the dictionary can be recovered via basis pursuit from a small number of random measurements.

### An Introduction To Compressive Sampling

• Computer Science
IEEE Signal Processing Magazine
• 2008
The theory of compressive sampling, also known as compressed sensing or CS, is surveyed, a novel sensing/sampling paradigm that goes against the common wisdom in data acquisition.

### A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm

• Computer Science
IEEE Transactions on Signal Processing
• 2009
A fast algorithm for overcomplete sparse decomposition, called SL0, is proposed, which tries to directly minimize the l 1 norm.

### Statistical modeling of discrete-time chaotic processes-basic finite-dimensional tools and applications

• Computer Science
The IEEE International Symposium on Circuits and Systems, 2003. Tutorial Guide: ISCAS 2003.
• 2003
Experimental evidence shows that the availability of statistical tools enables the design of chaos-based systems which favorably compare with analogous nonchaos-based counterparts.