{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T23:11:06Z","timestamp":1659049866833},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,5,28]],"date-time":"2017-05-28T00:00:00Z","timestamp":1495929600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Major Project of Education Department in Sichuan","award":["14ZA0172"],"award-info":[{"award-number":["14ZA0172"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s11277-017-4528-1","type":"journal-article","created":{"date-parts":[[2017,5,28]],"date-time":"2017-05-28T05:48:40Z","timestamp":1495950520000},"page":"647-659","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["HRS: A Robust Compressed Sensing Arithmetic in Wireless Equipment Acoustic Signal Test"],"prefix":"10.1007","volume":"97","author":[{"given":"Changjian","family":"Deng","sequence":"first","affiliation":[]},{"given":"Dongyi","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"issue":"5","key":"4528_CR1","doi-asserted-by":"crossref","first-page":"1382","DOI":"10.1109\/TASL.2010.2090656","volume":"19","author":"A Griffin","year":"2011","unstructured":"Griffin, A., Hirvonen, T., Tzagkarakis, C., Mouchtaris, A., & Tsakalides, P. (2011). Single-channel and multi-channel sinusoidal audio coding using compressed sensing. IEEE Transactions on Audio, Speech, and Language Processing, 19(5), 1382\u20131395.","journal-title":"IEEE Transactions on Audio, Speech, and Language Processing"},{"issue":"1","key":"4528_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/LSP.2009.2034560","volume":"17","author":"D Giacobello","year":"2010","unstructured":"Giacobello, D., Christensen, M. G., Murthi, M. N., Jensen, S. H., & Moonen, M. (2010). Retrieving sparse patterns using a compressed sensing framework: Applications to speech coding based on sparse linear prediction. IEEE Signal Processing Letters, 17(1), 103\u2013106.","journal-title":"IEEE Signal Processing Letters"},{"key":"4528_CR3","doi-asserted-by":"crossref","unstructured":"Giacobello, D., Christensen, M. G., Dahl, J., & Moonen, M. (2008). Sparse linear predictors for speech processing. In Proceedings of the international conference on spoken language processing.","DOI":"10.21437\/Interspeech.2008-394"},{"key":"4528_CR4","unstructured":"Giacobello, D., Van Waterschoot, T., Christensen, M. G., & Jensen, S. H. (2010). High-order sparse linear predictors for audio processing. In Signal Processing Conference, 2010, European, pp. 234\u2013238."},{"issue":"5","key":"4528_CR5","doi-asserted-by":"crossref","first-page":"1644","DOI":"10.1109\/TASL.2012.2186807","volume":"20","author":"D Giacobello","year":"2012","unstructured":"Giacobello, D., Christensen, M. G., Murthi, M. N., Jensen, S. H., & Moonen, M. (2012). Retrieving sparse patterns using a compressed sensing framework: Applications to speech coding based on sparse linear prediction. IEEE Transactions on Audio, Speech, and Language Processing, 20(5), 1644\u20131657.","journal-title":"IEEE Transactions on Audio, Speech, and Language Processing"},{"key":"4528_CR6","unstructured":"Hassam, M. K., & Maha, E. S. (2014). A comparative study of audio compression based on compressed sensing and sparse fast fourier transform (SFFT): Performance and challenges, arxiv.org\/abs\/1403.3061 ."},{"issue":"12","key":"4528_CR7","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"JA Tropp","year":"2007","unstructured":"Tropp, J. A., & Gilbert, A. C. (2007). Signal recovery from random measurements via orthogonal matching pursuit. IEEE Transactions on Information Theory, 53(12), 4655\u20134666.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"4528_CR8","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., & Tropp, J. A. (2009). CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Applied and Computational Harmonic Analysis, 26(3), 301\u2013321.","journal-title":"Applied and Computational Harmonic Analysis"},{"issue":"3","key":"4528_CR9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., & Davies, M. E. (2009). Iterative hard thresholding for compressed sensing. Applied and Computational Harmonic Analysis, 27(3), 265\u2013274.","journal-title":"Applied and Computational Harmonic Analysis"},{"issue":"4","key":"4528_CR10","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"M Figueiredo","year":"2007","unstructured":"Figueiredo, M., Nowak, R., & Wright, S. (2007). Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. IEEE Journal of Selected Topics in Signal Processing, 1(4), 586\u2013597.","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"issue":"7","key":"4528_CR11","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S. J., Nowak, R. D., & Figueiredo, M. A. T. (2009). Sparse reconstruction by separable approximation. IEEE Transactions on Signal Processing, 57(7), 2479\u20132493.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"45","key":"4528_CR12","doi-asserted-by":"crossref","first-page":"18914","DOI":"10.1073\/pnas.0909892106","volume":"106","author":"DL Donoho","year":"2009","unstructured":"Donoho, D. L., Maleki, A., & Montanari, A. (2009). Message-passing algorithms for compressed sensing. Proceedings of the National Academy of Sciences of the United States of America, 106(45), 18914\u201318919.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"4528_CR13","doi-asserted-by":"crossref","unstructured":"Hassanieh, H., Indyk, P., Katabi, D., & Price, E. (2012). Simple and practical algorithm for sparse Fourier transform. In Proceedings of the twenty-third annual ACM-SIAM symposium on discrete algorithms, pp. 1183\u20131194.","DOI":"10.1137\/1.9781611973099.93"},{"key":"4528_CR14","unstructured":"Ying, L. (2008). Sparse fourier transform via butterfly algorithm. arxiv.org\/abs\/0801.1524 ."},{"key":"4528_CR15","doi-asserted-by":"crossref","unstructured":"Pawar, S., & Ramchandran, K. (2014). A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes. In IEEE international symposium on information theory, IEEE, pp. 1852\u20131856.","DOI":"10.1109\/ISIT.2014.6875154"},{"issue":"3","key":"4528_CR16","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1109\/ISIT.2013.6620269","volume":"27","author":"S Pawar","year":"2013","unstructured":"Pawar, S., & Ramchandran, K. (2013). Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity. 2013 IEEE International Symposium on Information Theory, 27(3), 464\u2013468.","journal-title":"2013 IEEE International Symposium on Information Theory"},{"key":"4528_CR17","first-page":"4","volume":"04","author":"CA Roberto","year":"2009","unstructured":"Roberto, C. A., & Saad, D. (2009). Properties of sparse random matrices over finite fields. Journal of Statistical Mechanics Theory and Experiment, 04, 4\u201317.","journal-title":"Journal of Statistical Mechanics Theory and Experiment"},{"key":"4528_CR18","doi-asserted-by":"crossref","unstructured":"Berinde, R., Gilbert, A. C., Indyk, P., Karloff, H., & Strauss, M. J (2008). Combining geometry and combinatory: A unified approach to sparse signal recovery. In IEEE Allerton conference on communication, control, and computing, 2008, 798\u2013805.","DOI":"10.1109\/ALLERTON.2008.4797639"},{"issue":"9","key":"4528_CR19","doi-asserted-by":"crossref","first-page":"5145","DOI":"10.1109\/TIT.2016.2587772","volume":"62","author":"EL Miles","year":"2016","unstructured":"Miles, E. L. (2016). Unknown sparsity in compressed sensing: Denoising and inference. IEEE Transactions on Information Theory, 62(9), 5145\u20135166.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"21","key":"4528_CR20","doi-asserted-by":"crossref","first-page":"5525","DOI":"10.1109\/TSP.2016.2591511","volume":"64","author":"R Boyer","year":"2016","unstructured":"Boyer, R., Couillet, R., Fleury, B. H., & Larzabal, P. (2016). Oracle large-system estimation performance in noisy compressed sensing with random support\u2014A bayesian analysis. IEEE Transactions on Singal Processing, 64(21), 5525\u20135535.","journal-title":"IEEE Transactions on Singal Processing"},{"issue":"9","key":"4528_CR21","doi-asserted-by":"crossref","first-page":"14971501","DOI":"10.1109\/LSP.2015.2409896","volume":"22","author":"M Shaghaghi","year":"2015","unstructured":"Shaghaghi, M., & Vorobyov, S. (2015). CramerRao bound for sparse signals fitting the low-rank model with small number of parameters. IEEE Signal Processing Letters, 22(9), 14971501.","journal-title":"IEEE Signal Processing Letters"},{"issue":"4","key":"4528_CR22","first-page":"488492","volume":"23","author":"MNE Korso","year":"2016","unstructured":"Korso, M. N. E., Boyer, R., Larzabal, P., & Fleury, B. H. (2016). Estimation performance for the Bayesian hierarchical linear model. IEEE Signal Processing Letters, 23(4), 488492.","journal-title":"IEEE Signal Processing Letters"},{"issue":"12","key":"4528_CR23","first-page":"74457463","volume":"62","author":"M Kliesch","year":"2016","unstructured":"Kliesch, M., Kueng, R., Eisert, J., & Gross, D. (2016). Improving compressed sensing with the diamond norm. IEEE Transactions on Information Theory, Mathematics, 62(12), 74457463.","journal-title":"IEEE Transactions on Information Theory, Mathematics"},{"issue":"3","key":"4528_CR24","first-page":"15351554","volume":"63","author":"MC Rui","year":"2017","unstructured":"Rui, M. C., & Tnczos, E. (2017). Adaptive compressed sensing for support recovery of structured sparse sets. IEEE Transactions on Information Theory, 63(3), 15351554.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"4528_CR25","doi-asserted-by":"crossref","first-page":"15551570","DOI":"10.1109\/TIT.2016.2633415","volume":"63","author":"C Cartis","year":"2017","unstructured":"Cartis, C., & Thompson, A. (2017). Quantitative recovery conditions for tree-based compressed sensing. IEEE Transactions on Information Theory, 63(3), 15551570.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"4528_CR26","doi-asserted-by":"crossref","first-page":"2627","DOI":"10.1109\/TASL.2013.2281570","volume":"21","author":"B Defraene","year":"2013","unstructured":"Defraene, B., Mansour, N., De Hertogh, S., Waterschoot, T., Diehl, M., & Moonen, M. (2013). Declipping of audio signals using perceptual compressed sensing. IEEE Transactions on Audio, Speech, and Language Processing, 21(12), 2627\u20132637.","journal-title":"IEEE Transactions on Audio, Speech, and Language Processing"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-017-4528-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-4528-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-4528-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T22:39:33Z","timestamp":1659047973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-017-4528-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,28]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["4528"],"URL":"https:\/\/doi.org\/10.1007\/s11277-017-4528-1","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,28]]}}}