2007 IEEE International Symposium on Information Theory最新文献_第9页

Reliable Memories with Subline Accesses 具有子访问的可靠存储器

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557599

Junsheng Han, L. A. Lastras-Montaño

{"title":"Reliable Memories with Subline Accesses","authors":"Junsheng Han, L. A. Lastras-Montaño","doi":"10.1109/ISIT.2007.4557599","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557599","url":null,"abstract":"We study memories protected with error control codes, in which the memory's contents are organized in lines which are read and written to in isolation from other lines. In these memories the available redundancy is structured so as to protect individual lines rather than the entire memory as a whole. Often designers wish to read and write only parts of the memory line, as in some instances this leads to various favorable system design tradeoffs, including better power consumption, increased data access concurrency, etc. (alternatively one may say that designers sometimes would prefer smaller line sizes). Nevertheless when designing systems with such subline accesses it is often found that in order to mantain a given level of reliability, the total amount of redundancy allocated in the memory needs to be increased beyond desirable levels. In this work, we initiate a study of the problem of structuring error control codes to allow subline accesses with good tradeoffs between reliability and redundancy. We motivate and explore a setting in which a \"double-lookup\" protocol is used in conjunction with certain types of two-level codes, whereby error detection is attained in a first level and error correction using the second level is performed whenever errors are detected in the first level. We obtain lower bounds on redundancy for a given level of reliability and offer a code construction that attains this bound for a certain important class of parameters. We also introduce an alternate construction which allows us to find longer codes under restrictions of the Galois field size used in the codes.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122761160","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}

引用次数: 63

Theory and Performance of ML Decoding for Turbo Codes using Genetic Algorithm 基于遗传算法的Turbo码ML解码理论与性能研究

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557298

Tsun-chih Hsueh, D. Shiu

{"title":"Theory and Performance of ML Decoding for Turbo Codes using Genetic Algorithm","authors":"Tsun-chih Hsueh, D. Shiu","doi":"10.1109/ISIT.2007.4557298","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557298","url":null,"abstract":"Although yielding the lowest error probability, ML decoding of turbo codes has been considered unrealistic so far because efficient ML decoders have not been discovered. In this paper, we propose the Genetic Decoding Algorithm (GDA) for turbo codes. GDA combines the principles of perturbed decoding and genetic algorithm. In GDA, chromosomes are random additive perturbation noises. A conventional turbo decoder is used to assign fitness values to the chromosomes in the population. After generations of evolution, good chromosomes that correspond to decoded codewords of very good likelihood emerge. GDA can be used as a practical decoder for turbo codes in certain contexts. It is also a natural multiple-output decoder. The most important aspect of GDA, in our opinion, is that one can utilize GDA to empirically determine a lower bound on the error probability with ML decoding. Our results show that, at a word error probability of 10-4, GDA achieves the performance of ML decoding. Using GDA, we establish that an ML decoder only slightly outperforms a MAP-based iterative decoder at this word error probability for the block size we used and the turbo code defined for WCDMA.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122839381","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

On Construction of Two Classes of Efficient Quantum Error-Correction Codes 两类高效量子纠错码的构造

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557531

P. Tan, Jing Li

引用次数: 8

On Optical Orthogonal, Cyclically Permutable, and Super Optical Orthogonal Codes 光正交码、循环置换码和超光正交码

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557579

S. Martirosyan, A. Vinck, A. Harutyunyan

引用次数: 0

Using zero-rate feedback on binary additive channels with individual noise sequences 利用零速率反馈对具有单独噪声序列的二进制加性信道

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557423

K. Eswaran, A. Sarwate, A. Sahai, M. Gastpar

引用次数: 12

On the Capacity Bounds of Undirected Networks 关于无向网络的容量边界

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557081

A. Al-Bashabsheh, A. Yongaçoğlu

引用次数: 1

Optimal Combining Schemes for MIMO Systems with Hybrid ARQ 具有混合ARQ的MIMO系统的最优组合方案

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557560

E. W. Jang, Jungwon Lee, H. Lou, J. Cioffi

引用次数: 32

Optimal Watermark Embedding and Detection Strategies Under General Worst Case Attacks 一般最坏情况下最优水印嵌入与检测策略

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557586

E. Sabbag, N. Merhav

引用次数: 1

The Value of Frame-Delays in the Sequential Coding of Correlated Sources 帧延迟在相关源序列编码中的价值

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557434

N. Ma, P. Ishwar

引用次数: 8

Synchronizing block codes with a decoder for variable-length codes 将块码与可变长度码的解码器同步

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557460

U. Speidel, T. Gulliver

引用次数: 2