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

2008 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
The effect of symbol rate on constrained capacity for linear modulation 符号率对线性调制约束容量的影响
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595156
F. Rusek, Dzevdan Kapetanovic, John B. Anderson
{"title":"The effect of symbol rate on constrained capacity for linear modulation","authors":"F. Rusek, Dzevdan Kapetanovic, John B. Anderson","doi":"10.1109/ISIT.2008.4595156","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595156","url":null,"abstract":"We consider the effect of symbol rate on the constrained capacity of linear modulation with a fixed spectral density. We show that constrained capacity grows with the symbol rate for some modulation pulses but shrinks with others. Sufficient conditions on the pulse are derived for the constrained capacity to be monotonically increasing with faster symbol rate. Most standard pulses fulfill these.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129204651","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
Large deviations analysis of SSMA communication systems with spreading sequences of Markov chains 具有马尔可夫链扩展序列的SSMA通信系统的大偏差分析
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595214
H. Fujisaki
{"title":"Large deviations analysis of SSMA communication systems with spreading sequences of Markov chains","authors":"H. Fujisaki","doi":"10.1109/ISIT.2008.4595214","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595214","url":null,"abstract":"In this report we consider asynchronous spread spectrum multiple access (SSMA) communication systems with spreading sequences of Markov chains. We show that, given phase shifts and time delays, the empirical mean of the multiple access interference (MAI) for such systems satisfies the conditional large deviation principle (LDP) with the convex good rate function. By refinement of the large deviations analysis, we obtain exact asymptotics of bit error probabilities in such systems.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129344211","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
Game theoretic considerations for the Gaussian Multiple Access Channel 高斯多址信道的博弈论考虑
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595446
Vojislav Gajic, B. Rimoldi
{"title":"Game theoretic considerations for the Gaussian Multiple Access Channel","authors":"Vojislav Gajic, B. Rimoldi","doi":"10.1109/ISIT.2008.4595446","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595446","url":null,"abstract":"We study the behavior of users in a classical Additive White Gaussian Noise Multiple Access Channel. We model users as rational entities whose only interest is to maximize their own communication rate, and we model their interaction as a noncooperative one-shot game. The Nash equilibria of the two-user game are found, and the relation between the pure-strategy and mixed-strategy Nash equilibria is discussed. As in most games, the absence of cooperation and coordination leads to inefficiencies.We then extend our setting using evolutionary game theory, which we use to model a large population of users playing the MAC game over time. A unique evolutionary stable strategy is found for this case, corresponding to the strategy achieving the Nash equilibrium in a simplified one-shot game. Finally, we investigate what happens to the distribution of strategies in a population when we assume that the number of offsprings of a user is equal to the payoff of this user in a one-shot game. We find that the system converges to a state in which the average strategy of the population is the evolutionary stable strategy.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123984017","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
Detailed evolution of degree distributions in residual graphs with joint degree distributions 具有联合度分布的残差图中度分布的详细演化
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1093/ietfec/e91-a.10.2737
Takayuki Nozaki, K. Kasai, T. Shibuya, K. Sakaniwa
{"title":"Detailed evolution of degree distributions in residual graphs with joint degree distributions","authors":"Takayuki Nozaki, K. Kasai, T. Shibuya, K. Sakaniwa","doi":"10.1093/ietfec/e91-a.10.2737","DOIUrl":"https://doi.org/10.1093/ietfec/e91-a.10.2737","url":null,"abstract":"Luby et al. derived evolution of degree distributions in residual graphs for irregular LDPC code ensembles. Evolution of degree distributions in residual graphs is an important characteristic which is used for finite-length analysis of the expected block and bit error probabilities over the binary erasure channel. In this paper, we derive detailed evolution of degree distributions in residual graphs for irregular LDPC code ensembles with joint degree distributions.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121221895","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
Block network error control codes and syndrome-based maximum likelihood decoding 块网络错误控制码和基于证型的最大似然译码
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595098
H. Bahramgiri, F. Lahouti
{"title":"Block network error control codes and syndrome-based maximum likelihood decoding","authors":"H. Bahramgiri, F. Lahouti","doi":"10.1109/ISIT.2008.4595098","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595098","url":null,"abstract":"The block network error control coding, BNEC, is presented to combat error and erasure for multicast in directed acyclic networks. Aiming at reducing complexity, BNEC syndrome-based decoding and detection is introduced. Next, we propose a three-stage syndrome-based BNEC decoding, comprising error detection, finding error positions and error values. Besides considering bounded-distance decoding for error correction up to refined Singleton bound, we present BNEC complete decoding and show that, a code with redundancy order deltat for receiver t, corrects deltat-1 errors with a probability approaching 1, for a sufficiently large field size. Also, complete maximum likelihood BNEC decoding is proposed. As probability of error in different network edges is not equal in general, the number of edge errors, assessed in Singleton bound, is not a sufficient statistic for ML decoding.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116468752","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
A framework for coded computation 编码计算的框架
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595409
Eric Rachlin, J. Savage
{"title":"A framework for coded computation","authors":"Eric Rachlin, J. Savage","doi":"10.1109/ISIT.2008.4595409","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595409","url":null,"abstract":"Error-correcting codes have been very successful in protecting against errors in data transmission. Computing on encoded data, however, has proved more difficult. In this paper we extend a framework introduced by Spielman [14] for computing on encoded data. This new formulation offers significantly more design flexibility, reduced overhead, and simplicity. It allows for a larger variety of codes to be used in computation and makes explicit conditions on codes that are compatible with computation. We also provide a lower bound on the overhead required for a single step of coded computation.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121582921","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}
引用次数: 11
Tight bounds on minimum maximum pointwise redundancy 最小最大点冗余的紧界
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595328
M. Baer
{"title":"Tight bounds on minimum maximum pointwise redundancy","authors":"M. Baer","doi":"10.1109/ISIT.2008.4595328","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595328","url":null,"abstract":"This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determined by the nonlinear codeword length objective of minimizing maximum pointwise redundancy. This objective relates to both universal modeling and Shannon coding, and these bounds are tight throughout the interval. The upper bounds also apply to a related objective, that of dth exponential redundancy.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132108904","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
Boolean functions with noisy inputs 带有噪声输入的布尔函数
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595410
Steffen Schober, M. Bossert
{"title":"Boolean functions with noisy inputs","authors":"Steffen Schober, M. Bossert","doi":"10.1109/ISIT.2008.4595410","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595410","url":null,"abstract":"We consider Boolean functions with noisy inputs. I.e., each binary input is sent over a binary symmetric channel with crossover probability isin before fed into the function. By proving an upper bound for the average l-sensitivity, we show that Boolean functions with average sensitivity less or equal 1 will not amplify the noise at their input. This means, that on average the probability that the output of the function is different from the output of the same function without noise, is less or equal e.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132211092","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
A lattice-based linear shift register synthesis for multisequences of varying length 用于变长度多序列的基于点阵的线性移位寄存器合成
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595288
Li-Ping Wang, Quan Wang, Kun Wang
{"title":"A lattice-based linear shift register synthesis for multisequences of varying length","authors":"Li-Ping Wang, Quan Wang, Kun Wang","doi":"10.1109/ISIT.2008.4595288","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595288","url":null,"abstract":"In this paper we propose a linear shift register synthesis algorithm for a multisequence of varying length by modifying the lattice basis reduction multisequence synthesis (Wang-Zhu-Pei for short) algorithm (L.-P. Wang et al., 2004). After a few simple modifications to it we can obtain the Schmidt-Sidorenko algorithm in (G. Schmidt and V.R. Sidorenko, 2006). In addition, we give the necessary and sufficient condition for the uniqueness of the minimal-length linear shift-register for generating a multisequence of varying length.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129992633","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
Time-invariant rateless codes for MIMO channels MIMO信道的时不变无速率码
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595390
M. Shanechi, U. Erez, Kevin P. Boyle, G. Wornell
{"title":"Time-invariant rateless codes for MIMO channels","authors":"M. Shanechi, U. Erez, Kevin P. Boyle, G. Wornell","doi":"10.1109/ISIT.2008.4595390","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595390","url":null,"abstract":"Two time-invariant rateless code constructions are developed for efficient communication over multi-input multi- output (MIMO) Gaussian channels. Both architectures employ layering, dithering, and repetition as key ingredients, and convert the MIMO channel into a scalar channel to which classical Gaussian base codes can be applied. Both constructions are convolutionally structured - one is based on faster-than-Nyquist (ftN) signaling, while the other on a diagonal layering (DL) structure. Moreover, both employ successive cancellation decoding. We show that ftN rateless codes are asymptotically capacity achieving at any signal-to-noise ratio (SNR) and induce a time-invariant scalar channel. We also show that DL codes are capacity achieving at any SNR, and induce a particular time-varying scalar channel to which standard LDPC base codes can be applied without significantly sacrificing performance.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130159157","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
首页 上一页 下一页 尾页
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学术官方微信