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

2015 IEEE Information Theory Workshop - Fall (ITW)最新文献

筛选
英文 中文
How many users are needed for non-trivial performance of random beamforming in highly-directional mm-wave MIMO downlink? 在高方向毫米波MIMO下行链路中，随机波束形成的卓越性能需要多少用户?
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-10-01 DOI: 10.1109/ITWF.2015.7360772
Gilwon Lee, Y. Sung, Junyeong Seo
{"title":"How many users are needed for non-trivial performance of random beamforming in highly-directional mm-wave MIMO downlink?","authors":"Gilwon Lee, Y. Sung, Junyeong Seo","doi":"10.1109/ITWF.2015.7360772","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360772","url":null,"abstract":"In this paper, the multi-user (MU) gain and the impact of training are investigated for random beamforming (RBF) in highly-directional millimeter-wave (mm-wave) MU multiple-input multiple-output (MIMO) downlink which is considered as one of the major technological thrusts for 5G communications. To do so, the uniform random line-of-sight (UR-LoS) channel model suitable for highly-directional mm-wave radio propagation channels is adopted. Based on the UR-LOS channel model, the performance of RBF and the MU gain in mm-wave MIMO systems are analyzed. It is shown that there exists a transition point on the number of users relative to the number of transmit antennas for non-trivial performance of the RBF scheme. Furthermore, in case of training, the number of training beams relative to the number of antennas required for asymptotically good performance of the RBF scheme is specified when the number of users relative to the number of antennas is given. The provided results in this paper yields insights into the MU gain with partial CSI and the amount of required training in highly-directional mm-wave channels.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123730436","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}
引用次数: 4
Strong coordination over multi-hop line networks 多跳线路网络的强协调性
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-10-01 DOI: 10.1109/ITWF.2015.7360761
B. Vellambi, J. Kliewer, M. Bloch
{"title":"Strong coordination over multi-hop line networks","authors":"B. Vellambi, J. Kliewer, M. Bloch","doi":"10.1109/ITWF.2015.7360761","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360761","url":null,"abstract":"We analyze the problem of strong coordination over a multi-hop line network where the node initiating the coordination is a terminal network node. We provide a characterization of the capacity region when the initiating node possesses unlimited local randomness and intermediate nodes operate under a functional regime. In this regime, next-hop messages are created only using common randomness and previous-hop incoming messages, i.e., local randomness at intermediate nodes is only used for generating actions.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132848510","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}
引用次数: 18
Strategic compression and transmission of information 战略性地压缩和传递信息
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-10-01 DOI: 10.1109/ITWF.2015.7360767
E. Akyol, Cédric Langbort, T. Başar
{"title":"Strategic compression and transmission of information","authors":"E. Akyol, Cédric Langbort, T. Başar","doi":"10.1109/ITWF.2015.7360767","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360767","url":null,"abstract":"This paper considers the problem of communication in the context of strategic information transfer (SIT) concept of Crawford and Sobel in economics. SIT is different from the conventional communication paradigms since it involves different objectives for the encoder and the decoder, which are aware of this mismatch and act accordingly. This leads to a game whose equilibrium solutions are studied here. We model the problem as a Stackelberg game-as opposed to the Nash model used in prior work in economics- where the encoder is the leader and its distortion measure depends on a private information sequence which is non-causally available, only to the encoder; and the decoder is the follower. We consider three problem settings focusing on the quadratic distortion measures and jointly Gaussian source and private information: compression, communication (joint source-channel coding over a scalar Gaussian channel), and the simple equilibrium conditions without any compression or communication. We characterize the fundamental limits -asymptotic in blocklength- of the equilibrium strategies and associated costs for these problems. For the quadratic-Gaussian case, we compute the equilibrium conditions and strategic rate-distortion function explicitly, and show optimality of uncoded communication over an additive white Gaussian channel, paralleling the well-known optimality of uncoded communication in the conventional, “nonstrategic” communication setting.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116749978","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}
引用次数: 18
On the energy-delay tradeoff in lossy network communications 损耗网络通信中的能量延迟权衡
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-10-01 DOI: 10.1109/ITWF.2015.7360778
Lei Yu, Houqiang Li, Weiping Li, Zixiang Xiong, A. Høst-Madsen
{"title":"On the energy-delay tradeoff in lossy network communications","authors":"Lei Yu, Houqiang Li, Weiping Li, Zixiang Xiong, A. Høst-Madsen","doi":"10.1109/ITWF.2015.7360778","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360778","url":null,"abstract":"This work investigates the energy-delay tradeoff in real-time network communication systems with ARQ, where energy is measured by power and energy per bit, respectively. We consider the lossy communication case with a finite buffer size, where each block is allowed to be retransmitted under a time constraint. We apply finite blocklength results of channel coding into our system. By adaptively optimizing the blocklength, coding rate, power allocation, and maximum number of retransmissions according to the queue state, we algorithmically achieve the optimal energy-delay tradeoff. We also lower and upper bound the optimal energy-delay function in order to study its asymptotic behavior as the delay and buffer size go to infinity, showing consistency with existing result. That is: the energy per bit approaches the minimum of -1.59 dB as the delay goes to infinity and power approaches zero. We observe that the power increases very rapidly when delay moves away from infinity, meaning that it is very hard to achieve the -1.59 dB limit in practice.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116613782","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
Optimum one-bit quantization 最佳的位量化
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-10-01 DOI: 10.1109/ITWF.2015.7360795
G. Alirezaei, R. Mathar
{"title":"Optimum one-bit quantization","authors":"G. Alirezaei, R. Mathar","doi":"10.1109/ITWF.2015.7360795","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360795","url":null,"abstract":"This paper deals with discrete input one-bit output quantization. A discrete input signal is subject to additive noise and is then quantized to zero or one by comparison with a threshold q. For finitely many fixed support points and fixed threshold q we first determine the mutual information of this channel. The capacity-achieving input distribution is shown to be concentrated on merely two extreme support points. Furthermore, an elegant representations of the corresponding probabilities is found. Finally, we set out to determine the optimum threshold q, which is an extremely hard problem. By means of graphical representations a completely different behavior of the objective function is revealed, depending on the choice of parameters and the noise distribution.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"668 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115749158","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}
引用次数: 12
Source identification and compression of mixture data from finite observations 源识别和压缩混合数据从有限的观测
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-10-01 DOI: 10.1109/ITWF.2015.7360728
A. Abdi, F. Fekri
{"title":"Source identification and compression of mixture data from finite observations","authors":"A. Abdi, F. Fekri","doi":"10.1109/ITWF.2015.7360728","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360728","url":null,"abstract":"We consider the problem of the identification of a mixture of ergodic stationary sources from a limited number of finite-length observations of a mixture. We propose an algorithm based on Bayesian Information Criterion and Expectation Maximization to identify the sources' models and estimate the mixture parameters. Based on this algorithm, the sources' distributions can be computed and used for nearly optimal memory-assisted coding of the sequences generated by the mixture. Further, we provide upper and lower bounds on the entropy of the mixture source and show that it converges to the upper bound as the length of the sequences increases and derive the convergence rate for the per-symbol entropy of the mixture of finite memory sources.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114777485","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
New construction of asymptotically optimal optical orthogonal codes 渐近最优光学正交码的新构造
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-10-01 DOI: 10.1109/ITWF.2015.7360748
Jin-Ho Chung, Kyeongcheol Yang
{"title":"New construction of asymptotically optimal optical orthogonal codes","authors":"Jin-Ho Chung, Kyeongcheol Yang","doi":"10.1109/ITWF.2015.7360748","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360748","url":null,"abstract":"An optical orthogonal code (OOC) of length N is a set of {0, 1}-sequences of length N, all of which have a constant weight. It is employed as a spreading code in optical communication systems, where 1 means signal `on' and 0 signal `off.' In this paper, we present a generic construction of OOCs of length (q-1)N from an OOC of length N, where q is a prime power with gcd(q -1,N) = 1. This construction can be applied to any OOCs with maximum correlation value 1 and weight less than or equal to q. As a result, a new family of asymptotically optimal OOCs with respect to the Johnson bound can be obtained from an optimal OOC with maximum correlation value 1.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123783571","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
Network combination operations preserving the sufficiency of linear network codes 保持线性网络码充分性的网络组合运算
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-10-01 DOI: 10.1109/ITWF.2015.7360731
Congduan Li, S. Weber, J. Walsh
{"title":"Network combination operations preserving the sufficiency of linear network codes","authors":"Congduan Li, S. Weber, J. Walsh","doi":"10.1109/ITWF.2015.7360731","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360731","url":null,"abstract":"Operations that combine smaller networks into a larger network in a manner such that the rate region of the larger network can be directly obtained from the associated rate regions of the smaller networks are defined and presented. The operations are selected to also have the property that the sufficiency of classes of linear network codes and the tightness of the Shannon (polymatroid) outer bound are preserved in the combination. Four such operations are defined, and the classes of linear codes considered include both scalar and vector codes. It is demonstrated that these operations enable one to obtain rate regions for networks of arbitrary size, and to also determine if some classes of linear codes are sufficient and/or the Shannon outer bound bound is tight for these networks.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122951160","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
A lower bound on the per soliton capacity of the nonlinear optical fibre channel 非线性光纤通道单孤子容量的下界
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-08-19 DOI: 10.1109/ITWF.2015.7360743
N. Shevchenko, J. Prilepsky, S. Derevyanko, A. Alvarado, P. Bayvel, S. Turitsyn
{"title":"A lower bound on the per soliton capacity of the nonlinear optical fibre channel","authors":"N. Shevchenko, J. Prilepsky, S. Derevyanko, A. Alvarado, P. Bayvel, S. Turitsyn","doi":"10.1109/ITWF.2015.7360743","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360743","url":null,"abstract":"A closed-form expression for a lower bound on the per soliton capacity of the nonlinear optical fibre channel in the presence of (optical) amplifier spontaneous emission (ASE) noise is derived. This bound is based on a non-Gaussian conditional probability density function for the soliton amplitude jitter induced by the ASE noise and is proven to grow logarithmically as the signal-to-noise ratio increases.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128027386","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}
引用次数: 22
Joint source-channel coding for broadcast channel with cooperating receivers 具有协作接收器的广播信道联合源信道编码
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-08-17 DOI: 10.1109/ITWF.2015.7360754
Sajjad Bahrami, Behrooz Razeghi, Mostafa Monemizadeh, G. Hodtani
{"title":"Joint source-channel coding for broadcast channel with cooperating receivers","authors":"Sajjad Bahrami, Behrooz Razeghi, Mostafa Monemizadeh, G. Hodtani","doi":"10.1109/ITWF.2015.7360754","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360754","url":null,"abstract":"It is known that, as opposed to point-to-point channel, separate source and channel coding is not optimal in general for sending correlated sources over multiuser channels. In some works joint source-channel coding has been investigated for some certain multiuser channels, e.g., multiple access channel (MAC) and broadcast channel (BC). In this paper, we obtain a sufficient condition for transmitting arbitrarily correlated sources over a discrete memoryless BC with cooperating receivers, where the receivers are allowed to exchange messages via a pair of noisy cooperative links. It is seen that our result is a general form of previous ones and includes them as its special cases.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116028278","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
首页 上一页 下一页 尾页
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学术官方微信