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

2007 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
On the Optimality of Lattice Coding and Decoding in Multiple Access Channels 多址信道中点阵编码和解码的最优性
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557228
Young-Han Nam, H. E. Gamal
{"title":"On the Optimality of Lattice Coding and Decoding in Multiple Access Channels","authors":"Young-Han Nam, H. E. Gamal","doi":"10.1109/ISIT.2007.4557228","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557228","url":null,"abstract":"In this paper, we consider a class of multiple access lattice space-time coding and decoding schemes. We prove an extended version of the Minkowski-Hlawka theorem, utilizing independent Loeliger ensembles. Applying this extension, we prove that lattice coding and decoding achieves the optimal diversity-multiplexing tradeoff of multiple access channels.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"293 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123178795","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}
引用次数: 28
Fast Decoding of Rate-Compatible Punctured LDPC Codes 速率兼容穿孔LDPC码的快速解码
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557229
Jini Kwon, D. Klinc, J. Ha, S. McLaughlin
{"title":"Fast Decoding of Rate-Compatible Punctured LDPC Codes","authors":"Jini Kwon, D. Klinc, J. Ha, S. McLaughlin","doi":"10.1109/ISIT.2007.4557229","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557229","url":null,"abstract":"While rate-compatible punctured low-density parity-check (RCP-LDPC) codes offer high flexibility in terms of code rate at a relatively low cost in implementation complexity, they are reported to require more decoding iterations than unpunctured LDPC codes. In this paper1 we consider layered belief propagation decoding and propose efficient check node layering that significantly accelerates the decoding convergence of RCP-LDPC codes. We show that the proposed layering outperforms both random layering and conventional BP decoding. The performance improvements become more distinctive at high rates and they come at no additional implementation cost.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121809729","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
Multimode Coding for Generating Conservative Arrays for Holographic Storage 全息存储中产生保守阵列的多模编码
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557383
Yongguang Zhu, I. Fair
{"title":"Multimode Coding for Generating Conservative Arrays for Holographic Storage","authors":"Yongguang Zhu, I. Fair","doi":"10.1109/ISIT.2007.4557383","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557383","url":null,"abstract":"In order to minimize the interference between adjacent data arrays recorded in the same holographic volume, the patterns of 1's and 0's in each data array should be t- conservative, i.e., for a prescribed integer t, there should be at least t transitions of the form 1 rarr 0 or 0 rarr 1 in each column and row of the data array. In this paper, we present extensions to the algorithm proposed by Vardy et al. for encoding unconstrained binary arrays into t-conservative arrays. We set our work in the context of multimode codes. The multimode encoding process involves adding each input array to a set of control arrays to form a selection set, and selecting one that \"best\" satisfies the predefined selection criterion. We propose a new approach for construction of the control arrays, and demonstrate how the algorithm proposed by Vardy et al. is a special case of this approach. We also propose a novel approach for embedding the index of the control arrays into the encoded array, and propose alternatives for array selection.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115827599","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
Re-examining Probabilistic Versus Deterministic Key Management 重新审视概率与确定性密钥管理
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557608
Dahai Xu, Jianwei Huang, Jeffrey S. Dwoskin, M. Chiang, R. Lee
{"title":"Re-examining Probabilistic Versus Deterministic Key Management","authors":"Dahai Xu, Jianwei Huang, Jeffrey S. Dwoskin, M. Chiang, R. Lee","doi":"10.1109/ISIT.2007.4557608","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557608","url":null,"abstract":"It is widely believed that although being more complex, a probabilistic key predistribution scheme is much more resilient against node capture than a deterministic one in lightweight wireless ad hoc networks. Backed up by the surprisingly large successful attack probabilities computed in this paper, we show that the probabilistic approaches have only limited performance advantages over deterministic approaches. We first consider a static network scenario as originally considered in the seminal paper by Eschenauer and Gligor [1], where any node capture happens after the establishment of all pairwise links, and show that the deterministic approach can achieve a performance as good as the probabilistic one. Furthermore in a mobile network, the probabilistic key management as described in [1] can lead to a successful attack probability of one order of magnitude larger than the one in a static network.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120941594","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}
引用次数: 21
On Convergence Properties of Message-Passing Estimation Algorithms 消息传递估计算法的收敛性
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557604
J. Dauwels
{"title":"On Convergence Properties of Message-Passing Estimation Algorithms","authors":"J. Dauwels","doi":"10.1109/ISIT.2007.4557604","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557604","url":null,"abstract":"The convergence and stability properties of several message-passing estimation algorithms are investigated, i.e., (generalized) expectation maximization, gradient methods, and coordinate ascent/descent. Results are presented for cycle-free and cyclic factor graphs.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127313949","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
Capacity of Coordinated Actions 协调行动的能力
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557184
T. Cover, H. Permuter
{"title":"Capacity of Coordinated Actions","authors":"T. Cover, H. Permuter","doi":"10.1109/ISIT.2007.4557184","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557184","url":null,"abstract":"We propose the problem of coordinating action over many nodes by distributed communication. The idea is to switch the emphasis from exchanging information to setting up cooperative action. Examples are given. We solve most 3-node problems but one remains open.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123295801","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}
引用次数: 19
Shannon Transform of Certain Matrix Products 若干矩阵积的香农变换
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557458
N. Letzepis, A. Grant
{"title":"Shannon Transform of Certain Matrix Products","authors":"N. Letzepis, A. Grant","doi":"10.1109/ISIT.2007.4557458","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557458","url":null,"abstract":"We derive a closed form expression for the Shannon transform of the product of two arbitrary positive semidefinite random matrices, where at least one of the matrices is unitary invariant. In principle, S-transforms could be directly applied in this scenario, however in many cases of interest this approach leads to an intractable expression. Our alternative approach, based on hypergeometric functions, leads to a tractable asymptotic expression. This result is validated for finite size matrices using Monte Carlo simulations.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123334161","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
The Best Binary Linear Block Codes for Scalar Source-Channel Coding 用于标量源信道编码的最佳二进制线性分组码
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557313
Ilju Na, D. Neuhoff
{"title":"The Best Binary Linear Block Codes for Scalar Source-Channel Coding","authors":"Ilju Na, D. Neuhoff","doi":"10.1109/ISIT.2007.4557313","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557313","url":null,"abstract":"This paper finds the best binary linear block codes to use when an IID uniform source is uniform scalar quantized for transmission over a binary symmetric channel, with performance measured by mean squared error (MSE). The best code is found by optimizing the source-channel rate allocation, the linear code, and the assignment of its codewords to quantization indices. A table shows the maximum attained SNR, together with a code that achieves it, for a range of channel transition probabilities and transmission rates. When optimized, the performance of such systems comes within 1 ~ 2 dB of that of the best nonlinear codes found by an iterative algorithm.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125427785","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
Multiuser Limited Feedback for Wireless Multi-Antenna Communication 无线多天线通信的多用户有限反馈
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557520
Kaibin Huang, R. Heath, J. Andrews
{"title":"Multiuser Limited Feedback for Wireless Multi-Antenna Communication","authors":"Kaibin Huang, R. Heath, J. Andrews","doi":"10.1109/ISIT.2007.4557520","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557520","url":null,"abstract":"For a wireless multi-antenna network with a large number of users, the sum capacity scales at most linearly with the number of antennas and double logarithmically the number of users. Achieving this optimal capacity scaling potentially requires feedback of channel state information (CSI) from all users, leading to overflow of the feedback channel. This paper proposes a limited feedback strategy that provides feedback control such that a sum CSI feedback rate constraint is satisfied. It is proved that a wireless multi-antenna network using the proposed limited feedback strategy achieves the optimal capacity scaling for the broadcast channel.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116003651","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
Competitive On-line Linear FIR MMSE Filtering 竞争在线线性FIR MMSE滤波
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557121
Taesup Moon, T. Weissman
{"title":"Competitive On-line Linear FIR MMSE Filtering","authors":"Taesup Moon, T. Weissman","doi":"10.1109/ISIT.2007.4557121","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557121","url":null,"abstract":"We consider the problem of causal estimation, i.e., filtering, of a real-valued signal corrupted by zero mean, i.i.d., real-valued additive noise under the mean square error (MSE) criterion. We build a competitive on-line filtering algorithm whose normalized cumulative MSE, for every bounded underlying signal, is asymptotically as small as the best linear finite-duration impulse response (FIR) filter of order d. We do not assume any stochastic mechanism in generating the underlying signal, and assume only the variance of the noise is known to the filter. The regret of our scheme is shown to decay in the order of O (log n/n), where n is the length of the signal. Moreover, we present a concentration of the average square error of our scheme to that of the best d-th order linear FIR filter. Our analysis combines tools from the problems of universal filtering and competitive on-line regression.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122331944","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
下一页 尾页
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学术官方微信