Information Theoretic Bounds for Sparse Reconstruction in Random Noise
Compressive sensing (CS) plays a pivotal role in the signal processing and we address on the issues, i.e., the information-theoretic analysis of CS under random noise in this paper. To distinguish from existing literature, we aim at providing a precise reconstruction of the source signal. From the a...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8703376/ |
id |
doaj-0d578f2eea314a3b803759c36dd19721 |
---|---|
record_format |
Article |
spelling |
doaj-0d578f2eea314a3b803759c36dd197212021-03-29T23:50:17ZengIEEEIEEE Access2169-35362019-01-01710230410231210.1109/ACCESS.2019.29141168703376Information Theoretic Bounds for Sparse Reconstruction in Random NoiseJunjie Chen0https://orcid.org/0000-0001-7032-2759Fangqi Zhu1https://orcid.org/0000-0002-2528-4017Qilian Liang2Department of Electrical Engineering, The University of Texas at Arlington, Arlington, TX, USADepartment of Electrical Engineering, The University of Texas at Arlington, Arlington, TX, USADepartment of Electrical Engineering, The University of Texas at Arlington, Arlington, TX, USACompressive sensing (CS) plays a pivotal role in the signal processing and we address on the issues, i.e., the information-theoretic analysis of CS under random noise in this paper. To distinguish from existing literature, we aim at providing a precise reconstruction of the source signal. From the analysis of the recovery performance, we calculate the lower band upper bound of the probability of error for CS. To be more specific, we provide more discussions for the case where both the source and the noise follow Gaussian distribution. It has been proved that perfect reconstruction of the signal vector is impossible if the corresponding conditions are not satisfied, which can be served as the theoretical reference of noisy CS. In terms of the necessary proofs, we leverage the results from information theory and estimation theory. The compression of real underwater acoustic sensor network (UWASN) data is applied to verify the theoretical bounds derived in this paper.https://ieeexplore.ieee.org/document/8703376/Compressive sensingrandom noiseprobability of errortheoretical performance boundsunderwater acoustic sensor networks |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Junjie Chen Fangqi Zhu Qilian Liang |
spellingShingle |
Junjie Chen Fangqi Zhu Qilian Liang Information Theoretic Bounds for Sparse Reconstruction in Random Noise IEEE Access Compressive sensing random noise probability of error theoretical performance bounds underwater acoustic sensor networks |
author_facet |
Junjie Chen Fangqi Zhu Qilian Liang |
author_sort |
Junjie Chen |
title |
Information Theoretic Bounds for Sparse Reconstruction in Random Noise |
title_short |
Information Theoretic Bounds for Sparse Reconstruction in Random Noise |
title_full |
Information Theoretic Bounds for Sparse Reconstruction in Random Noise |
title_fullStr |
Information Theoretic Bounds for Sparse Reconstruction in Random Noise |
title_full_unstemmed |
Information Theoretic Bounds for Sparse Reconstruction in Random Noise |
title_sort |
information theoretic bounds for sparse reconstruction in random noise |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2019-01-01 |
description |
Compressive sensing (CS) plays a pivotal role in the signal processing and we address on the issues, i.e., the information-theoretic analysis of CS under random noise in this paper. To distinguish from existing literature, we aim at providing a precise reconstruction of the source signal. From the analysis of the recovery performance, we calculate the lower band upper bound of the probability of error for CS. To be more specific, we provide more discussions for the case where both the source and the noise follow Gaussian distribution. It has been proved that perfect reconstruction of the signal vector is impossible if the corresponding conditions are not satisfied, which can be served as the theoretical reference of noisy CS. In terms of the necessary proofs, we leverage the results from information theory and estimation theory. The compression of real underwater acoustic sensor network (UWASN) data is applied to verify the theoretical bounds derived in this paper. |
topic |
Compressive sensing random noise probability of error theoretical performance bounds underwater acoustic sensor networks |
url |
https://ieeexplore.ieee.org/document/8703376/ |
work_keys_str_mv |
AT junjiechen informationtheoreticboundsforsparsereconstructioninrandomnoise AT fangqizhu informationtheoreticboundsforsparsereconstructioninrandomnoise AT qilianliang informationtheoreticboundsforsparsereconstructioninrandomnoise |
_version_ |
1724188948400439296 |