{"title":"Signal reconstruction after compressed sensing using probabilistic approximation and gradient descent","authors":"S. S, Pawan Joshi","doi":"10.1109/ICAECCT.2016.7942597","DOIUrl":null,"url":null,"abstract":"Compressed sensing allows for signal sampling at frequencies much lesser than the Nyquist rate, thus allowing for lesser resource and area consumption of sampling modules as well as lesser data rates for information transfer. However the process of signal reconstruction is based on constraints of sparsity and requires methods more complex than sinc interpolation, which is used in Nyquist sampled reconstruction. Some of the methods used are l1 norm minimisation, convex optimisation as well as greedy methods. This paper describes a reconstruction algorithm using probabilistic approximation and gradient descent. Satisfactory results have been obtained and this concept can be further developed and optimised for large scale usage.","PeriodicalId":6629,"journal":{"name":"2016 IEEE International Conference on Advances in Electronics, Communication and Computer Technology (ICAECCT)","volume":"48 1","pages":"273-276"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Advances in Electronics, Communication and Computer Technology (ICAECCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAECCT.2016.7942597","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Compressed sensing allows for signal sampling at frequencies much lesser than the Nyquist rate, thus allowing for lesser resource and area consumption of sampling modules as well as lesser data rates for information transfer. However the process of signal reconstruction is based on constraints of sparsity and requires methods more complex than sinc interpolation, which is used in Nyquist sampled reconstruction. Some of the methods used are l1 norm minimisation, convex optimisation as well as greedy methods. This paper describes a reconstruction algorithm using probabilistic approximation and gradient descent. Satisfactory results have been obtained and this concept can be further developed and optimised for large scale usage.