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

2012 IEEE International Symposium on Information Theory Proceedings最新文献

筛选
英文 中文
Minimization of entropy functionals revisited 熵函数的最小化
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283516
I. Csiszár, F. Matús
{"title":"Minimization of entropy functionals revisited","authors":"I. Csiszár, F. Matús","doi":"10.1109/ISIT.2012.6283516","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283516","url":null,"abstract":"Integral functionals based on convex normal integrands are minimized subject to finitely many moment constraints. The integrands are assumed to be strictly convex but not autonomous or differentiable. The effective domain of the value function is described by a modification of the concept of convex core. The minimization is viewed as a primal problem and studied together with a dual one in the framework of convex duality. Main results assume a dual constraint qualification but dispense with the primal constraint qualification. Minimizers and generalized minimizers are explicitly described whenever the primal value is finite. Existence of a generalized dual solution is established whenever the dual value is finite. A generalized Pythagorean identity is presented using Bregman distance and a correction term. Results are applied to minimization of Bregman distances.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115084201","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
The DoF of the K-user interference channel with a cognitive relay 具有认知中继的k用户干扰信道的DoF
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283514
A. Chaaban, A. Sezgin
{"title":"The DoF of the K-user interference channel with a cognitive relay","authors":"A. Chaaban, A. Sezgin","doi":"10.1109/ISIT.2012.6283514","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283514","url":null,"abstract":"It was shown recently that the 2-user interference channel with a cognitive relay (IC-CR) has full degrees of freedom (DoF) almost surely, that is, 2 DoF. The purpose of this work is to check whether the DoF of the K-user IC-CR, consisting of K user pairs and a cognitive relay, follow as a straight forward extension of the 2-user case. As it turns out, this is not the case. The k-user IC-CR is shown to have 2K/3 DoF if K >; 2 for the when the channel is time varying, achievable using interference alignment. Thus, while the basic k-user IC with time varying channel coefficients has 1/2 DoF per user for all K, the k-user IC-CR with varying channels has 1 DoF per user if K = 2 and 2/3 DoF per user if K >; 2. Furthermore, the DoF region of the 3-user IC-CR with constant channels is characterized using interference neutralization, and a new upper bound on the sum-capacity of the 2-user IC-CR is given.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115181718","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
Percolation in directed random geometric graphs 有向随机几何图中的渗透
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284262
Olivier Dousse
{"title":"Percolation in directed random geometric graphs","authors":"Olivier Dousse","doi":"10.1109/ISIT.2012.6284262","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284262","url":null,"abstract":"The connectivity graph of wireless networks, under many models as well as in practice, may contain unidirectional links. The simplifying assumption that such links are useless is often made, mainly because most wireless protocols use per-hop acknowledgments. However, two-way communication between a pair of nodes can be established as soon as there exists paths in both directions between them. Therefore, instead of discarding unidirectional links, one might be interested in studying the strongly connected components of the connectivity graph. In this paper, we look at the percolation phenomenon in some directed random geometric graphs that can be used to model wireless networks. We show that among the nodes that can be reached from the origin, a non-zero fraction can also reach the origin. In other words, the percolation threshold for strong connectivity is equal to the threshold for one-way connectivity.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116029421","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
WOM with retained messages 带有保留消息的口碑
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283490
Lele Wang, Minghai Qin, Eitan Yaakobi, Young-Han Kim, P. Siegel
{"title":"WOM with retained messages","authors":"Lele Wang, Minghai Qin, Eitan Yaakobi, Young-Han Kim, P. Siegel","doi":"10.1109/ISIT.2012.6283490","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283490","url":null,"abstract":"Write-once memory (WOM) is a binary storage medium in which each memory cell is initially in state 0 and can be irreversibly programmed to state 1. This paper studies the problem of writing multiple messages into a WOM. Instead of writing a new message (and obliterating old ones) as in the traditional setup, the user wishes to retain access to some of the previously written messages. The capacity region is studied and code constructions are proposed for three canonical cases.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116117403","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
Linear network coding capacity region of 2-receiver MIMO broadcast packet erasure channels with feedback 带反馈的双接收机MIMO广播包擦除信道的线性网络编码容量区域
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283724
Chih-Chun Wang, D. Love
{"title":"Linear network coding capacity region of 2-receiver MIMO broadcast packet erasure channels with feedback","authors":"Chih-Chun Wang, D. Love","doi":"10.1109/ISIT.2012.6283724","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283724","url":null,"abstract":"This work studies the capacity of the 2-receiver multiple-input/multiple-output (MIMO) broadcast packet erasure channels (PECs) with channel output feedback, which is in contrast with the single-input/single-output setting of the existing works. Motivated by the immense success of linear network coding (LNC) in theory and in practice, this work focuses exclusively on LNC schemes and characterizes the LNC feedback capacity region (R1*, R2*) of 2-receiver MIMO broadcast PECs. A new linear-space-based approach is proposed, which unifies the problems of finding a capacity outer bound and devising the achievability scheme into a single linear programming (LP) problem. Specifically, an LP solver is used to exhaustively search for the LNC scheme(s) with the best possible throughput, the result of which is thus guaranteed to attain the LNC feedback capacity.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116127475","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
Error exponents for Rayleigh fading product MIMO channels 瑞利衰落积MIMO信道的误差指数
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283835
J. Xue, Md. Zahurul I. Sarkar, T. Ratnarajah, C. Zhong
{"title":"Error exponents for Rayleigh fading product MIMO channels","authors":"J. Xue, Md. Zahurul I. Sarkar, T. Ratnarajah, C. Zhong","doi":"10.1109/ISIT.2012.6283835","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283835","url":null,"abstract":"Along with the channel capacity, the error exponent is one of the most important information theoretic measures of reliability, as it sets ultimate bounds on the performance of communication systems employing codes of finite complexity. In this paper, we derive the closed-form expressions for the Gallager's random coding and expurgated error exponents for Rayleigh fading product multiple-input multiple-output (MIMO) channels under the assumption that there is no channel-state information (CSI) at the transmitter and perfect CSI at the receiver. From the derived analytical expressions, we get insight into an elementary tradeoff between the communication reliability and information rate for the Rayleigh fading product MIMO channels. Moreover, we can easily compute the necessary codeword length without the extensive Monte-carlo simulation to achieve predefined error probability at a given rate below the channel capacity. In addition, we derive the exact closed-form expressions for the ergodic capacity and cutoff rate based on easily computable Meijer G-function. The closed-form expressions for the error exponents, ergodic capacity and cutoff rate have also been derived for Rayleigh fading keyhole MIMO channels as the example of special case.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116455328","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}
引用次数: 11
Convergence of generalized linear coordinate-descent message-passing for quadratic optimization 广义线性坐标下降消息传递的二次优化收敛性
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283649
Guoqiang Zhang, R. Heusdens
{"title":"Convergence of generalized linear coordinate-descent message-passing for quadratic optimization","authors":"Guoqiang Zhang, R. Heusdens","doi":"10.1109/ISIT.2012.6283649","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283649","url":null,"abstract":"We study the generalized linear coordinate-descent (GLiCD) algorithm for the quadratic optimization problem. As an extension of the linear coordinate-descent (LiCD) algorithm, the GLiCD algorithm incorporates feedback from last iteration in generating new messages. We show that if the amount of feedback signal from last iteration is above a threshold and the GLiCD algorithm converges, it computes the optimal solution. Based on the result, we further show that if the feedback signal is large enough, the GLiCD algorithm is guaranteed to converge.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122341855","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
Large zero periodic autocorrelation zone of Golay sequences Golay序列的大零周期自相关带
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6282830
G. Gong, F. Huo, Yang Yang
{"title":"Large zero periodic autocorrelation zone of Golay sequences","authors":"G. Gong, F. Huo, Yang Yang","doi":"10.1109/ISIT.2012.6282830","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6282830","url":null,"abstract":"Sequences with good correlation properties have been widely used in modern communications, radar and sonar applications. In this paper, we consider the autocorrelation property of the single binary and quaternary Golay sequences, with special focus on their zero periodic autocorrelation zone. Some examples along with one case of the proof will be given in order to demonstrate this zero periodic autocorrelation zone. This finding on Golay sequences can be explored during synchronization and detection at the receiver end and thus improve the performance of the orthogonal frequency-division multiplexing (OFDM) system where Golay sequences are employed for the peak-to-average power reduction.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122604094","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
Relaxed Gaussian Belief Propagation 松弛高斯信念传播
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283652
Y. El-Kurdi, D. Giannacopoulos, W. Gross
{"title":"Relaxed Gaussian Belief Propagation","authors":"Y. El-Kurdi, D. Giannacopoulos, W. Gross","doi":"10.1109/ISIT.2012.6283652","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283652","url":null,"abstract":"The Gaussian Belief Propagation (GaBP) algorithm executed on Gaussian Markov Random Fields can take a large number of iterations to converge if the inverse covariance matrix of the underlying Gaussian distribution is ill-conditioned and weakly diagonally dominant. Such matrices can arise from many practical problem domains. In this study, we propose a relaxed GaBP algorithm that results in a significant reduction in the number of GaBP iterations (of up to 12.7 times). We also propose a second relaxed GaBP algorithm that avoids the need of determining the relaxation factor a priori which can also achieve comparable reductions in iterations by only setting two basic heuristic measures. We show that the new algorithms can be implemented without any significant increase, over the original GaBP, in both the computational complexity and the memory requirements. We also present detailed experimental results of the new algorithms and demonstrate their effectiveness in achieving significant reductions in the iteration count.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122882334","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}
引用次数: 15
Agreement of a restricted secret key 受限制密钥的协议
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283585
Chung Chan
{"title":"Agreement of a restricted secret key","authors":"Chung Chan","doi":"10.1109/ISIT.2012.6283585","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283585","url":null,"abstract":"A secret key agreement problem is proposed with the additional restriction that the key is a function of a given secret source. An inner bound to the achievable rates, error and secrecy exponents is derived. The maximum key rate strongly achievable with positive exponents is characterized. The result leads to class of admissible restrictions on the key functions that does not diminish the strongly achievable key rate.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"1652 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114049158","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}
引用次数: 10
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书