2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)最新文献

筛选
英文 中文
Outage capacity and throughput analysis of multiuser FSO systems 多用户FSO系统的中断容量和吞吐量分析
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-06 DOI: 10.1109/CWIT.2015.7255172
S. Zhalehpour, M. Uysal, O. Dobre, T. Ngatched
{"title":"Outage capacity and throughput analysis of multiuser FSO systems","authors":"S. Zhalehpour, M. Uysal, O. Dobre, T. Ngatched","doi":"10.1109/CWIT.2015.7255172","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255172","url":null,"abstract":"In this paper, we investigate the performance of free space optical (FSO) systems with a multiuser scheme employing select-max scheduling technique. Specifically, we consider an FSO communication system which employs a central node equipped with N transmit apertures, each of which aimed to any of the users. Under the assumption of log-normal turbulence channels, we derive closed-form outage capacity and outage throughput expressions for the FSO communication system and demonstrate the effect of the outage probability, number of users and average signal-to-noise ratio on the system performance.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122540959","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
Locality-aware fountain codes for massive distributed storage systems 大规模分布式存储系统的位置感知喷泉码
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-06 DOI: 10.1109/CWIT.2015.7255143
Toritseju Okpotse, S. Yousefi
{"title":"Locality-aware fountain codes for massive distributed storage systems","authors":"Toritseju Okpotse, S. Yousefi","doi":"10.1109/CWIT.2015.7255143","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255143","url":null,"abstract":"Low repair locality of a distributed storage code has been shown to reduce strain on storage node input-output (I/O) resources during node repair operations after a failure. In this paper, we consider the use of Fountain codes for distributed storage systems and aim to understand the relationship between repair locality and code parameters for a systematic Fountain code. While the information-theoretic trade-off between repair locality and storage overhead has been understood and characterized, the challenge of choosing a locality value that satisfies multiple storage system design metrics is yet to be resolved. We approach this problem by deriving an expression for the probability distribution of repair locality in terms of the rateless code degree distribution coefficients and suggest that factoring this relationship into the code design process enables the design of rateless codes better adjusted to the needs of a massive distributed storage system.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126411357","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
A fast displacement-based Peterson decoder 基于位移的快速彼得森解码器
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-06 DOI: 10.1109/CWIT.2015.7255142
C. Senger, F. Kschischang
{"title":"A fast displacement-based Peterson decoder","authors":"C. Senger, F. Kschischang","doi":"10.1109/CWIT.2015.7255142","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255142","url":null,"abstract":"A displacement-based approach for solving the Peterson system that arises in the decoding of generalized Reed-Solomon codes is presented. The main contribution is an LU factorization algorithm for the corresponding Toeplitz coefficient matrix, implemented as a sequence of vector-matrix multiplications each with linear instead of quadratic time-complexity, resulting in overall quadratic decoding time-complexity.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126899220","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
Empirical support for the high-density subset sum decision threshold 高密度子集和决策阈值的经验支持
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-01 DOI: 10.1109/CWIT.2015.7255176
Thomas O'Neil, Travis Desell
{"title":"Empirical support for the high-density subset sum decision threshold","authors":"Thomas O'Neil, Travis Desell","doi":"10.1109/CWIT.2015.7255176","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255176","url":null,"abstract":"This article describes several properties of the random problem space for the Subset Sum problem, derived both empirically and analytically. Empirical results support the conjecture that Subset Sum instances always have a solution when the input set S is a set of n elements with a maximum value of m, the target sum t is between m and the sum of the smallest n - 1 elements of S, and n ≥ ⌊m/2⌋ + 1. While the proof of this conjecture remains an open problem, exhaustive enumeration of problem instances has resulted in no counterexamples for values of m ≤ 49. Sequential processing was used to generate the empirical data for values up to m = 40. The SubsetSum@Home volunteer computing project reproduced the results of the sequential code and extended the enumeration beyond m = 49.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130243917","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
Non-binary distributed arithmetic coding 非二进制分布式算术编码
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-01 DOI: 10.1109/CWIT.2015.7255140
Ziyang Wang, Yongyi Mao, I. Kiringa
{"title":"Non-binary distributed arithmetic coding","authors":"Ziyang Wang, Yongyi Mao, I. Kiringa","doi":"10.1109/CWIT.2015.7255140","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255140","url":null,"abstract":"The development of wireless sensor networks has inspired great research interest in the design of distributed source coding(DSC) schemes. Among various DSC schemes, distributed arithmetic coding (DAC) is an attractive option due to its low encoding complexity as well as its good performance at short block lengths. Since DAC has only been proposed for binary sources to date, in this paper we propose two non-binary DAC schemes and investigate their performance and complexity via computer simulations.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117126020","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
Upper bound on the capacity of the nonlinear Schrödinger channel 非线性Schrödinger通道容量的上界
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-02-23 DOI: 10.1109/CWIT.2015.7255144
Mansoor I. Yousefi, G. Kramer, F. Kschischang
{"title":"Upper bound on the capacity of the nonlinear Schrödinger channel","authors":"Mansoor I. Yousefi, G. Kramer, F. Kschischang","doi":"10.1109/CWIT.2015.7255144","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255144","url":null,"abstract":"It is shown that the capacity of the channel modeled by (a discretized version of) the stochastic nonlinear Schrödinger (NLS) equation is upper-bounded by log(l + SNR) with SNR = P<sub>0</sub>/σ<sup>2</sup>(z), where P<sub>0</sub> is the average input signal power and σ<sup>2</sup>(z) is the total noise power up to distance z. The result is a consequence of the fact that the deterministic NLS equation is a Hamiltonian energy-preserving dynamical system.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126520895","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}
引用次数: 30
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学术官方微信