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

2013 13th Canadian Workshop on Information Theory最新文献

筛选
英文 中文
On selection of optimal parameters for the WG stream cipher family 关于WG流密码族最优参数的选择
2013 13th Canadian Workshop on Information Theory Pub Date : 2013-06-18 DOI: 10.1109/CWIT.2013.6621585
K. Mandal, G. Gong, Xinxin Fan, M. Aagaard
{"title":"On selection of optimal parameters for the WG stream cipher family","authors":"K. Mandal, G. Gong, Xinxin Fan, M. Aagaard","doi":"10.1109/CWIT.2013.6621585","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621585","url":null,"abstract":"In this paper, we first present some new results about the Welch-Gong (WG) transformations, followed by a description of the WG stream cipher family which is built upon an LFSR and a WG transformation over an extension field. The randomness properties of keystreams produced by a decimated WG cipher are derived based on the new results. We also discuss the selection criteria for choosing the optimal parameters for a WG cipher in order to achieve the maximum level of security. Finally, we present the optimal parameters for the WG transformations over F2m, 7 ≤ m ≤ 16 based on the proposed criteria.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126102958","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
Asymptotic error rate analysis of H-S/EGC over arbitrarily correlated Rician channels 任意相关通道H-S/EGC的渐近错误率分析
2013 13th Canadian Workshop on Information Theory Pub Date : 2013-06-18 DOI: 10.1109/CWIT.2013.6621589
Xuegui Song, Julian Cheng, N. Beaulieu
{"title":"Asymptotic error rate analysis of H-S/EGC over arbitrarily correlated Rician channels","authors":"Xuegui Song, Julian Cheng, N. Beaulieu","doi":"10.1109/CWIT.2013.6621589","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621589","url":null,"abstract":"We study asymptotic error rate performance of a multi-branch hybrid selection/equal-gain combining (H-S/EGC) diversity reception system over arbitrarily correlated Rician channels. Based on an integral representation of the joint probability density function of multivariate Rician random variables with arbitrary correlations, closed-form asymptotic error rate expression is derived for multi-branch H-S/EGC diversity reception. Numerical results indicate that this analytical solution can be used to estimate the error rate in large signal-to-noise ratio regimes accurately. The analytical results reveal some important insights into the performance characteristics of H-S/EGC diversity reception system operating over arbitrarily correlated Rician fading channels.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"359 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133408015","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
Translation schemes and LP bounds 翻译方案和LP边界
2013 13th Canadian Workshop on Information Theory Pub Date : 2013-06-18 DOI: 10.1109/CWIT.2013.6621620
A. Al-Bashabsheh, Yongyi Mao, T. Chan
{"title":"Translation schemes and LP bounds","authors":"A. Al-Bashabsheh, Yongyi Mao, T. Chan","doi":"10.1109/CWIT.2013.6621620","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621620","url":null,"abstract":"We summarize some results and concepts regarding translation schemes in hope of making such topic more accessible. Two subclasses of translation schemes are of particular interest, namely, the ordered and unordered extension schemes. A linear programming (LP) bound for translation schemes is discussed. Specifying the translation scheme as the ordered extension of the one-class translation scheme, such LP bound reduces to the recently derived LP bound of Chan et al. based on the notion of support enumerator.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131627426","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
Electrical-SNR-optimized detection threshold for OOK IM/DD optical wireless communications OOK IM/DD光无线通信的电信噪比优化检测阈值
2013 13th Canadian Workshop on Information Theory Pub Date : 2013-06-18 DOI: 10.1109/CWIT.2013.6621617
Luanxia Yang, Julian Cheng, J. Holzman
{"title":"Electrical-SNR-optimized detection threshold for OOK IM/DD optical wireless communications","authors":"Luanxia Yang, Julian Cheng, J. Holzman","doi":"10.1109/CWIT.2013.6621617","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621617","url":null,"abstract":"We first revisit the problem of on-off keying demodulation with fixed detection thresholds over atmospheric turbulence channels. The resulting error floors are derived for a variety of turbulence channel models. To eliminate the irreducible error floors, we propose a detection system based on the electrical signal-to-noise ratio. Such a system offers performance compromise between the optimum system with time-varying detection threshold and the suboptimal system with fixed detection threshold.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134520849","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
Scheduling in omnidirectional relay networks 全向中继网络中的调度
2013 13th Canadian Workshop on Information Theory Pub Date : 2013-06-18 DOI: 10.1109/CWIT.2013.6621608
Shuning Wang, Liang-Liang Xie
{"title":"Scheduling in omnidirectional relay networks","authors":"Shuning Wang, Liang-Liang Xie","doi":"10.1109/CWIT.2013.6621608","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621608","url":null,"abstract":"We consider the optimal scheduling problem of the omnidirectional relay scheme in wireless networks. In a half-duplex model, we first present an optimal operation scheme that can achieve the maximum rate for the all-source all-cast problem for both one-dimensional and two-dimensional regular networks. Then, we show that the same rate can also be achieved with the greedy scheme. In the full-duplex model, the maximum rate is achieved with a simpler proof compared to the previous result. Some discussions are presented on more general networks.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130948980","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
Using bit recycling to reduce Knuth's balanced codes redundancy 使用位回收来减少Knuth的平衡码冗余
2013 13th Canadian Workshop on Information Theory Pub Date : 2013-06-18 DOI: 10.1109/CWIT.2013.6621583
Ahmad Al-Rababa'a, Danny Dubé, J. Chouinard
{"title":"Using bit recycling to reduce Knuth's balanced codes redundancy","authors":"Ahmad Al-Rababa'a, Danny Dubé, J. Chouinard","doi":"10.1109/CWIT.2013.6621583","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621583","url":null,"abstract":"Donald Knuth published an efficient algorithm for constructing a code with balanced codewords. A balanced codeword is a codeword that contains an equal number of zero's and one's. The redundancy of the codes built using Knuth's algorithm is about twice the lower bound on redundancy. In this paper we propose a new scheme based on the bit recycling compression technique to reduce Knuth's algorithm redundancy. The proposed scheme does not affect the simplicity of Knuth's algorithm and achieves less redundancy. Theoretical results and an analysis of our scheme are presented as well.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134454227","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
Optical communication using coherent detection with space-time coding in the presence of atmospheric turbulence 在大气湍流中使用相干探测与空时编码的光通信
2013 13th Canadian Workshop on Information Theory Pub Date : 2013-06-18 DOI: 10.1109/CWIT.2013.6621615
Mingbo Niu, Julian Cheng, J. Holzman
{"title":"Optical communication using coherent detection with space-time coding in the presence of atmospheric turbulence","authors":"Mingbo Niu, Julian Cheng, J. Holzman","doi":"10.1109/CWIT.2013.6621615","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621615","url":null,"abstract":"Space-time codes are of great interest for wireless communication systems as they can be used to improve the system performance. For optical wireless communications using coherent detection, atmospheric channels can induce fading as well as phase noise to degrade wireless link performance. In this paper, a space-time coded communication system is studied for a wireless optical link using coherent detection over atmospheric turbulence channels. An Alamouti-type space-time coded system structure is proposed when both turbulence-induced fading and phase noise from the channel and lasers are present. The error rate performance is analyzed for the proposed scheme over a wide range of turbulence conditions. Closed-form error rate expressions are derived for such systems for fast performance evaluation. In numerical case studies, the usefulness of the proposed optical wireless space-time coded system is demonstrated by a comparison to a single-input single-output optical wireless communication system.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126455652","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
Energy of decoding algorithms 解码算法的能量
2013 13th Canadian Workshop on Information Theory Pub Date : 2013-06-18 DOI: 10.1109/CWIT.2013.6621582
Christopher G. Blake, F. Kschischang
{"title":"Energy of decoding algorithms","authors":"Christopher G. Blake, F. Kschischang","doi":"10.1109/CWIT.2013.6621582","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621582","url":null,"abstract":"A standard model for the energy of a computation was developed by Thompson, which relates the energy of a computation to the product of the area a circuit and the number of clock cycles needed to carry out the computation. We show that for any circuit implemented this way, using any algorithm that performs decoding of a codeword passed through a binary symmetric channel, as the block length approaches infinity either (a) the probability of block error approaches 1 or (b) the energy of the computation scales at least as equation. This implies that the energy of successful decoding, per decoded bit, must scale at least as equation.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126574821","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
Streaming erasure codes under mismatched source-channel frame rates 在不匹配的源信道帧率下的流擦除码
2013 13th Canadian Workshop on Information Theory Pub Date : 2013-06-18 DOI: 10.1109/CWIT.2013.6621611
Pratik Patil, Ahmed Badr, A. Khisti
{"title":"Streaming erasure codes under mismatched source-channel frame rates","authors":"Pratik Patil, Ahmed Badr, A. Khisti","doi":"10.1109/CWIT.2013.6621611","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621611","url":null,"abstract":"Streaming erasure codes sequentially encode a source stream into channel packets over a burst erasure channel and guarantee that each source frame is recovered within a fixed decoding delay. We study streaming codes when M channel packets need to be transmitted between successive source frames. This extends earlier works which exclusively focus on the case when M = 1. We obtain a general upper bound on the associated streaming capacity and show that it can be achieved for sufficiently large decoding delays using a layered code. For the minimum possible decoding delay we also establish the streaming capacity and show that it can be obtained using a repetition code.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125814341","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
Properties of the polarization transformations for the likelihood ratios of symmetric B-DMCs 对称b - dmc似然比的极化变换性质
2013 13th Canadian Workshop on Information Theory Pub Date : 2013-03-13 DOI: 10.1109/CWIT.2013.6621586
Mine Alsan
{"title":"Properties of the polarization transformations for the likelihood ratios of symmetric B-DMCs","authors":"Mine Alsan","doi":"10.1109/CWIT.2013.6621586","DOIUrl":"https://doi.org/10.1109/CWIT.2013.6621586","url":null,"abstract":"We investigate, starting with a symmetric B-DMC, the evolution of various probabilities related to the likelihood ratios of the synthetic channels created by the recursive application of the polarization transformations. We show the processes are bounded sub/super martingales converging to the extremes of the bounded intervals. In particular, this is true for the process that tracks the error probability of the likelihood ratio based decision rule of the synthetic channels. Moreover, the derivations reveal the set of BECs do not only provide universally good indices for the information sets of symmetric B-DMCs, but also universally bad indices. The analysis provides a new perspective into the theory of channel polarization initiated by Arikan, and it helps us to address an approximation to the computations of the likelihood ratios of the synthetic channels.","PeriodicalId":398936,"journal":{"name":"2013 13th Canadian Workshop on Information Theory","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124894468","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学术官方微信