Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285770
I. Fliss, M. Tagina
In this paper, a general methodology to diagnose multiple faults in hybrid dynamic systems is proposed. The considered dynamic hybrid systems exhibit continuous dynamics with discernable discrete functioning modes. The inputs of the proposed methodology are residuals representing the numerical evaluation of Analytical Redundancy Relations extended to hybrid systems. These residuals are generated due to the use of switched bond graph modeling. The evaluation of these residuals is based on the combination of adaptive thresholding and fuzzy logic reasoning optimized by Particle Swarm Optimization (PSO). The results of the detection module are displayed as a colored causal graph. This causal graph is exploited to correctly isolate multiple faults. The ongoing experiments focus on a simulation of the three-tank hydraulic system, a benchmark in the diagnosis domain.
{"title":"Exploiting fuzzy reasoning optimized by Particle Swarm Optimization and adaptive thresholding to diagnose multiple faults in dynamic hybrid systems","authors":"I. Fliss, M. Tagina","doi":"10.1109/ICCITECHNOL.2012.6285770","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285770","url":null,"abstract":"In this paper, a general methodology to diagnose multiple faults in hybrid dynamic systems is proposed. The considered dynamic hybrid systems exhibit continuous dynamics with discernable discrete functioning modes. The inputs of the proposed methodology are residuals representing the numerical evaluation of Analytical Redundancy Relations extended to hybrid systems. These residuals are generated due to the use of switched bond graph modeling. The evaluation of these residuals is based on the combination of adaptive thresholding and fuzzy logic reasoning optimized by Particle Swarm Optimization (PSO). The results of the detection module are displayed as a colored causal graph. This causal graph is exploited to correctly isolate multiple faults. The ongoing experiments focus on a simulation of the three-tank hydraulic system, a benchmark in the diagnosis domain.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126264005","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}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285790
Badreddine Guizani, B. Ayeb, A. Koukam
Scalability is one of critical challenges for link-state routing protocols in mobile wireless networks. Reducing routing overhead is the key to resolve the scalability problem. In this context, we propose a new link state routing protocol named CLSR. It uses clustering to reduce the routing overhead and the size of routing table. It introduces one level hierarchy in the network and it applies proactive link state approach inside as well as outside clusters. We study through simulations the performances of our protocol CLSR, and we compare it to F-OLSR, OLSR-Tree and SA-OLSR protocols. Simulations show that our protocol provides comparable or better performances in term of the generated routing overhead and the data packets delivery ratio.
{"title":"A new cluster-based link state routing for mobile ad hoc networks","authors":"Badreddine Guizani, B. Ayeb, A. Koukam","doi":"10.1109/ICCITECHNOL.2012.6285790","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285790","url":null,"abstract":"Scalability is one of critical challenges for link-state routing protocols in mobile wireless networks. Reducing routing overhead is the key to resolve the scalability problem. In this context, we propose a new link state routing protocol named CLSR. It uses clustering to reduce the routing overhead and the size of routing table. It introduces one level hierarchy in the network and it applies proactive link state approach inside as well as outside clusters. We study through simulations the performances of our protocol CLSR, and we compare it to F-OLSR, OLSR-Tree and SA-OLSR protocols. Simulations show that our protocol provides comparable or better performances in term of the generated routing overhead and the data packets delivery ratio.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127769958","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}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285802
R. Atawia, Mariam El Azab, T. Elshabrawy, M. Ashour
Handover guarantees sustained connectivity during movement of mobile subscribers within cellular networks. In the planning phase of a typical cellular network, the neighboring cell list (NCL) construction depicts the most important feature that would guide the handover performance for each cell. The NCL defines a limited number of cells (neighbors) as candidates for handover from the serving cell of a given subscriber. The identity and number of members of a given NCL play a critical role in the performance of handover where successful handover procedures are mainly attributed to correct construction of NCL. NCLs that suffer from missing neighbor cells result in handover failure or sub-optimal handover decisions. On the other hand, long NCLs are associated with handover delay. In a typical cellular service provider, the initial NCLs are manually constructed and then the defined lists are further optimized during operation. Depending on the efficiency of the manually generated list, the network may suffer bad handover performance until these lists are optimized. To overcome this problem, this paper introduces a mechanism to automatically generate an efficient NCL for a new planned cell based on ranked overlapping coverage using empirical model calculations. The proposed algorithm was tested on a real-life network for two types of mobile generations (GSM and UMTS). The designed NCL is shown to contain all essential neighbors of operationally optimized lists with minimal increase of average NCL lengths.
{"title":"Ranked overlapping coverage based construction of efficient neighboring cell list for GSM/UMTS cellular networks","authors":"R. Atawia, Mariam El Azab, T. Elshabrawy, M. Ashour","doi":"10.1109/ICCITECHNOL.2012.6285802","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285802","url":null,"abstract":"Handover guarantees sustained connectivity during movement of mobile subscribers within cellular networks. In the planning phase of a typical cellular network, the neighboring cell list (NCL) construction depicts the most important feature that would guide the handover performance for each cell. The NCL defines a limited number of cells (neighbors) as candidates for handover from the serving cell of a given subscriber. The identity and number of members of a given NCL play a critical role in the performance of handover where successful handover procedures are mainly attributed to correct construction of NCL. NCLs that suffer from missing neighbor cells result in handover failure or sub-optimal handover decisions. On the other hand, long NCLs are associated with handover delay. In a typical cellular service provider, the initial NCLs are manually constructed and then the defined lists are further optimized during operation. Depending on the efficiency of the manually generated list, the network may suffer bad handover performance until these lists are optimized. To overcome this problem, this paper introduces a mechanism to automatically generate an efficient NCL for a new planned cell based on ranked overlapping coverage using empirical model calculations. The proposed algorithm was tested on a real-life network for two types of mobile generations (GSM and UMTS). The designed NCL is shown to contain all essential neighbors of operationally optimized lists with minimal increase of average NCL lengths.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"60 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131809941","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}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285791
S. K. Malekee, Ehsan Rahimi, M. Mayiami
In this paper, n mobile source-destination pairs and m relay nodes are considered in the same frequency band. In the previous works, it is assumed that the ad hoc nodes were fixed which causes users with lower SINR cannot communicate through relays. Here, we propose a scheme in which the mobility is managed in opportunistic manner to let ad hoc nodes satisfy a lower SINR threshold to be active and transmit successfully. We compute new SINR threshold for n source-destination pairs and m relays distributed uniformly and randomly on the constant area. This threshold is achieved as 1-√(log n/n)/R which causes the lower bound of the throughput to be increased. Also, we investigate the required time for movement of nodes and estimate it as Θ(√(log n)). This time is negligible compared to queuing delay term which is computed previously as in the order of Θ(n). Both of the simulation results and analytical calculations show that we achieve the better throughput while the delay does not change meaningfully.
{"title":"Opportunistic relaying in ad-hoc networks for throughput improvement","authors":"S. K. Malekee, Ehsan Rahimi, M. Mayiami","doi":"10.1109/ICCITECHNOL.2012.6285791","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285791","url":null,"abstract":"In this paper, n mobile source-destination pairs and m relay nodes are considered in the same frequency band. In the previous works, it is assumed that the ad hoc nodes were fixed which causes users with lower SINR cannot communicate through relays. Here, we propose a scheme in which the mobility is managed in opportunistic manner to let ad hoc nodes satisfy a lower SINR threshold to be active and transmit successfully. We compute new SINR threshold for n source-destination pairs and m relays distributed uniformly and randomly on the constant area. This threshold is achieved as 1-√(log n/n)/R which causes the lower bound of the throughput to be increased. Also, we investigate the required time for movement of nodes and estimate it as Θ(√(log n)). This time is negligible compared to queuing delay term which is computed previously as in the order of Θ(n). Both of the simulation results and analytical calculations show that we achieve the better throughput while the delay does not change meaningfully.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122094006","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}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285836
Yu Ting Sun, Jia-Chin Lin
Orthogonal frequency-division multiplexing (OFDM) communication is a promising technique for use in fourth-generation (4G) mobile communications. Meanwhile, the carrier aggregation technique becomes crucial for raising the transmission rate. The achievable data rate of an OFDM system is generally limited by spectral efficiency and the available bandwidth; the former strongly depends on the adopted modulation techniques, and the latter strongly depends on the spectrum policy. A carrier aggregation method is a feasible and flexible bandwidth utilization technique that facilitates upgrades to transmission throughput by aggregating several contiguous or non-contiguous carriers. Unlike conventional OFDM systems, multiple carrier frequency offsets (CFOs) must be taken into consideration for carrier-aggregated OFDM (CA-OFDM) communications. Several preambles are constructed as pilots for individual component carriers. With knowledge of the preamble property, novel estimation methods for multiple CFOs are proposed and investigated by taking advantage of either a multiple signal classification (MUSIC) or a root-MUSIC algorithm. Simulation results show that the proposed method can achieve good performance in terms of the error rate of detection and the mean-square error (MSE) over time-varying multipath fading channels. With assistance from the accurate multi-CFO estimation and compensation proposed in this paper, the carrier aggregation, which is conventionally accomplished on the medium access control (MAC) layer with a few parallel, ordinary OFDM inner receivers, can be effectively transformed to be a physical-layer (PHY) multiplexing technique by means of a larger-size fast Fourier transform (FFT) demodulation. This transformation can reduce the implementation overhead needed by independently building several parallel ordinary inner receivers. This transformation can also save the header length prefixed on the MAC layer for conducting carrier aggregations.
{"title":"Multi-carrier frequency-offset estimation based on MUSIC for carrier-aggregation orthogonal frequency-division multiplexing communications","authors":"Yu Ting Sun, Jia-Chin Lin","doi":"10.1109/ICCITECHNOL.2012.6285836","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285836","url":null,"abstract":"Orthogonal frequency-division multiplexing (OFDM) communication is a promising technique for use in fourth-generation (4G) mobile communications. Meanwhile, the carrier aggregation technique becomes crucial for raising the transmission rate. The achievable data rate of an OFDM system is generally limited by spectral efficiency and the available bandwidth; the former strongly depends on the adopted modulation techniques, and the latter strongly depends on the spectrum policy. A carrier aggregation method is a feasible and flexible bandwidth utilization technique that facilitates upgrades to transmission throughput by aggregating several contiguous or non-contiguous carriers. Unlike conventional OFDM systems, multiple carrier frequency offsets (CFOs) must be taken into consideration for carrier-aggregated OFDM (CA-OFDM) communications. Several preambles are constructed as pilots for individual component carriers. With knowledge of the preamble property, novel estimation methods for multiple CFOs are proposed and investigated by taking advantage of either a multiple signal classification (MUSIC) or a root-MUSIC algorithm. Simulation results show that the proposed method can achieve good performance in terms of the error rate of detection and the mean-square error (MSE) over time-varying multipath fading channels. With assistance from the accurate multi-CFO estimation and compensation proposed in this paper, the carrier aggregation, which is conventionally accomplished on the medium access control (MAC) layer with a few parallel, ordinary OFDM inner receivers, can be effectively transformed to be a physical-layer (PHY) multiplexing technique by means of a larger-size fast Fourier transform (FFT) demodulation. This transformation can reduce the implementation overhead needed by independently building several parallel ordinary inner receivers. This transformation can also save the header length prefixed on the MAC layer for conducting carrier aggregations.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134267828","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}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285814
Khlifi Nesrine, M. B. Jemaa
Wireless Sensors Networks (WSN) are increasingly used in various applications such as environment tracking, health monitoring, industrial control and intrusion detection applications. WSN consists of small-sized nodes, deployed generally in inaccessible environment to the human, in order to collect information about it. These motes are autonomous and work with battery. The critical characteristic of these networks is energy, which is their main design constraint to increase their lifetime. Energy consumption has a major impact on all levels: application software, motes (software and hardware) routing and communication channel. This paper proposes a new routing mechanism to reduce energy consumption in WSNs, and subsequently increasing their lifetime. In particular, we describe a new routing protocol named: Hierarchical Energy Efficient Routing Protocol (HEERP). Using computer simulations, we show that HEERP outperforms LEACH, is the most existing popular routing pool.
{"title":"HEERP: Hierarchical energy efficient routing protocol for Wireless Sensor Networks","authors":"Khlifi Nesrine, M. B. Jemaa","doi":"10.1109/ICCITECHNOL.2012.6285814","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285814","url":null,"abstract":"Wireless Sensors Networks (WSN) are increasingly used in various applications such as environment tracking, health monitoring, industrial control and intrusion detection applications. WSN consists of small-sized nodes, deployed generally in inaccessible environment to the human, in order to collect information about it. These motes are autonomous and work with battery. The critical characteristic of these networks is energy, which is their main design constraint to increase their lifetime. Energy consumption has a major impact on all levels: application software, motes (software and hardware) routing and communication channel. This paper proposes a new routing mechanism to reduce energy consumption in WSNs, and subsequently increasing their lifetime. In particular, we describe a new routing protocol named: Hierarchical Energy Efficient Routing Protocol (HEERP). Using computer simulations, we show that HEERP outperforms LEACH, is the most existing popular routing pool.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132398162","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}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285820
A. Gallas, W. Barhoumi, E. Zagrouba
Avoiding the “curse of dimensionality” in contentbased image retrieval becomes one of the most essential tasks to achieve because of the high number of stocked images as well as the high dimensionality of the descriptive vectors' space. In this context, our work consists on minimizing low-level features describing an image by using a reduced descriptor that combines color and texture information which is wavelet transformation. In fact, we propose to describe the image by high frequency subbands of discrete wavelet transformation (DWT) related to weighted salient regions after a fuzzy segmentation step. Moreover, images comparison guided by the most weighted regions is presented. Experiments and comparative study with other similar works prove the efficiency of the proposed approach for image retrieval in heterogeneous image bases.
{"title":"Image retrieval based on wavelet sub-bands and fuzzy weighted regions","authors":"A. Gallas, W. Barhoumi, E. Zagrouba","doi":"10.1109/ICCITECHNOL.2012.6285820","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285820","url":null,"abstract":"Avoiding the “curse of dimensionality” in contentbased image retrieval becomes one of the most essential tasks to achieve because of the high number of stocked images as well as the high dimensionality of the descriptive vectors' space. In this context, our work consists on minimizing low-level features describing an image by using a reduced descriptor that combines color and texture information which is wavelet transformation. In fact, we propose to describe the image by high frequency subbands of discrete wavelet transformation (DWT) related to weighted salient regions after a fuzzy segmentation step. Moreover, images comparison guided by the most weighted regions is presented. Experiments and comparative study with other similar works prove the efficiency of the proposed approach for image retrieval in heterogeneous image bases.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134166590","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}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285832
Souheila Boudouda, Mahmoud Boufaïda
Modeling and managing Supply chain management systems that span multiple organizations involves new challenges, mainly regarding the ability to cope with change on the wide variety of languages and technologies which are heterogeneous in permanent evolution. The goal of our work is to contribute to the field of modeling and designing Supply chain management systems. Let's put forward a methodological approach which is based on four aspects (resource aspect, organizational aspect, functional aspect and interaction aspect) and which uses the multi agents system to model their different actors. Each actor in the proposed model is represented by a subsystem. They interact with each other to accomplish their tasks using two types of interaction, internal and external. They can communicate, negotiate and collaborate through a communication interface in order to discuss and negotiate the stocks, make the system more responsive and reduce inventory carrying costs.
{"title":"A methodological approach for modeling supply chain management","authors":"Souheila Boudouda, Mahmoud Boufaïda","doi":"10.1109/ICCITECHNOL.2012.6285832","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285832","url":null,"abstract":"Modeling and managing Supply chain management systems that span multiple organizations involves new challenges, mainly regarding the ability to cope with change on the wide variety of languages and technologies which are heterogeneous in permanent evolution. The goal of our work is to contribute to the field of modeling and designing Supply chain management systems. Let's put forward a methodological approach which is based on four aspects (resource aspect, organizational aspect, functional aspect and interaction aspect) and which uses the multi agents system to model their different actors. Each actor in the proposed model is represented by a subsystem. They interact with each other to accomplish their tasks using two types of interaction, internal and external. They can communicate, negotiate and collaborate through a communication interface in order to discuss and negotiate the stocks, make the system more responsive and reduce inventory carrying costs.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131316114","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}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285833
Inès Bousnina, Nessrine Rejeb, M. Salah, A. Samet
In this paper, we propose a new method to simultaneously estimate the maximum Doppler Spread (DS), the mean Angle of Arrival (AoA) and the Angular Spread (AS). To this end, the derivatives of the cross-correlation functions (DCCF) of the received signal at a Uniform Linear Array (ULA) are exploited. The Rayleigh channel model where the received signal AoAs follow a Gaussian angular distribution is considered. Simulation results show that, the proposed approach offers better accuracy for maximum DS than the algorithm developed in [1]. For the mean AoA and AS estimation, our approach presents NRMSEs close to the one developed in [2].
{"title":"Doppler and angular spreads estimation using the derivatives of the cross-correlation functions","authors":"Inès Bousnina, Nessrine Rejeb, M. Salah, A. Samet","doi":"10.1109/ICCITECHNOL.2012.6285833","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285833","url":null,"abstract":"In this paper, we propose a new method to simultaneously estimate the maximum Doppler Spread (DS), the mean Angle of Arrival (AoA) and the Angular Spread (AS). To this end, the derivatives of the cross-correlation functions (DCCF) of the received signal at a Uniform Linear Array (ULA) are exploited. The Rayleigh channel model where the received signal AoAs follow a Gaussian angular distribution is considered. Simulation results show that, the proposed approach offers better accuracy for maximum DS than the algorithm developed in [1]. For the mean AoA and AS estimation, our approach presents NRMSEs close to the one developed in [2].","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122055543","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}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285822
Kao-Peng Chou, Jia-Chin Lin
In this paper, a hybrid Cramér-Rao bound (HCRB) for the channel estimation of non-orthogonal, disintegrated, amplify-and-forward (NAF) relaying systems is derived. The HCRB is an effective benchmark for examining channel estimation performance. Several conventional frequency-domain channel estimations, such as the least-squares (LS), minimum-mean-square-error (MMSE) channel estimators are simulated and compared with the derived HCRB.
{"title":"A hybrid Cramér-Rao bound for the channel estimation of non-orthogonal, disintegrated, amplify-and-forward cooperative OFDM systems","authors":"Kao-Peng Chou, Jia-Chin Lin","doi":"10.1109/ICCITECHNOL.2012.6285822","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285822","url":null,"abstract":"In this paper, a hybrid Cramér-Rao bound (HCRB) for the channel estimation of non-orthogonal, disintegrated, amplify-and-forward (NAF) relaying systems is derived. The HCRB is an effective benchmark for examining channel estimation performance. Several conventional frequency-domain channel estimations, such as the least-squares (LS), minimum-mean-square-error (MMSE) channel estimators are simulated and compared with the derived HCRB.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"288 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121072719","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：