Proceedings. IEEE International Symposium on Information Theory最新文献_第6页

A highly parallel decoder for turbo codes 涡轮码的高度并行解码器

Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023500

J. Sun, O. Takeshita, M. Fitz

引用次数: 2

An algebraic number theoretic framework for space-time coding 空时编码的代数数论框架

Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023404

H. El Gamal, M. O. Damen

{"title":"An algebraic number theoretic framework for space-time coding","authors":"H. El Gamal, M. O. Damen","doi":"10.1109/ISIT.2002.1023404","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023404","url":null,"abstract":"In this paper, we develop a novel framework for constructing full rate, full diversity, and polynomial complexity space-time codes for systems with arbitrary numbers of transmit and receive antennas. The proposed framework combines space-time layering concepts with algebraic number theoretic constellations to construct universal codes for scenarios where the channel state information (CSI) is known a-priori at the transmitter and receiver (TR-CSI), receiver only (R-CSI), and neither one of them (N-CSI). For a coherent system (i.e., R-CSI) with M transmit and N receive antennas in quasi-static fading, the proposed codes are constructed over T = M symbol periods by properly assigning algebraic number theoretic constellations to the different layers. The proposed codes are delay-optimal and achieve the maximum diversity advantage MN over quasi-static fading channels for arbitrary numbers of antennas and arbitrary transmission rates. The lattice structure of the proposed codes allows for polynomial complexity maximum likelihood decoding using the sphere decoder. The proposed framework subsumes many of the existing codes in the literature, extends naturally to time-selective and frequency-selective channels, and allows for more flexibility in the trade-off between power efficiency, bandwidth efficiency, and receiver complexity.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"5 1","pages":"132-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73127360","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

Universal linked multiple access source codes 通用链接多址访问源代码

Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023367

S. Jaggi, M. Effros

引用次数: 11

Irregular progressive edge-growth (PEG) Tanner graphs 不规则渐进边生长(PEG)坦纳图

Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023752

Xiao-Yu Hu, E. Eleftheriou, D. Arnold

引用次数: 40

Decoding of Reed-Solomon codes for additive cost functions 加性代价函数的Reed-Solomon码解码

Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023585

R. Koetter, A. Vardy

引用次数: 15

Analysis and design of LDPCCs over Gaussian channels with erasures 高斯信道上带擦除的LDPCCs的分析与设计

Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023302

J. Ha, S. McLaughlin

引用次数: 4

The use of memory in randomized load balancing 随机负载均衡中内存的使用

Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023397

Dharam J. Shah, B. Prabhakar

{"title":"The use of memory in randomized load balancing","authors":"Dharam J. Shah, B. Prabhakar","doi":"10.1109/ISIT.2002.1023397","DOIUrl":"https://doi.org/10.1109/ISIT.2002.1023397","url":null,"abstract":"We consider the following canonical load balancing problem: Drop n balls into n bins so as to minimize the maximum loading. An execution of the well-known \"load the least loaded bin\" algorithm results in an optimal loading of one ball per bin. Azar et al. (1994) consider an algorithm which assigns each ball to the least loaded of d randomly chosen bins and show that the maximum load is ln ln n/ln d + O(1) for d /spl ges/ 2, as compared to ln n/ln ln n (1 + o(1)) for d = 1. A dynamic version of the load balancing problem involves jobs arriving as a rate n/spl lambda/ Poisson process at n rate 1 exponential server queues is considered in Mitzenmacher (1996) and in Vvedenskaya et. al. (1996). They find similar exponential improvements in performance for d /spl ges/ 2 as compared with d = 1. In this paper, we consider a variation of randomized load balancing schemes which involve the use of memory. This is motivated by the observation that the loads do not change by much between iterations; hence remembering \"good samples\" from one iteration for use in future iterations ought to pay off significantly. We find this is indeed true, and quantify the improvement.","PeriodicalId":92129,"journal":{"name":"Proceedings. IEEE International Symposium on Information Theory","volume":"21 1","pages":"125-"},"PeriodicalIF":0.0,"publicationDate":"2002-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78877965","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

Classification of circulant and 4-circulant extremal additive self-dual codes 循环和4循环极值加性自对偶码的分类

Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023729

T. Gulliver, J.-L. Kim

引用次数: 0

Evaluating zero error noise thresholds by the replica method for Gallager code ensembles 用Gallager码集成的复制方法评估零误差噪声阈值

Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023527

Y. Kabashima, N. Sazuka, K. Nakamura, D. Saad

引用次数: 4

A time-scale separation technique for the analysis of random access systems with incremental redundancy 具有增量冗余的随机接入系统分析的时间尺度分离技术

Proceedings. IEEE International Symposium on Information Theory Pub Date : 2002-06-30 DOI: 10.1109/ISIT.2002.1023287

R. Prakash, V. Veeravalli

引用次数: 8