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

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

筛选
英文 中文
Sample Complexity of the Boolean Multireference Alignment Problem. 布尔多引用对齐问题的样本复杂性。
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2017-06-01 Epub Date: 2017-08-15 DOI: 10.1109/ISIT.2017.8006742
Emmanuel Abbe, João M Pereira, Amit Singer
{"title":"Sample Complexity of the Boolean Multireference Alignment Problem.","authors":"Emmanuel Abbe, João M Pereira, Amit Singer","doi":"10.1109/ISIT.2017.8006742","DOIUrl":"10.1109/ISIT.2017.8006742","url":null,"abstract":"<p><p>The Boolean multireference alignment problem consists in recovering a Boolean signal from multiple shifted and noisy observations. In this paper we obtain an expression for the error exponent of the maximum A posteriori decoder. This expression is used to characterize the number of measurements needed for signal recovery in the low SNR regime, in terms of higher order autocorrelations of the signal. The characterization is explicit for various signal dimensions, such as prime and even dimensions.</p>","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"2017 ","pages":"1316-1320"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5947970/pdf/nihms912110.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"36094672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Chained Kullback-Leibler Divergences. 链Kullback-Leibler散度。
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2016-07-01 Epub Date: 2016-08-11 DOI: 10.1109/ISIT.2016.7541365
Dmitri S Pavlichin, Tsachy Weissman
{"title":"Chained Kullback-Leibler Divergences.","authors":"Dmitri S Pavlichin,&nbsp;Tsachy Weissman","doi":"10.1109/ISIT.2016.7541365","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541365","url":null,"abstract":"<p><p>We define and characterize the \"chained\" Kullback-Leibler divergence min <i><sub>w</sub> D</i>(<i>p</i>‖<i>w</i>) + <i>D</i>(<i>w</i>‖<i>q</i>) minimized over all intermediate distributions <i>w</i> and the analogous <i>k</i>-fold chained K-L divergence min <i>D</i>(<i>p</i>‖<i>w<sub>k</sub></i><sub>-1</sub>) + … + <i>D</i>(<i>w</i><sub>2</sub>‖<i>w</i><sub>1</sub>) + <i>D</i>(<i>w</i><sub>1</sub>‖<i>q</i>) minimized over the entire path (<i>w</i><sub>1</sub>,…,<i>w<sub>k</sub></i><sub>-1</sub>). This quantity arises in a large deviations analysis of a Markov chain on the set of types - the Wright-Fisher model of neutral genetic drift: a population with allele distribution <i>q</i> produces offspring with allele distribution <i>w</i>, which then produce offspring with allele distribution <i>p</i>, and so on. The chained divergences enjoy some of the same properties as the K-L divergence (like joint convexity in the arguments) and appear in <i>k</i>-step versions of some of the same settings as the K-L divergence (like information projections and a conditional limit theorem). We further characterize the optimal <i>k</i>-step \"path\" of distributions appearing in the definition and apply our findings in a large deviations analysis of the Wright-Fisher process. We make a connection to information geometry via the previously studied continuum limit, where the number of steps tends to infinity, and the limiting path is a geodesic in the Fisher information metric. Finally, we offer a thermodynamic interpretation of the chained divergence (as the rate of operation of an appropriately defined Maxwell's demon) and we state some natural extensions and applications (a <i>k</i>-step mutual information and <i>k</i>-step maximum likelihood inference). We release code for computing the objects we study.</p>","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"2016 ","pages":"580-584"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ISIT.2016.7541365","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35545992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Blind multiuser detection using linearly constrained minimum variance filters 使用线性约束最小方差滤波器的盲多用户检测
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-11-07 DOI: 10.1109/ISIT.2002.1023764
Tsung-Hsien Liu
{"title":"Blind multiuser detection using linearly constrained minimum variance filters","authors":"Tsung-Hsien Liu","doi":"10.1109/ISIT.2002.1023764","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023764","url":null,"abstract":"We propose a new blind multiuser detector for the frequency selective multipath channels. The new linearly constrained minimum variance (LCMV) RAKE receiver is an enhancement to the previously published decorrelating RAKE (D-RAKE) receiver. Compared with the D-RAKE receiver, the LCMV-RAKE receiver processes full information of the desired user and is shown by simulations to have lower bit error rates. Furthermore, the LCMV-RAKE receiver is not limited to the quasi-synchronous model, where the maximum delay spread is assumed to be small compared to the symbol duration.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"647 1","pages":"492-"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77029490","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
Iterative table-lookup decoding for a 2-state, rate-1/2, turbo-like code 迭代表查找解码的两状态，速率1/2，涡轮式代码
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-11-07 DOI: 10.1109/ISIT.2002.1023612
P. Massey, D. J. Costello
{"title":"Iterative table-lookup decoding for a 2-state, rate-1/2, turbo-like code","authors":"P. Massey, D. J. Costello","doi":"10.1109/ISIT.2002.1023612","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023612","url":null,"abstract":"This paper introduces a high-speed decoder for parallel-concatenated convolutional codes (PCCCs). The decoder utilizes a method of recursively reading from a set of lookup-tables and storing the data bytes temporarily in memory for later recursions/iterations. The sizes of the lookup-tables can be reasonably small for PCCCs consisting of 2-state constituent encoders. A class of 2-state PCCCs is given that utilizes feedforward-enhancement to achieve excellent bit error rate performance even when decoded with the recursive table-lookup decoder.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"58 1","pages":"340-"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79461038","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
On the stability of certain collision resolution protocols with retransmission diversity 重传分集下某些冲突解决协议的稳定性研究
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-09-12 DOI: 10.1109/ISIT.2002.1023426
G. Dimić, N. Sidiropoulos
{"title":"On the stability of certain collision resolution protocols with retransmission diversity","authors":"G. Dimić, N. Sidiropoulos","doi":"10.1109/ISIT.2002.1023426","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023426","url":null,"abstract":"A class of collision resolution protocols [(B)NDMA] has been introduced for slotted packet multiple access. By providing retransmission diversity of the collided packets, these protocols offer the means to improve upon random splitting-based collision resolution protocols, at a moderate complexity cost. In this paper, we find sufficient conditions for stability of (B)NDMA by using the dominant system approach, developed for stability analysis of finite population slotted ALOHA. We reconsider the steady-state analysis, bypassing the earlier generating function approach, so that we can deal with asymmetry (multirate systems). This yields expressions for throughput and delay per queue. We also generalize BNDMA and the associated stability analysis to multicode systems.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"36 1","pages":"154-"},"PeriodicalIF":0.0,"publicationDate":"2002-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90664763","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
Stability analysis of the turbo decoding algorithm using Max-Log-MAP 基于Max-Log-MAP的turbo译码算法稳定性分析
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-09-12 DOI: 10.1109/ISIT.2002.1023413
Wei-Sheng Wu, Chung-hsuan Wang, M. Chiu, Chi-chao Chao
{"title":"Stability analysis of the turbo decoding algorithm using Max-Log-MAP","authors":"Wei-Sheng Wu, Chung-hsuan Wang, M. Chiu, Chi-chao Chao","doi":"10.1109/ISIT.2002.1023413","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023413","url":null,"abstract":"In this paper we investigate analytically the convergence properties of the iterative turbo decoding with the Max-Log-MAP algorithm for soft-output generation. With respect to the iterative decoding scheme, several equivalent mathematical formulations are derived to facilitate the stability analysis, based on which we show that turbo decoding with Max-Log-MAP has at least one fixed point but is in general suboptimal and may not even converge. Finally, some conditions are given to guarantee the convergence of the iterative turbo decoding.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"16 1","pages":"141-"},"PeriodicalIF":0.0,"publicationDate":"2002-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81754231","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
Downlink-uplink duality and effective bandwidths 下行-上行对偶性和有效带宽
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-09-12 DOI: 10.1109/ISIT.2002.1023324
David Tse, P. Viswanath
{"title":"Downlink-uplink duality and effective bandwidths","authors":"David Tse, P. Viswanath","doi":"10.1109/ISIT.2002.1023324","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023324","url":null,"abstract":"There is an interesting duality between the uplink and downlink beamforming problems. We exhibit this duality and use it to show that effective bandwidth results obtained for the uplink translate into effective bandwidth results for the downlink. This duality has been observed in a variety of seemingly different contexts in the literature.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"25 1","pages":"52-"},"PeriodicalIF":0.0,"publicationDate":"2002-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89709391","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}
引用次数: 62
Minimum probability of error of many-user CDMA without power control 无功率控制的多用户CDMA最小误差概率
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-09-12 DOI: 10.1109/ISIT.2002.1023460
Dongning Guo, S. Verdú
{"title":"Minimum probability of error of many-user CDMA without power control","authors":"Dongning Guo, S. Verdú","doi":"10.1109/ISIT.2002.1023460","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023460","url":null,"abstract":"The minimum-probability-of-error (optimal) detector of multiuser CDMA is shown to be equivalent to a conditional mean estimator which finds the mean value of the stochastic output of a so-called Bayes retrochannel. The equivalence of the Bayes retrochannel to a spin glass allows the optimal bit-error-rate to be determined exactly in the large-system limit by studying macroscopic properties of the spin glass using tools developed in statistical mechanics. It is found that all users, regardless of their individual received energies, enjoy the same multiuser efficiency, which is directly related to the mean-square error of the conditional mean estimator.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"5 1","pages":"188-"},"PeriodicalIF":0.0,"publicationDate":"2002-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81997635","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}
引用次数: 5
Adaptive transmission with channel state uncertainty 信道状态不确定的自适应传输
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-09-12 DOI: 10.1109/ISIT.2002.1023381
L. Lin, R. Yates, P. Spasojevic
{"title":"Adaptive transmission with channel state uncertainty","authors":"L. Lin, R. Yates, P. Spasojevic","doi":"10.1109/ISIT.2002.1023381","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023381","url":null,"abstract":"Based on the concept of information outage, a general framework for optimizing adaptive transmission design with channel state uncertainty is formulated for slow fading channels.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"130 1","pages":"109-"},"PeriodicalIF":0.0,"publicationDate":"2002-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89228610","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
An alternate algorithm for calculating generalized posterior probability and decoding 一种计算广义后验概率和解码的替代算法
Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-09-12 DOI: 10.1109/ISIT.2002.1023610
T. Matsushima, T. K. Matsushima, S. Hirasawa
{"title":"An alternate algorithm for calculating generalized posterior probability and decoding","authors":"T. Matsushima, T. K. Matsushima, S. Hirasawa","doi":"10.1109/ISIT.2002.1023610","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023610","url":null,"abstract":"The accurate and efficient calculation of ordinary and generalized posterior distributions is an important problem in the several research fields such as decoding, AI, statistics and statistical mechanics. The condition of generalized posterior distributions is not given by the deterministic values such as X = x, but by the distributions such as P(X = x) = p. If the condition is P(X = x) = 1 then the generalized posterior distribution is an ordinary posterior distribution. A procedure using the sum of the e-projection 1 vectors is proposed. Since the procedure is suitable for parallel algorithms, an alternate algorithm for calculating generalized posterior distributions on log linear models is given by the procedure. The proposed algorithm works well for codes with short loops.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"92 11 1","pages":"338-"},"PeriodicalIF":0.0,"publicationDate":"2002-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87744537","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
下一页 尾页
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学术官方微信
小红书