I. Stanković, M. Brajović, M. Daković, L. Stanković
{"title":"复值二值压缩感知","authors":"I. Stanković, M. Brajović, M. Daković, L. Stanković","doi":"10.1109/TELFOR.2018.8612043","DOIUrl":null,"url":null,"abstract":"One-bit (or binary) compressive sensing (CS) is a relatively new idea in the theory of sparse signal reconstruction. It is based on using only the sign of the available measurements for the signal recovery. In this paper, we analyze the one-bit CS concepts on complex-valued random Gaussian measurement matrices. The signal is reconstructed using an iterative hard thresholding algorithm, modified for the complex-valued binary measurements. The considered CS approach is particularly suitable for hardware realizations. The reconstruction performance is validated numerically, and compared with the traditional CS reconstruction based on quantized digital measurements.","PeriodicalId":229131,"journal":{"name":"2018 26th Telecommunications Forum (TELFOR)","volume":"32 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Complex-Valued Binary Compressive Sensing\",\"authors\":\"I. Stanković, M. Brajović, M. Daković, L. Stanković\",\"doi\":\"10.1109/TELFOR.2018.8612043\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One-bit (or binary) compressive sensing (CS) is a relatively new idea in the theory of sparse signal reconstruction. It is based on using only the sign of the available measurements for the signal recovery. In this paper, we analyze the one-bit CS concepts on complex-valued random Gaussian measurement matrices. The signal is reconstructed using an iterative hard thresholding algorithm, modified for the complex-valued binary measurements. The considered CS approach is particularly suitable for hardware realizations. The reconstruction performance is validated numerically, and compared with the traditional CS reconstruction based on quantized digital measurements.\",\"PeriodicalId\":229131,\"journal\":{\"name\":\"2018 26th Telecommunications Forum (TELFOR)\",\"volume\":\"32 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 26th Telecommunications Forum (TELFOR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TELFOR.2018.8612043\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 26th Telecommunications Forum (TELFOR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TELFOR.2018.8612043","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
One-bit (or binary) compressive sensing (CS) is a relatively new idea in the theory of sparse signal reconstruction. It is based on using only the sign of the available measurements for the signal recovery. In this paper, we analyze the one-bit CS concepts on complex-valued random Gaussian measurement matrices. The signal is reconstructed using an iterative hard thresholding algorithm, modified for the complex-valued binary measurements. The considered CS approach is particularly suitable for hardware realizations. The reconstruction performance is validated numerically, and compared with the traditional CS reconstruction based on quantized digital measurements.