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

2008 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Error-correcting codes for rank modulation 用于等级调制的纠错码
2008 IEEE International Symposium on Information Theory Pub Date : 2008-11-20 DOI: 10.1109/ISIT.2008.4595285
Anxiao Jiang, Moshe Schwartz, Jehoshua Bruck
{"title":"Error-correcting codes for rank modulation","authors":"Anxiao Jiang, Moshe Schwartz, Jehoshua Bruck","doi":"10.1109/ISIT.2008.4595285","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595285","url":null,"abstract":"We investigate error-correcting codes for a novel storage technology for flash memories, the rank-modulation scheme. In this scheme, a set of n cells stores information in the permutation induced by the different charge levels of the individual cells. The resulting scheme eliminates the need for discrete cell levels, overcomes overshoot errors when programming cells (a serious problem that reduces the writing speed), and mitigates the problem of asymmetric errors. In this paper, we study the properties of error correction in rank modulation codes. We show that the adjacency graph of permutations is a subgraph of a multi-dimensional array of a special size, a property that enables code designs based on Lee- metric codes. We present a one-error-correcting code whose size is at least half of the optimal size. We also present additional error-correcting codes and some related bounds.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"56 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121004438","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}
引用次数: 93
The pre-log of Gaussian broadcast with feedback can be two 带反馈的高斯广播的预对数可以是2
2008 IEEE International Symposium on Information Theory Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601032
M. Wigger, M. Gastpar
{"title":"The pre-log of Gaussian broadcast with feedback can be two","authors":"M. Wigger, M. Gastpar","doi":"10.1109/ITA.2008.4601032","DOIUrl":"https://doi.org/10.1109/ITA.2008.4601032","url":null,"abstract":"A generic intuition says that the pre-log, or multiplexing gain, cannot be larger than the minimum of the number of transmit and receive dimensions. This suggests that for the scalar broadcast channel, the pre-log cannot exceed one. By contrast, in this note, we show that when the noises are anti-correlated and feedback is present, then a pre-log of two can be attained. In other words, in this special case, in the limit of high SNR, the scalar Gaussian broadcast channel turns into two parallel AWGN channels. Achievability is established via a coding strategy due to Schalkwijk, Kailath, and Ozarow.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125217877","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}
引用次数: 1
On successive refinement for the Wyner-Ziv problem with partially cooperating decoders 部分合作解码器Wyner-Ziv问题的逐次细化
2008 IEEE International Symposium on Information Theory Pub Date : 2008-08-08 DOI: 10.1109/ISIT.2008.4595375
S. Bross, T. Weissman
{"title":"On successive refinement for the Wyner-Ziv problem with partially cooperating decoders","authors":"S. Bross, T. Weissman","doi":"10.1109/ISIT.2008.4595375","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595375","url":null,"abstract":"A successive refinement model in which each receiver observes its own side-information, while the side-information pair is stochastically degraded with respect to the source, is considered. It is further assumed that a one way conference link with given capacity exists between the decoder observing the degraded side-information and the one observing the higher quality side-information. Inner and outer bounds on the rate-distortion region are derived. Our bounds are partially tight in the sense that the characterization of the primary encoder rates is conclusive, the remaining gap being in the characterization of the conference encoder rate.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116729564","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
Simulation-based estimation of the partition function and the information rate of two-dimensional models 基于仿真的二维模型配分函数和信息率估计
2008 IEEE International Symposium on Information Theory Pub Date : 2008-08-08 DOI: 10.1109/ISIT.2008.4595160
Hans-Andrea Loeliger, Mehdi Molkaraie
{"title":"Simulation-based estimation of the partition function and the information rate of two-dimensional models","authors":"Hans-Andrea Loeliger, Mehdi Molkaraie","doi":"10.1109/ISIT.2008.4595160","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595160","url":null,"abstract":"Monte Carlo methods are considered to compute, first, the partition function of graphical models, and second, the information rate of source/channel models, in both cases for factor graphs with cycles. The convergence of two basic Monte Carlo methods is improved by sampling only a cycle breaking subset of the variables and using exact sum-product computations for the remaining variables. The methods are demonstrated by their application to a two-dimensional Ising model and to a two-dimensional intersymbol interference channel.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114412418","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
An analysis of mobile relaying for coverage extension 移动中继扩展覆盖分析
2008 IEEE International Symposium on Information Theory Pub Date : 2008-08-08 DOI: 10.1109/ISIT.2008.4595393
Lei Xiao, T. Fuja, D. Costello
{"title":"An analysis of mobile relaying for coverage extension","authors":"Lei Xiao, T. Fuja, D. Costello","doi":"10.1109/ISIT.2008.4595393","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595393","url":null,"abstract":"This paper considers the coverage extension that mobile relays offer to an isolated base station. The relays are modelled as realizations of a two dimensional Poisson process with random motion, and as such their availability to forward messages received from a base station or from out-of-range mobiles is open to analysis. Two important performance metrics are derived: the probability of establishing a route and the expected duration that a route or connection can be sustained via a two hop coverage extension. The results provide insights into the benefits mobile relays can offer in terms of assisting users far away from the base station.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132021259","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}
引用次数: 14
Routing and spectral efficiency in a wireless network with two parallel relays 具有两个并联中继的无线网络中的路由和频谱效率
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595201
Shashank V. Maiya, T. Fuja
{"title":"Routing and spectral efficiency in a wireless network with two parallel relays","authors":"Shashank V. Maiya, T. Fuja","doi":"10.1109/ISIT.2008.4595201","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595201","url":null,"abstract":"This paper compares routing strategies in a simple four node network consisting of a source, a destination, and two parallel relays. Relay-to-relay communication is not considered, so there are three possible routing strategies: (1.) direct (source-to-destination) transmission; (2.) two-hop transmission that makes use of exactly one relay (i.e., the better-placed relay); and (3.) two-hop transmission wherein both relays are used during the second hop. The channel model assumes additive white Gaussian noise and attenuation due to path loss; for two-hop routing, time division multiple access is assumed for interference mitigation. Using simple capacity arguments, the paper first compares two-hop routing through one relay and two-hop routing through two relays and characterizes the relay placements for which one mode is preferable to the other. Then, two-hop transmission exploiting both relays is compared with direct transmission. It is shown that if the desired end-to-end rate is above a critical spectral efficiency, it is always preferable to transmit the signal directly no matter where the two relays are located.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114977884","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
Achievable rates of nonlinear MIMO systems with noisy channel state information 具有噪声信道状态信息的非线性MIMO系统的可实现速率
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595474
G. K. Psaltopoulos, A. Wittneben
{"title":"Achievable rates of nonlinear MIMO systems with noisy channel state information","authors":"G. K. Psaltopoulos, A. Wittneben","doi":"10.1109/ISIT.2008.4595474","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595474","url":null,"abstract":"Multiple input multiple output (MIMO) communication systems that employ nonlinear detectors, i.e., amplitude-only or phase-only detectors, where first introduced. Such systems are low-complexity and low-power alternatives to legacy MIMO systems in applications, e.g. sensor networks, where low power consumption and low cost are very stringent constraints. This work extends the achievable rates study presented, to cover the case where the channel estimation at the receiver contains an additive Gaussian noise term.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124408780","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
Smooth compression, Gallager bound and nonlinear sparse-graph codes 平滑压缩，Gallager界和非线性稀疏图码
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595436
A. Montanari, Elchanan Mossel
{"title":"Smooth compression, Gallager bound and nonlinear sparse-graph codes","authors":"A. Montanari, Elchanan Mossel","doi":"10.1109/ISIT.2008.4595436","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595436","url":null,"abstract":"A data compression scheme is defined to be smooth if its image (the codeword) depends gracefully on the source (the data). Smoothness is a desirable property in many practical contexts, and widely used source coding schemes lack of it. We introduce a family of smooth source codes based on sparse graph constructions, and prove them to achieve the (information theoretic) optimal compression rate for a dense set of iid sources. As a byproduct, we show how Gallager bound on sparsity can be overcome using non-linear function nodes.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117238117","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}
引用次数: 23
Secrecy capacity region of a class of one-sided interference channel 一类单侧干扰信道的保密容量区域
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595012
Zang Li, R. Yates, W. Trappe
{"title":"Secrecy capacity region of a class of one-sided interference channel","authors":"Zang Li, R. Yates, W. Trappe","doi":"10.1109/ISIT.2008.4595012","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595012","url":null,"abstract":"We derive an outer bound for the secrecy capacity region of a class of one-sided interference channel. The transmitters are assumed to be trustworthy while the message is secure against the non-intended receiver. The outer bound is applied to a deterministic channel in which the outer bound is showed to be tight, and to a Gaussian one-sided interference channel where a scheme is proposed that can come within one bit of the outer bound.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127212657","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}
引用次数: 51
Constructions of fully-diverse high-rate space-frequency codes for asynchronous cooperative relay networks 异步协同中继网络中全多样化高速率空频码的构建
2008 IEEE International Symposium on Information Theory Pub Date : 2008-07-06 DOI: 10.1109/ISIT.2008.4595103
Hsiao-feng Lu
{"title":"Constructions of fully-diverse high-rate space-frequency codes for asynchronous cooperative relay networks","authors":"Hsiao-feng Lu","doi":"10.1109/ISIT.2008.4595103","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595103","url":null,"abstract":"A systematic construction of fully-diverse, high-rate OFDM-based space-frequency coding schemes for the cooperative relay network communication is presented in this paper. Assuming an asynchronous communication between the intermediate relays and the destination node, it is shown that the proposed scheme can achieve full cooperative diversity for any possible time delays between the relays and the destination node if the number of subcarriers used in the OFDM modulation and the oversampling ratio used at the destination node are both powers of a prime. Such conditions are naturally met in all existing OFDM-based communication standards. Comparing to the space-time trellis codes proposed by Xia et al. , the present scheme not only achieves full diversity gain at a much higher rate but also are more flexible in both code and signal designs. A design example targeting at the latest OFDM-based standards is also given.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127357972","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}
引用次数: 4
下一页 尾页
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学术官方微信