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

2007 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Asymptotic Capacity of Multi-Level Amplify-and-Forward Relay Networks 多级放大转发中继网络的渐近容量
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557424
Shu-ping Yeh, O. Lévêque
{"title":"Asymptotic Capacity of Multi-Level Amplify-and-Forward Relay Networks","authors":"Shu-ping Yeh, O. Lévêque","doi":"10.1109/ISIT.2007.4557424","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557424","url":null,"abstract":"This paper analyzes the capacity of a wireless relay network composed of a large number of nodes that operate in an amplify-and-forward mode and that divide into a fixed number of levels. The capacity computation relies on the study of products of large random matrices, whose limiting eigenvalue distribution is computed via a set of recursive equations.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133794078","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}
引用次数: 61
Multilevel Broadcast Networks 多级广播网络
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557122
Shashi Borade, Lizhong Zheng, M. Trott
{"title":"Multilevel Broadcast Networks","authors":"Shashi Borade, Lizhong Zheng, M. Trott","doi":"10.1109/ISIT.2007.4557122","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557122","url":null,"abstract":"This paper is eligible for the student paper award. We formulate a broadcast problem, where based on their quality of observations, outputs at various receivers are represented on a graph (called \"degradation graph\"). If receiver Z is a physically degraded version of receiver Y, then node Z is a child of node Y in this graph. This generalization of the classical degraded broadcast channel provides a framework for various situations where at least some information should be available to receivers with partial (or noisier) observations. Upper and lower bounds are obtained on the capacity region. The upper bound is based on auxiliary variables, whose structure is described by the mirror image of the channel's degradation graph. As a special case of our problem, a packet broadcast network is considered.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133821203","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}
引用次数: 31
High Diversity Scheme for Wireless Networks based on Interference Cancellation 基于干扰消除的无线网络高分集方案
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557395
C. Rao, B. Hassibi
{"title":"High Diversity Scheme for Wireless Networks based on Interference Cancellation","authors":"C. Rao, B. Hassibi","doi":"10.1109/ISIT.2007.4557395","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557395","url":null,"abstract":"Consider a wireless network with m transmitter-receiver pairs and an additional n relay nodes to assist communication. We are interested in the rate/diversity trade-off of such a system. Since the presence of interference is known to reduce diversity significantly, we propose a transmission scheme based on interference cancellation by the relay nodes. This scheme achieves a diversity linear in the number of relay nodes (over all rates up to the maximum possible). Compared to a protocol where receivers decode all transmitted messages, the new scheme is seen to achieve higher diversity at higher rates.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116994728","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 Multiterminal Secrecy Capacities 关于多终端保密能力
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557158
I. Csiszár, P. Narayan
{"title":"On Multiterminal Secrecy Capacities","authors":"I. Csiszár, P. Narayan","doi":"10.1109/ISIT.2007.4557158","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557158","url":null,"abstract":"Shannon-theoretic secret key generation by several parties is considered for source models in which the distinct components of a multiple source observed separately by multiple terminals, and for channel models in which a secure noisy channel with one input terminal and multiple output terminals, and, additionally in both cases, a public noiseless channel of unlimited capacity, are available for accomplishing this goal. The secret key is generated for a set A of terminals, with the remaining terminals (if any) cooperating in this task through their public communication. We show that for source models in which secrecy is required from an eavesdropper that observes only the public communication and perhaps also a set of terminals disjoint from A, secrecy capacity can be achieved with noninteractive communication, the key being generated by any chosen terminal in the secret key-seeking set A of terminals obliviously of the public communication. For models in which the eavesdropper also possesses side information that is not available to any of the terminals cooperating in secrecy generation, an upper bound for the secrecy capacity and a sufficient condition for its tightness are given. The latter partially fills a gap in the authors' previous work [6].","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116151496","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
On the minimum weight of simple full-length array LDPC codes 简单全长阵列LDPC码的最小权值研究
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1093/ietfec/e91-a.6.1502
K. Sugiyama, Y. Kaji
{"title":"On the minimum weight of simple full-length array LDPC codes","authors":"K. Sugiyama, Y. Kaji","doi":"10.1093/ietfec/e91-a.6.1502","DOIUrl":"https://doi.org/10.1093/ietfec/e91-a.6.1502","url":null,"abstract":"Simple and full-length array LDPC codes (SFA-LDPC codes) is a class of LDPC codes which are algebraically constructed from a family of array codes. The minimum weight of SFA-LDPC codes has been investigated in literatures, but exact minimum weight of the code is not known except for some small parameters. In this paper it is shown that the class of SFA-LDPC codes which are denoted by CA (p, 4) in this paper contains a codeword whose minimum weight is 10 or less, if p is a prime number greater than 7. Combined with the Yang's lower bound on the minimum weight of CA (p,4), this implies that the minimum weight of CA (p, 4) is exactly 10 for any prime p with p > 7.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116243117","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}
引用次数: 18
Multihopping Strategies: An Error-Exponent Comparison 多跳策略:误差指数比较
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557420
Wenyi Zhang, U. Mitra
{"title":"Multihopping Strategies: An Error-Exponent Comparison","authors":"Wenyi Zhang, U. Mitra","doi":"10.1109/ISIT.2007.4557420","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557420","url":null,"abstract":"Multihop channels are believed to provide benefits in performance because the reduction in transmission distance per hop directly translates to increased channel gains. However, a potential concern of multihop transmission is that the incurred delay also increases with the number of hops, and hence may pose challenges for delay-sensitive applications. This paper investigates the issue of delay from the perspective of error exponents, motivated by the fact that delay is tightly coupled with reliability. Two multihopping strategies are compared. The concatenated coding strategy, in which relay nodes perform inner coding and the source-destination pair further performs outer coding, is shown to provide near-optimal performance at low rates. In contrast, the pass-or-decode strategy, where relay nodes can either decode-and-forward or simply pass the received symbols, is shown to outperform the concatenated coding strategy as the achievable rate increases. The comparison suggests different system architectures for high and low rate applications,respectively.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115117653","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
Multiple Description Quantizer Design for Space-time Orthogonal Block Coded Channels 时空正交分组编码信道的多描述量化器设计
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557311
Yugang Zhou, W. Chan
{"title":"Multiple Description Quantizer Design for Space-time Orthogonal Block Coded Channels","authors":"Yugang Zhou, W. Chan","doi":"10.1109/ISIT.2007.4557311","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557311","url":null,"abstract":"We study the design of multiple description quantizers for space-time orthogonal block coded slow Rayleigh fading channels. A time-interleaver is employed at the transmitter to provide independent channel instances for the multiple descriptions, and a maximum a posteriori (MAP) decoder is employed at the receiver to jointly decode the multiple descriptions. We propose a scheme to optimize multiple description vector quantizers using an upper bound of the channel transition probability achieved by the MAP decoder. The scheme furnishes substantial performance gain.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123467610","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
A New Class of Asynchronous Distributed Space-Time Codes 一类新的异步分布式空时码
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557439
M. O. Damen, A. R. Hammons
{"title":"A New Class of Asynchronous Distributed Space-Time Codes","authors":"M. O. Damen, A. R. Hammons","doi":"10.1109/ISIT.2007.4557439","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557439","url":null,"abstract":"We propose a new class of C-linear distributed space-time codes for cooperative networks using a decode- and-forward strategy. Our codes achieve full spatial diversity regardless of the relays' timing offsets. The proposed codes are effective and flexible, enabling use of different signal constellations, transmission rates, numbers of transmit and receive antennas, and different tradeoffs between decoder complexity and overall performance. Furthermore, we extend our framework to handle the case where relays have multiple antennas and propose few examples of the modified code construction.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125026229","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
Distributed Resource Allocation for OFDMA System with Half-Duplex Relay using Rateless Code 基于无速率码的半双工中继OFDMA系统分布式资源分配
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557502
Shunqing Zhang, V. Lau
{"title":"Distributed Resource Allocation for OFDMA System with Half-Duplex Relay using Rateless Code","authors":"Shunqing Zhang, V. Lau","doi":"10.1109/ISIT.2007.4557502","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557502","url":null,"abstract":"This paper considers the resource allocation problem in the wireless OFDMA systems with a relay node. We consider half-duplex relay in which the relay node cannot transmit and receive simultaneously on the same frequency. As a result, the use of relay node may enhance or degrade the system throughput depending on the instantaneous channel states between the source and relay, the relay and the destination as well as the source and destination. Hence, it is very important to dynamically adjust the resource (subcarrier) allocated to the relay node so that the relay is used only at the right time according to the instantaneous channel states. Conventional approaches dynamically schedule the usage of the relay node in a centralized manner in which full knowledge of the channel states between any two nodes in the network is required. However, perfect knowledge of the channel states at various nodes are very difficult to obtain. In this paper, we shall propose a distributed resource allocation algorithm on the OFDMA system with half-duplex relay by employing rateless code. Based on the ACK/NAK exchanges between the source, destination and relay, the proposed algorithm iteratively allocates resource to the source and relay, and converge to the close-to-optimal allocation within finite steps. The resource allocation algorithm has low complexity and provable convergence property. Asymptotic throughput performance of the proposed algorithm is derived. We show that the system achieves significant throughput gain compared to the point-to-point baseline system without relay as well as the baseline system with random subcarrier allocation.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"84 2-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123461818","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
Secrecy Capacity Region of Fading Broadcast Channels 衰落广播信道的保密容量区域
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557401
Yingbin Liang, H. Poor, S. Shamai
{"title":"Secrecy Capacity Region of Fading Broadcast Channels","authors":"Yingbin Liang, H. Poor, S. Shamai","doi":"10.1109/ISIT.2007.4557401","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557401","url":null,"abstract":"The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The secrecy capacity region is first established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the Gaussian case of the Csiszar-Korner BCC model. The secrecy capacity results are then applied to give the ergodic secrecy capacity region for the fading BCC.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122082239","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}
引用次数: 47
首页 上一页
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学术官方微信