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

International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications最新文献

筛选
英文 中文
A non-coherent AF scheme for two-way wireless relay networks based on packings in Grassmann manifolds 基于格拉斯曼流形封装的双向无线中继网络非相干自动对焦方案
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2010-12-03 DOI: 10.1109/ISITA.2010.5649198
Z. Utkovski, Yao Cheng, J. Lindner
{"title":"A non-coherent AF scheme for two-way wireless relay networks based on packings in Grassmann manifolds","authors":"Z. Utkovski, Yao Cheng, J. Lindner","doi":"10.1109/ISITA.2010.5649198","DOIUrl":"https://doi.org/10.1109/ISITA.2010.5649198","url":null,"abstract":"Motivated from results for the point-to-point block MIMO fading channels without channel knowledge, we propose an AF scheme for the non-coherent two-way relaying channel with the half-duplex constraint. The communication takes place in two phases, multicast and broadcast. In the multicast phase the terminals send the signals simultaneously. In the broadcast phase, the relays resend the signal received in the broadcast phase. The code construction is based on subspace packings in the Grassmann manifolds. We show, that although no channel knowledge is assumed at either the terminals or at the relays, the terminals are able to subtract the self-interference part of the received signal. The performance analysis shows that the noncoherent two-way relaying outperforms non-coherent one-way relaying and delivers the promise of increased spectral efficiency.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77361058","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
On the joint decoding of LDPC codes and finite-state channels via linear programming 基于线性规划的LDPC码与有限状态信道联合译码
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513614
Byung-Hak Kim, H. Pfister
{"title":"On the joint decoding of LDPC codes and finite-state channels via linear programming","authors":"Byung-Hak Kim, H. Pfister","doi":"10.1109/ISIT.2010.5513614","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513614","url":null,"abstract":"In this paper, the linear programming (LP) decoder for binary linear codes, introduced by Feldman, et al. is extended to joint-decoding of binary-input finite-state channels. In particular, we provide a rigorous definition of LP joint-decoding pseudo-codewords (JD-PCWs) that enables evaluation of the pairwise error probability between codewords and JD-PCWs. This leads naturally to a provable upper bound on decoder failure probability. If the channel is a finite-state intersymbol interference channel, then the LP joint decoder also has the maximum-likelihood (ML) certificate property and all integer valued solutions are codewords. In this case, the performance loss relative to ML decoding can be explained completely by fractional valued JD-PCWs.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79637588","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
Communicating the sum of sources in a 3-sources/3-terminals network; revisited 通信3源/3端网络中的源和;重新审视
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513422
M. Langberg, A. Ramamoorthy
{"title":"Communicating the sum of sources in a 3-sources/3-terminals network; revisited","authors":"M. Langberg, A. Ramamoorthy","doi":"10.1109/ISIT.2010.5513422","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513422","url":null,"abstract":"We consider the problem of multicasting sums over directed acyclic networks with unit capacity edges. A set of source nodes si observe independent unit-entropy source processes X i and want to communicate Σ X i to a set of terminals t j . Previous work on this problem has established necessary and sufficient conditions on the s i -t j connectivity in the case when there are two sources or two terminals (Ramamoorthy '08), and in the case of three sources and three terminals (Langberg-Ramamoorthy '09). In particular the latter result establishes that each terminal can recover the sum if there are two edge disjoint paths between each s i -t j pair. In this work, we provide a new and significantly simpler proof of this result, and introduce techniques that may be of independent interest in other network coding problems.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86106657","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
Active eavesdropping in fast fading channels: A Block-Markov Wyner secrecy encoding scheme 快速衰落信道中的主动窃听:一种块马尔可夫维纳保密编码方案
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513558
G. Amariucai, Shuangqing Wei
{"title":"Active eavesdropping in fast fading channels: A Block-Markov Wyner secrecy encoding scheme","authors":"G. Amariucai, Shuangqing Wei","doi":"10.1109/ISIT.2010.5513558","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513558","url":null,"abstract":"This paper studies the problem of active eavesdropping in fast fading channels. The active eavesdropper (Eve-A) is a more powerful adversary than the classical eavesdropper. It can choose between two functional modes: eavesdropping (Ex mode), and jamming (Jx mode) - Eve-A cannot function in full duplex mode. We consider the most conservative scenario, when the Eve-A can choose her strategy based on the legitimate transmitter-receiver pair's strategy - and thus the transmitter and legitimate receiver have to plan for the worst. We introduce a novel encoding scheme, based on very limited and unprotected feedback - the Block-Markov Wyner (BMW) encoding scheme - which outperforms any schemes currently available.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78702167","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}
引用次数: 7
An upper bound on multi-hop transmission capacity with dynamic routing selection 基于动态路由选择的多跳传输容量上限
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513248
Yuxin Chen, J. Andrews
{"title":"An upper bound on multi-hop transmission capacity with dynamic routing selection","authors":"Yuxin Chen, J. Andrews","doi":"10.1109/ISIT.2010.5513248","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513248","url":null,"abstract":"This paper develops an upper bound on the end-to-end transmission capacity of multi-hop wireless networks, in which all nodes are randomly distributed. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form bound on the outage probability is derived in terms of the number of potential paths. This in turn gives an upper bound on the number of successful transmissions that can occur per unit area, which is known as the transmission capacity. The upper bound results from assuming independence among the potential paths, and can be viewed as the maximum diversity case. A useful aspect of the upper bound is its simple form for an arbitrary-sized network, which allows us to immediately observe how the number of hops and other network traits affect spatial throughput. Our analysis indicates that predetermined routing approach (such as nearest-neighbor) cannot achieve optimal throughput: more hops are not necessarily helpful in interference-limited networks compared with single-hop direct transmission.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80348552","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
Quasi-perfect geometrically uniform codes derived from graphs over Gaussian integer rings 从高斯整数环上的图导出的拟完美几何均匀码
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513673
Catia Quilles, R. Palazzo
{"title":"Quasi-perfect geometrically uniform codes derived from graphs over Gaussian integer rings","authors":"Catia Quilles, R. Palazzo","doi":"10.1109/ISIT.2010.5513673","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513673","url":null,"abstract":"In this paper we present a generalization of the perfect codes derived from the quotient rings of Gaussian integers. We call this class of codes quasi-perfect, which in addition to preserving the property of being geometrically uniform codes they are able to correct more error patterns than the perfect codes.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73504228","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
Source coding with a side information 'vending machine' at the decoder 源编码与侧信息“自动贩卖机”在解码器
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5206064
T. Weissman, H. Permuter
{"title":"Source coding with a side information 'vending machine' at the decoder","authors":"T. Weissman, H. Permuter","doi":"10.1109/ISIT.2009.5206064","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5206064","url":null,"abstract":"We have formalized and characterized the fundamental limits for the problem of source coding with decoder side information, where the decoder is allowed to choose actions that affect the nature and quality of the side information.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91472326","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
Maximizing sum rate and minimizing MSE on multiuser downlink: Optimality, fast algorithms and equivalence via max-min SIR 在多用户下行链路上最大化和速率和最小化MSE:通过max-min SIR实现最优化、快速算法和等价性
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205907
C. Tan, M. Chiang, R. Srikant
{"title":"Maximizing sum rate and minimizing MSE on multiuser downlink: Optimality, fast algorithms and equivalence via max-min SIR","authors":"C. Tan, M. Chiang, R. Srikant","doi":"10.1109/ISIT.2009.5205907","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205907","url":null,"abstract":"Maximizing the minimum weighted SIR, minimizing the weighted sum MSE and maximizing the weighted sum rate in a multiuser downlink system are three important performance objectives in joint transceiver and power optimization, where all the users have a total power constraint. We show that, through connections with the nonlinear Perron-Frobenius theory, jointly optimizing power and beamformers in the max-min weighted SIR problem can be solved optimally in a distributed fashion. Then, connecting these three performance objectives through the arithmetic-geometric mean inequality and nonnegative matrix theory, we solve the weighted sum MSE minimization and weighted sum rate maximization in the low to moderate interference regimes using fast algorithms.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78090721","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}
引用次数: 25
Diversity-multiplexing tradeoff of the dynamic decode and forward protocol on a MIMO half-duplex relay channel MIMO半双工中继信道上动态解码和转发协议的分集复用权衡
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205881
Sanjay Karmakar, M. Varanasi
{"title":"Diversity-multiplexing tradeoff of the dynamic decode and forward protocol on a MIMO half-duplex relay channel","authors":"Sanjay Karmakar, M. Varanasi","doi":"10.1109/ISIT.2009.5205881","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205881","url":null,"abstract":"We compute the diversity-multiplexing tradeoff (DMT) curve for a three node multi-input-multi-output (MIMO) half-duplex (HD) relay network, operating in the dynamic decode-and-forward (DDF) [1] mode. We consider the case where the source and the destination have n antennas each and the single relay node has m antennas. Denoting such a channel as a (n, m)-relay channel, we provide an analytical characterization of the DMT curve for certain simple configurations such as (n, 1), (1, m) and (2, 2). We employ a numerical method to compute the DMT for more general channel configurations. Interestingly, for low multiplexing gains the achievable diversity orders of the HD-DDF protocol coincides with the diversity orders achieved by the full-duplex decode-and-forward (FDDF) protocol analyzed in [2]. In fact, the HD-DDF and FDDF protocols achieve the same diversity orders for all integer multiplexing gains. Thus, the half duplex constraint does not significantly affect the achievable DMT for the DF protocol when the source and the destination have the same number of antennas.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75070337","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
Interference alignment and the generalized degrees of freedom of the X channel 干涉对准和X通道的广义自由度
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205582
Chiachi Huang, V. Cadambe, S. Jafar
{"title":"Interference alignment and the generalized degrees of freedom of the X channel","authors":"Chiachi Huang, V. Cadambe, S. Jafar","doi":"10.1109/ISIT.2009.5205582","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205582","url":null,"abstract":"We study the sum capacity of the X channel generalization of the symmetric 2-user interference channel. In this X channel, there are 4 independent messages, one from each transmitter to each receiver. We characterize the sum capacity of a deterministic version of this channel, and obtain the generalized degrees of freedom characterization for the Gaussian version. The regime where the X channel outperforms the underlying interference channel is explicitly identified, and an interesting interference alignment scheme based on a cyclic decomposition of the signal space is shown to be optimal in this regime.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82252244","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}
引用次数: 84
首页 上一页 下一页 尾页
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学术官方微信