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

2008 Information Theory and Applications Workshop最新文献

筛选
英文 中文
The pre-log of Gaussian broadcast with feedback can be two 带反馈的高斯广播的预对数可以是2
2008 Information Theory and Applications Workshop Pub Date : 2008-05-07 DOI: 10.1109/ISIT.2008.4595189
M. Wigger, M. Gastpar
{"title":"The pre-log of Gaussian broadcast with feedback can be two","authors":"M. Wigger, M. Gastpar","doi":"10.1109/ISIT.2008.4595189","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595189","url":null,"abstract":"A generic intuition says that the pre-log, or multi-plexing 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":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129611142","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
On the inner and outer bounds for 2-receiver discrete memoryless broadcast channels 双接收机离散无记忆广播信道的内外边界
2008 Information Theory and Applications Workshop Pub Date : 2008-04-23 DOI: 10.1109/ITA.2008.4601053
Chandra Nair, Z. Wang
{"title":"On the inner and outer bounds for 2-receiver discrete memoryless broadcast channels","authors":"Chandra Nair, Z. Wang","doi":"10.1109/ITA.2008.4601053","DOIUrl":"https://doi.org/10.1109/ITA.2008.4601053","url":null,"abstract":"We study the best known general inner bound (K. Marton, January, 2003) and outer bound (C. Nair et al., January, 2007) for the capacity region of the two user discrete memory less channel.We prove that a seemingly stronger outer bound is identical to a weaker form of the outer bound that was also presented in (C. Nair et al., January, 2007). We are able to further express the best outer bound in a form that is computable, i.e. there are bounds on the cardinalities of the auxiliary random variables. The inner and outer bounds coincide for all channels for which the capacity region is known and it is not known whether the regions described by these bounds are same or different. We present a channel, where assuming a certain conjecture backed by simulations and partial theoretical results, one can show that the bounds are different.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125783078","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}
引用次数: 36
Interior-point algorithms for linear-programming decoding 线性规划译码的内点算法
2008 Information Theory and Applications Workshop Pub Date : 2008-02-10 DOI: 10.1109/ITA.2008.4601085
P. Vontobel
{"title":"Interior-point algorithms for linear-programming decoding","authors":"P. Vontobel","doi":"10.1109/ITA.2008.4601085","DOIUrl":"https://doi.org/10.1109/ITA.2008.4601085","url":null,"abstract":"Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of such algorithms for solving the linear program that appears in the linear-programming decoder formulation.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115681166","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}
引用次数: 37
Sum capacity of the Gaussian interference channel in the low interference regime 高斯干涉信道在低干扰状态下的和容量
2008 Information Theory and Applications Workshop Pub Date : 2008-01-02 DOI: 10.1109/ITA.2008.4601084
V. Annapureddy, V. Veeravalli
{"title":"Sum capacity of the Gaussian interference channel in the low interference regime","authors":"V. Annapureddy, V. Veeravalli","doi":"10.1109/ITA.2008.4601084","DOIUrl":"https://doi.org/10.1109/ITA.2008.4601084","url":null,"abstract":"New upper bounds on the sum capacity of the two-user Gaussian interference channel are derived. Using these bounds, it is shown that treating interference as noise achieves the sum capacity if the interference levels are below certain thresholds.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114331039","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}
引用次数: 64
The Entropy Photon-Number Inequality and its consequences 熵光子数不等式及其结果
2008 Information Theory and Applications Workshop Pub Date : 2007-10-30 DOI: 10.1109/ITA.2008.4601037
S. Guha, B. Erkmen, J. Shapiro
{"title":"The Entropy Photon-Number Inequality and its consequences","authors":"S. Guha, B. Erkmen, J. Shapiro","doi":"10.1109/ITA.2008.4601037","DOIUrl":"https://doi.org/10.1109/ITA.2008.4601037","url":null,"abstract":"Determining the ultimate classical information carrying capacity of electromagnetic waves requires quantum-mechanical analysis to properly account for the bosonic nature of these waves. Recent work has established capacity theorems for bosonic single-user, broadcast, and wiretap channels, under the presumption of two minimum output entropy conjectures. Despite considerable accumulated evidence that supports the validity of these conjectures, they have yet to be proven. Here we show that the preceding minimum output entropy conjectures are simple consequences of an entropy photon-number inequality, which is a conjectured quantum-mechanical analog of the entropy power inequality from classical information theory.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125875648","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}
引用次数: 34
A truncation depth rule of thumb for convolutional codes 卷积代码的截断深度经验法则
2008 Information Theory and Applications Workshop Pub Date : 2007-05-01 DOI: 10.1109/ITA.2008.4601052
Bruce Moision
{"title":"A truncation depth rule of thumb for convolutional codes","authors":"Bruce Moision","doi":"10.1109/ITA.2008.4601052","DOIUrl":"https://doi.org/10.1109/ITA.2008.4601052","url":null,"abstract":"The commonly used rule of thumb of 5 m for the truncation depth of a memory m convolutional code is accurate only for rate 1/2 codes and should be replaced by two to three times m/(1-r) for a rate r code.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133604915","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
High-resolution distributed functional quantization 高分辨率分布式功能量化
2008 Information Theory and Applications Workshop Pub Date : 1900-01-01 DOI: 10.1109/ITA.2008.4601035
Vinith Misra, V. K. Goyal, L. Varshney
{"title":"High-resolution distributed functional quantization","authors":"Vinith Misra, V. K. Goyal, L. Varshney","doi":"10.1109/ITA.2008.4601035","DOIUrl":"https://doi.org/10.1109/ITA.2008.4601035","url":null,"abstract":"In traditional modes of lossy compression, attaining low distortion letter-by-letter on a vector of source letters X<sub>1</sub> <sup>N</sup>=(X<sub>1</sub>, X<sub>2</sub>,..., X<sub>N</sub>)isinRopf<sup>N</sup> is the implicit aim. We consider here instead the goal of estimating at the destination a function G(X<sub>1</sub> <sup>N</sup>) of the source data under the constraint that each X<sub>i</sub> must be separately scalar quantized. The design of optimal fixed- and variable-rate scalar quantizers is considered under the assumptions of high-resolution quantization theory, yielding optimal point densities for regular quantizers. Additionally, we consider how performance scales with N for certain classes of functions. This demonstrates potentially large improvement from consideration of G in the quantizer design.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114324960","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
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信