Efficient Model-Free Learning to Overcome Hardware Nonidealities in Analog-to-Information Converters
Pages 3574 - 3578
Abstract
This paper considers compressed sensing (CS) in the context of RF spectrum sensing and presents an efficient approach for learning hardware nonidealities in an analog-to-information converter (A2IC). The proposed methodology is based on the learned iterative shrinkage-thresholding algorithm (LISTA), which enables co-optimization of the hardware and the reconstruction algorithm and leads to a model-free recovery approach that is optimally tuned for the unique computational constraints and hardware nonidealities present in the RF frontend. To achieve this, we devise a training protocol that employs a dataset and neural network of minimal sizes. We demonstrate the effectiveness of our methodology on simulated data from a model of a well-established CS A2IC in the presence of linear impairments and noise. The recovery process extrapolates from training on 1-sparse signals to recovering the support of signals whose sparsity runs up to the theoretical optimum for <tex>$\ell^{1}$</tex>-based algorithms across a range of typical operating SNRs.
8. References
[1]
E. J. Candes, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information”, IEEE Transactions on Information The-ory, vol. 52, no. 2, pp. 489–509, Feb. 2006.
[2]
E. J. Candes and T. Tao, “Decoding by linear programming”, IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4203–4215, Dec. 2005.
[3]
D. L. Donoho, “Compressed sensing”, IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289–1306, Apr. 2006.
[4]
David L. Donoho, “For most large underdetermined systems of linear equations the minimal 1-norm solution is also the sparsest solution”, Communications on Pure and Applied Mathe-maticics, vol. 59, no. 6, pp. 797–829, 2006.
[5]
E. Axell, G. Leus, E. G. Larsson, and H. V. Poor, “Spec-trum sensing for cognitive radio: State-of-the-art and recent advances”, IEEE Signal Processing Magazine, vol. 29, no. 3, pp. 101–116, May 2012.
[6]
T. Haque, M. Bajor, Y. Zhang, J. Zhu, Z. Jacobs, R. Kettlewell, J. Wright, and P. R. Kinget, “A direct RF-to-information converter for reception and wideband interferer detection employing pseudo-random lo modulation”, in Proc. IEEE Radio Frequency Integrated Circuits Symp. (RFIC), June 2017, pp. 268–271.
[7]
D. Adams, Y. Eldar, and B. Murmann, “A mixer frontend for a four-channel modulated wideband converter with 62 dB blocker rejection”, in Proc. IEEE Radio Frequency Integrated Circuits Symp. (RFIC), May 2016, pp. 286–289.
[8]
R. T. Yazicigil, T. Haque, M. R. Whalen, J. Yuan, J. Wright, and P. R. Kinget, “A 2.7-to-3.7GHz rapid interferer detector exploiting compressed sampling with a quadrature analog-to-information converter”, in Proc. IEEE Int. Solid-State Circuits Conf.-(ISSCC) Digest of Technical Papers, Feb. 2015, pp. 1–3.
[9]
M. Mishali and Y. C. Eldar, “From theory to practice: Sub-Nyquist sampling of sparse wideband analog signals”, IEEE Journal of Selected Topics in Signal Processing, vol. 4, no. 2, pp. 375–391, Apr. 2010.
[10]
J. Mitola, “Cognitive radio for flexible mobile multimedia communications”, in Proc. (MoMuC'99) 1999 IEEE Int Mobile Multimedia Communications Workshop, 1999, pp. 3–10.
[11]
Y. Chi, L L. Scharf, A. Pezeshki, and A R. Calderbank, “Sensi-tivity to basis mismatch in compressed sensing”, IEEE Trans. Signal Process., vol. 59, no. 5, pp. 2182–2195, May 2011.
[12]
Marco F. Duarte and Richard G. Baraniuk, “Spectral compressive sensing”, Appl. Comput. Harmon. Anal., vol. 35, no. 1, pp. 111–129, July 2013.
[13]
J. A. Tropp and A. C. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit”, IEEE Transactions on Information Theory, vol. 53, no. 12, pp. 4655–4666, Dec. 2007.
[14]
T. Zhang, “Sparse recovery with orthogonal matching pursuit under rip”, IEEE Transactions on Information Theory, vol. 57, no. 9, pp. 6215–6221, Sept. 2011.
[15]
Karol Gregor and Yann LeCun, “Learning fast approximations of sparse coding”, in Proceedings of the 27th International Conference on Machine Learning (ICML-10), 2010, pp. 399–406.
[16]
Ulugbek S. Kamilov and Hassan Mansour, “Learning optimal nonlinearities for iterative thresholding algorithms”, IEEE Signal Process. Lett., no. 5, pp. 747–751, Dec. 2015.
[17]
Bo Xin, Yizhou Wang, Wen Gao, David Wipf, and Baoyuan Wang, “Maximal sparsity with deep networks?”, in Advances in Neural Information Processing Systems 29, D D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett, Eds., pp. 4340–4348. Curran Associates, Inc., 2016.
[18]
Debabrata Mahapatra, Subhadip Mukherjee, and Chandra Sekhar Seelamantula, “Deep sparse coding using optimized linear expansion of thresholds”, arXiv preprint arXiv:, May 2017.
[19]
Mark Borgerding, Philip Schniter, and Sundeep Rangan, “AMP-Inspired deep networks for sparse linear inverse problems”, Dec. 2016.
[20]
Hao He, Bo Xin, and David Wipf, “From bayesian sparsity to gated recurrent nets”, arXiv preprint arXiv:, June 2017.
[21]
H. Palangi, R. Ward, and L. Deng, “Distributed compressive sensing: A deep learning approach”, IEEE Trans. Signal Process., vol. 64, no. 17, pp. 4504–4518, 2016.
[22]
P. Sprechmann, A. Bronstein, M. and G. Sapiro, “Learning efficient sparse and low rank models”, IEEE Trans. Pattern Anal. Mach. In tell., vol. 37, no. 9, pp. 1821–1833, Sept. 2015.
[23]
T. Haque, R. T. Yazicigil, K. J. L. Pan, J. Wright, and P. R. Kinget, “Theory and design of a quadrature analog-to-information converter for energy-efficient wideband spectrum sensing”, IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 62, no. 2, pp. 527–535, Feb. 2015.
[24]
Scott Chen and David L. Donoho, “Examples of basis pursuit”, in Wavelet Applications in Signal and Image Processing III. Sept. 1995, vol. 2569, pp. 564–575, International Society for Optics and Photonics.
[25]
A. Beck and M. Teboulle, “A fast iterative Shrinkage-Thresholding algorithm for linear inverse problems”, SIAM J. Imaging Sci., vol. 2, no. 1, pp. 183–202, Jan. 2009.
[26]
Neal Parikh and Stephen Boyd, “Proximal algorithms”, Foundations and Trends in Optimization, vol. 1, no. 3, pp. 127–239, 2014.
[27]
Roman Vershynin, “Introduction to the non-asymptotic analysis of random matrices”, arXiv preprint arXiv:, 2010.
[28]
Simon Foucart and Holger Rauhut, A Mathematical Introduction to Compressive Sensing, Birkhäuser Basel, 2013.
[29]
Martín Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, and Others, “TensorFlow: A system for Large-Scale machine learning”, in OSDI. 2016, vol. 16, pp. 265–283, usenix.org.
[30]
Alekh Agarwal, Sahand Negahban, and Martin J Wainwright, “Fast global convergence of gradient methods for high-dimensional statistical recovery”, Ann. Stat., vol. 40, no. 5, pp. 2452–2482, Oct. 2012.
Index Terms
- Efficient Model-Free Learning to Overcome Hardware Nonidealities in Analog-to-Information Converters
Index terms have been assigned to the content through auto-classification.
Recommendations
Comments
Information & Contributors
Information
Published In
Apr 2018
17916 pages
Copyright © 2018.
Publisher
IEEE Press
Publication History
Published: 15 April 2018
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in