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

2016 Iran Workshop on Communication and Information Theory (IWCIT)最新文献

筛选
英文 中文
Performance improvement of transmission links in overlay cognitive radio through interference alignment 通过干扰对准提高叠加认知无线电传输链路的性能
2016 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2016-05-03 DOI: 10.1109/IWCIT.2016.7491617
F. Rezaei, A. Tadaion
{"title":"Performance improvement of transmission links in overlay cognitive radio through interference alignment","authors":"F. Rezaei, A. Tadaion","doi":"10.1109/IWCIT.2016.7491617","DOIUrl":"https://doi.org/10.1109/IWCIT.2016.7491617","url":null,"abstract":"In this paper we propose a method to enhance the performance of both the primary and secondary links through interference alignment (IA) in an overlay cognitive scheme. We consider a cognitive network in which multiple multi-input multi-output (MIMO) secondary users (SUs) seek to overlay their signals with an existing MIMO primary user (PU). Since in overlay scheme, the cognitive transmitters have knowledge of the primary message, they can improve or maintain the communication of the PU. IA enables the SUs to enhance their performance without causing/receiving any interference to/from the PU while also improve the rate of the primary link. We try to enhance the performance of the users in two different scenarios. In the first one, the SUs assign part of their power to assist the primary transmission to reach its target rate and the remaining power for their own communication. In the second one, the SUs allocate part of their power for their own transmissions to reach their target sum rate and the remainder to assist the primary transmission. In addition, we employ power allocation method as an important issue to further improve the performance of the cognitive users. The analytical results are confirmed through simulations.","PeriodicalId":414101,"journal":{"name":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116336426","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
Dynamic index coding gain over a complete bi-directional side information graph 动态索引编码增益超过一个完整的双向侧信息图
2016 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2016-05-03 DOI: 10.1109/IWCIT.2016.7491621
M. Hadi, M. M. Mojahedian, M. Aref
{"title":"Dynamic index coding gain over a complete bi-directional side information graph","authors":"M. Hadi, M. M. Mojahedian, M. Aref","doi":"10.1109/IWCIT.2016.7491621","DOIUrl":"https://doi.org/10.1109/IWCIT.2016.7491621","url":null,"abstract":"Dynamic Index coding as a generalization of the traditional index coding problem, deals with transmission of some dynamic data flows in the presence of side information. For a dynamic index coding system, the set of average flow rates for which the system can be stable is named Code-Constraint Capacity region. In this paper, we identify the code-constraint capacity region for a dynamic index coding problem with complete bi-directional side information graph. Furthermore, we introduce the concept of Dynamic Index Coding Gain to quantify the improvement resulted from the dynamic index coding with respect to uncoded transmissions. We also provide some corollaries about system performance metrics such as delay and average number of queued packets. In addition, we show how time-sharing method may reduce transmission delay.","PeriodicalId":414101,"journal":{"name":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130995128","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
Comparison between fractional Fourier transform-based single carrier and OFDM systems 基于分数阶傅里叶变换的单载波与OFDM系统的比较
2016 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2016-05-03 DOI: 10.1109/IWCIT.2016.7491615
Z. Mokhtari, M. Sabbaghian
{"title":"Comparison between fractional Fourier transform-based single carrier and OFDM systems","authors":"Z. Mokhtari, M. Sabbaghian","doi":"10.1109/IWCIT.2016.7491615","DOIUrl":"https://doi.org/10.1109/IWCIT.2016.7491615","url":null,"abstract":"In this paper, we compare fractional Fourier transform orthogonal frequency division multiplexing (FrFT-OFDM) system and a single carrier (SC) system whose equalization is performed in the fractional Fourier domain which is called FrFT-SC. We first derive a tight upper bound for the interference power of the FrFT-SC signal in the fractional Fourier domain. Then, by obtaining the angle of transform which minimizes this tight upper bound, we derive a close approximation of the optimal angle of transform and show that it is similar to that of FrFT-OFDM system. Furthermore, we perform a comparative performance evaluation between the FrFT-OFDM and FrFT-SC systems from the bit error rate and peak to average power ratio (PAPR) point of views. The simulation results indicate that in a doubly dispersive channel, the FrFT-SC system significantly outperforms the FrFT-OFDM system when both systems utilize the near optimal angle of transform. Our comparison also shows that the PAPR of FrFT-OFDM system is significantly higher than that of FrFT-SC systems for all angles of transform between 0 and π.","PeriodicalId":414101,"journal":{"name":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114983929","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 new robust correntropy based Levenberg-Marquardt algorithm 一种新的鲁棒相关熵Levenberg-Marquardt算法
2016 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2016-05-03 DOI: 10.1109/IWCIT.2016.7491623
Ahmad Reza Heravi, G. Hodtani
{"title":"A new robust correntropy based Levenberg-Marquardt algorithm","authors":"Ahmad Reza Heravi, G. Hodtani","doi":"10.1109/IWCIT.2016.7491623","DOIUrl":"https://doi.org/10.1109/IWCIT.2016.7491623","url":null,"abstract":"Recently, there has been much interest in information theoretic learning (ITL) criteria, widely used in several applications with different robust algorithms. Dealing with the rate convergence of the information theoretic robust approaches, we introduce a fast novel correntropy based algorithm, as correntropy based Levenberg-Marquardt (CLM), and apply it to nonlinear learning problems. This new method converges significantly faster than common gradient descent maximum correntropy based method, and is robust against heavy-tailed noise distributions or outliers. In addition, as our numerical results illustrate, this novel method while having the same convergence rate as the previously presented fastest correntropy based method for linear models, called fixed-point maximum correntropy criteria (FP-MCC), is also valid for all linear and nonlinear learning models.","PeriodicalId":414101,"journal":{"name":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"748 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132279288","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
Iterative block-sparse recovery method for distributed MIMO radar 分布式MIMO雷达的迭代块稀疏恢复方法
2016 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2016-05-03 DOI: 10.1109/IWCIT.2016.7491622
A. Abtahi, M. Azghani, Javad Tayefi, F. Marvasti
{"title":"Iterative block-sparse recovery method for distributed MIMO radar","authors":"A. Abtahi, M. Azghani, Javad Tayefi, F. Marvasti","doi":"10.1109/IWCIT.2016.7491622","DOIUrl":"https://doi.org/10.1109/IWCIT.2016.7491622","url":null,"abstract":"In this paper, an iterative method for block-sparse recovery is suggested for target parameters estimation in a distributed MIMO radar system. The random sampling has been used as the sensing scheme in the receivers. The simulation results prove that the proposed method is superior to the other state-of-the-art techniques in the accuracy of the target estimation task.","PeriodicalId":414101,"journal":{"name":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131986611","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
An online transmission policy for energy harvesting systems with data traffic arrival 具有数据流量到达的能量收集系统的在线传输策略
2016 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2016-05-03 DOI: 10.1109/IWCIT.2016.7491613
M. Rezaee, M. Mirmohseni, M. Aref
{"title":"An online transmission policy for energy harvesting systems with data traffic arrival","authors":"M. Rezaee, M. Mirmohseni, M. Aref","doi":"10.1109/IWCIT.2016.7491613","DOIUrl":"https://doi.org/10.1109/IWCIT.2016.7491613","url":null,"abstract":"In communications, the nodes with the ability of harvesting energy potentially can prolong the overall network lifetime. In this paper, we consider a single-user energy harvesting wireless communication system, in which arrival data and harvested energy curves are modeled as continuous functions. Our goal is to find an online algorithm for the throughput maximization problem, which only needs the causal information of the arrival processes. We propose a heuristic online algorithm which is efficient for both discrete and continuous models, even when the distributions of harvested energy and arrival data are unknown.","PeriodicalId":414101,"journal":{"name":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130993100","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
Number of frequency slots in low collision Reed Solomon based frequency hopping sequences 基于Reed Solomon的低碰撞跳频序列的频率槽数
2016 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2016-05-03 DOI: 10.1109/IWCIT.2016.7491620
Seyed Javid Haghighat Hosseini, H. Bahramgiri
{"title":"Number of frequency slots in low collision Reed Solomon based frequency hopping sequences","authors":"Seyed Javid Haghighat Hosseini, H. Bahramgiri","doi":"10.1109/IWCIT.2016.7491620","DOIUrl":"https://doi.org/10.1109/IWCIT.2016.7491620","url":null,"abstract":"The idea of relating cyclic codes and frequency hopping (FH) sequences has yielded families of FH sequences, which meet tight bounds. Reed Solomon based FH sequences are an instance of such families. In this paper, these sequences are investigated for Galois fields of characteristic two. More specifically, the symbols utilized in each of sequences are calculated for two important cases, where hamming correlation between sequences is at most three. It has been shown that regardless of the length of sequence, the number of symbols utilized in such sequences can take only 5 values, and there is no sequence in which other number of symbols are used. The number of sequences in which a specified number of symbols are used is also counted, which shows that there is significant variation between the numbers of sequences as the number of symbols changes.","PeriodicalId":414101,"journal":{"name":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"26 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129384738","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
Asymmetric successive compute-and-forward 不对称连续计算和转发
2016 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2016-05-03 DOI: 10.1109/IWCIT.2016.7491625
Leila Ghabeli, M. Derpich
{"title":"Asymmetric successive compute-and-forward","authors":"Leila Ghabeli, M. Derpich","doi":"10.1109/IWCIT.2016.7491625","DOIUrl":"https://doi.org/10.1109/IWCIT.2016.7491625","url":null,"abstract":"In this paper we review the previously proposed methods for successive compute-and-forward and discuss about their incompleteness through some examples. Then we present a comprehensive formulation for multi-step successive interference cancellation problem through the asymmetric successive compute-and-forward strategy. It is shown that the generalized formulation includes the previous approaches.","PeriodicalId":414101,"journal":{"name":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122305758","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
Rate-splitting and successive decoding for Gaussian interference channels 高斯干扰信道的分频和连续译码
2016 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2016-05-03 DOI: 10.1109/IWCIT.2016.7491616
A. Haghi, A. Khandani
{"title":"Rate-splitting and successive decoding for Gaussian interference channels","authors":"A. Haghi, A. Khandani","doi":"10.1109/IWCIT.2016.7491616","DOIUrl":"https://doi.org/10.1109/IWCIT.2016.7491616","url":null,"abstract":"Joint decoding is employed in many coding schemes to achieve a larger rate region. However, decoding complexity escalates considerably when joint decoding is used. This paper studies the achievable sum-rate of the two-user Gaussian interference channel when joint decoding is replaced by successive decoding. When interference is weak, it is shown that, for a wide range of transmitters' powers, rate-splitting and joint decoding are not required. A single split scheme with successive decoding achieves the Han-Kobayashi sum-rate. When rate-splitting is required, a novel rate-splitting scheme is proposed that does not use joint decoding. The number of required splits and the amount of power allocated to each split are expressed in closed forms. It is proved that the difference between the sum-rate of this scheme and that of the Han-Kobayashi scheme is bounded, even when transmitters' powers approach infinity.","PeriodicalId":414101,"journal":{"name":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115124667","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
Non-binary deterministic measurement matrix construction employing maximal curves 利用最大曲线构造非二元确定性测量矩阵
2016 Iran Workshop on Communication and Information Theory (IWCIT) Pub Date : 2016-05-03 DOI: 10.1109/IWCIT.2016.7491614
Ali Mohades, Mohamad Mahdi Mohades, A. Tadaion
{"title":"Non-binary deterministic measurement matrix construction employing maximal curves","authors":"Ali Mohades, Mohamad Mahdi Mohades, A. Tadaion","doi":"10.1109/IWCIT.2016.7491614","DOIUrl":"https://doi.org/10.1109/IWCIT.2016.7491614","url":null,"abstract":"Designing a measurement matrix is a principal problem in the theory of compressive sensing. Channel coding generator matrices are commonly employed to design a measurement matrix. Based on authors knowledge, a few studies have been made to connect algebraic geometry codes and compressive sensing. In this paper, we have employed algebraic geometry codes to construct low coherence non-binary sensing matrices. With this method, we have introduced a new group of deterministic sensing matrices employing maximal curves. Comparison of Gaussian matrix and proposed matrices shows that these matrices outperform the Gaussian matrices in terms of noiseless and noisy signal recovery.","PeriodicalId":414101,"journal":{"name":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130842236","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
下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书