## Abstract

We consider the problem of recovering an N-dimensional sparse vector x from its linear transformation y=Dx of M (<N) dimensions. Minimization of the l_{1}-norm of x under the constraint y=Dx is a standard approach for the recovery problem, and earlier studies report that the critical condition for typically successful l_{1}-recovery is universal over a variety of randomly constructed matrices D. To examine the extent of the universality, we focus on the case in which D is provided by concatenating T=N/M matrices O _{1},O_{2},...,O_{T} drawn uniformly according to the Haar measure on the M×M orthogonal matrices. By using the replica method in conjunction with the development of an integral formula to handle the random orthogonal matrices, we show that the concatenated matrices can result in better recovery performance than that predicted by the universality when the density of non-zero signals is not uniform among the T matrix modules. The universal condition is reproduced for the special case of uniform non-zero signal densities. Extensive numerical experiments support the theoretical predictions.

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

Article number | P12003 |

Journal | Journal of Statistical Mechanics: Theory and Experiment |

Volume | 2012 |

Issue number | 12 |

DOIs | |

Publication status | Published - 1 Dec 2012 |

MoE publication type | A1 Journal article-refereed |

## Keywords

- error correcting codes
- source and channel coding
- statistical inference

## Fingerprint

Dive into the research topics of 'Typical l_{1}-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices'. Together they form a unique fingerprint.