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

Asymptotic Rate versus Design Rate 渐进速率与设计速率

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

C. Méasson, A. Montanari, R. Urbanke

引用次数: 10

ML decoding via mixed-integer adaptive linear programming ML解码通过混合整数自适应线性规划

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

S. Draper, J. Yedidia, Yige Wang

{"title":"ML decoding via mixed-integer adaptive linear programming","authors":"S. Draper, J. Yedidia, Yige Wang","doi":"10.1109/ISIT.2007.4557459","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557459","url":null,"abstract":"Linear programming (LP) decoding was introduced by Feldman et al. (IEEE Trans. Inform. Theory Mar. 2005) as a novel way to decode binary low-density parity-check codes. Taghavi and Siegel (Proc. ISIT 2006) describe a computationally simplified decoding approach they term \"adaptive\" LP decoding. Adaptive LP decoding starts with a sub-set of the LP constraints, and iteratively adds violated constraints until an optimum of the original LP is found. Usually only a tiny fraction of the original constraints need to be reinstated, leading to huge efficiency gains compared to ordinary LP decoding. Here we describe a modification of the adaptive LP decoder that results in a maximum likelihood (ML) decoder. Whenever the adaptive LP decoder returns a pseudo-codeword rather than a codeword, we add an integer constraint on the least certain symbol of the pseudo-codeword. For certain codes, and especially in the high-SNR (error floor) regime, only a few integer constraints are required to force the resultant mixed-integer LP to the ML solution. We demonstrate that our approach can efficiently achieve the optimal ML decoding performance on a (155,64) LDPC code introduced by Tanner et al.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"58 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":"134284685","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}

引用次数: 43

Precoding of Space-Time Block Codes in Multiuser MIMO Channels with Outdated Channel State Information 具有过时信道状态信息的多用户MIMO信道空时分组码的预编码

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

Jane Wei Huang, E. Au, V. Lau

{"title":"Precoding of Space-Time Block Codes in Multiuser MIMO Channels with Outdated Channel State Information","authors":"Jane Wei Huang, E. Au, V. Lau","doi":"10.1109/ISIT.2007.4557519","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557519","url":null,"abstract":"Motivated by the fact that combining space-time block codes with channel precoding can make the system robust against channel fading while achieving both coding and diversity gains, we propose a joint set of linear precoder designs for uplink multiuser space-time block coded multiple-input multiple-output systems with multipacket reception by exploiting outdated channel state information. In particular, we formulate the design as an optimization problem of minimizing pairwise error probability subject to transmit power constraint for each user. Due to non-convex nature of the optimization problem, we devise an iterative algorithm to solve for linear precoding structure for general space-time block code. For orthogonal space-time block code, we also propose a simplified distributed algorithm to solve for a closed-form solution. Asymptotic analysis of the effect of channel quality on the precoder structure is also presented. Simulation results are provided to demonstrate the effectiveness of the proposed designs for orthogonal and quasi-orthogonal space-time block codes over the conventional beamforming system.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"23 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":"131580115","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

Broadcasting with Feedback 有反馈的广播

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

Sibi Raj Bhaskaran

引用次数: 6

An Information Theoretic View of Stochastic Resonance 随机共振的信息论观点

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

V. Anantharam, V. Borkar

引用次数: 2

Equivalence classes of boolean functions for first-order correlation 一阶相关布尔函数的等价类

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

J. L. Bars, Alfredo Viola

{"title":"Equivalence classes of boolean functions for first-order correlation","authors":"J. L. Bars, Alfredo Viola","doi":"10.1109/ISIT.2007.4557223","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557223","url":null,"abstract":"Boolean functions are very important cryptographic primitives in stream or block ciphers. In this context, these functions need to satisfy good properties like high algebraic degree, nonlinearity and correlation immunity. We present here an original and efficient method to enumerate all the correlation-immune functions of a fixed Hamming weight, in particular the class of 1-resilient functions. The key idea consists in defining equivalent classes to split boolean functions along their distance from correlation-immune boolean functions. These classes, called first-order correlation classes, are built using a recursive decomposition of smaller classes. We derive from this method several algorithms to enumerate their elements and to count their cardinality. We first show that the exact number of 1-resilient boolean functions with 7 variables is 23478015754788854439497622689296 and we obtain a tight estimation of their number with 8 variables, between 4 1067 and 5.6 1068. We then present a general lower bound for the number of 1-resilient boolean functions and improve Schneider's upper bound. We also propose a general lower bound for the number of k-resilient functions. Most of the bounds presented in this paper, substantially improve the best known bounds in the literature. We finally establish that the probability of a Boolean function being 1-resilient is asymptotically between (npi)n/2/2n2-3/2n-1en-1/2.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"47 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":"133019940","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

Codes for Multi-Level Flash Memories: Correcting Asymmetric Limited-Magnitude Errors 多层快闪记忆体编码:修正非对称有限幅度错误

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

Yuval Cassuto, Moshe Schwartz, V. Bohossian, Jehoshua Bruck

引用次数: 44

A Note on Error Correction Schemes using LDPC codes with a High-Capacity Feedback Channel 基于高容量反馈信道的LDPC码纠错方案的注解

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

Naoto Kobayashi, T. Matsushima, S. Hirasawa

引用次数: 1

Joint Beamforming and Power Control for Optimal SIR Assignment in Cellular Uplinks 蜂窝上行链路中最优SIR分配的联合波束形成和功率控制

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

T. Lan, P. Hande, M. Chiang

引用次数: 9

Sum-Capacity and MMSE for the MIMO Broadcast Channel without Eigenvalue Decompositions 无特征值分解的MIMO广播信道的和容量和MMSE

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

R. Hunger, D. Schmidt, W. Utschick

引用次数: 15