Pub Date : 2010-10-14DOI: 10.1109/WICOM.2010.5601426
Yongtao Wei, Jinkuan Wang, Cuirong Wang, Cong Wang
For future internet, network virtualization provides the feasibility of running multiple routing architectures on a shared physical infrastructure. This paper presents the design and evaluation of a bandwidth allocation algorithm based on multi-commodity flow problem solver ?? which integrated with a traffic predictor. The basic idea of our design is that some failure in the MFP computation implies that one or more links do not have enough available capacity, which violates the linear constraints on the commodities for each link when modeling MFP. To avoid producing bottleneck links, we employed traffic predictor. On one hand, MFP solver makes better resource utilization by making use of the thin pieces of available bandwidth, by which the virtual network can accept more service requests. On the other hand, the traffic predictor adjusts the link with the largest occupation (bottleneck link) by checking the traffic rate of a user link and adjusting the reserved bandwidth based on the Forecasting of the traffic history. Then we present the results of performance comparisons of the predictor-integrated algorithm and the allocation algorithm only by Solving MFP. The comparisons are based on the mean packet delay, the variance of the packet delay, and the buffer requirements. Our performance tests show that predictor-integrated algorithm works better than the allocation algorithm only by Solving MFP in terms of the three metrics listed above.
{"title":"Bandwidth allocation in virtual network based on traffic prediction","authors":"Yongtao Wei, Jinkuan Wang, Cuirong Wang, Cong Wang","doi":"10.1109/WICOM.2010.5601426","DOIUrl":"https://doi.org/10.1109/WICOM.2010.5601426","url":null,"abstract":"For future internet, network virtualization provides the feasibility of running multiple routing architectures on a shared physical infrastructure. This paper presents the design and evaluation of a bandwidth allocation algorithm based on multi-commodity flow problem solver ?? which integrated with a traffic predictor. The basic idea of our design is that some failure in the MFP computation implies that one or more links do not have enough available capacity, which violates the linear constraints on the commodities for each link when modeling MFP. To avoid producing bottleneck links, we employed traffic predictor. On one hand, MFP solver makes better resource utilization by making use of the thin pieces of available bandwidth, by which the virtual network can accept more service requests. On the other hand, the traffic predictor adjusts the link with the largest occupation (bottleneck link) by checking the traffic rate of a user link and adjusting the reserved bandwidth based on the Forecasting of the traffic history. Then we present the results of performance comparisons of the predictor-integrated algorithm and the allocation algorithm only by Solving MFP. The comparisons are based on the mean packet delay, the variance of the packet delay, and the buffer requirements. Our performance tests show that predictor-integrated algorithm works better than the allocation algorithm only by Solving MFP in terms of the three metrics listed above.","PeriodicalId":190625,"journal":{"name":"2010 International Conference On Computer Design and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121328128","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 : 2010-08-16DOI: 10.1109/ICCDA.2010.5541045
Xueli Shen, Ji-suo Zhang
This paper presents a particle swarm optimization based on real-time collision detection algorithm, and combines the PSO and the OBB hierarchy bounding box algorithm. OBB algorithm close simply establishes three-dimensional object bounding box. the collision detection problem in the three-dimensional space change into a two-dimensional space optimization process. PSO algorithm can quickly determine the regional intervention of geometric model, and exclude non-interference in the region. Then, further details of the triangle collision detection, and improves real-time collision detection in the virtual system
{"title":"Research of collision detection algorithm based on particle swarm optimization","authors":"Xueli Shen, Ji-suo Zhang","doi":"10.1109/ICCDA.2010.5541045","DOIUrl":"https://doi.org/10.1109/ICCDA.2010.5541045","url":null,"abstract":"This paper presents a particle swarm optimization based on real-time collision detection algorithm, and combines the PSO and the OBB hierarchy bounding box algorithm. OBB algorithm close simply establishes three-dimensional object bounding box. the collision detection problem in the three-dimensional space change into a two-dimensional space optimization process. PSO algorithm can quickly determine the regional intervention of geometric model, and exclude non-interference in the region. Then, further details of the triangle collision detection, and improves real-time collision detection in the virtual system","PeriodicalId":190625,"journal":{"name":"2010 International Conference On Computer Design and Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124891501","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 : 2010-08-09DOI: 10.1109/ICCDA.2010.5541382
Xian-ming Shan, He-yong Yang, Peng Zhang
The fault of new type artillery radar is highly complex and correlative. The neural network technology was incorporated into the radar fault diagnosis after the fault features of new type artillery radar and the shortage of the expert diagnosis system were analyzed. There are many difficulties in the process of the servicing for the artillery radar, such as technology level is low, fault diagnosis is difficult. To resolve the problem, a fault diagnosis expert system was realized based on RBF(Radial Basis Function) neural network. The collectivity structure of expert system, structure and function of software were discussed. Accordingly, several key techniques such as the fault diagnosis principle of RBF neural network, knowledge database, reasoning engine were also given in detail. The application results showed that the expert system proved its feasibility and practical, the servicing efficiency and fault diagnosis ability are improved.
{"title":"Fault diagnosis expert system of artillery radar based on neural network","authors":"Xian-ming Shan, He-yong Yang, Peng Zhang","doi":"10.1109/ICCDA.2010.5541382","DOIUrl":"https://doi.org/10.1109/ICCDA.2010.5541382","url":null,"abstract":"The fault of new type artillery radar is highly complex and correlative. The neural network technology was incorporated into the radar fault diagnosis after the fault features of new type artillery radar and the shortage of the expert diagnosis system were analyzed. There are many difficulties in the process of the servicing for the artillery radar, such as technology level is low, fault diagnosis is difficult. To resolve the problem, a fault diagnosis expert system was realized based on RBF(Radial Basis Function) neural network. The collectivity structure of expert system, structure and function of software were discussed. Accordingly, several key techniques such as the fault diagnosis principle of RBF neural network, knowledge database, reasoning engine were also given in detail. The application results showed that the expert system proved its feasibility and practical, the servicing efficiency and fault diagnosis ability are improved.","PeriodicalId":190625,"journal":{"name":"2010 International Conference On Computer Design and Applications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122171192","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 : 2010-08-09DOI: 10.1109/ICCDA.2010.5541264
Chitiz Gupta, Rahul Jain, R. Lohia, R. Shankar, S. Tapaswi
Wireless sensor networks con sist of sink nodes and multiple sensor nodes that monitor environmental conditions such as pressure, temperature, etc. The main constraint associated with sensor nodes is energy consumption. The Extended Concentric-Clustering Routing Scheme ECCRS [1] is a hybrid mechanism that unifies the chain-based scheme PEGASIS and the clustering scheme. In this paper, we improve the energy consumption in ECCRS further by improving the energy and distance parameters. In our approach, the sensor field is divided into various levels and each level has the same node density as well as the same number of nodes, for which the radius of each level is adjusted accordingly. To improve the energy factor in ECCRS, our proposed scheme creates a set of probable candidates for cluster heads. The cluster head formation of a level from its probable candidate set takes into account the minimum distance between the higher level cluster head the nodes of the probable candidates set of the same level. The simulation results show that our approach is 13% more efficient as compared to ECCRS in terms of energy consumption.
{"title":"Improved Concentric Clustering Routing Scheme adapted to various environments of sensor networks","authors":"Chitiz Gupta, Rahul Jain, R. Lohia, R. Shankar, S. Tapaswi","doi":"10.1109/ICCDA.2010.5541264","DOIUrl":"https://doi.org/10.1109/ICCDA.2010.5541264","url":null,"abstract":"Wireless sensor networks con sist of sink nodes and multiple sensor nodes that monitor environmental conditions such as pressure, temperature, etc. The main constraint associated with sensor nodes is energy consumption. The Extended Concentric-Clustering Routing Scheme ECCRS [1] is a hybrid mechanism that unifies the chain-based scheme PEGASIS and the clustering scheme. In this paper, we improve the energy consumption in ECCRS further by improving the energy and distance parameters. In our approach, the sensor field is divided into various levels and each level has the same node density as well as the same number of nodes, for which the radius of each level is adjusted accordingly. To improve the energy factor in ECCRS, our proposed scheme creates a set of probable candidates for cluster heads. The cluster head formation of a level from its probable candidate set takes into account the minimum distance between the higher level cluster head the nodes of the probable candidates set of the same level. The simulation results show that our approach is 13% more efficient as compared to ECCRS in terms of energy consumption.","PeriodicalId":190625,"journal":{"name":"2010 International Conference On Computer Design and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134097029","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}
As the approaching of the multi-core era, chip multiprocessor(CMP) architectures present a challenge for efficient simulation, combining with the requirements of a detailed simulator running realistic workloads. Parallelization, which can exploit inherent parallelism in CMP simulation, is a common method to reduce simualtion time. We design and implement PCAsim, a parallel cycle accurate and user-level CMP simulator running on shared memory platform. The simulator is parallelized by POSIX threads according to target system architecture. Each core thread and the manager thread are synchronized with Slack mechanism [11]. But we find slack mechanism can not ensure the simulator against time violation among events generated by network activity and cache coherence protocol. To solve the problem, we propose an effective synchronous method called pending barrier. This method augments the power of traditional conservative parallel synchronous mechanism and improves simulation accuracy with negligible performance degradation. Except synchronization, we also encountered many other troublesome issues in implementing PCAsim. This paper describes some common ones and illustrates how we address them. The evaluations show that PCAsim can achieve reasonable speed-up and scalability.
{"title":"PCAsim: A parallel cycle accurate simulation platform for CMPs","authors":"Xiaodong Zhu, Junmin Wu, Xiufeng Sui, Wei Yin, Qingbo Wang, Zhe Gong","doi":"10.1109/ICCDA.2010.5540881","DOIUrl":"https://doi.org/10.1109/ICCDA.2010.5540881","url":null,"abstract":"As the approaching of the multi-core era, chip multiprocessor(CMP) architectures present a challenge for efficient simulation, combining with the requirements of a detailed simulator running realistic workloads. Parallelization, which can exploit inherent parallelism in CMP simulation, is a common method to reduce simualtion time. We design and implement PCAsim, a parallel cycle accurate and user-level CMP simulator running on shared memory platform. The simulator is parallelized by POSIX threads according to target system architecture. Each core thread and the manager thread are synchronized with Slack mechanism [11]. But we find slack mechanism can not ensure the simulator against time violation among events generated by network activity and cache coherence protocol. To solve the problem, we propose an effective synchronous method called pending barrier. This method augments the power of traditional conservative parallel synchronous mechanism and improves simulation accuracy with negligible performance degradation. Except synchronization, we also encountered many other troublesome issues in implementing PCAsim. This paper describes some common ones and illustrates how we address them. The evaluations show that PCAsim can achieve reasonable speed-up and scalability.","PeriodicalId":190625,"journal":{"name":"2010 International Conference On Computer Design and Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123343186","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 : 2010-08-05DOI: 10.1109/ICCDA.2010.5541184
Haitao Chen, Husheng Liao
XML has become the de facto standard for representing and interchanging data in web-based applications. And XML view has been widely applied. In relational database, the views are often defined by a query statement, though there may be GUI tools as aids. However, the users usually desire a conceptual modeling tool to help them define views and communicate with each other. Richer semantics are also expected when users tackle view related issues, such as view updates. In this paper, we present a framework for defining XML views, which includes three levels: conceptual level, logical level and physical level. Conceptual level is described by some conceptual model, e.g. EER or UML. Logical level is captured by some XML schema language and physical level is the XML views data. In particular, we show what semantics should be captured and how to represent them.
{"title":"A framework for defining XML views","authors":"Haitao Chen, Husheng Liao","doi":"10.1109/ICCDA.2010.5541184","DOIUrl":"https://doi.org/10.1109/ICCDA.2010.5541184","url":null,"abstract":"XML has become the de facto standard for representing and interchanging data in web-based applications. And XML view has been widely applied. In relational database, the views are often defined by a query statement, though there may be GUI tools as aids. However, the users usually desire a conceptual modeling tool to help them define views and communicate with each other. Richer semantics are also expected when users tackle view related issues, such as view updates. In this paper, we present a framework for defining XML views, which includes three levels: conceptual level, logical level and physical level. Conceptual level is described by some conceptual model, e.g. EER or UML. Logical level is captured by some XML schema language and physical level is the XML views data. In particular, we show what semantics should be captured and how to represent them.","PeriodicalId":190625,"journal":{"name":"2010 International Conference On Computer Design and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123698557","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 : 2010-06-25DOI: 10.1109/ICCDA.2010.5541209
Fuzhong Wang, Xiaoli Liu
The paper studies on the characteristics and generation process of all kinds of roads, then a program is developed for generating random road by VB software. According to the simulation requirement, a random B-road is generated and used for the vehicle ride comfort simulation. Another program is developed based on FlexPro which is data-processing software, according to the “ Vehicle vibration-Describing method for raid surface irregularity”. Using the program to deal with ride comfort data between simulation and experiment, the result of handling is that the difference between the simulation and experiment is 2.57%. So the model used above has good validity and feasibility, and a new way is opened up to research on vehicle ride comfort with random road inputs.
{"title":"Research on the simulation of vehicle ride comfort with random road inputs based on ADAMS/view","authors":"Fuzhong Wang, Xiaoli Liu","doi":"10.1109/ICCDA.2010.5541209","DOIUrl":"https://doi.org/10.1109/ICCDA.2010.5541209","url":null,"abstract":"The paper studies on the characteristics and generation process of all kinds of roads, then a program is developed for generating random road by VB software. According to the simulation requirement, a random B-road is generated and used for the vehicle ride comfort simulation. Another program is developed based on FlexPro which is data-processing software, according to the “ Vehicle vibration-Describing method for raid surface irregularity”. Using the program to deal with ride comfort data between simulation and experiment, the result of handling is that the difference between the simulation and experiment is 2.57%. So the model used above has good validity and feasibility, and a new way is opened up to research on vehicle ride comfort with random road inputs.","PeriodicalId":190625,"journal":{"name":"2010 International Conference On Computer Design and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115638549","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 : 2010-06-25DOI: 10.1109/ICCDA.2010.5541439
Ya-Hui Liu, Qing-Xuan Jia, Han-Xu Sun, Su Jie
To solve the problem of multi-camera calibration, an algorithm is brought forward based on coplanar projection of points. A coordinate system is unified between world coordinates and projective plane ones. After feature patterns projected onto a planar screen and corners extracted from images, each camera is calibrated respectively, from which it can obtain internal parameters and relative poses among cameras. Initial values of spatial points are derived from projective transformation. Then it finds out corresponding points of each image pair by epipolar geometry constraint and calculates spatial points in terms of triangle principle again. Root mean square error between initial values and estimation values are calculated. Furthermore, it eliminates points until errors of all spatial points within threshold. The experimental analyses indicate that the algorithm can reduce computational complexity and manual intervention. Calibration accuracy can meet the need.
{"title":"Multi-camera calibration based on coplanar projection of points","authors":"Ya-Hui Liu, Qing-Xuan Jia, Han-Xu Sun, Su Jie","doi":"10.1109/ICCDA.2010.5541439","DOIUrl":"https://doi.org/10.1109/ICCDA.2010.5541439","url":null,"abstract":"To solve the problem of multi-camera calibration, an algorithm is brought forward based on coplanar projection of points. A coordinate system is unified between world coordinates and projective plane ones. After feature patterns projected onto a planar screen and corners extracted from images, each camera is calibrated respectively, from which it can obtain internal parameters and relative poses among cameras. Initial values of spatial points are derived from projective transformation. Then it finds out corresponding points of each image pair by epipolar geometry constraint and calculates spatial points in terms of triangle principle again. Root mean square error between initial values and estimation values are calculated. Furthermore, it eliminates points until errors of all spatial points within threshold. The experimental analyses indicate that the algorithm can reduce computational complexity and manual intervention. Calibration accuracy can meet the need.","PeriodicalId":190625,"journal":{"name":"2010 International Conference On Computer Design and Applications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115691403","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 : 2010-06-25DOI: 10.1109/ICCDA.2010.5541319
Lifen Li, Changming Zhang
With the growing deployment of host and network intrusion detection systems (IDSs), thousands of alerts are generally generated from them per day. Managing these alerts becomes critically important. In this paper, a hybrid alert clustering method based on self-Organizing maps (SOM) and particle swarm optimization (PSO) is presented. We firstly select the important features through binary particle swarm optimization (BPSO) and mutual information (MI) and get a dimension reduced dataset. SOM is used to cluster the dataset. PSO is used to evolve the weights for SOM to improve the clustering result. The algorithm is based on a type of unsupervised machine learning algorithm that infers relationships from data without the need to train the algorithm with expertly labelled data. The approach is validated using the 2000 DARPA intrusion detection datasets and comparative results between the canonical SOM and our scheme are presented.
{"title":"Alert clustering using integrated SOM/PSO","authors":"Lifen Li, Changming Zhang","doi":"10.1109/ICCDA.2010.5541319","DOIUrl":"https://doi.org/10.1109/ICCDA.2010.5541319","url":null,"abstract":"With the growing deployment of host and network intrusion detection systems (IDSs), thousands of alerts are generally generated from them per day. Managing these alerts becomes critically important. In this paper, a hybrid alert clustering method based on self-Organizing maps (SOM) and particle swarm optimization (PSO) is presented. We firstly select the important features through binary particle swarm optimization (BPSO) and mutual information (MI) and get a dimension reduced dataset. SOM is used to cluster the dataset. PSO is used to evolve the weights for SOM to improve the clustering result. The algorithm is based on a type of unsupervised machine learning algorithm that infers relationships from data without the need to train the algorithm with expertly labelled data. The approach is validated using the 2000 DARPA intrusion detection datasets and comparative results between the canonical SOM and our scheme are presented.","PeriodicalId":190625,"journal":{"name":"2010 International Conference On Computer Design and Applications","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124440965","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 : 2010-06-25DOI: 10.1109/ICCDA.2010.5540707
Peng Han, Jinkuan Wang, P. Xu
In the Orthogonal Frequency Division Multiplexing (OFDM) system, pilot signals are transmitted for the receiving device to estimate the channel's response. The interval of such pilot is often designed to accommodate the devices under most extreme channel conditions or the average conditions of the environment. This scenario design either results in unnecessary overhead that could have been used for data transmission otherwise, or causes the significant degradation of the system performance when the environment worsens. In this paper, we propose an adaptive pilot system with low complexity that sends pilot signals adaptively based on the Doppler frequency shift estimation. It reacts to the environment conditions and reduces the overall pilot overhead when the ideal performance is guaranteed. Furthermore, the placement of signals in channel and the flowcharts on both TDD and FDD systems to facilitate this adaptive operation have also been addressed. Simulation results show that the proposed scheme can remarkably improve the system performance with low pilot overhead compared to the conventional schemes.
{"title":"Adaptive pilot design based on Doppler frequency shift estimation for OFDM system","authors":"Peng Han, Jinkuan Wang, P. Xu","doi":"10.1109/ICCDA.2010.5540707","DOIUrl":"https://doi.org/10.1109/ICCDA.2010.5540707","url":null,"abstract":"In the Orthogonal Frequency Division Multiplexing (OFDM) system, pilot signals are transmitted for the receiving device to estimate the channel's response. The interval of such pilot is often designed to accommodate the devices under most extreme channel conditions or the average conditions of the environment. This scenario design either results in unnecessary overhead that could have been used for data transmission otherwise, or causes the significant degradation of the system performance when the environment worsens. In this paper, we propose an adaptive pilot system with low complexity that sends pilot signals adaptively based on the Doppler frequency shift estimation. It reacts to the environment conditions and reduces the overall pilot overhead when the ideal performance is guaranteed. Furthermore, the placement of signals in channel and the flowcharts on both TDD and FDD systems to facilitate this adaptive operation have also been addressed. Simulation results show that the proposed scheme can remarkably improve the system performance with low pilot overhead compared to the conventional schemes.","PeriodicalId":190625,"journal":{"name":"2010 International Conference On Computer Design and Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123082262","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
扫码关注我们
求助内容：
应助结果提醒方式：