Segmented compressed sampling for analog-to-information conversion: Method and performance analysis

IEEE Transactions on Signal Processing

Volumn 59, Issue 2, 2011, Pages 554-572

  Taheri, Omid ^a   Vorobyov, Sergiy A ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Analog to information conversion (AIC); compressed sampling (CS); correlated random variables; CraigBernstein inequality; empirical risk minimization; segmented AIC; segmented CS

Indexed keywords

COMPRESSED SAMPLING (CS); CORRELATED RANDOM VARIABLES; CRAIGBERNSTEIN INEQUALITY; EMPIRICAL RISK MINIMIZATION; INFORMATION CONVERSION; SEGMENTED AIC; SEGMENTED CS;

AIRCRAFT PROPULSION; OPTIMIZATION; RANDOM VARIABLES; SIGNAL RECONSTRUCTION;

MATRIX ALGEBRA;

EID: 78651350106     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2010.2091411     Document Type: Article

References (25)

1. E. J. Candes and M. B. Wakin, "An introduction to compressive sampling," IEEE Signal Process. Mag., vol. 25, no. 2, pp. 21-30, Mar. 2008.
2. E. J. Candes and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
3. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
4. J. Haupt and R. Nowak, "Signal reconstruction from noisy random projections," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 4036-4048, Sep. 2006.
5. M. Wakin, J. N. Laska, M. F. Duarte, D. Baron, S. Sarvotham, D. Takhar, K. F. Kelly, and R. G. Baraniuk, "An architecture for compressive imaging," in Proc. IEEE ICIP, Atlanta, GA, Oct. 2006, pp. 1273-1276.
6. W. Bajwa, J. Haupt, A. Sayeed, and R. Nowak, "Joint sourcechannel communication for distributed estimation in sensor networks," IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3629-3653, Oct. 2007.
7. Z. Yu, S. Hoyos, and B. M. Sadler, "Mixed-signal parallel compressed sensing and reception for cognitive radio," in Proc. IEEE ICASSP, Las Vegas, NV, Apr. 2008, pp. 3861-3864.
8. G. Taubock and F. Hlawatsch, "A compressed sensing technique for OFDM channel estimation in mobile environments: Exploiting channel sparsity for reducing pilots," in Proc. IEEE ICASSP, Las Vegas, NV, Apr. 2008, pp. 2885-2888.
9. Y. M. Lu and M. N. Do, "A theory for sampling signals from a union of subspaces," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2334-2345, Jun. 2008.
10. Y. C. Eldar and M. Mishali, "Robust recovery of signals from a structured union of subspaces," IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 5302-5316, Nov. 2009.
11. J. N. Laska, S. Kirolos, M. F. Duarte, T. S. Ragheb, R. G. Baraniuk, and Y. Massoud, "Theory and implementation of an analog-to-information converter using random demodulation," in Proc. IEEE ISCAS, New Orleans, LA, May 2007, pp. 1959-1962.
12. O. Taheri and S. A. Vorobyov, "Segmented compressed sampling for analog-to-information conversion," in Proc. IEEE CAMSAP, Aruba, Dutch Antilles, Dec. 2010, pp. 113-116.
13. W. Badjwa, J. D. Haupt, G. M. Raz, S. J. Wright, and R. D. Nowak, "Toeplitz-structured compressed sensing matrices," in Proc. IEEE SSP, Madison, WI, Aug. 2007, pp. 294-298.
14. R. Baraniuk and P. Steeghs, "Compressive radar imaging," presented at the IEEE Radar Conf., Waltham, MA, Apr. 2007.
15. O. Taheri and S. A. Vorobyov, "Empirical risk minimization-based analysis of segmented compressed sampling," presented at the 44th Annu. Asilomar Conf. Signals, Systems, Computers, Pacific Grove, CA, Nov. 2010.
16. P. Vandewalle, J. Kovacevic, and M. Vetterli, "Reproducible research in signal processing," IEEE Signal Process. Mag., vol. 26, no. 3, pp. 37-47, May 2009.
17. D. L. Donoho and J. Tanner, "Counting faces of randomly projected polytopes when the projection radically lowers dimension," J. Amer. Math. Soc., vol. 22, no. 1, pp. 1-53, Jan. 2009.
18. E. J. Candes and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
19. R. G. Baraniuk, M. Davenport, R. De Vore, and M. Wakin, "A simple proof of the restricted isometry property for random matrices," Construct. Approx., vol. 28, no. 3, pp. 253-263, Dec. 2008.
20. 1 -norm solution is also the sparsest solution," Commun. Pure Appl. Math., vol. 59, pp. 797-829, Jun. 2006. (Pubitemid 43667226)
21. E. J. Candes, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Commun. Pure Appl. Math., vol. 59, pp. 1207-1223, Aug. 2006.
22. V. N. Vapnik, Statistical Learning Theory. New York: Wiley, 1998.
23. D. Angelosante and G. B. Giannakis, "RLS-weighted LASSO for adaptive estimation of sparse signals," in Proc. IEEE ICASSP, Taipei, Taiwan, R.O.C., Apr. 2009, pp. 3245-3248.
24. C. Craig, "On the Tchebycheff inequality of Bernstein," Ann. Math. Stat., vol. 4, no. 2, pp. 94-102, May 1933.
25. 1 -minimization: A non-RIP analysis and extensions," Rice Univ. CAAM, Houston, TX, Tech. Rep. TR08-11, 2008 [Online]. Available: *http://www. caam.rice.edu/~yzhang/reports/tr0811.pdf