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

2010 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Entropy and the hyperplane conjecture in convex geometry 凸几何中的熵与超平面猜想
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513619
S. Bobkov, M. Madiman
{"title":"Entropy and the hyperplane conjecture in convex geometry","authors":"S. Bobkov, M. Madiman","doi":"10.1109/ISIT.2010.5513619","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513619","url":null,"abstract":"The hyperplane conjecture is a major unsolved problem in high-dimensional convex geometry that has attracted much attention in the geometric and functional analysis literature. It asserts that there exists a universal constant c such that for any convex set K of unit volume in any dimension, there exists a hyperplane H passing through its centroid such that the volume of the section K ∩ H is bounded below by c. A new formulation of this conjecture is given in purely information-theoretic terms. Specifically, the hyperplane conjecture is shown to be equivalent to the assertion that all log-concave probability measures are at most a bounded distance away from Gaussianity, where distance is measured by relative entropy per coordinate. It is also shown that the entropy per coordinate in a log-concave random vector of any dimension with given density at the mode has a range of just 1. Applications, such as a novel reverse entropy power inequality, are mentioned.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"592 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116553140","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}
引用次数: 9
Minimum energy per bit in wireless networks with correlated information 具有相关信息的无线网络中每比特的最小能量
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513713
A. Høst-Madsen
{"title":"Minimum energy per bit in wireless networks with correlated information","authors":"A. Høst-Madsen","doi":"10.1109/ISIT.2010.5513713","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513713","url":null,"abstract":"This paper develops a methodology for finding minimum energy per bit in networks with correlated information, without needing for find bounds on capacity. This is used to derive the minimum energy per bit for certain non-cooperative networks with common messages, and bounds on the minimum energy per bit in a MIMO broadcast channel with correlated information.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125267536","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
Max-min weighted SIR for MIMO downlink system: Optimality and algorithms MIMO下行系统的最大-最小加权SIR:最优性和算法
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513412
Desmond W. H. Cai, Tony Q. S. Quek, C. Tan
{"title":"Max-min weighted SIR for MIMO downlink system: Optimality and algorithms","authors":"Desmond W. H. Cai, Tony Q. S. Quek, C. Tan","doi":"10.1109/ISIT.2010.5513412","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513412","url":null,"abstract":"Designing fast algorithms that adapt the transmit and receive power and beamformers to optimize performance for different users is important in wireless MIMO downlink systems. This paper studies the max-min weighted SIR problem in the downlink, where multiple users are weighted according to priority and are subject to a total power constraint. The difficulty of this nonconvex problem is compounded by the coupling in the transmit and receive beamformers, thereby making it hard to optimize in a distributed fashion. We first show that this problem can be optimally and efficiently computed using a fast algorithm when the channels are rank-one. The optimal transmit and receive power and beamformers are also derived analytically. We then exploit the MIMO uplink-downlink duality to adapt our algorithm to compute a local optimal solution for channels with general rank.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115151161","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
Partial zero-forcing precoding for the interference channel with partially cooperating transmitters 具有部分合作发射机的干扰信道的部分强制零预编码
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513651
S. Hari, Wei Yu
{"title":"Partial zero-forcing precoding for the interference channel with partially cooperating transmitters","authors":"S. Hari, Wei Yu","doi":"10.1109/ISIT.2010.5513651","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513651","url":null,"abstract":"A communication model is considered in which the classic two-user Gaussian interference channel is augmented by noiseless rate-limited digital conferencing links between the transmitters. We propose a partial zero-forcing precoding strategy based on a shared-private rate splitting scheme at the transmitter, in which each transmitter communicates part of its message to the other transmitter, and subsequently partially pre-subtracts the interfering signal using a zero-forcing precoder. We prove an outer bound and show that the proposed strategy is asymptotically sum-capacity achieving in a very weak interference regime, where both the signal-to-noise ratio (SNR) and the interference-to-noise ratio (INR) go to infinity while their ratio in dB scale is kept fixed. In this case, every cooperation bit results in one-bit gain in sum capacity. We also consider a different asymptotic regime where the transmit power constraints and the channel gains are fixed while the noise powers go down to zero. In this case, if one compares with the achievable sum rate with interference treated as noise, one cooperation bit can in fact result in more than one-bit gain in achievable sum rate.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127705116","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}
引用次数: 9
On Gaussian MIMO broadcast channels with common and private messages 基于高斯MIMO的公共和私有消息广播信道
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513524
E. Ekrem, S. Ulukus
{"title":"On Gaussian MIMO broadcast channels with common and private messages","authors":"E. Ekrem, S. Ulukus","doi":"10.1109/ISIT.2010.5513524","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513524","url":null,"abstract":"We study the Gaussian multiple-input multiple-output (MIMO) broadcast channel with common and private messages. We first obtain an outer bound for the capacity region of the two-user discrete memoryless broadcast channel with common and private messages. We next show that if jointly Gaussian random variables are sufficient to evaluate this outer bound for the Gaussian MIMO broadcast channel, the dirty-paper coding (DPC) region is the capacity region of the Gaussian MIMO broadcast channel with common and private messages. However, we can evaluate only a loosened version of this outer bound, which yields the result that extending the DPC region in the common message rate direction by a fixed amount is an outer bound for the capacity region of the Gaussian MIMO broadcast channel with common and private messages. However, this fixed amount, i.e., the gap, is not finite for all channels. We derive the necessary and sufficient conditions for this gap to be finite.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128118311","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}
引用次数: 7
Algebraic constructions of graph-based nested codes from protographs 基于图形的原生图嵌套代码的代数构造
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513628
C. Kelley, J. Kliewer
{"title":"Algebraic constructions of graph-based nested codes from protographs","authors":"C. Kelley, J. Kliewer","doi":"10.1109/ISIT.2010.5513628","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513628","url":null,"abstract":"Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence of noise, in joint network-channel coding, or in physical-layer secrecy. Whereas nested lattice codes have been proposed recently for continuous-input channels, in this paper we focus on the construction of nested linear codes for joint channel-network coding problems based on algebraic protograph LDPC codes. In particular, over the past few years several constructions of codes have been proposed that are based on random lifts of suitably chosen base graphs. More recently, an algebraic analog of this approach was introduced using the theory of voltage graphs. In this paper we illustrate how these methods can be used in the construction of nested codes from algebraic lifts of graphs.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133165247","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}
引用次数: 14
Secrecy games over the cognitive channel 认知通道上的秘密游戏
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513708
Elizabeth Toher, O. O. Koyluoglu, H. E. Gamal
{"title":"Secrecy games over the cognitive channel","authors":"Elizabeth Toher, O. O. Koyluoglu, H. E. Gamal","doi":"10.1109/ISIT.2010.5513708","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513708","url":null,"abstract":"A secure communication game is considered for the cognitive channel with a confidential primary message, where the primary user is interested in maximizing its secure rate with lowest possible power consumption and the utility of the cognitive user is a weighted sum of the primary secrecy rate and the cognitive rate (corresponds to a spectrum law in favor of the legacy owners of the spectrum). An achievable rate region is derived for the channel with message splitting at the cognitive radio and noise forwarding. The game considers the case with no common message, but shows that even this limited scenario can still be beneficial. The established Nash Equilibrium (NE) shows that the cognitive user trades noise for bits. The results are also interesting in the sense that both users can benefit (by playing the distributed game) compared to their throughput resulting from the non-cooperative scenario.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131860146","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
Algebraic list-decoding on the operator channel 运算符通道上的代数列表解码
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513656
Hessam Mahdavifar, A. Vardy
{"title":"Algebraic list-decoding on the operator channel","authors":"Hessam Mahdavifar, A. Vardy","doi":"10.1109/ISIT.2010.5513656","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513656","url":null,"abstract":"The operator channel was introduced by Koetter and Kschischang as a model of errors and erasures for randomized network coding, in the case where network topology is unknown (the noncoherent case). The input and output of the operator channel are vector subspaces of the ambient space; thus error-correcting codes for this channel are collections of such subspaces. Koetter and Kschischang also constructed a remarkable family of codes for the operator channel. The Koetter-Kschischang codes are similar to Reed-Solomon codes in that codewords are obtained by evaluating certain (linearized) polynomials. In this paper, we consider the problem of list-decoding the Koetter-Kschischang codes on the operator channel. In a sense, we are able to achieve for these codes what Sudan was able to achieve for Reed-Solomon codes. In order to do so, we have to modify and generalize the original Koetter-Kschischang construction in many important respects. The end result is this: for any integer L, our list-L decoder guarantess successful recovery of the message subspace provided the normalized dimension of the error is at most L − L2(L + 1) over 2 R where R is the normalized rate of the code. Just as in the case of Sudan's list-decoding algorithm, this exceeds the previously best-known error-correction radius 1 - R, demonstrated by Koetter and Kschischang, for low rates R.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133383898","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}
引用次数: 38
Fundamental rate-reliability-complexity limits in outage limited MIMO communications 中断受限MIMO通信中的基本速率-可靠性-复杂性限制
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513479
P. Elia, J. Jaldén
{"title":"Fundamental rate-reliability-complexity limits in outage limited MIMO communications","authors":"P. Elia, J. Jaldén","doi":"10.1109/ISIT.2010.5513479","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513479","url":null,"abstract":"The work establishes fundamental limits between rate, reliability and computational complexity, for the general setting of outage-limited MIMO communications. In the high-SNR regime, the limits are optimized over all encoders, all decoders, and all complexity regulating policies. The work then proceeds to explicitly identify encoder-decoder designs and policies, that meet this optimal tradeoff. In practice, the limits aim to meaningfully quantify different pertinent and interrelated measures, such as the optimal rate-reliability capabilities per unit complexity and power, the optimal diversity gains per complexity costs, or the optimal goodput per flop. Finally the tradeoff's simple nature, renders it useful for insightful comparison of the rate-reliability-complexity capabilities for different encoders-decoders.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133850020","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
Performance analysis of identification system based on order statistics list decoder 基于顺序统计列表解码器的识别系统性能分析
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513690
F. Farhadzadeh, S. Voloshynovskiy, O. Koval
{"title":"Performance analysis of identification system based on order statistics list decoder","authors":"F. Farhadzadeh, S. Voloshynovskiy, O. Koval","doi":"10.1109/ISIT.2010.5513690","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513690","url":null,"abstract":"In this work we advocate an approach for the statistical performance analysis of an identification system. The statistical performance analysis is accomplished for the corresponding probability of miss and false acceptance based on the order statistic list decoding framework.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114437177","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学术官方微信