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

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

筛选
英文 中文
Joint Optimization of Adaptive Modulation and Coding, Power Control and Packet Retransmission over Block Fading Channels 分组衰落信道中自适应调制与编码、功率控制和分组重传的联合优化
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318033
J. S. Harsini, F. Lahouti
{"title":"Joint Optimization of Adaptive Modulation and Coding, Power Control and Packet Retransmission over Block Fading Channels","authors":"J. S. Harsini, F. Lahouti","doi":"10.1109/ITWITWN.2007.4318033","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318033","url":null,"abstract":"Adaptive modulation and coding (AMC) and automatic repeat request (ARQ) protocol are powerful techniques for improving the spectral efficiency (SE) or the error performance in wireless packet networks over fading channels. In this paper, we first consider a discrete-rate M-QAM based AMC scheme and propose a variable power transmission scheme for transmission of packets over block-fading wireless channels. Considering the error-correcting capability of the truncated-ARQ, which depends on the maximum number of retransmissions (Nr), we then optimize the AMC and power control schemes that guarantee the required packet loss rate (PLR) performance while satisfying an average transmit power constraint. Numerical results reveal that in wireless packet systems with limited packet length, the proposed link adaptation algorithm improves the system performance in terms of the SE and the PLR However, this improvement depends on the target PLR and Nr When the target PLR is sufficiently small, this improvement will be observed in terms of the SE for small Np however, in the larger target PLR, the improvement will only be observed in terms of the achievable PLR.","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":"116860449","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
Diversity Gains Across Line of Sight and Rich Scattering Environments from Space-Polarization-Time Codes 空间极化-时间码跨视线和丰富散射环境的分集增益
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318020
S. Sirianunpiboon, S. Howard, A. Calderbank
{"title":"Diversity Gains Across Line of Sight and Rich Scattering Environments from Space-Polarization-Time Codes","authors":"S. Sirianunpiboon, S. Howard, A. Calderbank","doi":"10.1109/ITWITWN.2007.4318020","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318020","url":null,"abstract":"Space-time codes built out of Alamouti components have been adopted in wireless standards such as UMTS, IEEE 802.1 In and IEEE 802.16 where they facilitate higher data rates through multiplexing of parallel data streams and the addition of two or more antennas at the receiver that perform interference cancellation. This paper provides new theoretical insight into an algorithm for interference cancellation through a Bayesian analysis that expresses performance as a function of SNR in terms of the ''angles\" between different space-time coded data streams. Our approach provides insights into the coupling of channel coding to spatial and polarization degrees of freedom.","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":"122374786","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}
引用次数: 21
Refined Coding Bounds for Network Error Correction 网络纠错的改进编码边界
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318046
Shenghao Yang, R. Yeung
{"title":"Refined Coding Bounds for Network Error Correction","authors":"Shenghao Yang, R. Yeung","doi":"10.1109/ITWITWN.2007.4318046","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318046","url":null,"abstract":"With respect to a given set of local encoding kernels defining a linear network code, refined versions of the Hamming bound, the Singleton bound and the Gilbert-Varshamov bound for network error correction are proved by the weight properties of network codes. This refined Singleton bound is also proved to be tight for linear message sets.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"77 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":"122870041","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
Hybrid ARQ: Theory, State of the Art and Future Directions 混合ARQ:理论、技术现状和未来方向
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318035
C. Lott, O. Milenkovic, E. Soljanin
{"title":"Hybrid ARQ: Theory, State of the Art and Future Directions","authors":"C. Lott, O. Milenkovic, E. Soljanin","doi":"10.1109/ITWITWN.2007.4318035","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318035","url":null,"abstract":"Hybrid ARQ transmission schemes combine the conventional ARQ with forward error correction. Incremental redundancy hybrid ARQ schemes adapt their error correcting code redundancy to varying channel gains, and thus achieve better throughput performance than ordinary ARQ, particularly over wireless channels with fluctuating channel conditions. Consequently, the scheme has been adopted by a number of standards for mobile phone networks. We provide a brief survey of theory and state of the art of hybrid ARQ, and present some possible future directions keeping in mind practical considerations.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"29 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":"124564393","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}
引用次数: 86
On the frame length of Achterbahn-128/80 关于Achterbahn-128/80的框架长度
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318039
R. Göttfert, B. Gammel
{"title":"On the frame length of Achterbahn-128/80","authors":"R. Göttfert, B. Gammel","doi":"10.1109/ITWITWN.2007.4318039","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318039","url":null,"abstract":"In this paper we examine a correlation attack against combination generators introduced by Meier et al. in 2006 and extended to a more powerful tool by Naya-Plasencia. The method has been used in the cryptanalysis of the stream ciphers Achterbahn and Achterbahn-128/80. No mathematical proofs for the method were given. We show that rigorous proofs can be given in an appropriate model, and that the implications derived from that model are in accordance with experimental results obtained from a true combination generator. We generalize the new correlation attack and, using that generalization, show that the internal state of Achterbahn-128 can be recovered with complexity 2119 using 248.54 consecutive keystream bits. In order to investigate a lower bound for the frame length of Achterbahn-128 we consider another application of the generalized correlation attack. This attack has complexity 2136 (higher than brute force) and requires 244.99 keystream bits. Similar results hold for Achterbahn-128. Due to these findings our new recommendation for the frame length of Achterbahn-128 and Achterbahn-80 is 244 bits.","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":"129163924","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
Dense MIMO Matrix Lattices and Class Field Theoretic Themes in Their Construction 密集MIMO矩阵格及其构造中的类场论主题
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318040
J. Lahtonen
{"title":"Dense MIMO Matrix Lattices and Class Field Theoretic Themes in Their Construction","authors":"J. Lahtonen","doi":"10.1109/ITWITWN.2007.4318040","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318040","url":null,"abstract":"Since the cyclic division algebras and their orders have become standard material for researchers seeking to construct good MIMO-lattices. The usual construction of the actual lattice corresponds to a cyclic submodule of an order. In a recent submission we studied the problem of identifying those cyclic division algebras that consume the least amount of the available signal space for a given minimum determinant. In this semi-tutorial note some of the material from is recapped together with hopefully illuminating examples. We also motivate our concept of density by previewing upper and lower bounds, and taking a closer look at some of the suggested MIMO-lattices in relation to these bounds.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"168 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131693032","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
Asymmetric Space-Time Block Codes for MIMO Systems MIMO系统的非对称空时分组码
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318041
C. Hollanti, K. Ranto
{"title":"Asymmetric Space-Time Block Codes for MIMO Systems","authors":"C. Hollanti, K. Ranto","doi":"10.1109/ITWITWN.2007.4318041","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318041","url":null,"abstract":"In this paper, the need for the construction of asymmetric space-time block codes (ASTBCs) is discussed, mostly concentrating on the case of four transmitting and two receiving antennas for simplicity. Above the trivial puncturing method, i.e. switching off the extra layers in the symmetric multiple input-multiple output (MIMO) setting, a more sophisticated yet simple asymmetric construction method is proposed. This method can be converted to produce multi-block space-time codes that achieve the diversity-multiplexing (D-M) tradeoff. It is also shown that maximizing the density of the newly proposed codes is equivalent to minimizing the discriminant of a certain order. The use of the general method is then demonstrated by building explicit, sphere decodable codes using different cyclic division algebras (CDAs). We verify by computer simulations that the newly proposed method can compete with the puncturing method, and in some cases outperforms it. Our conquering construction exploiting maximal orders improves even upon the punctured perfect code and the DjABBA code.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"28 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":"132422166","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
Robust Network Coding in the Presence of Link Failure Using a Multicast Rate-Diversity Trade off 链路失效时使用组播速率分集折衷的鲁棒网络编码
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318048
H. Bahramgiri, Mohammad Jabbari, F. Lahouti
{"title":"Robust Network Coding in the Presence of Link Failure Using a Multicast Rate-Diversity Trade off","authors":"H. Bahramgiri, Mohammad Jabbari, F. Lahouti","doi":"10.1109/ITWITWN.2007.4318048","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318048","url":null,"abstract":"We introduce a centralized joint network-channel coding scheme for maximized throughput and increased robustness against link failure in a communication network. We introduce RNC1(h,k) to multicast k independent data in a directed and acyclic network with capacity h, klesh . The redundancy through path diversity increases the resistance of the network against link failure. An improved version of RNC1, RNC2(h,k), is introduced to guarantee the rate k for h-k flow failures. The proposed schemes exploit the network structure for code design, which results in a manageable design complexity.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"46 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":"133734690","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
Subspace Properties of Randomized Network Coding 随机网络编码的子空间性质
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318023
Mahdi Jafari Siavoshani, C. Fragouli, S. Diggavi
{"title":"Subspace Properties of Randomized Network Coding","authors":"Mahdi Jafari Siavoshani, C. Fragouli, S. Diggavi","doi":"10.1109/ITWITWN.2007.4318023","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318023","url":null,"abstract":"Randomized network coding has network nodes randomly combine and exchange linear combinations of the source packets. A header appended to the packet, called coding vector, specifies the exact linear combination that each packet carries. The main contribution of this work is to investigate properties of the subspaces spanned by the collected coding vectors in each network node. We use these properties to exhibit the relationship between the network topology and the subspaces collected at the nodes. This allows us to passively infer the network topology for a general class of graphs.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"30 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":"114909517","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}
引用次数: 40
Serially Concatenated Continuous Phase Modulation with Extended BCH Codes 扩展BCH码的串行串联连续相位调制
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI: 10.1109/ITWITWN.2007.4318058
A. G. I. Amat, C. A. Nour, C. Douillard
{"title":"Serially Concatenated Continuous Phase Modulation with Extended BCH Codes","authors":"A. G. I. Amat, C. A. Nour, C. Douillard","doi":"10.1109/ITWITWN.2007.4318058","DOIUrl":"https://doi.org/10.1109/ITWITWN.2007.4318058","url":null,"abstract":"In this paper, serially concatenated continuous phase modulation (CPM) is considered. A concatenated structure consisting of a short extended BCH code as outer code is proposed, targeting a wide choice of spectral efficiencies, ranging from 0.75 to 2.25 bit/s/Hz. A two-step design procedure combining EXIT charts analysis and union bound techniques is used to optimize the association of the outer code and the CPM. An exhaustive study of several quaternary and octal CPM schemes is performed. The proposed concatenated structure offers very low error floors (frame error rate below 10-6) and good performance in the waterfall region for all spectral efficiencies. A significant improvement with respect to previous concatenated CPM schemes is shown. The envisaged application of the proposed scheme is the return link of broadband satellite communications.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"33 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":"114758098","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
首页 上一页 下一页 尾页
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学术官方微信