2012 IEEE International Symposium on Information Theory Proceedings最新文献_第10页

Asymptotic data rates of receive-diversity systems with MMSE estimation and interferers at correlated locations 具有MMSE估计和相关位置干扰的接收分集系统的渐近数据率

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284118

S. Govindasamy

引用次数: 0

Quantum M-ary phase shift keying 量子相移键控

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284252

R. Nair, B. J. Yen, S. Guha, J. Shapiro, S. Pirandola

引用次数: 1

Translation association schemes, poset metrics, and the shape enumerator of codes 翻译关联方案，偏置度量，和代码的形状枚举器

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283005

A. Barg, Marcelo Firer

引用次数: 1

On cooperation in multi-terminal computation and rate distortion 多终端计算的协同与速率畸变

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284662

Milad Sefidgaran, A. Tchamkerten

引用次数: 14

The Bethe approximation of the pattern maximum likelihood distribution 模式最大似然分布的贝特近似

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283654

P. Vontobel

{"title":"The Bethe approximation of the pattern maximum likelihood distribution","authors":"P. Vontobel","doi":"10.1109/ISIT.2012.6283654","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283654","url":null,"abstract":"Among all memoryless source distributions, the pattern maximum likelihood (PML) distribution is the distribution which maximizes the probability that a memoryless source produces a string with a given pattern. Equivalently, the PML distribution maximizes the permanent of a certain non-negative matrix. We reformulate this maximization problem as a double minimization problem of a suitable Gibbs free energy function. Because finding the minimum of this function appears intractable for practically relevant problem sizes, one must look for tractable approximations. One approach is to approximately find a minimum (or at least a local minimum) of the Gibbs free energy function by applying an alternating minimization algorithm where the steps are based on quantities that are obtained by Markov chain Monte Carlo sampling. One can show that this approach is equivalent to an algorithm that was proposed by Orlitsky et al. An alternative approach is to replace the Gibbs free energy function by a tractable approximation like the Bethe free energy function and to apply an alternating minimization algorithm to this function. As it turns out, empirically, this latter approach gives very good approximations to the PML distribution (or at least a locally optimal PML distribution), and, for the same level of accuracy, is two to three orders of magnitude faster than the former approach for practically relevant problem sizes. Moreover, the above free energy framework allows us to simplify some earlier proofs of properties of the PML distribution and to derive some new properties of the PML distribution, along with obtaining similar results for its Bethe approximation.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"33 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":"116903441","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}

引用次数: 27

On emptying a wireless network in minimum time 在最短时间内清空无线网络

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284004

Vangelis Angelakis, A. Ephremides, Qing He, D. Yuan

引用次数: 6

Incentives for cooperative relaying in a simple information-theoretic model 一个简单信息理论模型中合作中继的激励机制

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283971

D. Kalathil, R. Jain

引用次数: 0

Channel modelling of MU-MIMO systems by quaternionic free probability 基于四元数自由概率的MU-MIMO系统信道建模

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284001

R. Müller, Burak Çakmak

引用次数: 10

Degrees of freedom of MIMO X networks: Spatial scale invariance, one-sided decomposability and linear feasibility MIMO X网络的自由度:空间尺度不变性、单侧可分解性和线性可行性

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283728

Hua Sun, Chunhua Geng, Tiangao Gou, S. Jafar

{"title":"Degrees of freedom of MIMO X networks: Spatial scale invariance, one-sided decomposability and linear feasibility","authors":"Hua Sun, Chunhua Geng, Tiangao Gou, S. Jafar","doi":"10.1109/ISIT.2012.6283728","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283728","url":null,"abstract":"We show that an M × N user MIMO X network with A antennas at each node has A (MN/M+N-1) degrees of freedom (DoF), thus settling the spatial scale invariance conjecture (scaling the number of antennas at each node by a constant factor will scale the total DoF by the same factor) for this class of networks. The previously known best general DoF inner bound, inspired by the K user interference channel, was based on the decomposition of every transmitter and receiver into multiple single antenna nodes, transforming the network into an AM × AN user SISO X network. While such a decomposition is DoF optimal for the K user interference channel, a gap remained between the best inner and outer bound for the MIMO X channel. Here we close this gap with the new insight that the MIMO X network is only one-sided decomposable, i.e., either all the transmitters or all the receivers (but not both) can be decomposed by splitting multiple antenna nodes into multiple single antenna nodes without loss of DoF. The result is extended to SIMO and MISO X networks as well and in each case the DoF results satisfy the spatial scale invariance property. In addition, the feasibility of linear interference alignment is investigated based only on spatial beamforming without symbol extensions. Similar to MIMO interference networks, we show that when the problem is improper, it is infeasible.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"17 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":"121772795","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}

引用次数: 33

Synchrony amplification 同步放大

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283540

U. Maurer, Björn Tackmann

{"title":"Synchrony amplification","authors":"U. Maurer, Björn Tackmann","doi":"10.1109/ISIT.2012.6283540","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283540","url":null,"abstract":"Various protocols in the cryptography and distributed systems literature assume some notion of time: One major (but not the only) example are “synchronous” models which assume that a protocol is executed in a well-defined sequence of rounds with round switches that occur (almost) simultaneously at the parties. In many of the considered models, the notion of time is either implicit, or it is closely interweaved with other mechanics of the model such that formally proving even simple statements becomes a tedious task. In this work, we develop an abstract formal model that captures exactly how the availability of clocks with “weak” synchrony guarantees can benefit parties; in particular, we show how - and at what cost - the “synchrony” of clocks can be improved. Proofs in this model are simple and the statements transfer to all models that satisfy the abstraction. The main contribution of this paper is not the actual statements we prove (which mostly verify folklore beliefs), but the formal model that follows the construction paradigm of abstract cryptography and allows to state these proofs in a simple yet rigorous manner. Indeed, the paper is a step towards a treatment of synchronous cryptographic protocols in this constructive sense.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"122 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":"124178370","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