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

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

筛选
英文 中文
Distance properties and performance of physical layer network coding with binary linear codes for Gaussian two-way relay channels 高斯双向中继信道用二进制线性码编码物理层网络的距离特性和性能
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033920
Tao Yang, I. Land, Tao Huang, Jinhong Yuan, Zhuo Chen
{"title":"Distance properties and performance of physical layer network coding with binary linear codes for Gaussian two-way relay channels","authors":"Tao Yang, I. Land, Tao Huang, Jinhong Yuan, Zhuo Chen","doi":"10.1109/ISIT.2011.6033920","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033920","url":null,"abstract":"We investigate joint channel and physical layer network coding (CPNC) for Gaussian two-way relay channels. The two users' messages are encoded using the same binary linear code and are transmitted simultaneously with equal power. At the relay node, the network-coded message is recovered directly from the received signal sequence, and is then broadcast to the users. We propose a new methodology to explicitly find the distance spectrum of the coding scheme. Based on that, we analyze the error probability at the relay and derive an asymptotically tight performance bound (for high SNRs). We show that, with a general binary linear code, the CPNC scheme is subject to an asymptotic SNR loss of approximately ln 2 relative to the single-user case, regardless of the coding rate. Numerical results show that our analysis matches very well with the performance of the CPNC scheme.","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":"133639109","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
Random-coding joint source-channel bounds 随机编码联合源信道边界
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034267
A. T. Campo, G. Vazquez-Vilar, A. G. Fàbregas, Alfonso Martinez
{"title":"Random-coding joint source-channel bounds","authors":"A. T. Campo, G. Vazquez-Vilar, A. G. Fàbregas, Alfonso Martinez","doi":"10.1109/ISIT.2011.6034267","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034267","url":null,"abstract":"Random-coding exact characterizations and bounds to the error probability of joint source-channel coding are presented. In particular, upper bounds using maximum-a-posteriori and threshold decoding are derived as well as a lower bound motivated by Verdú-Han's lemma.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"201 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":"133674564","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
Deinterleaving Markov processes: The finite-memory switch case 去交错马尔可夫过程:有限内存切换情况
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034127
G. Seroussi, W. Szpankowski, M. Weinberger
{"title":"Deinterleaving Markov processes: The finite-memory switch case","authors":"G. Seroussi, W. Szpankowski, M. Weinberger","doi":"10.1109/ISIT.2011.6034127","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034127","url":null,"abstract":"We study the problem of deinterleaving a set of finite-memory (Markov) processes over disjoint finite alphabets, which have been randomly interleaved by a finite-memory switch, extending previous results obtained for the case of a memoryless switch [1]. The deinterleaver has access to a sample of the resulting interleaved process, but no knowledge of the number or structure of the Markov processes, or of the switch. We study conditions for uniqueness of the interleaved representation of a process, showing that certain switch configurations can cause ambiguities in the representation, in addition to those caused by memoryless component processes, which were known in the memoryless switch case. We show that a deinterleaving scheme based on minimizing a penalized maximum-likelihood cost function is strongly consistent also in the finite-memory switch case, in the sense of reconstructing, almost surely as the observed sequence length tends to infinity, a set of component and switch Markov processes compatible with the original interleaved process. Furthermore, under certain conditions on the structure of the switch, we show that the scheme recovers all possible interleaved representations of the original process. Experimental results are presented demonstrating that the proposed scheme performs well in practice, even for relatively short input samples.","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":"131809354","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
Is Unequal Error Protection useful? 不等错误保护有用吗?
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033770
Ozgun Y. Bursalioglu, G. Caire
{"title":"Is Unequal Error Protection useful?","authors":"Ozgun Y. Bursalioglu, G. Caire","doi":"10.1109/ISIT.2011.6033770","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033770","url":null,"abstract":"When transmitting source-encoded data, not all information bits are equally important, due to the different sensitivity of the source decoder to errors. Unequal Error Protection (UEP) consists of allocating coding redundancy depending on the importance of the information bits. We consider progressive transmission of source-encoded data under three different packet formats where either number of source bits per packet is fixed (fixed-k approach), or packet block length is fixed (fixed-n approach) or both parameters allowed to vary for each block (variable-(n, k) approach). Most existing results are based on some chosen family of channel codes and consider a single-user setting. Thanks to the recent finite length error probability results by Polyanskiy et al., in this work we investigate the UEP concept using the new finite-length random coding bounds. In the single-user case, we show that when codes meeting Polyanskiy achievability bounds are used, UEP does not obtain significant advantages over Equal-Error Protection (EEP) (advantages disappear for the variable-(n, k) case). Based on these results, a low complexity optimization algorithm is proposed for the multiuser (multicast) scenario.","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":"130296333","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
Secrecy games on the one-sided interference channel 单向干扰信道上的秘密游戏
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033734
Jianwei Xie, S. Ulukus
{"title":"Secrecy games on the one-sided interference channel","authors":"Jianwei Xie, S. Ulukus","doi":"10.1109/ISIT.2011.6033734","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033734","url":null,"abstract":"In this paper, we study the two-user one-sided interference channel with confidential messages. In this interference channel, in addition to the usual selfishness of the users, the relationship between the two pairs of users is further adversarial in the sense of both receivers' desires to eavesdrop on the communication of the other pair. We develop a game-theoretic model to study the information-theoretic secure communications in this setting. We first start with a game-theoretic model where each pair's payoff is their own secrecy rate. The analysis of the binary deterministic interference channel with this payoff function shows that self-jamming of a transmitter, which injures the eavesdropping ability of its own receiver, is not excluded by the Nash equilibria. We propose a refinement for the payoff function by explicitly accounting for the desire of the receiver to eavesdrop on the other party's communication. This payoff function captures the adversarial relationship between the two pairs of users better. We determine the Nash equilibria for the binary deterministic channel for both payoff functions.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"10 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":"114414714","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
Performance of hybrid codebook techniques for MISO downlink channels with limited feedback 有限反馈下MISO下行信道混合码本技术的性能
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033748
Sungkyu Jung, Kyeongjun Ko, Jungwoo Lee
{"title":"Performance of hybrid codebook techniques for MISO downlink channels with limited feedback","authors":"Sungkyu Jung, Kyeongjun Ko, Jungwoo Lee","doi":"10.1109/ISIT.2011.6033748","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033748","url":null,"abstract":"Multi-antenna downlink system with limited feedback can provide enormous capacity gains. In practical, two systems can be considered. One is zero-forcing beamforming (ZFBF), and the other is per user unitary rate control (PU2RC) which has been proposed for emerging cellular standards. In order to have good performance, ZFBF requires many feedback bits, and PU2RC requires many users. Recently, the authors proposed a hybrid multi-user MISO system which has merits of those two schemes simultaneously. In this paper, we analyze the sum-rate performance and quantization error of the hybrid scheme. The throughput scaling laws are also derived in high and medium SNR regimes.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"48 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":"114458362","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
Use of Gray codes for optimizing the search of (shortened) cyclic single burst-correcting codes 利用灰色码优化(缩短)循环单突发纠错码的搜索
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033720
L. J. García Villalba, Jose Rene Fuentes Cortez, A. L. Sandoval Orozco, M. Blaum
{"title":"Use of Gray codes for optimizing the search of (shortened) cyclic single burst-correcting codes","authors":"L. J. García Villalba, Jose Rene Fuentes Cortez, A. L. Sandoval Orozco, M. Blaum","doi":"10.1109/ISIT.2011.6033720","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033720","url":null,"abstract":"In a previous work [5] it was shown that the best measure for the efficiency of a single burst-correcting code is obtained using the Gallager bound as opposed to the Reiger bound. In this paper, an algorithm that optimizes the search for the best (shortened) cyclic burst-correcting codes is presented. The use of Gray codes in the algorithm optimizes the search, in the sense that no repeated syndromes are computed.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"17 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":"117130523","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
Gaussian fading broadcast channels with CSI only at the receivers: An improved constant gap 仅在接收机处具有CSI的高斯衰落广播信道:一种改进的常数间隙
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034122
R. Yates, J. Lei
{"title":"Gaussian fading broadcast channels with CSI only at the receivers: An improved constant gap","authors":"R. Yates, J. Lei","doi":"10.1109/ISIT.2011.6034122","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034122","url":null,"abstract":"We examine the capacity region of the K-user Gaussian fading broadcast channel with channel state known at the receivers but unknown at the transmitter. For binary expansion superposition signaling, we derive a new achievable rate based on soft decision decoding of the binary inputs. The approach is based on a simple tight bound on the output entropy of a high-SNR AWGN channel with a continuous uniform input. We show that a binary superposition signaling scheme is for each user within a constant gap of 5.443 b/s/Hz of the broadcast channel capacity for all fading state distributions.","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":"116261416","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
On the construction and MAP decoding of optimal variable-length error-correcting codes 最优变长纠错码的构造与MAP译码
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033955
Ting-Yi Wu, Po-Ning Chen, F. Alajaji, Y. Han
{"title":"On the construction and MAP decoding of optimal variable-length error-correcting codes","authors":"Ting-Yi Wu, Po-Ning Chen, F. Alajaji, Y. Han","doi":"10.1109/ISIT.2011.6033955","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033955","url":null,"abstract":"In this paper, we present a novel algorithm that guarantees of finding a variable-length error-correcting code (VLEC) with minimal average codeword length for a fixed free distance dfree. We also propose a low complexity maximum a posterior (MAP) decoding algorithm for our codes under the premise that the receiver knows the number of codewords being transmitted. The resulting VLEC provides significant gains over other codes from the literature. When compared with separate source-channel tandem codes with identical dfree, such as a tandem code consisting of a Huffman source code concatenated with a (2, 1, 4) tail-biting convolutional channel code, our system has only a 0.3 dB performance loss at a bit error rate of 10−5 while requiring significantly less decoding complexity.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"21 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":"123096360","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
Tree interactive encoding and decoding: Conditionally Φ-mixing sources 树交互编码和解码:有条件Φ-mixing源码
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033875
Jin Meng, E. Yang, Zhen Zhang
{"title":"Tree interactive encoding and decoding: Conditionally Φ-mixing sources","authors":"Jin Meng, E. Yang, Zhen Zhang","doi":"10.1109/ISIT.2011.6033875","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033875","url":null,"abstract":"Interactive encoding and decoding with tree decoding (referred to simply as tree interactive encoding and decoding (TRIED)) is considered for the problem of lossless source coding with decoder only side information. A TRIED scheme is proposed and demonstrated that when applied to encode any conditionally Φ-mixing source of length n, its error probability decays polynomially with respect to n, average rate is around conditional entropy rate, and average computational complexity of encoding and decoding is O(n ln n).","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"51 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":"123697174","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
首页 上一页 下一页 尾页
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学术官方微信