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

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

筛选
英文 中文
Universality in polytope phase transitions and iterative algorithms 多面体相变的普适性与迭代算法
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283554
M. Bayati, M. Lelarge, A. Montanari
{"title":"Universality in polytope phase transitions and iterative algorithms","authors":"M. Bayati, M. Lelarge, A. Montanari","doi":"10.1109/ISIT.2012.6283554","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283554","url":null,"abstract":"We consider a class of nonlinear mappings FA, N in RN indexed by symmetric random matrices A ϵ RN×N with independent entries. Within spin glass theory, special cases of these mappings correspond to iterating the TAP equations and were studied by Erwin Bolthausen. Within information theory, they are known as `approximate message passing' algorithms. We study the high-dimensional (large N) behavior of the iterates of F for polynomial functions F, and prove that it is universal, i.e. it depends only on the first two moments of the entries of A. As an application, we prove the universality of a certain phase transition arising in polytope geometry and compressed sensing. This solves a conjecture by David Donoho and Jared Tanner.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"48 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":"123908280","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}
引用次数: 35
An innovative approach for analysing rank deficient covariance matrices 一种分析秩缺失协方差矩阵的创新方法
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283987
G. Tucci, Ke Wang
{"title":"An innovative approach for analysing rank deficient covariance matrices","authors":"G. Tucci, Ke Wang","doi":"10.1109/ISIT.2012.6283987","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283987","url":null,"abstract":"The estimation of a covariance matrix from an insufficient amount of data is one of the most common problems in fields as diverse as multivariate statistics, wireless communications, signal processing, biology, learning theory and finance. In [13], a new approach to handle rank deficient covariance matrices was suggested. The main idea was to use dimensionality reduction in conjunction with an average over the Stiefel manifold. In this paper we further continue in this direction and consider a few innovative methods that show considerable improvements with respect to more traditional ones such as diagonal loading. One of the methods is called the Ewens estimator and uses a randomization of the sample covariance matrix over all the permutation matrices with respect to the Ewens measure. The techniques used to attack this problem are broad and run from random matrix theory to combinatorics.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"32 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":"123395989","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
On codes for structured bursts 关于结构化爆发的代码
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284044
L. A. Lastras-Montaño, M. Blaum
{"title":"On codes for structured bursts","authors":"L. A. Lastras-Montaño, M. Blaum","doi":"10.1109/ISIT.2012.6284044","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284044","url":null,"abstract":"We introduce a technique for constructing codes for bursts of errors that have some known structure; for example bursts of length at most b and Hamming weight at most t. This technique is based on modifying existing codes for generic bursts by replacing a portion of their check matrix with a more efficient one, in light of the additional constraints on the burst. We illustrate this procedure by modifying the Fire, Burton and Gilbert codes to address bursts with maximum Hamming weight, bursts with solid errors, or bursts with internal “mini-bursts”. We provide evidence that the redundancy of the codes we construct can be very good through examples, one of which is optimal within the class of cyclic codes.","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":"114219122","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
Optimal family of q-ary codes obtained from a substructure of generalised Hadamard matrices 由广义Hadamard矩阵的子结构得到的最优q元码族
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283038
Carl Bracken, Y. M. Chee, Punarbasu Purkayastha
{"title":"Optimal family of q-ary codes obtained from a substructure of generalised Hadamard matrices","authors":"Carl Bracken, Y. M. Chee, Punarbasu Purkayastha","doi":"10.1109/ISIT.2012.6283038","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283038","url":null,"abstract":"In this article we construct an infinite family of linear error correcting codes over F<sub>q</sub> for any prime power q. The code parameters are [q<sup>2t</sup> + q<sup>t-1</sup> - q<sup>2t-1</sup> - q<sup>t</sup>, 2t+1, q<sup>2t</sup> + q<sup>2t-2</sup> + q<sup>t-1</sup> - 2q<sup>2t-1</sup> - q<sup>t</sup>]<sub>q</sub>, for any positive integer t. This family is a generalisation of the optimal self-complementary binary codes with parameters [2u<sup>2</sup> - u, 2t + 1, u<sup>2</sup> - u]<sub>2</sub>, where u = 2<sup>t-1</sup>. The codes are obtained by considering a submatrix of a specially constructed generalised Hadamard matrix. The optimality of the family is confirmed by using a recently derived generalisation of the Grey-Rankin bound when t >; 1, and the Griesmer bound when t = 1.","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":"114237634","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
Relay-aided interference alignment for MIMO cellular networks MIMO蜂窝网络中继辅助干扰对准
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283997
X. Wang, Yongping Zhang, Philipp Zhang, Xiaotao Ren
{"title":"Relay-aided interference alignment for MIMO cellular networks","authors":"X. Wang, Yongping Zhang, Philipp Zhang, Xiaotao Ren","doi":"10.1109/ISIT.2012.6283997","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283997","url":null,"abstract":"Interference alignment scheme for multiple-in multiple-out (MIMO) cellular networks is discussed in this paper. An enhanced relay-aided interference alignment (eRIA) scheme is proposed. To align the interference, the scaling coefficients at relay is designed carefully and the design criterions of eRIA are given. The achievable degrees of freedom (DoF) of eRIA is derived. Both theoretical analysis and simulation results show that compared with Suh's scheme [8], eRIA can achieve higher DoF and require less time extensions.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"19 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":"116176759","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
Efficient algorithms for calculating Euclidean distance spectra of muliti-user continuous phase modulation systems 多用户连续相位调制系统欧氏距离谱的有效计算算法
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283942
Li Bing, T. Aulin, B. Bai
{"title":"Efficient algorithms for calculating Euclidean distance spectra of muliti-user continuous phase modulation systems","authors":"Li Bing, T. Aulin, B. Bai","doi":"10.1109/ISIT.2012.6283942","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283942","url":null,"abstract":"The performance of maximum likelihood detection of a coded modulation scheme over an additive white Gaussian noise channel can be predicted precisely by its Euclidean distance spectrum. In this paper, three algorithms are developed to generate the Euclidean distance spectra. The first algorithm is an exhaustive tree-search algorithm which is simplified by exploiting the correspondence between a code tree and the trellis. This algorithm is then modified to incorporate the A* algorithm and results in two heuristic algorithms. Moreover, the technique of trellis minimization is further developed for the multi user case and employed to reduce the complexity and memory requirements. Numerical results confirm that the proposed algorithms can generate the distance spectra of all systems with lower complexity relative to previous methods and are particularly suited for multi user CPM systems.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"24 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":"125740372","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}
引用次数: 8
Controlled sensing for sequential multihypothesis testing 序列多假设检验的控制传感
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283841
George K. Atia, V. Veeravalli
{"title":"Controlled sensing for sequential multihypothesis testing","authors":"George K. Atia, V. Veeravalli","doi":"10.1109/ISIT.2012.6283841","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283841","url":null,"abstract":"The problem of controlled sensing for multihypothesis testing is considered. Prior to decision making, a controller sequentially chooses among a set of control actions to shape the quality of the observations. The goal is to design an efficient control policy, a stopping rule and a final decision rule, to minimize the expected stopping time subject to hard constraints on the risks associated with wrong decisions about each hypothesis. We propose a sequential test, which is shown to be asymptotically optimal when the risks are sufficiently small. Optimality is based on a derived lower bound on the minimum expected stopping time of tests in the class of tests satisfying the predefined risk constraints. Furthermore, by viewing the variable-length coding problem as a special case of sequential multihypothesis testing with observation control, we recover the classic result of Burnašev on the expected coding length for variable-length coding over Discrete Memoryless Channels (DMCs) at zero rate.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"16 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":"127906439","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}
引用次数: 13
A random matrix approach to the finite blocklength regime of MIMO fading channels MIMO衰落信道有限块长度的随机矩阵方法
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283838
J. Hoydis, Romain Couillet, P. Piantanida, M. Debbah
{"title":"A random matrix approach to the finite blocklength regime of MIMO fading channels","authors":"J. Hoydis, Romain Couillet, P. Piantanida, M. Debbah","doi":"10.1109/ISIT.2012.6283838","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283838","url":null,"abstract":"This paper provides a novel central limit theorem (CLT) for the information density of the MIMO Rayleigh fading channel under white Gaussian inputs, when the data blocklength n and the number of transmit and receive antennas K and N, respectively, are large but of similar order of magnitude. This CLT is used to derive closed-form upper bounds on the error probability via an input-constrained version of Feinstein's lemma by Polyanskiy et al. and the second-order approximation of the coding rate. Numerical evaluations suggest that the normal approximation is tight for reasonably small values of n, K, N.","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":"131918072","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
Nonparametric decentralized detection based on weighted count kernel 基于加权计数核的非参数去中心化检测
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284201
Jiayao Hu, Yingbin Liang, E. Xing
{"title":"Nonparametric decentralized detection based on weighted count kernel","authors":"Jiayao Hu, Yingbin Liang, E. Xing","doi":"10.1109/ISIT.2012.6284201","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284201","url":null,"abstract":"The nonparametric decentralized detection problem is investigated, in which the joint distribution of the environmental event and the sensors' observations are not known and only a set of training samples are available. The system features rate constraints, i.e., integer bit constraints on sensors' transmissions, different qualities of observations, additional observations to the fusion center, and multi-level tree-structured network. Our study adopts the kernel-based nonparametric approach proposed by Nguyen, Wainwright, and Jordan with the following generalization. A weighted count kernel is introduced so that the corresponding reproducing kernel Hilbert space (RKHS) (over which the fusion center's decision rule is optimized) allows the fusion center's decision rule to count information from sensors and its own observations differently. In order to find the optimal decision rules, our optimization is solved by alternatively and recursively conducting three optimization steps: finding the optimal weight parameters in the weighted count kernel for selecting the best associated RKHS, finding the best optimal decision rule for the fusion center over the identified RKHS, and finding the local decision rules for sensors. Generalization to multilevel tree-structured networks is also discussed. Finally numerical results are provided to demonstrate the performance based on the proposed weighted count kernel.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"31 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":"134162311","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 class of iterated fast decodable space-time codes for 2n Tx antennas 一类用于2n Tx天线的迭代快速可解码空时码
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284039
N. Markin, F. Oggier
{"title":"A class of iterated fast decodable space-time codes for 2n Tx antennas","authors":"N. Markin, F. Oggier","doi":"10.1109/ISIT.2012.6284039","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284039","url":null,"abstract":"We present an iterative construction of algebraic space-time codes. Starting from a division algebra D, we show how to embed it into a larger ring A = A(D) and give conditions for A to be a new division algebra. Starting from a quaternion division algebra D<sub>1</sub>, we thus obtain a sequence D<sub>1</sub> ⊂ D<sub>2</sub> ⊂... of division algebras where D<sub>i</sub> = A(D<sub>i-1</sub>). Each of the D<sub>i</sub> can be used as an underlying structure to build a space-time C<sub>i</sub>. Furthermore, the iteration step is done such that fast-decodability of the original code is preserved. We illustrate our technique by creating an iterative version of the Silver code.","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":"131891862","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
首页 上一页 下一页 尾页
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学术官方微信
小红书