2010 17th International Conference on Telecommunications最新文献

筛选
英文 中文
Compensating for distortions in interpolation of two-dimensional signals using improved iterative techniques 利用改进的迭代技术补偿二维信号插值中的畸变
2010 17th International Conference on Telecommunications Pub Date : 2010-06-03 DOI: 10.1109/ICTEL.2010.5478860
Ali ParandehGheibi, M. Amin Rahimian, M. Akhaee, A. Ayremlou, F. Marvasti
{"title":"Compensating for distortions in interpolation of two-dimensional signals using improved iterative techniques","authors":"Ali ParandehGheibi, M. Amin Rahimian, M. Akhaee, A. Ayremlou, F. Marvasti","doi":"10.1109/ICTEL.2010.5478860","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478860","url":null,"abstract":"In this paper we extended a previously investigated modular method that is designed to compensate for interpolation distortions of one-dimensional signals, to two dimensions (2-D). Next the proposed 2-D modular technique was applied in an iterative fashion and was shown through both simulations and theoretical analyses to enhance the convergence of the iterative technique. In fact, with only a few modules we were able to achieve drastic improvements in signal reconstruction, and with a much less computational complexity. Moreover, both the simulations and the theoretical analysis confirmed the robustness of the proposed scheme against additive noise.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115361202","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 TOA-DOA node localization for mobile ad-hoc networks: Achieving high performance and low complexity 一种新的移动自组织网络TOA-DOA节点定位:实现高性能和低复杂度
2010 17th International Conference on Telecommunications Pub Date : 2010-04-04 DOI: 10.1109/ICTEL.2010.5478823
Zhonghai Wang, S. Zekavat
{"title":"A new TOA-DOA node localization for mobile ad-hoc networks: Achieving high performance and low complexity","authors":"Zhonghai Wang, S. Zekavat","doi":"10.1109/ICTEL.2010.5478823","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478823","url":null,"abstract":"This paper proposes a novel approach for node localization with applications in mobile ad-hoc networks. The network consists of base nodes and target nodes. Base nodes equipped with antenna arrays are capable of localizing target nodes independently via integrated time-of-arrival (TOA) and direction-of-arrival (DOA) estimation. In addition, base nodes cooperate to improve the localization accuracy by fusing the estimated target node positions. Kalman filter is integrated with the fusion to further improve the localization performance. The proposed technique is compared to a localization technique based on extended Kalman filter (EKF), which directly fuses the multiple measured TOA-DOA. The comparison criteria include localization accuracy in terms of error cumulative distribution function (CDF) and approximate posterior Cramer Rao lower bound (APCRLB), filter stability and computational complexity. The comparison confirms that the proposed method involves minor computational complexity, while it demonstrates slightly larger PCRLB; however, compared to EKF its stability is higher. This makes it a good candidate for localizing multiple target nodes in mobile ad-hoc networks.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122122601","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
Joint and iterative detection and decoding of differentially encoded COFDM systems 差分编码COFDM系统的联合迭代检测与解码
2010 17th International Conference on Telecommunications Pub Date : 2010-04-04 DOI: 10.1109/ICTEL.2010.5478774
W. V. Houtum, F. Willems
{"title":"Joint and iterative detection and decoding of differentially encoded COFDM systems","authors":"W. V. Houtum, F. Willems","doi":"10.1109/ICTEL.2010.5478774","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478774","url":null,"abstract":"Divsalar and Simon showed that with multi-symbol differential detection, the performance gap between two-symbol differential detection and coherent detection of differentially encoded phase shift keying can be closed. To close this gap for single-carrier differentially encoded phase shift keying with interleaving and convolutional encoding, Peleg et al. proposed a joint and iterative multi-symbol detection and decoding scheme that regards the differential encoding as inner component code of a serially concatenated code. Several data-, audio- and video-broadcast systems are differentially encoded multi-carrier systems and use time multiplexing of the transmitted services to reduce receiver complexity. The commonly used receiver-structure for these systems does not perform joint and iterative multi-symbol detection and decoding. The present work extends the use of the single-carrier iterative decoding scheme proposed by Peleg et al. to demodulate differentially encoded multi-carrier systems. A novel two-dimensional block-based demodulation is proposed that maintains both the multi-symbol differential detection coding gain and the reduction in receiver complexity by time-multiplexing. Simulations show that with comparable receiver-complexity, the proposed multi-carrier scheme outperforms the single-carrier scheme by ≈ 0.9 dB. Furthermore, the receiver complexity can be reduced up to a factor of four and a half compared to the single-carrier scheme. Finally, the proposed multi-carrier scheme outperforms ”classical” two-symbol differential detection with soft-decision Viterbi-decoding by ≈ 2.8 dB with one iteration and by ≈ 1.2 dB without iterations.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129711993","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
Placement-aware partial reconfiguration for a class of FIR-like structures 一类类fir结构的位置感知部分重构
2010 17th International Conference on Telecommunications Pub Date : 2010-04-04 DOI: 10.1109/ICTEL.2010.5478857
A. H. Gholamipour, F. Kurdahi, A. Eltawil, M. Saghir
{"title":"Placement-aware partial reconfiguration for a class of FIR-like structures","authors":"A. H. Gholamipour, F. Kurdahi, A. Eltawil, M. Saghir","doi":"10.1109/ICTEL.2010.5478857","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478857","url":null,"abstract":"Multi-mode systems make it possible to achieve multiple services on one platform, typically an FPGA. However, reconfiguration time and power, limit the extent to which reconfiguration can be applied. Traditionally, either complete modules have to be swapped out or they can co-exist on chip. In this work, we propose a methodology for exploring a larger reconfiguration space for a class of systems that have FIR-like structure. Furthermore, by jointly optimizing the filters we exploit parameter similarities to minimize a linear cost function of area and reconfiguration overhead. We consider the physical limitations of implementing these designs on FPGAs and propose a placement-aware approach to account for those limitations. The proposed technique minimizes the size of the reconfigurable filter and reduces the reconfiguration overhead by up to 25% in a WiMax system which is used as a case study.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130354227","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
A comparison of uplink scheduling in OFDMA and SCFDMA OFDMA与SCFDMA的上行调度比较
2010 17th International Conference on Telecommunications Pub Date : 2010-04-04 DOI: 10.1109/ICTEL.2010.5478799
E. Yaacoub, Z. Dawy
{"title":"A comparison of uplink scheduling in OFDMA and SCFDMA","authors":"E. Yaacoub, Z. Dawy","doi":"10.1109/ICTEL.2010.5478799","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478799","url":null,"abstract":"Uplink scheduling is compared between OFDMA and SCFDMA systems. Two low complexity scheduling algorithms are presented. Both algorithms perform utility maximization scheduling, with the second having the property of ensuring that all subcarriers allocated to a single user are consecutive. Furthermore, the case of independent fading over the subcarriers of a single resource block is compared to the case of identical fading corresponding to full correlation between the subcarriers of a resource block. Simulation results related to these different cases are presented and analyzed.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116323083","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
Efficient Mac Layer handoff management scheme for Wireless Mesh Networks 无线网状网络的高效Mac层切换管理方案
2010 17th International Conference on Telecommunications Pub Date : 2010-04-04 DOI: 10.1109/ICTEL.2010.5478777
N. Omheni, F. Zarai, L. Kamoun
{"title":"Efficient Mac Layer handoff management scheme for Wireless Mesh Networks","authors":"N. Omheni, F. Zarai, L. Kamoun","doi":"10.1109/ICTEL.2010.5478777","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478777","url":null,"abstract":"Wireless Mesh Networks (WMNs) have received much attention in recent years thanks to their desirable features such as its capability of enhancing coverage with low transmission power. A WMN is dynamically self-organized and self-configured, with the nodes in the network automatically establishing and maintaining mesh connectivity among themselves. Mobility management, with provisioning of Quality of Service guarantees to mobile stations (MSs), is one of the key topics in these networks. This paper proposes efficient Mac Layer handoff management scheme for WMNs. First, we describe a new approach to reduce discovery delay based on handoff prediction when MSs roam across different Wireless Mesh Routers (WMRs). Then we develop a new algorithm to select the optimal target WMR using the minimum airtime cost as metric. The simulation results show that our design may achieve better performance in terms of discovery delay and network throughput.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"484 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126515494","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
Using RSUs as delegates for pervasive access to services in vehicle ad hoc networks 使用rsu作为对车辆自组织网络中服务的普遍访问的委托
2010 17th International Conference on Telecommunications Pub Date : 2010-04-04 DOI: 10.1109/ICTEL.2010.5478816
Khaleel W. Mershad, H. Artail
{"title":"Using RSUs as delegates for pervasive access to services in vehicle ad hoc networks","authors":"Khaleel W. Mershad, H. Artail","doi":"10.1109/ICTEL.2010.5478816","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478816","url":null,"abstract":"Vehicular ad hoc networks, also known as VANETs, enable vehicles which are not necessarily within the same radio transmission range to communicate with each other. In addition to allowing direct communication between vehicles, VANETs also enable vehicles to connect to Roadside Units (RSUs) which are inexpensive infrastructure that have the capability of communicating with each others and with passing by vehicles. RSUs have so far been used for various purposes such as information disseminators, traffic directories, security providers, and service directories that store information about service providers. In this paper, we propose a system that uses RSUs as delegates of users in a VANET to acquire services from service providers without the users directly connecting to them. Since some of these services may require user authentication with the corresponding service providers, the system implements a method for allowing RSUs to use the user's credentials to get the requested services without jeopardizing the user's privacy. We evaluated the performance of the proposed system using the ns2 simulation software and demonstrated through comparing the results to those of an existing system the feasibility and efficiency of the new system in terms of query delay and traffic generation.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125489748","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
Performance analysis of a core node equipped with wavelength converter pool in an Optical Burst Switched network 光突发交换网络中配置波长转换池的核心节点性能分析
2010 17th International Conference on Telecommunications Pub Date : 2010-04-04 DOI: 10.1109/ICTEL.2010.5478866
M. Morsy, Mohammed Y. S. Sowailem, H. Shalaby
{"title":"Performance analysis of a core node equipped with wavelength converter pool in an Optical Burst Switched network","authors":"M. Morsy, Mohammed Y. S. Sowailem, H. Shalaby","doi":"10.1109/ICTEL.2010.5478866","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478866","url":null,"abstract":"A performance analysis of a core node in an OBS network having wavelength converters in the node resources is presented. The analysis assumes that the wavelength converters are deployed at the input ports of the node such that the node may have variable wavelength conversion capability. This means that the node may have no, partial or full conversion capability. The no and partial wavelength conversion is imitated by modeling each output port in the node as an M/M/w/w queue with limited server accessibility. Two performance measures are derived from the model; namely, the steady state throughput and the average burst loss probability assuming Poisson traffic arrivals. In addition, a simulation work is performed in order to validate the results of our proposed model. After taking into consideration the cost of the wavelength converters, optimum values for the wavelength conversion capability in the node, which lead to minimum burst loss probability, are reached for different traffic conditions.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130059354","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
Upper bound to error probability for coding on bidirectional broadcast channels 双向广播信道编码错误概率的上界
2010 17th International Conference on Telecommunications Pub Date : 2010-04-04 DOI: 10.1109/ICTEL.2010.5478873
T. Oechtering, M. Skoglund
{"title":"Upper bound to error probability for coding on bidirectional broadcast channels","authors":"T. Oechtering, M. Skoglund","doi":"10.1109/ICTEL.2010.5478873","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478873","url":null,"abstract":"The bidirectional broadcast channel denotes a broadcast channel with two receivers where each receiver knows the message intended for the other. Exponentially decreasing upper bounds on the average error probability using maximum likelihood decoders are derived based on Gallager's results for the point-to-point channel. The bounds are coupled by the common input distribution and provide an alternative coding theorem using the random coding argument. Then the results are extended to include an average input constraint and to continuous-valued channels. For illustration the bidirectional broadcast channel with binary symmetric channels and with Gaussian channels and an average input power constraint are discussed in detail.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134213809","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
Large antenna arrays for optimal direction finding 大型天线阵列,最佳测向
2010 17th International Conference on Telecommunications Pub Date : 2010-04-04 DOI: 10.1109/ICTEL.2010.5478790
H. Gazzah
{"title":"Large antenna arrays for optimal direction finding","authors":"H. Gazzah","doi":"10.1109/ICTEL.2010.5478790","DOIUrl":"https://doi.org/10.1109/ICTEL.2010.5478790","url":null,"abstract":"A procedure has been recently developed that computes the optimal sensors coordinates of the ambiguity-free antenna array for omnidirectional direction of arrival estimation. The procedure has an exponential complexity, motivating the simplification presented in this paper. This is made possible by exploiting some experimental observations, namely the fact that the optimal omnidirectional array has an axis symmetry and follows a concave curve. Complexity is drastically reduced and array optimization is conducted for large array sizes. As a conclusion, it is shown that, as the number of sensors increases, the Cramer-Rao bound achieved by the optimal arrays is 29% lower than that of the equivalent uniform circular arrays.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127866481","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
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学术官方微信