### Abstract

The performance of regularized least-squares estimation in noisy compressed sensing is analyzed in the limit when the dimensions of the measurement matrix grow large. The sensing matrix is considered to be from a class of random ensembles that encloses as special cases standard Gaussian, row-orthogonal, geometric, and so-called $T$-orthogonal constructions. Source vectors that have non-uniform sparsity are included in the system model. Regularization based on $\ell-{1}$-norm and leading to LASSO estimation, or basis pursuit denoising, is given the main emphasis in the analysis. Extensions to $\ell-{2}$-norm and zero-norm regularization are also briefly discussed. The analysis is carried out using the replica method in conjunction with some novel matrix integration results. Numerical experiments for LASSO are provided to verify the accuracy of the analytical results. The numerical experiments show that for noisy compressed sensing, the standard Gaussian ensemble is a suboptimal choice for the measurement matrix. Orthogonal constructions provide a superior performance in all considered scenarios and are easier to implement in practical applications. It is also discovered that for non-uniform sparsity patterns, the $T$-orthogonal matrices can further improve the mean square error behavior of the reconstruction when the noise level is not too high. However, as the additive noise becomes more prominent in the system, the simple row-orthogonal measurement matrix appears to be the best choice out of the considered ensembles.

Original language | English |
---|---|

Article number | 7399380 |

Pages (from-to) | 2100-2124 |

Number of pages | 25 |

Journal | IEEE Transactions on Information Theory |

Volume | 62 |

Issue number | 4 |

DOIs | |

Publication status | Published - 1 Apr 2016 |

MoE publication type | A1 Journal article-refereed |

### Fingerprint

### Keywords

- '1 minimization
- Compressed sensing
- compressed sensing matrices
- eigenvalues of random matrices
- noisy linear measurements

### Cite this

*IEEE Transactions on Information Theory*,

*62*(4), 2100-2124. [7399380]. https://doi.org/10.1109/TIT.2016.2525824