2014 IEEE International Symposium on Information Theory最新文献_第4页

Multi-terminal joint transceiver design for MIMO systems with contaminated source and individual power constraint 具有污染源和独立功率约束的MIMO系统多端联合收发器设计

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875402

Yang Liu, T. Li, Xuanxuan Lu

{"title":"Multi-terminal joint transceiver design for MIMO systems with contaminated source and individual power constraint","authors":"Yang Liu, T. Li, Xuanxuan Lu","doi":"10.1109/ISIT.2014.6875402","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875402","url":null,"abstract":"This paper considers optimal transceiver design for a multi-terminal multi-inputmulti-output (MIMO) system, where L sensors wirelessly communicate individually-contaminated observations of the same source to the fusion center. The constraint that each sensor has individual power cap significantly complicates the non-convex optimization problem, and the optimal (linear) precoding and postcoding are not previously known. Using the signal-to-noise-ratio (SNR) as the performance metric, and employing the alternative minimization approach, we decompose the original problem into multiple subproblems that will run iteratively. The key results include the development of a closed-form solution to the optimal postcoder given the precoders, and the development of a closed-form solution for the ε-optimal precoders given the postcoder. The former is achieved via eigenvalue decomposition, and the latter is achieved by bounding the optimal solutions from above and from below, designing a series of fast-converging bisection search, and developing the closed-form analytical solution for each search. The convergence and the complexity of the proposed algorithm is analyzed and simulations are provided to confirm the efficiency of our proposal.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127419756","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

Medium access control game with an enhanced physical-link layer interface 介质访问控制游戏具有增强的物理链路层接口

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875136

Yanru Tang, Tiegang Zhao, Jie Luo

引用次数: 2

Algorithms for computing network coding rate regions via single element extensions of matroids 利用拟阵的单元素扩展计算网络编码率区域的算法

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875245

Jayant Apte, Congduan Li, J. Walsh

引用次数: 19

Compression for similarity identification: Fundamental limits 相似性识别的压缩:基本限制

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6874783

A. Ingber, T. Weissman

引用次数: 5

Generalized binary independent component analysis 广义二元独立分量分析

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875048

Amichai Painsky, Saharon Rosset, M. Feder

{"title":"Generalized binary independent component analysis","authors":"Amichai Painsky, Saharon Rosset, M. Feder","doi":"10.1109/ISIT.2014.6875048","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875048","url":null,"abstract":"Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are as statistically independent as possible from each other. Usually the ICA framework assumes a model according to which the observations are generated (generative function, additive noise). Binary ICA (BICA) is a special case of ICA in which both the observations and the independent components are over the binary field GF(2). In this work we introduce a generalized BICA framework in which an observation vector is decomposed to its independent components (as much as possible) with no prior assumption on the way it was generated. We propose several theorems and show that this NP hard problem can be accurately solved with a branch and bound search tree algorithm, or tightly approximated with a series of linear programs. BICA was shown to have applications in many domains including medical diagnosis, multi-cluster assignment, network tomography and internet resource management. We suggest that BICA also applies in source coding; we argue that instead of generating statistically independent prediction errors, as in predictive coding, an improved encoder shall assemble a vector of observations and apply the generalized BICA on it. This is shown to achieve improved performance at the cost of introducing some time delay (working in batch).","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124285176","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

Group testing for non-uniformly quantized adder channels 非均匀量化加法器信道的群测试

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875254

A. Emad, O. Milenkovic

引用次数: 3

Optimal strategies for dynamic joint source-channel coding with feedback 带反馈的动态联合源信道编码优化策略

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875088

Se Yong Park, T. Javidi, A. Goldsmith

引用次数: 0

Intercepting tokens in cryptographic protocols: The empire strikes back in the clone wars 拦截加密协议中的令牌:帝国在克隆战争中反击

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875089

Özgür Dagdelen, M. Fischlin

{"title":"Intercepting tokens in cryptographic protocols: The empire strikes back in the clone wars","authors":"Özgür Dagdelen, M. Fischlin","doi":"10.1109/ISIT.2014.6875089","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875089","url":null,"abstract":"Achieving information-theoretically secure key exchange between two parties requires some “hardware set-up”, like the possibility to transmit quantum bits. An alternative approach, which recently emerged in the crypto community, is to use tamper-resistant hardware tokens in protocols. However, such tokens need to be transmitted physically between parties, opening up the possibility to attack the actual transfer of the token, possibly in combination with attacks on the digital protocol. We discuss such interception attacks on cryptographic protocols which rely on trustworthy hardware like one-time memory tokens (Goldwasser et al., Crypto 2008). In such attacks the adversary can mount man-in-the-middle attacks and access, or even substitute, transmitted tokens. We show that many of the existing token-based protocols are vulnerable against this kind of attack, which typically lies outside of the previously considered security models. We also give a positive result for protocols remaining secure against such attacks. We present a very efficient protocol for password-based authenticated key exchange based on the weak model of one-time memory tokens. Our protocol only requires four moves, very basic operations, and the sender to send ℓ tokens in the first step for passwords of length ℓ. At the same time we achieve information-theoretic security in Canetti's universal composition framework (FOCS 2001) against adaptive adversaries (assuming reliable erasure), even if the tokens are not guaranteed to be transferred securely, i.e., even if the adversary can read or substitute transmitted tokens.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116907288","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 impact of phase fading on the dirty paper coding channel 相位衰落对脏纸编码信道的影响

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875241

S. Rini, S. Shamai

引用次数: 9

Noisy feedback improves the Gaussian channel reliability function 噪声反馈改进了高斯信道可靠性函数

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875295

M. Burnashev, Hirosuke Yamamoto

引用次数: 12