2019 IEEE International Symposium on Information Theory (ISIT)最新文献_第6页

Error Exponents of Parallel Two-way Discrete Memoryless Channels using Variable Length Coding 采用变长编码的并行双向离散无记忆信道的误差指数

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849727

K. Palacio-Baus, Meysam Asadi, N. Devroye

引用次数: 2

Low-degree Pseudo-Boolean Function Recovery Using Codes 使用代码的低次伪布尔函数恢复

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849424

Orhan Ocal, S. Kadhe, K. Ramchandran

引用次数: 4

SPARCs and AMP for Unsourced Random Access 无源随机访问的SPARCs和AMP

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849802

Alexander Fengler, P. Jung, G. Caire

引用次数: 56

Pareto Optimal Schemes in Coded Caching 编码缓存中的Pareto最优方案

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849680

P. VijithKumarK., B. K. Rai, T. Jacob

引用次数: 4

Interactions Between Learning and Broadcasting in Wireless Recommendation Systems 无线推荐系统中学习与广播的交互作用

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849556

Linqi Song, C. Fragouli, D. Shah

引用次数: 7

Towards an Algebraic Network Information Theory: Distributed Lossy Computation of Linear Functions 迈向代数网络信息论:线性函数的分布有损计算

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849363

S. Lim, Chen Feng, A. Pastore, B. Nazer, M. Gastpar

引用次数: 5

Constrained de Bruijn Codes and their Applications 约束de Bruijn码及其应用

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849237

Y. M. Chee, T. Etzion, H. M. Kiah, Van Khu Vu, Eitan Yaakobi

引用次数: 4

Explicit constructions of MSR codes for the rack-aware storage model 机架感知存储模型的MSR代码的显式构造

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849278

Zitan Chen, A. Barg

引用次数: 0

Sparse Covariance Estimation from Quadratic Measurements: A Precise Analysis 二次测量的稀疏协方差估计:一个精确的分析

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849405

Ehsan Abbasi, Fariborz Salehi, B. Hassibi

{"title":"Sparse Covariance Estimation from Quadratic Measurements: A Precise Analysis","authors":"Ehsan Abbasi, Fariborz Salehi, B. Hassibi","doi":"10.1109/ISIT.2019.8849405","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849405","url":null,"abstract":"We study the problem of estimating a high-dimensional sparse covariance matrix, Σ0, from a finite number of quadratic measurements, i.e., measurements ${text{a}}_i^T{Sigma _0}{{text{a}}_i}$ which are quadratic forms in the measurement vectors ai resulting from the covariance matrix, Σ0. Such a problem arises in applications where we can only make energy measurements of the underlying random variables. We study a simple LASSO-like convex recovery algorithm which involves a squared 2-norm (to match the covariance estimate to the measurements), plus a regularization term (that penalizes the ℓ1−norm of the non-diagonal entries of Σ0 to enforce sparsity). When the measurement vectors are i.i.d. Gaussian, we obtain the precise error performance of the algorithm (accurately determining the estimation error in any metric, e.g., 2-norm, operator norm, etc.) as a function of the number of measurements and the underlying distribution of Σ0. In particular, in the noiseless case we determine the necessary and sufficient number of measurements required to perfectly recover Σ0 as a function of its sparsity. Our results rely on a novel comparison lemma which relates a convex optimization problem with \"quadratic Gaussian\" measurements to one which has i.i.d. Gaussian measurements.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"15 1","pages":"2074-2078"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76260610","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

Energy efficient random access for the quasi-static fading MAC 准静态衰落MAC的节能随机存取

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849288

S. Kowshik, K. Andreev, A. Frolov, Yury Polyanskiy

{"title":"Energy efficient random access for the quasi-static fading MAC","authors":"S. Kowshik, K. Andreev, A. Frolov, Yury Polyanskiy","doi":"10.1109/ISIT.2019.8849288","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849288","url":null,"abstract":"We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically, we extend the concept of random-access code introduced at ISIT’2017 by one of the authors to the practically more relevant case of the AWGN multiple-access channel (MAC) subject to Rayleigh fading, unknown to the decoder. We derive bounds on the fundamental limits of random-access coding and propose an alternating belief-propagation scheme as a candidate practical solution. The latter’s performance was found to be surprisingly close to the information-theoretic bounds. It is curious, thus, that while fading significantly increases the minimal required energy-per-bit Eb/N0 (from about 0-2 dB to about 8-11 dB), it appears that it is much easier to attain the optimal performance over the fading channel with a practical scheme by leveraging the inherent randomization introduced by the channel. Finally, we mention that while a number of candidate solutions (MUSA, SCMA, RSMA, etc.) are being discussed for the 5G, the information-theoretic analysis and benchmarking has not been attempted before (in part due to lack of common random-access model). Our work may be seen as a step towards unifying performance comparisons of these methods.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"67 1","pages":"2768-2772"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83585744","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}

引用次数: 46