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

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

筛选
英文 中文
Wideband localization via range likelihood based on reduced dataset 基于约简数据集的距离似然宽带定位
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-09-14 DOI: 10.1109/CWIT.2015.7255160
Stefania Bartoletti, Wenhan Dai, A. Conti, M. Win
{"title":"Wideband localization via range likelihood based on reduced dataset","authors":"Stefania Bartoletti, Wenhan Dai, A. Conti, M. Win","doi":"10.1109/CWIT.2015.7255160","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255160","url":null,"abstract":"Wideband localization commonly relies on accurate range information extracted from received waveforms, which can be obtained via hard-decision or soft-decision ranging. While hard-decision ranging based on energy samples has received much attention because of its low-complexity, soft-decision ranging based on waveform samples can significantly improve the localization accuracy at the cost of higher complexity. This paper proposes new soft-decision ranging techniques with low complexity for wideband localization. The proposed techniques adopt range likelihood functions obtained from a reduced dataset of the received waveform samples. Results show that the proposed soft-decision techniques enable localization with higher accuracy compared to hard-decision ranging.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116028336","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
Adaptive erasure code based distributed storage systems 基于自适应纠删码的分布式存储系统
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-09-14 DOI: 10.1109/CWIT.2015.7255179
B. K. Rai
{"title":"Adaptive erasure code based distributed storage systems","authors":"B. K. Rai","doi":"10.1109/CWIT.2015.7255179","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255179","url":null,"abstract":"Consider the following scenario: A data storage service provider provides an erasure code based distributed storage system (DSS). For the same data, the service provider gives several options: an (n<sub>i</sub>, k<sub>i</sub>) erasure code based DSS for i = 1,2, ..., m. The service provider charges differently for different options (say dollar Pi for an (n<sub>i</sub>, k<sub>i</sub>) erasure code based DSS for the data B of size |B|). A client had initially chosen for an (n<sub>i</sub>, k<sub>i</sub>) erasure code based DSS. At some point of time, the client wants to change for another option, say for an (n<sub>j</sub>, k<sub>j</sub>) erasure code based DSS for the same data, where 1≤ i, j ≤ m, i ≠ j. Thus, service provider would require to convert the (n<sub>i</sub>, k<sub>i</sub>) erasure code based DSS into an (n<sub>j</sub>, k<sub>j</sub>) erasure code based DSS. The service provider has the following problem: How to design an erasure code based DSS so that the conversion of an (n<sub>i</sub>, k<sub>i</sub>) erasure code based DSS into an (n<sub>j</sub>, k<sub>j</sub>) erasure code based DSS, for 1 ≤ i, j ≤ m, i ≠ j, can be done by downloading the minimum amount of data? In this paper, we present an adaptive coding scheme which requires to download the minimum amount of data while converting an (n<sub>i</sub>, k<sub>i</sub>) erasure code based DSS to an (n<sub>j</sub>, k<sub>j</sub>) erasure code based DSS, where 1 ≤ i, j ≤ m, i ≠ j.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"3 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114112494","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
A novel non-parametric method for blind identification of STBC codes 一种新的STBC码盲识别非参数方法
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-06 DOI: 10.1109/CWIT.2015.7255161
Mostafa Mohammadkarimi, O. Dobre
{"title":"A novel non-parametric method for blind identification of STBC codes","authors":"Mostafa Mohammadkarimi, O. Dobre","doi":"10.1109/CWIT.2015.7255161","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255161","url":null,"abstract":"In this paper, a method for blind identification of linear space-time block codes is presented. This relies on a binary tree for decision making, with features based on the empirical cumulative distribution functions of received signal statistics employed at each node. The proposed method avoids estimation of the channel and noise statistics, and modulation format, and is robust to the carrier frequency offset. Simulation results show that when compared with the existing methods, such as the fourth-order lag product and second-order cyclostationarity-based methods, the proposed non-parametric method exhibits a superior performance.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"41 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":"116690966","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
On bounds for the cognitive multiple access Z-Interference Channel 认知多址z干扰信道的边界问题
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-06 DOI: 10.1109/CWIT.2015.7255149
Fernando Reátegui del Águila, M. Z. Shakir, M. Imran, R. Tafazolli, K. Qaraqe, T. Ngatched
{"title":"On bounds for the cognitive multiple access Z-Interference Channel","authors":"Fernando Reátegui del Águila, M. Z. Shakir, M. Imran, R. Tafazolli, K. Qaraqe, T. Ngatched","doi":"10.1109/CWIT.2015.7255149","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255149","url":null,"abstract":"The Cognitive Multiple Access Z-Interference Channel consists of a MAC channel that receives interference from an external transmitter. In a previous work we studied this model where both MAC users are cognitive and showed that an encoding scheme based on Dirty Paper coding attains the capacity region for the Gaussian case. In this work we assume that only one MAC user is cognitive and show that the non-cognitive MAC user can still benefit from the cognition of the other MAC user compared to the case where none of the MAC users are cognitive. We compare the achievable rate region obtained for our model with those for the cases where interference is treated as noise and where part of the primary user's message is decodable at the MAC receiver.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"370 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":"123408860","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
Improved training and training power allocation schemes for multi-relay AF networks 改进了多中继AF网络的训练和训练功率分配方案
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-06 DOI: 10.1109/CWIT.2015.7255185
Dan Wang, Y. Jing
{"title":"Improved training and training power allocation schemes for multi-relay AF networks","authors":"Dan Wang, Y. Jing","doi":"10.1109/CWIT.2015.7255185","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255185","url":null,"abstract":"For a multi-relay amplify-and-forward (AF) network, an improved training scheme is proposed and the corresponding training power allocation problem is investigated for the individual channel estimation at the destination. Compared with a previous scheme where the training of the source-relay channels is conducted sequentially, the proposed scheme exploits the broadcast nature of the source-relay links to save training time and power. By analyzing the total mean square error (MSE) of all channel estimates and with the help of approximations, we derive a training power allocation solution among the source and the relays. Simulation results demonstrate that our improved training scheme and power allocation solution obtain lower total MSE than the existing schemes.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"259 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":"122747306","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
Higher dimensional varieties in coding theory 编码理论的高维变体
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-06 DOI: 10.1109/CWIT.2015.7255139
I. Blake, V. Murty, Hamid Usefi
{"title":"Higher dimensional varieties in coding theory","authors":"I. Blake, V. Murty, Hamid Usefi","doi":"10.1109/CWIT.2015.7255139","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255139","url":null,"abstract":"We consider enumeration and construction of points on diagonal and Hermitian surfaces. We give a recursive construction technique for the set of rational points of Hermitian surfaces. Then we apply this recursive enumeration of rational points to construct codes on Hermitian surfaces.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"32 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":"122592129","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
Improving transmission rate for the two-way relay channel by user cooperation 通过用户合作提高双向中继信道的传输速率
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-06 DOI: 10.1109/CWIT.2015.7255184
Ahmad Abu Al Haija, M. Vu
{"title":"Improving transmission rate for the two-way relay channel by user cooperation","authors":"Ahmad Abu Al Haija, M. Vu","doi":"10.1109/CWIT.2015.7255184","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255184","url":null,"abstract":"We analyze the impact of user cooperation in the two-way relay channel (TWRC) by letting each user send a quantized version of its received signal in addition to its own message. The proposed scheme is based on quantize-forward (QF) and partial decode-forward (PDF) relaying with sliding window decoding at the relay, and QF relaying with backward decodings at each user. For Gaussian channels, examples show that although there is no improvement on the sum rate, the individual rate can be significantly increased. Moreover, as the power of one user approaches infinity, the transmission rate of the other user asymptotically achieves the capacity by reaching the cut-set bound. Hence, such user cooperation may be useful in networks where users have different priorities.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"42 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":"117245888","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
On the secrecy capacity of fading Gaussian wiretap channel 衰落高斯窃听信道的保密能力研究
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-06 DOI: 10.1109/CWIT.2015.7255147
M. K. Hossan, Sanjay Karmakar, Anirban Ghosh
{"title":"On the secrecy capacity of fading Gaussian wiretap channel","authors":"M. K. Hossan, Sanjay Karmakar, Anirban Ghosh","doi":"10.1109/CWIT.2015.7255147","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255147","url":null,"abstract":"We consider the fast-fading Gaussian wiretap channel with single antenna nodes and without channel state information at the transmitter (CSIT), where the fading processes of the two links are arbitrary and independent of each other. We derive an upper bound to the secrecy capacity for this channel and an achievable rate as well. Subsequently, we identify a class of channel statistics for which the outer bound and the achievable rates are identical thereby characterizes the exact secrecy capacity of the channel. The class of channels with such channel statistics are called stochastically degraded in this paper. Many practical wireless settings including the Rayleigh fading environment fall under this stochastically degraded class. We illustrate our results by computing explicit expression for the secrecy capacity for Rayleigh distributed wiretap channels.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"51 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":"134445834","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
Uplink scheduling in multi-cell MU-MIMO systems with ZF post-processing and diversity combining 基于ZF后处理和分集组合的多小区MU-MIMO系统上行调度
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-06 DOI: 10.1109/CWIT.2015.7255158
Aasem N. Alyahya, J. Ilow
{"title":"Uplink scheduling in multi-cell MU-MIMO systems with ZF post-processing and diversity combining","authors":"Aasem N. Alyahya, J. Ilow","doi":"10.1109/CWIT.2015.7255158","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255158","url":null,"abstract":"This paper considers the selection of users and corresponding uplink decoding in multi-user multiple-input multiple-output (MU-MIMO) multi-cell systems, applicable to future wireless networks with centralized processing at the wireless controller (WC). Two-layer decoding is proposed. First, for all active mobile stations (MSs) the spatial streams are decoupled at the pre-assigned base stations (BSs) by using a zero-forcing (ZF) type algorithm. Second, for MSs with strong signals, hard-decision decoding is performed at the BSs; while for other MSs, especially those at the edge of the cells, soft decisions from multiple BSs are passed to the WC, where maximum ratio combining (MRC) is performed. When deploying MRC, two strategies are considered to deal with the inter-cell interference (ICI). Assuming access at the WC to hard-decoded user data, or the lack of it, MRC with successive interference cancellation (SIC) and conventional MRC are investigated, respectively. Simulation results are provided to demonstrate the potential of the technique developed in terms of total system sum rate performance.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"13 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":"132637132","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
Rf-pilot phase noise compensation for long-haul coherent optical OFDM systems 远距离相干光OFDM系统的射频导频相位噪声补偿
2015 IEEE 14th Canadian Workshop on Information Theory (CWIT) Pub Date : 2015-07-06 DOI: 10.1109/CWIT.2015.7255168
Jingwen Zhu, O. Omomukuyo, R. Venkatesan, Cheng Li, O. Dobre
{"title":"Rf-pilot phase noise compensation for long-haul coherent optical OFDM systems","authors":"Jingwen Zhu, O. Omomukuyo, R. Venkatesan, Cheng Li, O. Dobre","doi":"10.1109/CWIT.2015.7255168","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255168","url":null,"abstract":"Long-haul optical transmission systems employing coherent optical orthogonal frequency division multiplexing (CO-OFDM) are sensitive to laser phase noise. This causes a common phase rotation and inter-carrier interference. An effective method to compensate for the phase noise is to insert an RF-pilot tone in the middle of the OFDM signal. This RF-pilot is used to reverse the phase distortion at the receiver. This paper presents a performance analysis of the RF-pilot phase noise compensation scheme in a simulated 64 Gb/s CO-OFDM system. The effects of various parameters including laser linewidth, Mach-Zehnder modulator drive power, pilot-to-signal ratio, and fiber launch power are investigated. A comparison with the pilot-aided common phase error compensation method is provided to show the differences in the BER performance with respect to the required overhead.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"1 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":"123417628","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
下一页 尾页
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学术官方微信