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

2009 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Hybrid digital-analog joint source-channel coding for broadcasting correlated Gaussian sources 广播相关高斯源的混合数模联合信源信道编码
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205799
H. Behroozi, F. Alajaji, T. Linder
{"title":"Hybrid digital-analog joint source-channel coding for broadcasting correlated Gaussian sources","authors":"H. Behroozi, F. Alajaji, T. Linder","doi":"10.1109/ISIT.2009.5205799","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205799","url":null,"abstract":"We consider the transmission of a bivariate Gaussian source S = (S1, S2) across a power-limited two-user Gaussian broadcast channel. User i (i = 1, 2) observes the transmitted signal corrupted by Gaussian noise with power σi2 and wants to estimate Si. We study hybrid digital-analog (HDA) joint source-channel coding schemes and analyze these schemes to obtain achievable (squared-error) distortion regions. Two cases are considered: 1) source and channel bandwidths are equal, 2) broadcasting with bandwidth compression. We adapt HDA schemes of Wilson et al. [1] and Prabhakaran et al. [2] to provide various achievable distortion regions for both cases. Using numerical examples, we demonstrate that for bandwidth compression, a three-layered coding scheme consisting of analog, superposition, and Costa coding performs well compared to the other provided HDA schemes. In the case of matched bandwidth, a three-layered coding scheme with an analog layer and two layers, each consisting of a Wyner-Ziv coder followed by a Costa coder, performs best.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116222486","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}
引用次数: 12
Approximate capacity of a class of Gaussian relay-interference networks 一类高斯中继干扰网络的近似容量
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205512
S. Mohajer, David Tse, S. Diggavi
{"title":"Approximate capacity of a class of Gaussian relay-interference networks","authors":"S. Mohajer, David Tse, S. Diggavi","doi":"10.1109/ISIT.2009.5205512","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205512","url":null,"abstract":"In this paper we study the Gaussian relay-interference network, in which relay (helper) nodes are to facilitate competing information flows over a wireless network. We examine this problem for certain regimes of channel values, when one of the cross-links is dominated by noise, resulting in Z and/or S configurations for the networks. For these Gaussian ZZ and ZS networks, we establish an approximate characterization of the rate region. The outer bounds to the capacity regions are established using genie-aided techniques that extend the methods used for the Gaussian interference channel to the relay-interference network. For the inner bound of the ZZ network, we utilize a new interference management scheme, termed interference neutralization, which was inspired by our earlier study of such deterministic networks. This technique allows for over-the-air interference removal, without the transmitters having complete access to the interfering signals.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122403389","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}
引用次数: 39
Embedding maximum entropy models in algebraic varieties by Gröbner bases methods 利用Gröbner基方法在代数变量中嵌入最大熵模型
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205528
Ambedkar Dukkipati
{"title":"Embedding maximum entropy models in algebraic varieties by Gröbner bases methods","authors":"Ambedkar Dukkipati","doi":"10.1109/ISIT.2009.5205528","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205528","url":null,"abstract":"The main aim of this paper is to present some notions on how results from commutative algebra and algebraic geometry could be used in representation and computation of maximum entropy (ME) models in the cases, where an integer valued sufficient statistic exists. We give an implicit description of ME-models by embedding them in algebraic varieties for which we use Gröbner bases methods. We prove that in the case of ME, both the model and the data can be represented by algebraic varieties.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122726974","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
A G-estimator of the MIMO channel ergodic capacity MIMO信道遍历容量的g估计
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205643
P. Vallet, P. Loubaton
{"title":"A G-estimator of the MIMO channel ergodic capacity","authors":"P. Vallet, P. Loubaton","doi":"10.1109/ISIT.2009.5205643","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205643","url":null,"abstract":"In this paper, we deal with the estimation of the ergodic capacity of large MIMO systems, using training sequences whose lengths are of the same order of magnitude than the number of antennas. In this context, the traditional estimator becomes inconsistent. Following the ideas developed by Girko in the context of the so-called theory of G-estimation, we propose a new estimator. We analyze its asymptotic behaviour and show, using numerical simulations, that it tends to improve significantly the performance of the standard estimate for a realistic number of antennas.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128253847","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
On LP decoding of nonbinary expander codes 非二进制扩展码的LP译码
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205740
Vitaly Skachek
{"title":"On LP decoding of nonbinary expander codes","authors":"Vitaly Skachek","doi":"10.1109/ISIT.2009.5205740","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205740","url":null,"abstract":"A linear-programming (LP) decoder for nonbinary expander codes is presented. It is shown that the proposed decoder has the maximum-likelihood certificate properties. It is also shown that this decoder corrects any pattern of errors of a relative weight up to approximately 1/4δ<inf>A</inf>δ<inf>B</inf> (where δ<inf>A</inf> and δ<inf>B</inf> are the relative minimum distances of the constituent codes).","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129339586","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
Soft-decision-and-forward protocol for cooperative communication networks based on Alamouti code 基于Alamouti码的协作通信网络软决策转发协议
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5206487
Dong-joon Shin, Kyoung-Young Song, Jong-Seon No
{"title":"Soft-decision-and-forward protocol for cooperative communication networks based on Alamouti code","authors":"Dong-joon Shin, Kyoung-Young Song, Jong-Seon No","doi":"10.1109/ISIT.2009.5206487","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5206487","url":null,"abstract":"A cooperative protocol called soft-decision-and-forward (SDF) is introduced. SDF protocol exploits the soft decision values of the received signal at the relay node. Alamouti code is used for orthogonal transmission and distributed space-time codes are designed for non-orthogonal transmission. The maximum likelihood decoders with low decoding complexity are proposed. From simulations, it can be seen that SDF protocol outperforms AF protocol.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129913330","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
A sequential procedure for simultaneous detection and state estimation of Markov signals 一个同时检测和状态估计马尔科夫信号的顺序程序
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205663
E. Grossi, M. Lops, V. Maroulas
{"title":"A sequential procedure for simultaneous detection and state estimation of Markov signals","authors":"E. Grossi, M. Lops, V. Maroulas","doi":"10.1109/ISIT.2009.5205663","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205663","url":null,"abstract":"The problem of joint detection and state estimation of a Markov signal when a variable number of noisy measurements can be taken is here considered. In particular, the signal-observation sequence {Xi;Zi}i∈N is a hidden Markov process (HMP) while, if the signal is absent, the measurement {Zi}i2∈N is an i.i.d. process. In this framework, two coupled detection and estimation procedures are introduced for the cases of discrete and continuous state space. Bounds on the performance of the proposed procedures in terms of the thresholds are derived, similar to the classical bounds for the sequential probability ratio test (SPRT). Moreover, it is shown that, under a set of rather mild conditions, the procedures end with probability one and the stopping time is almost surely minimized in the class of tests with the same or smaller error probabilities.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130413514","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
Codes over M2(F2) and applications to Golden space-time coded modulation M2(F2)上的编码及其在Golden空时编码调制中的应用
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205614
F. Oggier, P. Solé, J. Belfiore
{"title":"Codes over M2(F2) and applications to Golden space-time coded modulation","authors":"F. Oggier, P. Solé, J. Belfiore","doi":"10.1109/ISIT.2009.5205614","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205614","url":null,"abstract":"In this paper, we study code constructions over the finite ring M<inf>2</inf>(F<inf>2</inf>), the ring of 2×2 matrices with coefficients in the finite field F<inf>2</inf>. We show how they can be related to classical codes over F<inf>4</inf>. We provide as application the design of outer codes for 2 × 2 space-time coded modulation, when the inner code is the so-called Golden code.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130593744","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
On multiple-input multiple-output Gaussian channels with arbitrary inputs subject to jamming 多输入多输出高斯信道任意输入易受干扰
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5206051
M. Rodrigues, Gil Ramos
{"title":"On multiple-input multiple-output Gaussian channels with arbitrary inputs subject to jamming","authors":"M. Rodrigues, Gil Ramos","doi":"10.1109/ISIT.2009.5206051","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5206051","url":null,"abstract":"This paper considers communication over channels subject to jamming. By capitalizing on the relationship between the mutual information and the minimum mean-squared error (MMSE), we investigate the interference covariance that minimizes the mutual information of a deterministic multiple-input multiple-output (MIMO) channel subject to Gaussian noise and Gaussian interference with arbitrary (not necessarily Gaussian) input distributions. We show that the worst interference covariance satisfies a fixed-point equation involving key system quantities, including the MMSE matrix. We also specialize the form of the worst interference covariance to the asymptotic regimes of low and high snr. We demonstrate that in the low-snr regime the worst interference covariance injects an appropriate amount of power directly into the channel eigenmodes. In contrast, in the high-snr regime the worst interference covariance minimizes the minimum distance between a modified version of the constellation vectors. Numerical results illustrate that optimization of the interference covariance has the potential to substantially decrease the reliable information transmission rate between a transmitterreceiver pair. The results are also applicable to scenarios where a jammer aims to impair the secrecy rate of wiretap channels.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123323510","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
The maximum likelihood probability of skewed patterns 歪斜模式的最大似然概率
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5206021
A. Orlitsky, Shengjun Pan
{"title":"The maximum likelihood probability of skewed patterns","authors":"A. Orlitsky, Shengjun Pan","doi":"10.1109/ISIT.2009.5206021","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5206021","url":null,"abstract":"A pattern is skewed if, as in 11123, one of its symbols repeats and the others appear once. We show that the pattern-maximum-likelihood distribution of essentially all skewed patterns consists of one discrete element whose probability is the fraction of times the repeated symbol appears in the pattern.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114354779","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}
引用次数: 13
首页 上一页 下一页 尾页
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学术官方微信