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

2008 International Symposium on Telecommunications最新文献

筛选
英文 中文
Development of Unscented Kalman filter algorithm for 3-D point based rigid registration 基于点的三维刚性配准Unscented卡尔曼滤波算法的发展
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651367
F. Zamani, A. Beheshti
{"title":"Development of Unscented Kalman filter algorithm for 3-D point based rigid registration","authors":"F. Zamani, A. Beheshti","doi":"10.1109/ISTEL.2008.4651367","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651367","url":null,"abstract":"This paper proposes an effective algorithm for estimating the transformation parameters which align two data sets belonging to the rigid objects. This point based algorithm uses unscented Kalman filter for estimating the state vector of transformation which is a nonlinear function of translation and rotation. It is also assumed that the Gaussian noise is added to the fixed data set. In this paper, firstly we investigate the newest algorithm performance for point based rigid body registration using UKF and then we show the drawback of this algorithm in estimating of high range rotations. It is shown that the UKF algorithm is sensitive to selecting the appropriate initial sate vector. For solving limitation of the UKF algorithm, we propose an extended unscented kalman filter algorithm. It is shown that by exploiting this new algorithm which uses pre-registration, we can find an appropriate initial state vector. In this paper, we compare the results of EUKF algorithm with the previous UKF algorithm for different rotations. We demonstrate the effectiveness of the EUKF algorithm for estimation of high transformations between two data sets.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131069736","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
Power allocation in an amplify-and-forward cooperative network for outage probability minimization 基于断电概率最小化的放大前向合作网络的功率分配
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651307
Arash Khabbazi, Said Nader-Esfahani
{"title":"Power allocation in an amplify-and-forward cooperative network for outage probability minimization","authors":"Arash Khabbazi, Said Nader-Esfahani","doi":"10.1109/ISTEL.2008.4651307","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651307","url":null,"abstract":"In cooperative networks, some of the users in neighborhood of the source relay the source information, in order to combat the effects of multipath fading. Recent investigations, on multirelay amplify-and-forward cooperative networks, have shown that a significant performance improvement will be obtained, if the phase information of the channel between relays and destination are feedback to the relays. As, in that case, the relays can send their signals simultaneously but with proper phases, so that these signals are combined coherently at destination. In this paper, we shall assume that the magnitude information of the channels is also feedback to the relays. We will use this information to find an optimum power allocation between the relays and the source. This optimal power allocation will be derived analytically, by minimization of outage probability. Numerical simulation shows that our optimal power allocation significantly improves the outage probability of the system, as compared with equal power allocation.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133241333","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
Jamming resistance capabilities of the Spectrally Phase Encoded OCDMA systems 频谱相位编码OCDMA系统的抗干扰能力
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651300
M. Emadi, J. Salehi
{"title":"Jamming resistance capabilities of the Spectrally Phase Encoded OCDMA systems","authors":"M. Emadi, J. Salehi","doi":"10.1109/ISTEL.2008.4651300","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651300","url":null,"abstract":"Although, enhanced security is often mentioned as a noticeable benefit of spectrally phase encoded optical CDMA (SPE-OCDMA) systems, the quantity and degree of security enhancement is not considered deeply in the literature. One of the facts in determining the degree of security is to assess the resistance capability of the system against various jammers attacks. In this paper, we introduce and model three types of jammers, namely (Pulse Jammer, Partialband Jammer, and Follower Jammer). We mathematically analyze the effects of the above jammers on the performance of the SPE-OCDMA systems that use On-Off Keying (OOK) modulation scheme. It is demonstrated that under certain conditions, the performance of the system can be dramatically degraded due to the jamming signals. Moreover, it is seen that the strongest jammer is the follower jammer.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"330 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116455044","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
Differential distinguishing attack on the Shannon stream cipher based on fault analysis 基于故障分析的香农流密码差分识别攻击
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651385
M. Hassanzadeh, M. Parker, T. Helleseth, Y. E. Salehani, M. Abyaneh
{"title":"Differential distinguishing attack on the Shannon stream cipher based on fault analysis","authors":"M. Hassanzadeh, M. Parker, T. Helleseth, Y. E. Salehani, M. Abyaneh","doi":"10.1109/ISTEL.2008.4651385","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651385","url":null,"abstract":"In reference, some weak points in the design of the Shannon stream cipher and a differential distinguisher with complexity of O(214.92) keystream bits (i.e. O(29.92) keystream words) were presented. Another distinguishing attack based on a multidimensional linear transformation was presented in which require 2106.996 keystream words. Both of these attacks need to have access to the initial state that is unlikely. In this paper, a likely attack using fault analysis method is exploited to solve the mentioned problem. Additionally, a new distinguisher is proposed which improves the attack complexity to four times the complexity of running the Shannon stream cipher. Only are two differential outputs needed for successful attack with error probability equal to 0.001.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116521050","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
Characterization of wireless mesh backhaul networks with MIMO systems 具有MIMO系统的无线网状回程网络的特性
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651333
N. Haghighizadeh, A. Mohammadi
{"title":"Characterization of wireless mesh backhaul networks with MIMO systems","authors":"N. Haghighizadeh, A. Mohammadi","doi":"10.1109/ISTEL.2008.4651333","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651333","url":null,"abstract":"In this paper, the wireless mesh backhaul using MIMO systems has been studied. In the mesh networking, information is routed from source to destination over multiple wireless links. On the other hand, using wireless MIMO systems, the channel capacity is significantly increased without additional signal power or bandwidth. We have used the linear programming to optimize the routing determination and to maximize the throughput. This technique is used to calculate the throughput for a hexagonal grid of base-stations, for single-hop, multi-hop, SISO, and MIMO transmissions for various network scenarios.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133559939","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
Low cost concurrent error detection for lattice wave digital filters 格子波数字滤波器的低成本并发误差检测
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651371
R. Yousefi, M. Sargolzaie, S. M. Fakhraie
{"title":"Low cost concurrent error detection for lattice wave digital filters","authors":"R. Yousefi, M. Sargolzaie, S. M. Fakhraie","doi":"10.1109/ISTEL.2008.4651371","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651371","url":null,"abstract":"Wave digital filters are widely used in digital signal processing systems due to their implementation advantages such as low sensitivity, good round-off noise and wide dynamic range. A low-cost on-line test scheme for wave digital filters is proposed. Area overhead is reduced significantly with the aim to bring online testing to costumer electronics. 20% fault coverage improvement is also achieved by using the proposed simple test scheme.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124915958","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
Three-dimensional finite-difference time-domain analysis of gas ionization 三维气体电离时域有限差分分析
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651292
H. Rastegarfar, A. A. Shishegar
{"title":"Three-dimensional finite-difference time-domain analysis of gas ionization","authors":"H. Rastegarfar, A. A. Shishegar","doi":"10.1109/ISTEL.2008.4651292","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651292","url":null,"abstract":"The propagation of intense optical beams in a gas undergoing ionization is analyzed through a three-dimensional finite-difference time-domain (3D-FDTD) scheme. The propagation dynamics include the effects of diffraction, nonlinear self-focusing, and ionization. For sufficiently intense optical beams the neutral gas undergoes ionization, generating a plasma which tends to defocus the beam. Balancing of diffraction, plasma defocusing, and nonlinear self-focusing may lead to self-guided results. In this paper, necessary relations have been introduced into the conventional FDTD formulation to account for the nonlinear behaviors. Furthermore, a concurrent utilization of computer memory and disk storage helps us in expanding the simulation domain to a considerable extent. Results of various simulation scenarios are offered using our FDTD code. Simulations indicate that gas ionization has considerable effects on the propagation characteristics of intense optical beams.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130271012","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
A new 3-layer replication and scheduling strategy In data grid 数据网格中一种新的三层复制调度策略
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651347
R. Sepahvand, A. Horri, G. Dastghaibyfard
{"title":"A new 3-layer replication and scheduling strategy In data grid","authors":"R. Sepahvand, A. Horri, G. Dastghaibyfard","doi":"10.1109/ISTEL.2008.4651347","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651347","url":null,"abstract":"In data grids huge amount of data are generated and processed by users around the world. Objective of dynamic replica strategies is reducing file access time by reducing network traffic, which leads to reducing job runtime. In this paper a replication algorithm for a 3-level hierarchical structure and a scheduling algorithm are proposed. The simulation results with optorsim show better performance (over 13%) comparing to current algorithms.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127613209","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
Some enhanced cache replacement policies for reducing power in mobile devices 一些增强的缓存替换策略，用于降低移动设备的功耗
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651305
M. Fathy, M. Soryani, A. E. Zonouz, A. Asad, M. Seyrafi
{"title":"Some enhanced cache replacement policies for reducing power in mobile devices","authors":"M. Fathy, M. Soryani, A. E. Zonouz, A. Asad, M. Seyrafi","doi":"10.1109/ISTEL.2008.4651305","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651305","url":null,"abstract":"Developing widely useful mobile computing applications presents difficult challenges. On one hand, mobile users demand fast response times, and deep relevant content. On the other hand, mobile devices have limited storage, power and communication resources. Caching frequently accessed data items on the mobile client is an effective technique to improve the system performance in mobile environment. Due to cache size limitation, the choice of cache replacement technique to find a suitable subset of items for eviction from cache becomes important. Power consumption and lookup latency both are crucial factors of performance in embedded systems. One important decision in designing hierarchical memories is selection of cache replacement policies. In this paper, we firstly explain briefly some of the available and used replacement policies in modern cache structures. Then we propose some improved replacement policies and evaluate their performance. We show that, taking the dirty blocks into account in cache policy will reduce the average power consumption by some percents.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127838702","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
Local reconstruction of virtual backbone to support mobility in wireless ad hoc networks 支持无线自组织网络移动性的虚拟骨干网局部重构
2008 International Symposium on Telecommunications Pub Date : 2008-10-14 DOI: 10.1109/ISTEL.2008.4651332
P. Teymoori, N. Yazdani
{"title":"Local reconstruction of virtual backbone to support mobility in wireless ad hoc networks","authors":"P. Teymoori, N. Yazdani","doi":"10.1109/ISTEL.2008.4651332","DOIUrl":"https://doi.org/10.1109/ISTEL.2008.4651332","url":null,"abstract":"Constructing a connected dominating set (CDS) has been widely used as a topology control method and a virtual backbone to reduce energy consumption and communication overhead. Previous works emphasize on constructing the minimum CDS (MCDS) and do not consider node mobility and CDS reconstruction where energy balancing is required. In this paper, we propose a CDS reconstruction algorithm which is able to reconfigure the CDS locally in the presence of mobility and energy balancing without the need for reconstructing the whole CDS. The algorithm does not increase the approximation factor of the algorithm which has constructed the CDS already and it has O(Delta log Delta) and O(Delta) time and message complexity, respectively, which is a great improvement in comparison with the other approaches, where Delta is the maximum degree of the network graph.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"75 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120923071","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
首页 上一页 下一页 尾页
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学术官方微信