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

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks最新文献

筛选
英文 中文
Opportunistic Cooperative Diversity Protocols for Wireless Networks 无线网络的机会合作分集协议
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318045
Z. Ding, Y. Gong, T. Ratnarajah, C. Cowan
{"title":"Opportunistic Cooperative Diversity Protocols for Wireless Networks","authors":"Z. Ding, Y. Gong, T. Ratnarajah, C. Cowan","doi":"10.1109/ITWITWN.2007.4318045","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318045","url":null,"abstract":"In this paper we consider a cooperative communication system where some a priori information of wireless channels is available at the transmitter. Several opportunistic relaying strategies are developed to fully utilize the available channel information. Then an explicit expression of the outage probability is developed for each proposed cooperative scheme as well as the diversity-multiplexing tradeoff by using order statistics. Our analytical results show that the more channel information available at the transmitter, the better performance a cooperative system can achieve. When the exact values of the source-relay channels are available, the performance loss at low SNR can be effectively suppressed. When the source node has the access to the source-relay and relay-destination channels, the full diversity can be achieved by costing only one extra channel used for relaying transmission, and an optimal diversity-multiplexing tradeoff can be achieved d(r) = (N + 1)(1 - 2r), where N is the number of all possible relaying nodes.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120983945","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
Design of Cross-Packet Channel Coding with Low-Density Parity-Check Codes 低密度奇偶校验码跨包信道编码设计
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318036
J. Chui, A. Chindapol
{"title":"Design of Cross-Packet Channel Coding with Low-Density Parity-Check Codes","authors":"J. Chui, A. Chindapol","doi":"10.1109/ITWITWN.2007.4318036","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318036","url":null,"abstract":"We describe a new mechanism that extends the notion of current hybrid automatic repeat request (H-ARQ) schemes. Unlike other H-ARQ methods, if a retransmission for a packet is required, the retransmission jointly embeds the original information of the first packet as well as additional information from a second packet. In fading channels, this approach introduces diversity gain for the first packet without decreasing the overall code rate. This concept is demonstrated with an implementation based on low-density parity-check (LDPC) codes, and simulations show that this H-ARQ scheme provides a significant increase in coding gain for the first packet, and incurs negligible loss of coding gain for the second packet.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123907360","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}
引用次数: 10
Expected Distortion for Gaussian Source with a Broadcast Transmission Strategy over a Fading Channel 衰落信道上广播传输策略高斯源的期望失真
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318028
C. Tian, A. Steiner, S. Shamai, S. Diggavi
{"title":"Expected Distortion for Gaussian Source with a Broadcast Transmission Strategy over a Fading Channel","authors":"C. Tian, A. Steiner, S. Shamai, S. Diggavi","doi":"10.1109/ITWITWN.2007.4318028","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318028","url":null,"abstract":"We consider the problem of transmitting a Gaussian source on a slowly fading Gaussian channel, subject to the mean squared error distortion measure. The channel state information is known only at the receiver but not the transmitter. The source is assumed to be encoded in a successive refinement manner, and then transmitted over the channel using the broadcast strategy. In order to minimize the expected distortion at the receiver, optimal power allocation is essential. We propose an efficient algorithm to compute the optimal solution in linear time O(M). Moreover, we provide a derivation of the optimal power allocation when the fading state is a continuum, using the classical variational method. The proposed algorithm as well as the continuous solution is based on an alternative representation of the capacity region of the Gaussian broadcast channel.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129972528","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
On Sequences with Good Correlation Properties: A New Perspective 关于具有良好相关性质的序列:一个新的视角
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318030
P. Stoica, Jian Li, Ming Xue
{"title":"On Sequences with Good Correlation Properties: A New Perspective","authors":"P. Stoica, Jian Li, Ming Xue","doi":"10.1109/ITWITWN.2007.4318030","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318030","url":null,"abstract":"The so-called merit factor approach (MFA) to radar binary sequence design has led to several theoretical contributions in fairly diverse research areas including information theory, computer science, combinatorial optimization, and analytical number theory. However, the pragmatic motivation of this approach is shown here to be questionable. Specifically, the MFA -which basically aims at minimizing the clutter effect on radar performance -implicitly assumes the use of a least-squares (LS) receiver that is optimal only when there is no clutter. This apparent inconsistency in the problem formulation can be eliminated by using a more general optimal instrumental-variables (IV) receiver in lieu of the LS receiver. The IV receiver proposed here is shown to reject clutter much more efficiently than the LS receiver. Additionally, the binary sequence design problem associated with the IV receiver is shown to have an interesting form that is likely to attract the attention of the readers previously interested in the MFA.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124337489","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 Note on Distinguishing Attacks 关于区分攻击的说明
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318038
Håkan Englund, Martin Hell, T. Johansson
{"title":"A Note on Distinguishing Attacks","authors":"Håkan Englund, Martin Hell, T. Johansson","doi":"10.1109/ITWITWN.2007.4318038","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318038","url":null,"abstract":"A new distinguishing attack scenario for stream ciphers, allowing a resynchronization collision attack, is presented. The attack can succeed if the part of the state that depends on both the key and the IV is smaller than twice the key size. It is shown that the attack is applicable to block ciphers in OFB mode. For OFB mode, the attack is more powerful than the previously known generic distinguishing attack since it will directly recover a part of the plaintext while having the same asymptotic complexity as the generic distinguishing attack. The attack is also demonstrated on the eSTREAM candidate LEX. LEX is not vulnerable to any of the previously known generic distinguishing attack but is vulnerable to the new attack. It is shown that if approximately 265.7 resynchro-nizations using LEX are performed for the same key, some plaintext might be recovered.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129852031","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}
引用次数: 28
Achieving the Lowest Outage Probability for Multi-Phase Cooperative Wireless Networks 实现多相协作无线网络的最低中断概率
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318072
Chen Sun, Jun Cheng, M. Taromaru
{"title":"Achieving the Lowest Outage Probability for Multi-Phase Cooperative Wireless Networks","authors":"Chen Sun, Jun Cheng, M. Taromaru","doi":"10.1109/ITWITWN.2007.4318072","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318072","url":null,"abstract":"The performance of a multi-phase cooperative communication is studied in a wireless network. Each node is a mobile module having multiple antennas (MA) or a group of sensors forming a virtual antenna array (VAA). The scenario comprises a number of multiple-input multiple-output (MIMO) channels with mutually independent Rayleigh fading processes. A data frame from a signal source node is split into portions. Each portion is transmitted from a distinct node in a sequential manner to the destination node. First, we give the criterion on how to select wireless nodes for achieving the lowest outage probability of information capacity. Second, the analytical expressions of the optimal frame splitting (FS) ratios are derived for arbitrary signal-to-noise (SNR) situations. This is fulfilled by employing Gaussian approximations of those random MIMO channel capacities. Finally, we examine the optimal FS ratios in high-SNR regime. The theoretical results are useful to designing cooperative communication protocols.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128394054","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}
引用次数: 6
A Rank-Metric Approach to Error Control in Random Network Coding 随机网络编码误差控制的秩-度量方法
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318069
Danilo Silva, F. Kschischang, R. Koetter
{"title":"A Rank-Metric Approach to Error Control in Random Network Coding","authors":"Danilo Silva, F. Kschischang, R. Koetter","doi":"10.1109/ITWITWN.2007.4318069","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318069","url":null,"abstract":"The problem of error control in random network coding is considered, and a formulation of the problem is given in terms of rank-metric codes. This formulation allows many of the tools developed for rank-metric codes to be applied to random network coding. A random network code induces a generalized decoding problem for rank-metric codes in which the channel may supply partial information about the error in the form of erasures (knowledge of an error location not its values) and deviations (knowledge of an error value but not its location).","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131041838","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}
引用次数: 143
Some Key Problems in Network Error Correction Coding Theory 网络纠错编码理论中的几个关键问题
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318047
Zhen Zhang, Xijin Yan, Huseyin Balli
{"title":"Some Key Problems in Network Error Correction Coding Theory","authors":"Zhen Zhang, Xijin Yan, Huseyin Balli","doi":"10.1109/ITWITWN.2007.4318047","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318047","url":null,"abstract":"This paper summarizes our recent works on network error correction codes. We study basic properties of linear network error correction codes in the single source multicast case. We define the minimum distance of a network error correction code which plays the same role as it does in classical coding theory. We construct MDS codes and give sufficient conditions for its existence. We propose basic decoding algorithms and analyze their performance. We propose an improved upper bound for the failure probability of random network code and use it to analyze the performance of randomized network error correction codes [9], [10]. We study the possibility of decoding beyond error correction capability. We propose a hybrid network error correction coding systems. An extensive performance analysis of this coding system is reported in a separate paper.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116763910","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
On the Effects of Pseudo-Codewords on Independent Rayleigh Flat-Fading Channels 伪码字对独立瑞利平衰落信道的影响
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318057
E. Rosnes
{"title":"On the Effects of Pseudo-Codewords on Independent Rayleigh Flat-Fading Channels","authors":"E. Rosnes","doi":"10.1109/ITWITWN.2007.4318057","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318057","url":null,"abstract":"In this work, we consider the pairwise error probability (PEP) of a linear programming (LP) decoder for a general binary linear code as formulated by Feldman et al. (IEEE Trans. Inform. Theory, Mar. 2005) on an independent (or memoryless) Rayleigh flat-fading channel with coherent detection and perfect channel state information (CSI) at the receiver. Let H be a parity-check matrix of a binary linear code and consider LP decoding based on H. The output of the LP decoder is always a pseudo-codeword. We will show that the PEP of decoding to a pseudo-codeword omega when the all-zero codeword is transmitted on an independent Rayleigh flat-fading channel with coherent detection and perfect CSI at the receiver, behaves asymptotically as K(omega)ldr(Es/NO)-chi(omega), where chi(omega) is the support set of omega, i.e., the set of non-zero coordinates, Es/NO is the average signal-to-noise ratio (SNR), and K(omega) is a constant independent of the SNR. Thus, the asymptotic decay rate of the error probability with the average SNR is determined by the size of the smallest non-empty stopping set in the Tanner graph of H.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122837561","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 Strong Converse for the Broadcast Capacity Region of Two-Pase Bidirectional Relaying 两相双向中继广播容量区的强反向问题
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318043
I. Bjelakovic, T. Oechtering, C. Schnurr, H. Boche
{"title":"On the Strong Converse for the Broadcast Capacity Region of Two-Pase Bidirectional Relaying","authors":"I. Bjelakovic, T. Oechtering, C. Schnurr, H. Boche","doi":"10.1109/ITWITWN.2007.4318043","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318043","url":null,"abstract":"In our previous work we determined the weak capacity region for the broadcast phase of two-phase bidirectional relay channel. It turned out that the set of achievable rates obtained by optimizing over the two communication phases exceeds that obtained by using the network coding principle, i.e. by applying XOR to the decoded messages. In this paper we supplement our result by a proof of the strong converse with respect to the maximum error probability to the coding theorem for the broadcast phase. This result implies that the capacity region of that phase remains constant for a certain range of values of average error parameters [epsiv1,epsiv2].","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127752634","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
下一页 尾页
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学术官方微信