An analog sub-linear time sparse signal acquisition framework based on structured matrices
Abstract
Advances in compressed-sensing (CS) have sparked interest in designing information acquisition systems that process data at close to the information rate. Initial proposals for CS signal acquisition systems utilized random matrix ensembles in conjunction with convex relaxation based signal reconstruction algorithms. While providing universal performance bounds, random matrix based formulations present several practical problems due to: the difficulty in physically implementing key mathematical operations, and their dense representation. In this paper, we present a CS architecture which is based on a sub-linear time recovery algorithm (with minimum memory requirement) that exploits a novel structured matrix. This formulation allows the use of a reconstruction algorithm based on relatively simple computational primitives making it more amenable to implementation in a fully-integrated form. Theoretical recovery guarantees are discussed and a hypothetical physical CS decoder is described.
Additional Information
© 2012 IEEE. Date of Current Version: 30 August 2012. The authors would like to acknowledge Mathew Till and Dr. Stephen Becker for insightful technical discussions.Attached Files
Accepted Version - An_20analog_20sub-linear_20time_20sparse_20signal_20acquisition_20framework_20based_20on_20structured_20matrices.pdf
Files
Name | Size | Download all |
---|---|---|
md5:80c8b03f3710fca03dcf1140bb0de8af
|
123.3 kB | Preview Download |
Additional details
- Eprint ID
- 33925
- Resolver ID
- CaltechAUTHORS:20120907-092240681
- Created
-
2012-09-07Created from EPrint's datestamp field
- Updated
-
2023-03-15Created from EPrint's last_modified field