发布求助
文献互助 智能选刊 最新文献

2019 IEEE Information Theory Workshop (ITW)最新文献

筛选
英文 中文
Stochastic stability of nonlinear dynamical systems under information constraints* 信息约束下非线性动力系统的随机稳定性
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989265
C. Kawan, S. Yüksel
{"title":"Stochastic stability of nonlinear dynamical systems under information constraints*","authors":"C. Kawan, S. Yüksel","doi":"10.1109/ITW44776.2019.8989265","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989265","url":null,"abstract":"We study the following problem: Given a stochastic nonlinear system controlled over a possibly noisy communication channel, what is the largest class of such channels for which there exist coding and control policies so that the closed-loop system is stochastically stable? The stability criterion considered is asymptotic mean stationarity (AMS). We first develop a general method (based on ergodic theory) to derive fundamental lower bounds on the channel capacity necessary for achieving asymptotic mean stationarity. These bounds are consistent, and more refined in comparison, with the bounds obtained earlier via information-theoretic methods. Moreover, our approach is more versatile in view of the models considered and allows for finer lower bounds when the AMS measure is known to admit further properties such as moment constraints.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"209 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115643224","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
Coordination via Shared Randomness 通过共享随机性进行协调
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8988914
Gowtham R. Kurri, V. Prabhakaran
{"title":"Coordination via Shared Randomness","authors":"Gowtham R. Kurri, V. Prabhakaran","doi":"10.1109/ITW44776.2019.8988914","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8988914","url":null,"abstract":"We study a distributed sampling problem where a set of processors want to output correlated sequences of random variables with the help of a coordinator which has access to several independent sources of randomness. Each processor has access to a subset of these sources. When these subsets are pairwise disjoint (individually shared randomness model), we characterize the rate of communication required from the coordinator to the processors over a multicast link. We also give an upper bound on the communication rate for the randomness-on-the-forehead model where each processor observes all but one source of randomness. For the general model, we completely characterize the trade-off region between communication and shared randomness rates when all the processors wish to output the same random sequence.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123176860","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
Mixed Delay Constraints on a Fading C-RAN Uplink 衰落C-RAN上行链路的混合延迟约束
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989156
Homa Nikbakht, M. Wigger, W. Hachem, S. Shamai
{"title":"Mixed Delay Constraints on a Fading C-RAN Uplink","authors":"Homa Nikbakht, M. Wigger, W. Hachem, S. Shamai","doi":"10.1109/ITW44776.2019.8989156","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989156","url":null,"abstract":"A cloud radio access network (C-RAN) is considered where the first hop from the user equipments (UEs) to the basestations (BSs) is modeled by the fading Wyner soft-handoff model. The focus is on mixed-delay constraints where a set of messages (so called “slow” messages) are jointly decoded in the cloud unit (CU), whereas the remaining messages (called “fast” messages) have to be decoded immediately at the BSs. This paper presents inner and outer bounds on the capacity region for such a setup. Moreover, the multiplexing gain region is characterized exactly. The presented results show that for small fronthaul capacity it is beneficial to send both “fast” and “slow” messages. However, when the rate of “fast” messages is already large, then increasing it further, deteriorates the sum-rate of the system. In this regime, the stringent decoding delay on the “fast” messages penalizes the overall performance. Our results indicate that this penalty is larger at moderate SNR than at high SNR and it is also larger for random time-varying fading coefficients than for static ones.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127145917","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}
引用次数: 8
Rate loss in the Gaussian CEO problem 高斯CEO问题中的速率损失
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8988944
V. Kostina
{"title":"Rate loss in the Gaussian CEO problem","authors":"V. Kostina","doi":"10.1109/ITW44776.2019.8988944","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8988944","url":null,"abstract":"We present a characterization of the Gaussian CEO rate region, in which the operational point at each boundary is characterized by one free parameter. That parameter determines the water level. Only those sensors whose observation noise is below that water level need to compress and transmit their data. Using that characterization, we present a simple (suboptimal) achievable region, expressed in terms of the difference between the noisy and the noiseless rate-distortion functions. Using that achievable region, we can explicitly bound the rate loss due to lack of cooperation among the compressors.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116151554","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}
引用次数: 3
Forward Reconciliation for Covert Key Generation 隐蔽密钥生成的前向和解
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989274
I. Kadampot, M. Bloch
{"title":"Forward Reconciliation for Covert Key Generation","authors":"I. Kadampot, M. Bloch","doi":"10.1109/ITW44776.2019.8989274","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989274","url":null,"abstract":"We propose a forward reconciliation algorithm for covert key generation based on pulse-position modulation (PPM) and multilevel coding (MLC) with multistage decoding (MSD). This multilevel scheme not only allows one to concentrate the diffuse information content of the sparse signals used for covertness but also enables the use of independent codes at each level designed for stationary channels. In particular, we show that polar codes offer a low-complexity reconciliation-capacity achieving solution.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130651504","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
A New Family of Constrained Codes with Applications in Data Storage 一类新的约束码及其在数据存储中的应用
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989270
Ahmed Hareedy, R. Calderbank
{"title":"A New Family of Constrained Codes with Applications in Data Storage","authors":"Ahmed Hareedy, R. Calderbank","doi":"10.1109/ITW44776.2019.8989270","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989270","url":null,"abstract":"Line codes make it possible to mitigate interference, to prevent short pulses, and to generate streams of bipolar signals with no direct-current (DC) power content through balancing. They find application in magnetic recording (MR) devices, in Flash devices, and in optical recording devices. This paper introduces a new family of fixed-length, binary constrained codes, named lexicographically-ordered constrained codes (LOCO codes), for bipolar non-return-to-zero signaling. LOCO codes are capacity achieving, the lexicographic indexing enables simple, practical encoding and decoding, and this simplicity is demonstrated through analysis of circuit complexity. Experimental results demonstrate a gain of up to 10% in rate achieved by LOCO codes with respect to practical run-length-limited codes designed for the same purpose. Simulation results suggest that it is possible to achieve channel density gains of about 20% in MR systems by using a LOCO code to encode only the parity bits of a low-density parity-check code before writing.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132430088","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}
引用次数: 2
Achievable Rate-Distortion Region for Robust Distributed Source Coding 鲁棒分布式信源编码的可实现率失真区域
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989299
Arun Padakandla
{"title":"Achievable Rate-Distortion Region for Robust Distributed Source Coding","authors":"Arun Padakandla","doi":"10.1109/ITW44776.2019.8989299","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989299","url":null,"abstract":"We derive a new inner bound to the rate-distortion (RD) region of the robust distributed source coding (RDSC) problem. The derived bound is proven to strictly enlarge the previous known largest for identified examples. This builds on the fixed block-length coding scheme that has been proposed in a series of recent works. Detailed results are available in [1].","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133135776","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
Construction of binary polarization kernels for low complexity window processing 低复杂度窗口处理中二元极化核的构造
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989344
Grigorii Trofimiuk, P. Trifonov
{"title":"Construction of binary polarization kernels for low complexity window processing","authors":"Grigorii Trofimiuk, P. Trifonov","doi":"10.1109/ITW44776.2019.8989344","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989344","url":null,"abstract":"An algorithm for construction of binary polarization kernels of size 16 and 32 with polarization rate greater than 0.5, which admit low complexity processing is proposed. Kernels are obtained by employing such linear transformations of the Arikan matrix, which minimize the complexity of the window processing algorithm, while preserving required rate of polarization. Simulation results show that polar subcodes with obtained kernels can outperform polar codes with Arikan kernel, while having lower decoding complexity.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114832358","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}
引用次数: 6
Improved Storage for Efficient Private Information Retrieval 改进存储，实现高效的私有信息检索
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989262
Karim A. Banawan, Batuhan Arasli, S. Ulukus
{"title":"Improved Storage for Efficient Private Information Retrieval","authors":"Karim A. Banawan, Batuhan Arasli, S. Ulukus","doi":"10.1109/ITW44776.2019.8989262","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989262","url":null,"abstract":"We consider the problem of private information retrieval from N storage- constrained databases. In this problem, a user wishes to retrieve a single message out of M messages (of size L) without revealing any information about the identity of the message to individual databases. Each database stores $mu M L$ symbols, i.e., a $mu$ fraction of the entire library, where $frac{1}{N} leq mu leq 1.$ Our goal is to characterize the optimal tradeoff curve for the storage cost (captured by $mu$) and the normalized download cost $(D / L).$ We show that the download cost can be reduced by employing a hybrid storage scheme that combines MDS coding ideas with uncoded partial replication ideas. When there is no coding, our scheme reduces to Attia-Kumar-Tandon storage scheme, which was initially introduced by Maddah-AliNiesen in the context of the caching problem, and when there is no uncoded partial replication, our scheme reduces to Banawan-Ulukus storage scheme; in general, our scheme outperforms both.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115109881","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}
引用次数: 24
On the Structure of the Capacity Formula for General Finite State Channels with Applications 一般有限状态信道容量公式的结构及其应用
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989035
H. Boche, R. Schaefer, H. Poor
{"title":"On the Structure of the Capacity Formula for General Finite State Channels with Applications","authors":"H. Boche, R. Schaefer, H. Poor","doi":"10.1109/ITW44776.2019.8989035","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989035","url":null,"abstract":"Finite state channels (FSCs) model discrete channels with memory where the channel output depends on the channel input and the actual channel state. The capacity of general FSCs has been established as the limit of a sequence of multi-letter expressions; a corresponding finite-letter characterization is not known to date. In this paper, it is shown that it is indeed not possible to find such a finite-letter entropic characterization for FSCs whose input, output, and state alphabets satisfy |X| $geq2$, |Y| $geq2$, and |${S}$| $geq2$. Further, the algorithmic computability of the capacity of FSCs is studied. To account for this, the concept of a Turing machine is adopted as it provides fundamental performance limits for today’s digital computers. It is shown that the capacity of a FSC is not Banach-Mazur computable and therewith not Turing computable for $|mathcal {X}| geq 2, |mathcal {Y}| geq 2, |S| geq 2$.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129524589","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}
引用次数: 5
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信