发布求助
文献互助 智能选刊 最新文献

2011 IEEE International Symposium on Information Theory Proceedings最新文献

筛选
英文 中文
Constrained Wyner-Ziv coding 约束Wyner-Ziv编码
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033696
A. Lapidoth, Andreas Malär, M. Wigger
{"title":"Constrained Wyner-Ziv coding","authors":"A. Lapidoth, Andreas Malär, M. Wigger","doi":"10.1109/ISIT.2011.6033696","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033696","url":null,"abstract":"We consider a variation on the Wyner-Ziv source coding problem with side-information at the decoder where the encoder is required to be able to compute the decoder's reconstruction sequence with some fidelity. This requirement limits the extent to which the reconstruction sequence can depend on the side-information, which is not available to the encoder. For finite-alphabet memoryless sources and single-letter distortion measures we compute the minimal description rate as a function of the joint law of the source and side-information and of the allowed distortions at the encoder and decoder. We also treat memoryless Gaussian sources with mean squared-error distortion measures.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129962560","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}
引用次数: 9
Adaptive cut generation for improved linear programming decoding of binary linear codes 改进二进制线性码的线性规划译码的自适应切割生成
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033822
Xiaojie Zhang, P. Siegel
{"title":"Adaptive cut generation for improved linear programming decoding of binary linear codes","authors":"Xiaojie Zhang, P. Siegel","doi":"10.1109/ISIT.2011.6033822","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033822","url":null,"abstract":"Linear programming (LP) decoding approximates optimal maximum-likelihood (ML) decoding of a linear block code by relaxing the equivalent ML integer programming (IP) problem into a more easily solved LP problem. The LP problem is defined by a set of linear inequalities derived from the constraints represented by the rows of a parity-check matrix of the code. Adaptive linear programming (ALP) decoding significantly reduces the complexity of LP decoding by iteratively and adaptively adding necessary constraints in a sequence of smaller LP problems. Adaptive introduction of constraints derived from certain additional redundant parity check (RPC) constraints can further improve ALP performance. In this paper, we propose a new and effective algorithm to identify RPCs that produce linear constraints, referred to as “cuts,” that can eliminate non-ML solutions generated by the ALP decoder, often significantly improving the decoder error-rate performance. The cut-finding algorithm is based upon a specific transformation of an initial parity-check matrix of the linear block code. Simulation results for several low-density parity-check codes demonstrate that the modified ALP decoding algorithm significantly narrows the performance gap between LP decoding and ML decoding.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134132577","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
Interference alignment over asynchronous X networks 异步X网络上的干扰校准
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034035
H. Najafi, Mehdi Torbatian, M. O. Damen
{"title":"Interference alignment over asynchronous X networks","authors":"H. Najafi, Mehdi Torbatian, M. O. Damen","doi":"10.1109/ISIT.2011.6034035","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034035","url":null,"abstract":"A symbol-asynchronous X network with time-invariant channel coefficients and single antenna nodes is considered. By employing the asynchronism in the design of the interference alignment, we achieve the upper bound for the total number of degrees of freedom of this network which is argued to be the same as that of the synchronous case. The asynchronism, which exists among the received signals at each receiver, results in inter-symbol-interference (ISI) among the transmitted symbols from different transmitters. This can provide the channel variation required for the vector alignment over the constant network with single antenna nodes.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134588697","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
Degrees of freedom of the interference channel: A general formula 干涉信道的自由度:一般公式
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033761
Yihong Wu, S. Shamai, S. Verdú
{"title":"Degrees of freedom of the interference channel: A general formula","authors":"Yihong Wu, S. Shamai, S. Verdú","doi":"10.1109/ISIT.2011.6033761","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033761","url":null,"abstract":"We give a general formula for the degrees of freedom of the K-user real additive-noise interference channel involving maximization of information dimension. Previous results are recovered, and even generalized in certain cases with simplified proofs. Connections to fractal geometry are drawn.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131725376","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
The degrees of freedom region of the MIMO interference channel with delayed CSIT 具有延迟CSIT的MIMO干扰信道的自由度区域
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033951
C. Vaze, M. Varanasi
{"title":"The degrees of freedom region of the MIMO interference channel with delayed CSIT","authors":"C. Vaze, M. Varanasi","doi":"10.1109/ISIT.2011.6033951","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033951","url":null,"abstract":"The degrees of freedom (DoF) region of the 2-user MIMO interference channel (IC) is studied under fast fading and the assumption of delayed channel state information at transmitters (CSIT) wherein the receivers know all channel matrices perfectly and the transmitters acquire this knowledge with a certain delay. An outer bound to the DoF region is first derived. This bound is then shown to be tight for all possible values of the number of antennas at the four terminals. This is done by developing interference alignment based achievability schemes. A comparison of the DoF region under the delayed CSIT assumption is made with that of the idealistic perfect CSIT assumption where perfect and global channel knowledge (without delay) is available at the transmitters (and receivers) on the one hand and with the DoF region of the conservative no CSI assumption on the other, where CSI is available at the receivers but not at all at the transmitters.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129400097","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}
引用次数: 11
Common information of random linear network coding over a 1-hop broadcast packet erasure channel 随机线性网络编码在1跳广播包擦除信道上的公共信息
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033839
Chih-Chun Wang, Jaemin Han
{"title":"Common information of random linear network coding over a 1-hop broadcast packet erasure channel","authors":"Chih-Chun Wang, Jaemin Han","doi":"10.1109/ISIT.2011.6033839","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033839","url":null,"abstract":"Random linear network coding (RLNC) is widely used in practical network coding (NC) protocol design. Recent results show that RLNC also plays an important role in capacity-achieving intersession NC schemes for erasure-based 1-hop relay networks. This work quantifies the common information of RLNC over a 1-hop broadcast packet erasure channel. Several potential applications are discussed, including source coding, intersession NC, and broadcasting with common and private information.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131072297","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
Characterizing capacity achieving write once memory codes for multilevel flash memories 表征实现多级快闪存储器一次写入的存储器代码的容量
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034021
Ryan Gabrys, L. Dolecek
{"title":"Characterizing capacity achieving write once memory codes for multilevel flash memories","authors":"Ryan Gabrys, L. Dolecek","doi":"10.1109/ISIT.2011.6034021","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034021","url":null,"abstract":"This work investigates the structure of capacity achieving write once memory codes with particular attention to the case where each cell of the flash memory device is capable of representing more than one bit. These results are used to characterize the rates achieved across generations for capacity achieving codes as well to construct a high rate ternary two write code. Additionally, the problem of maximizing the sum rate for two writes given that both writes encode at the same rate is considered.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"21 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132149830","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}
引用次数: 16
Partial group decoding for interference channels 干扰信道的部分分组解码
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033788
A. Tajer, H. Poor, Xiaodong Wang
{"title":"Partial group decoding for interference channels","authors":"A. Tajer, H. Poor, Xiaodong Wang","doi":"10.1109/ISIT.2011.6033788","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033788","url":null,"abstract":"In order to achieve the Han-Kobayashi rate region for the two-user interference channel each transmitter splits its message into two sub-messages, each drawn from an independent codebook. Generalizing this idea to the K-user interference channel implies that 2K−1 codebooks should be allocated to each transmitter, where each of them carries the message that is public to one of the subsets of the K−1 non-designated receivers. While such a rate-splitting scheme yields the best known achievable rate region (with random coding), optimizing a rate-related utility function over this region presents certain challenges stemming from the computational complexities and the distributed nature of interference channels. This paper introduces the notion of partial group decoding which offers a practical rate optimization strategy over this achievable rate region and mitigates these challenges. The merits of partial group decoders are demonstrated through treating the problem of optimal rate allocation with fairness constraints.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128838351","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
Achievable rates of MIMO-ISI systems with linear precoding and iterative LMMSE detection 用线性预编码和迭代LMMSE检测MIMO-ISI系统的可实现速率
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034109
Xiaojun Yuan, L. Ping, A. Kavcic
{"title":"Achievable rates of MIMO-ISI systems with linear precoding and iterative LMMSE detection","authors":"Xiaojun Yuan, L. Ping, A. Kavcic","doi":"10.1109/ISIT.2011.6034109","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034109","url":null,"abstract":"In this paper, we consider the performance analysis of multiple-input multiple-output (MIMO) inter-symbol interference (ISI) systems involving linear-precoding (LP) and iterative linear minimum mean-square error (ILMMSE) detection. The main contribution of this paper is an area theorem to evaluate the achievable rate of the proposed LP-ILMMSE scheme. Based on this area theorem, we further optimize the linear precoder to maximize the achievable rate. Numerical results are provided to verify our analysis.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131906197","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}
引用次数: 5
Some voltage graph-based LDPC tailbiting codes with large girth 一些基于电压图的大周长LDPC尾码
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034230
I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov, Roman V. Satyukov
{"title":"Some voltage graph-based LDPC tailbiting codes with large girth","authors":"I. Bocharova, F. Hug, R. Johannesson, B. Kudryashov, Roman V. Satyukov","doi":"10.1109/ISIT.2011.6034230","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034230","url":null,"abstract":"The relation between the parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and the biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Algorithms for searching iteratively for LDPC block codes with large girth are presented and constructions based on Steiner Triple Systems and short QC block codes are introduced, leading to new QC regular LDPC block codes with girth up to 24.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127052409","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}
引用次数: 8
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信