2020 IEEE International Symposium on Information Theory (ISIT)最新文献

A Novel B-MAP Proxy for Greedy Sparse Signal Recovery Algorithms 一种新的B-MAP代理贪婪稀疏信号恢复算法

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174022

Jeongmin Chae, Songnam Hong

{"title":"A Novel B-MAP Proxy for Greedy Sparse Signal Recovery Algorithms","authors":"Jeongmin Chae, Songnam Hong","doi":"10.1109/ISIT44484.2020.9174022","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174022","url":null,"abstract":"We propose a novel greedy algorithm to recover a sparse signal from a small number of noisy measurements. In the proposed method, a new support index is identified for each iteration, based on bit-wise maximum a posteriori (B-MAP) detection. This approach is an optimal in the sense of detecting one of the remaining support indices, provided that all the indices during the previous iterations are perfectly recovered. Unfortunately, the exact computation of B-MAP detection is not practical since it requires a heavy marginalization of a highdimensional sparse vector to compute a posteriori probability of each remaining support. Our major contribution is to present a good proxy, named B-MAP proxy, on the a posteriori probability. The proposed proxy is easily evaluated only using vector correlations as in popular orthogonal matching pursuit (OMP) and accurate enough to represent a relative ordering on the probabilities. Via simulations, we demonstrate that the proposed greedy algorithm yields a higher recovery accuracy than the existing benchmark methods as OMP and MAP-OMP, having the same computational complexity.A full version of this paper is accessible at: https://arxiv.org/abs/1910.12512/","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"297 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115135506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Coding for Efficient DNA Synthesis 高效DNA合成编码

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174272

A. Lenz, Yi Liu, Cyrus Rashtchian, P. Siegel, A. Wachter-Zeh, Eitan Yaakobi

引用次数: 16

Classical Mechanism is Optimal in Classical-Quantum Differentially Private Mechanisms 经典机制在经典量子微分私有机制中是最优的

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174484

Yuuya Yoshida, Masahito Hayashi

引用次数: 5

Discrete Optimal Reconstruction Distributions for Itakura-Saito Distortion Measure Itakura-Saito失真测度的离散最优重构分布

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174352

Kazuho Watanabe

引用次数: 0

Interference Management without CSIT: A Broadcast Approach 无CSIT干扰管理:一种广播方法

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174000

Maha Zohdy, A. Tajer, S. Shamai

{"title":"Interference Management without CSIT: A Broadcast Approach","authors":"Maha Zohdy, A. Tajer, S. Shamai","doi":"10.1109/ISIT44484.2020.9174000","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174000","url":null,"abstract":"Effective interference management in the multiuser interference channel strongly hinges on the availability of the channel state information at the transmitters (CSIT). In a broad range of emerging large-scale and distributed networks (e.g., the Internet of Things), however, acquiring the CSIT is prohibitive, due to the extensive information exchange that it imposes. In such circumstances, as a result, the interference management approaches that rely on the CSIT lose their effectiveness. This paper focuses on the two-user interference channel, and proposes a broadcast approach to interference management. Its hallmark is that the transmitters, unlike the receivers, are completely oblivious to instantaneous channel states. Each transmitter splits its message into multiple superimposed encoded information layers, where each layer is adapted to a given possible state for the combined states of all channels. Depending on the relative strengths of the direct and interfering channels, each receiver opportunistically decodes a subset of the received layers from both transmitters. An average achievable rate region is delineated serving as an inner bound on the average capacity region of the Gaussian interference channel in the absence of CSIT. Finally, it characterizes the gap between the achievable average sum-rate and the sum-rate capacity with the full CSIT in the asymptote of high signal-to-noise ratio. Numerical evaluations show that the cost of lacking CSIT is often insignificant.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115339513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Bursty Wireless Networks of Bounded Capacity 有限容量的突发无线网络

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174034

Grace Villacrés, T. Koch, G. Vazquez-Vilar

引用次数: 0

On the Algorithmic Computability of Achievability and Converse: ϵ-Capacity of Compound Channels and Asymptotic Bounds of Error-Correcting Codes 复合信道的可达性和逆:ϵ-Capacity的算法可计算性及纠错码的渐近界

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174342

H. Boche, R. Schaefer, H. Poor

{"title":"On the Algorithmic Computability of Achievability and Converse: ϵ-Capacity of Compound Channels and Asymptotic Bounds of Error-Correcting Codes","authors":"H. Boche, R. Schaefer, H. Poor","doi":"10.1109/ISIT44484.2020.9174342","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174342","url":null,"abstract":"A coding theorem consists of two parts: achievability and converse which establish lower and upper bounds on the capacity. This paper analyzes these bounds from a fundamental, algorithmic point of view by studying whether or not such bounds can be computed algorithmically in principle (without putting any constraints on the computational complexity of such algorithms). For this purpose, the concept of Turing machines is used which provides the fundamental performance limits of digital computers. To this end, computable continuous functions are studied and properties of computable sequences of such functions are identified. Subsequently, these findings are exemplarily applied to two different open problems. The first one is the ϵ-capacity of compound channels which is unknown to date. It is studied whether or not the ϵ-capacity can be algorithmically computed and it is shown that there is no computable characterization of the difference between computable upper and lower bounds possible. Thus, computable sharp lower and upper bounds on the ϵ-capacity of computable compound channels cannot exist. The crucial consequence is that the ϵ-capacity cannot be characterized by a finite-letter entropic expression. The second application involves asymptotic bounds for error-correcting codes which is a long-standing open problem in coding theory. Only lower and upper bounds are known which are not sharp. It is conjectured that the asymptotic bound is indeed a non-computable function which would then imply with the previous findings that it is impossible to find computable lower and upper bounds that are asymptotically tight.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122411287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Rate-Diversity Optimal Multiblock Space-Time Codes via Sum-Rank Codes 基于和秩码的速率分集优化多块空时码

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174329

Mohannad Shehadeh, F. Kschischang

引用次数: 13

Multi-Cast Channels with Hierarchical Flow 具有分层流的多播通道

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174439

Jonathan Ponniah, Liang-Liang Xie

引用次数: 0

Mechanisms for Hiding Sensitive Genotypes with Information-Theoretic Privacy 利用信息论隐私隐藏敏感基因型的机制

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174492

Fangwei Ye, Hyunghoon Cho, S. Rouayheb

引用次数: 6