Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.最新文献_第6页

On designing error-correctable codes by biomolecular computation 基于生物分子计算的可纠错编码设计研究

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523775

Jian-Qin Liu, K. Shimohara

引用次数: 3

Discriminatory source coding for a noiseless broadcast channel 无噪声广播信道的歧视性源编码

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523296

Leonard H. Grokop, A. Sahai, M. Gastpar

引用次数: 15

Bounds on the ergodic capacity of training-based multiple-antenna systems 基于训练的多天线系统遍历能力的界限

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523443

S. Furrer, D. Dahlhaus

{"title":"Bounds on the ergodic capacity of training-based multiple-antenna systems","authors":"S. Furrer, D. Dahlhaus","doi":"10.1109/ISIT.2005.1523443","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523443","url":null,"abstract":"Multiple-antenna concepts for wireless communication systems promise high spectral efficiencies by proper exploitation of the randomness in multipath propagation. In this paper, we investigate the impact of channel uncertainty caused by channel estimation errors on the capacity of Rayleigh and Ricean block-fading channels. We consider a training-based multiple-antenna system that reserves a portion of time to sound the channel. The training symbols are used to estimate the channel state information (CSI) at the receiver by means of an arbitrary linear estimation filter. No CSI is assumed at the transmitter. We present an equivalent system model for training-based multiple-antenna systems, which specifies the channel by the estimated (and hence, known) channel coefficients and an uncorrelated, data-dependent noise. Based on this equivalent model, which includes the special cases of perfect CSI and no CSI, we derive upper and lower bounds on the maximum instantaneous mutual information and the ergodic capacity, and extend previous results to arbitrary (and possibly mismatched) linear channel estimators and to correlated Ricean fading","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"21 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120851538","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}

引用次数: 3

An algebraic method for constructing efficiently encodable irregular LDPC codes 构造有效可编码的不规则LDPC码的代数方法

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523458

Hachiro Fujita, Maki Ohata, K. Sakaniwa

引用次数: 5

Tradeoff between PAPR reduction and decoding complexity in transformed OFDM systems 变换OFDM系统中PAPR降低与译码复杂度的权衡

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523543

Vijay Ahirwar, B. Rajan

引用次数: 11

Concentration and relative entropy for compound Poisson distributions 复合泊松分布的浓度和相对熵

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523662

M. Madiman, Ioannis Kontoyiannis

{"title":"Concentration and relative entropy for compound Poisson distributions","authors":"M. Madiman, Ioannis Kontoyiannis","doi":"10.1109/ISIT.2005.1523662","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523662","url":null,"abstract":"Using a simple inequality about the relative entropy, its so-called \"tensorization property,\" we give a simple proof of a functional inequality which is satisfied by any compound Poisson distribution. This functional inequality belongs to the class of modified logarithmic Sobolev inequalities. We use it to obtain measure concentration bounds for compound Poisson distributions under a variety of assumptions on their tail behavior. In particular, we show how the celebrated \"Herbst argument\" can be modified to yield sub-exponential concentration bounds. For example, suppose Z is a compound Poisson random variable with values on the nonnegative integers, and let f be a function such that |f(k+1) - f(k)| les 1 for all k. Then, if the base distribution of Z does not have a finite moment-generating function but has finite moments up to some order L > 1, we show that the probability that f(Z) exceeds its mean by a positive amount t or more decays approximately like (const)middott-L, where the constant is explicitly identified. This appears to be one of the very first examples of concentration bounds with power-law decay","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124639693","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

EXIT charts for non-binary LDPC codes over arbitrary discrete-memoryless channels 任意离散无存储器信道上非二进制LDPC码的退出图

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523288

A. Bennatan, D. Burshtein

引用次数: 1

On the asymptotic properties of sparse matrix codes in the CEO problem 关于CEO问题中稀疏矩阵码的渐近性质

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523770

T. Murayama

引用次数: 2

Secret key agreement under sampling attack 抽样攻击下的密钥协议

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523726

J. Muramatsu, K. Yoshimura, Kenichi Arai, P. Davis

引用次数: 1

A high-speed analog min-sum iterative decoder 高速模拟最小和迭代解码器

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523649

S. Hemati, A. Banihashemi, C. Plett

引用次数: 4