2006 IEEE International Symposium on Information Theory最新文献_第3页

Information Transmission over the Postal Channel with and without Feedback 有反馈和无反馈的邮政信道信息传输

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261562

Wenyi Zhang, S. Kotagiri, J. N. Laneman

{"title":"Information Transmission over the Postal Channel with and without Feedback","authors":"Wenyi Zhang, S. Kotagiri, J. N. Laneman","doi":"10.1109/ISIT.2006.261562","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261562","url":null,"abstract":"The postal channel models a postal system in which letters, each consisting of a number of characters, are sometimes lost. We study the postal channel with variable-length letters and variable-length coding over letters, both with and without letter-by-letter feedback. Without allowing letter lengths to encode information, we examine one feedback strategy consisting of automatic repeat-request (ARQ) with exponentially increasing letter lengths. For this strategy we investigate an alternative notion of information rate per character, based upon the total, random number of characters required to convey the messages instead of its expectation. This information rate exhibits a phase transition in its convergence as the number of messages becomes large: if the letter lengths increase by a factor less than the inverse of the probability that a letter is lost, it converges to the channel capacity; otherwise, it converges to a number strictly larger than channel capacity. More generally, when we allow both the characters and the length of a letter to convey information, we compute the corresponding channel capacity with and without feedback, and find that it is twice the channel capacity of the original postal channel without allowing letter lengths to encode information","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"55 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122865110","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

AG Goppa Codes from Maximal Curves over determined Finite Fields of characteristic 2 特征2有限域上极大曲线的AG Goppa码

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261891

R. McEliece, M. C. Rodríguez-Palánquex

引用次数: 0

Generalized Multilevel Constructions for Reed-Muller Codes and Barnes-Wall lattices Reed-Muller码和Barnes-Wall格的广义多层结构

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261788

A. Salomon, O. Amrani

引用次数: 0

Sub-optimal Power Allocation for MIMO Channels MIMO信道的次优功率分配

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261658

A. Grant, L. Hanlen

引用次数: 4

A Novel Method for Combining Algebraic Decoding and Iterative Processing 一种代数译码与迭代处理相结合的新方法

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261714

Xiangyu Tang, R. Koetter

引用次数: 39

Distributed LT Codes 分布式LT代码

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261875

Srinath Puducheri-Sundaravaradhan, J. Kliewer, T. Fuja

引用次数: 43

Throughput analysis for MIMO systems in the high SNR regime 高信噪比下MIMO系统的吞吐量分析

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261822

N. Prasad, M. Varanasi

{"title":"Throughput analysis for MIMO systems in the high SNR regime","authors":"N. Prasad, M. Varanasi","doi":"10.1109/ISIT.2006.261822","DOIUrl":"https://doi.org/10.1109/ISIT.2006.261822","url":null,"abstract":"Outage capacity and throughput are the two key metrics through which the fundamental limits of delay-sensitive wireless MIMO links can be studied. In this paper, we show that these metrics are intimately related, and consequently, as in the case of outage capacity, the growth rate of throughput with SNR rho is t log rho for a general class of fading channels (with channel state information at the receiver (CSIR) and with or without CSI at the transmitter (CSIT)) whose channel matrix is of rank t with probability one. However, while asymptotically tight affine lower bounds of the form t log rho + 0(1) were recently derived for outage capacity for such channels, in the sense that the limit as rho rarr infin of the difference between the outage capacity and the lower bound is zero, such affine lower bounds are not possible in general for the throughput. Using the t log rho + O(1) bounds on outage capacity however, lower bounds on throughput are specified where the high SNR limit of the ratio of the throughput and its lower bound is unity. These bounds reveal that the throughput optimal outage probability approaches zero as rho rarr infin. An important exception is the scenario where both the transmitter and receiver have CSI under the long-term power constraint (LTPC), for which we obtain a lower bound of the form t log rho + O(1) which is asymptotically tight (in the stronger sense) and interestingly, this lower bound is identical to the asymptotic delay-limited capacity. The throughputs of MISO and SIMO fading channels are extensively analyzed and it is shown that asymptotically, isotropic Gaussian input is throughput optimal, correlation is detrimental whereas increase in the Rice factor is beneficial and that throughput is schur-concave in the correlation eigenvalues","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129750815","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

A Capacity-Based Approach for Designing Bit-Interleaved Coded GFSK with Noncoherent Detection 基于容量的位交织编码GFSK非相干检测设计方法

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.262088

R. I. Seshadri, M. Valenti

引用次数: 1

Worst-case Analysis of the Low-complexity Symbol Grouping Coding Technique 低复杂度符号分组编码技术的最坏情况分析

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.262028

A. Said

引用次数: 1

Difference Sampling Theorems For a Class of Non-Bandlimited Signals 一类非带限信号的差分采样定理

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI: 10.1109/ISIT.2006.261687

Chen Meng, J. Tuqan

引用次数: 2