Pub Date : 2010-07-18DOI: 10.1109/ICASID.2010.5551353
Wenli Shen, Yanping Yu
A non-coherent detection algorithm was proposed for orthogonal space-time coded multi-level continuous phase modulation (OST-MCPM) transmission systems of two transmit antennas, using a non-coherent maximum likelihood (ML) approach with different lengths of watch window. The noncoherent detection algorithm is suitable for any number of receive antennas and the receiver does not need to estimate the channel state information. Two suboptimal detectors of reduced complexity could be obtained through approximation and decision feedback. Simulation results show that the bit error rate (BER) performance degradation is very small compared with that of the coherent maximum likelihood sequence estimation (MLSE) algorithm over quasi-static flat Rayleigh fading channels and the performance is also satisfying when the watch window length is small enough over fast Rayleigh fading channels.
{"title":"Non-coherent detection for orthogonal space-time coded CPM systems","authors":"Wenli Shen, Yanping Yu","doi":"10.1109/ICASID.2010.5551353","DOIUrl":"https://doi.org/10.1109/ICASID.2010.5551353","url":null,"abstract":"A non-coherent detection algorithm was proposed for orthogonal space-time coded multi-level continuous phase modulation (OST-MCPM) transmission systems of two transmit antennas, using a non-coherent maximum likelihood (ML) approach with different lengths of watch window. The noncoherent detection algorithm is suitable for any number of receive antennas and the receiver does not need to estimate the channel state information. Two suboptimal detectors of reduced complexity could be obtained through approximation and decision feedback. Simulation results show that the bit error rate (BER) performance degradation is very small compared with that of the coherent maximum likelihood sequence estimation (MLSE) algorithm over quasi-static flat Rayleigh fading channels and the performance is also satisfying when the watch window length is small enough over fast Rayleigh fading channels.","PeriodicalId":391931,"journal":{"name":"2010 International Conference on Anti-Counterfeiting, Security and Identification","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132386766","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}
Call Admission control (CAC) is an important part of radio resource management (RRM) according to certain criteria, CAC determines whether the call is admitted to access or not. CAC is an important means to guarantee the quality of service (QoS) in wireless network. This paper analyses the multi-user detection factor on the uplink load of TD-SCDMA system and the effects of adjacent cell interference theoretically. A CAC algorithm based on the soft-block (SB) is proposed after discussing the shortage of traditional CAC algorithms in TD-SCDMA system in the paper. The simulation results show that the proposed algorithm has a lower blocking rate and call drop rates, and provides a better QoS to access users. At the same time, it has also higher resource utilization.
{"title":"Call admission control algorithm based on soft-blocking for TD-SCDMA system","authors":"Weichu Zhang, Lianfeng Huang, Zhibin Gao, Yuliang Tang","doi":"10.1109/ICASID.2010.5551345","DOIUrl":"https://doi.org/10.1109/ICASID.2010.5551345","url":null,"abstract":"Call Admission control (CAC) is an important part of radio resource management (RRM) according to certain criteria, CAC determines whether the call is admitted to access or not. CAC is an important means to guarantee the quality of service (QoS) in wireless network. This paper analyses the multi-user detection factor on the uplink load of TD-SCDMA system and the effects of adjacent cell interference theoretically. A CAC algorithm based on the soft-block (SB) is proposed after discussing the shortage of traditional CAC algorithms in TD-SCDMA system in the paper. The simulation results show that the proposed algorithm has a lower blocking rate and call drop rates, and provides a better QoS to access users. At the same time, it has also higher resource utilization.","PeriodicalId":391931,"journal":{"name":"2010 International Conference on Anti-Counterfeiting, Security and Identification","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132689263","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-07-18DOI: 10.1109/ICASID.2010.5551843
Yuli Fu, Yune Lai
This paper presents an improved algorithm for detecting the SYN flooding attacks. The algorithm is based on the characteristics of the network processor IXP2850's hardware and software framework. It improves the typical method that is based on checking the received SYN segments twice from the same source. The improved algorithm will label the segments first, and then verify them to determine whether an attack happens. By this algorithm, the false alarm rate will decrease and the valid defense measures will be done at the right moment.
{"title":"An improved algorithm for detecting SYN flooding attacks based on network processor","authors":"Yuli Fu, Yune Lai","doi":"10.1109/ICASID.2010.5551843","DOIUrl":"https://doi.org/10.1109/ICASID.2010.5551843","url":null,"abstract":"This paper presents an improved algorithm for detecting the SYN flooding attacks. The algorithm is based on the characteristics of the network processor IXP2850's hardware and software framework. It improves the typical method that is based on checking the received SYN segments twice from the same source. The improved algorithm will label the segments first, and then verify them to determine whether an attack happens. By this algorithm, the false alarm rate will decrease and the valid defense measures will be done at the right moment.","PeriodicalId":391931,"journal":{"name":"2010 International Conference on Anti-Counterfeiting, Security and Identification","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132821743","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-07-18DOI: 10.1109/ICASID.2010.5551520
L. Li, Xingfa Huang, Zhou Yu
A low power full custom Half-Band FIR digtal Alter with fixed coefficients used for sigma-delta ADC is presented. The Half-Band FIR digtal filter uses three- stage cascaded strcture and has linear phase and lowpass characteristics. It achieves passband ripple of 0.003dB and stopband attenuation of 82dB, and dissipates only 15mW with a 3V supply based on a 0.35um CMOS process.
{"title":"A full custom half-band filter used for sigma-delta ADC","authors":"L. Li, Xingfa Huang, Zhou Yu","doi":"10.1109/ICASID.2010.5551520","DOIUrl":"https://doi.org/10.1109/ICASID.2010.5551520","url":null,"abstract":"A low power full custom Half-Band FIR digtal Alter with fixed coefficients used for sigma-delta ADC is presented. The Half-Band FIR digtal filter uses three- stage cascaded strcture and has linear phase and lowpass characteristics. It achieves passband ripple of 0.003dB and stopband attenuation of 82dB, and dissipates only 15mW with a 3V supply based on a 0.35um CMOS process.","PeriodicalId":391931,"journal":{"name":"2010 International Conference on Anti-Counterfeiting, Security and Identification","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131774585","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-07-18DOI: 10.1109/ICASID.2010.5551834
Yousheng Zhao, Ning Hou, Duoli Zhang, Gaoming Du, Li Li, H. Pan
Unlike traditional SoC (System-on-chip) chip, multiprocessor chip that contains multiple independent processors, each processor owns different applications, so we need to make a reasonable multiprocessor chip initialization program. This paper proposes a design for the multiprocessor system initialization. The main contribution is as follows: Firstly, one method for the implementation of multiprocessor system initialization is designed. Once the system is power-up or reset each processor's configuration data will be put to destination place through certain data path. Secondly, it is also an important reference for other types of initialization design of NoC (Network-on-chip) system. The design was successfully implemented on FPGA for an MPSoC system.
{"title":"Initialization method for MPSoC","authors":"Yousheng Zhao, Ning Hou, Duoli Zhang, Gaoming Du, Li Li, H. Pan","doi":"10.1109/ICASID.2010.5551834","DOIUrl":"https://doi.org/10.1109/ICASID.2010.5551834","url":null,"abstract":"Unlike traditional SoC (System-on-chip) chip, multiprocessor chip that contains multiple independent processors, each processor owns different applications, so we need to make a reasonable multiprocessor chip initialization program. This paper proposes a design for the multiprocessor system initialization. The main contribution is as follows: Firstly, one method for the implementation of multiprocessor system initialization is designed. Once the system is power-up or reset each processor's configuration data will be put to destination place through certain data path. Secondly, it is also an important reference for other types of initialization design of NoC (Network-on-chip) system. The design was successfully implemented on FPGA for an MPSoC system.","PeriodicalId":391931,"journal":{"name":"2010 International Conference on Anti-Counterfeiting, Security and Identification","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132743402","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}
Paper takes the presence of the erroneous channel state information (CSI) into consideration. A three transmit antennas and one receive antenna Alamouti space-time scheme system {3,2; 1} with transmit antennas selection (TAS) is investigated. We assume that channel is an independent and flat Rayleigh fading channel and the system employs Binary Phase-Shift Keying (BPSK) modulation. Considering a solution over order statistic characteristic of the selective channel with CSI feedback error at the transmitter side, three kinds of possible TAS subsets (1,2), (1,3) and (2,3) for {3,2; 1} system are proposed. Combination of transmit power allocation technique and TAS technique, the three accurate analytical expressions of bit-error rate (BER) have been derived. The analysis results show that when the error is existed in CSI we ought to try to choose the subset consisting of largest ordinal number as transmit in a practical system. The numerical results also show that appropriate power allocation for transmit antennas selected can effectively enhance system bit error performance, when the factor k is large enough, such as k≥10, thus the BER performance of subset (1,3) is consistent with (2,3).
{"title":"Performance analysis of Alamouti scheme with joint imperfect transmit antennas selection and power allocation over Rayleigh fading channels","authors":"Mingjie Zhuang, Qiang Chen, Zijie Lin, Guoxiang Peng","doi":"10.1109/ICASID.2010.5551349","DOIUrl":"https://doi.org/10.1109/ICASID.2010.5551349","url":null,"abstract":"Paper takes the presence of the erroneous channel state information (CSI) into consideration. A three transmit antennas and one receive antenna Alamouti space-time scheme system {3,2; 1} with transmit antennas selection (TAS) is investigated. We assume that channel is an independent and flat Rayleigh fading channel and the system employs Binary Phase-Shift Keying (BPSK) modulation. Considering a solution over order statistic characteristic of the selective channel with CSI feedback error at the transmitter side, three kinds of possible TAS subsets (1,2), (1,3) and (2,3) for {3,2; 1} system are proposed. Combination of transmit power allocation technique and TAS technique, the three accurate analytical expressions of bit-error rate (BER) have been derived. The analysis results show that when the error is existed in CSI we ought to try to choose the subset consisting of largest ordinal number as transmit in a practical system. The numerical results also show that appropriate power allocation for transmit antennas selected can effectively enhance system bit error performance, when the factor k is large enough, such as k≥10, thus the BER performance of subset (1,3) is consistent with (2,3).","PeriodicalId":391931,"journal":{"name":"2010 International Conference on Anti-Counterfeiting, Security and Identification","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131404545","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-07-18DOI: 10.1109/ICASID.2010.5551505
Yang Zhang, Xiangtao Zhang, Fagui Liu
Service-Oriented Computing (SOC) is emerging as a new promising computing paradigm. Web service discovery is one of the key issues in SOC. Web service discovery usually provide UDDI as a standard registry which features only keyword-based matches that often give poor performance. Currently approaches for semantic service discovery are mostly limited to the matching of their inputs/outputs possibly enhanced with some ontological knowledge. Recent works have demonstrated that this approach is not sufficient to discover relevant services. In this paper, we argue that in many situations, the service discovery should be based on the specification of service behavior. The idea behind this is to develop matching techniques that operates on behavior models and allow delivery of partial matches. We give the relative definition of our formal model based on Petri nets and WF-nets and propose the transformation from the OWL-S process model into a formal model we defined. And then we define behavior equivalence notion based on our formal model and detail the semantic web service matchmaking algorithm based on that notion.
{"title":"Semantic web service matchmaking based on service behavior","authors":"Yang Zhang, Xiangtao Zhang, Fagui Liu","doi":"10.1109/ICASID.2010.5551505","DOIUrl":"https://doi.org/10.1109/ICASID.2010.5551505","url":null,"abstract":"Service-Oriented Computing (SOC) is emerging as a new promising computing paradigm. Web service discovery is one of the key issues in SOC. Web service discovery usually provide UDDI as a standard registry which features only keyword-based matches that often give poor performance. Currently approaches for semantic service discovery are mostly limited to the matching of their inputs/outputs possibly enhanced with some ontological knowledge. Recent works have demonstrated that this approach is not sufficient to discover relevant services. In this paper, we argue that in many situations, the service discovery should be based on the specification of service behavior. The idea behind this is to develop matching techniques that operates on behavior models and allow delivery of partial matches. We give the relative definition of our formal model based on Petri nets and WF-nets and propose the transformation from the OWL-S process model into a formal model we defined. And then we define behavior equivalence notion based on our formal model and detail the semantic web service matchmaking algorithm based on that notion.","PeriodicalId":391931,"journal":{"name":"2010 International Conference on Anti-Counterfeiting, Security and Identification","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133576888","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-07-18DOI: 10.1109/ICASID.2010.5551511
Dexin Li
This article proposes a methodology on how to justify homogeneous Markov source information entropy based on Chapman-Kolmogorov equation. According to the ergodic theorem, a new proof methodology is proposed in this article, which is different from the basis on properties of information entropy.
{"title":"Homogeneous Markov source information entropy proof based on C-K equation","authors":"Dexin Li","doi":"10.1109/ICASID.2010.5551511","DOIUrl":"https://doi.org/10.1109/ICASID.2010.5551511","url":null,"abstract":"This article proposes a methodology on how to justify homogeneous Markov source information entropy based on Chapman-Kolmogorov equation. According to the ergodic theorem, a new proof methodology is proposed in this article, which is different from the basis on properties of information entropy.","PeriodicalId":391931,"journal":{"name":"2010 International Conference on Anti-Counterfeiting, Security and Identification","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114366443","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-07-18DOI: 10.1109/ICASID.2010.5551836
Xin Jin, Y. Song, Duoli Zhang
With the improved performance of SoC for real-time application, more and more processing cores have been integrated into one chip, which is called MPSoC. One of the key problems is how to design the MPSoC architecture to improve the overall performance. In this paper, a cluster-based MPSoC using hierarchical on-chip communication is proposed. In the top level, on-chip network is used as the communication backbone for various clusters. In the cluster level, processing cores and IPs communicate with each others via a hierarchical bus. This paper focuses on the design and verification problems of computation cluster, which consists of several RISC processors and storage components. Separate control path and data path are designed to meet the performance requirements. The proposed architecture is implemented into a FPGA prototype. And a video application is mapped on the prototype to verify the functionality. Experiments show that the proposed MPSoC can work at 90 MHz and successfully accomplish real-time fade-in-fade-out processing of 4 lane videos which are 320⋆240 and 24 frames per second.
{"title":"FPGA prototype design of the computation nodes in a cluster based MPSoC","authors":"Xin Jin, Y. Song, Duoli Zhang","doi":"10.1109/ICASID.2010.5551836","DOIUrl":"https://doi.org/10.1109/ICASID.2010.5551836","url":null,"abstract":"With the improved performance of SoC for real-time application, more and more processing cores have been integrated into one chip, which is called MPSoC. One of the key problems is how to design the MPSoC architecture to improve the overall performance. In this paper, a cluster-based MPSoC using hierarchical on-chip communication is proposed. In the top level, on-chip network is used as the communication backbone for various clusters. In the cluster level, processing cores and IPs communicate with each others via a hierarchical bus. This paper focuses on the design and verification problems of computation cluster, which consists of several RISC processors and storage components. Separate control path and data path are designed to meet the performance requirements. The proposed architecture is implemented into a FPGA prototype. And a video application is mapped on the prototype to verify the functionality. Experiments show that the proposed MPSoC can work at 90 MHz and successfully accomplish real-time fade-in-fade-out processing of 4 lane videos which are 320⋆240 and 24 frames per second.","PeriodicalId":391931,"journal":{"name":"2010 International Conference on Anti-Counterfeiting, Security and Identification","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115406398","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-07-18DOI: 10.1109/ICASID.2010.5551508
Lei Wang, Xiaoyao Xie
In this paper through analyzing the characteristics of the history data in bridge safety monitoring system, we explain the importance and features of process data compression. The theory of SDT and improved SDT have been introduced in this paper, analyzing the performances of the algorithm and simulation used by SILAB have been given in this paper. By comparing the performance of the two algorithms, we could possibly use the improved SDT to compress the recorded data of the bridge safety monitoring system.
{"title":"Implementation of data compression algorithm based on SILAB","authors":"Lei Wang, Xiaoyao Xie","doi":"10.1109/ICASID.2010.5551508","DOIUrl":"https://doi.org/10.1109/ICASID.2010.5551508","url":null,"abstract":"In this paper through analyzing the characteristics of the history data in bridge safety monitoring system, we explain the importance and features of process data compression. The theory of SDT and improved SDT have been introduced in this paper, analyzing the performances of the algorithm and simulation used by SILAB have been given in this paper. By comparing the performance of the two algorithms, we could possibly use the improved SDT to compress the recorded data of the bridge safety monitoring system.","PeriodicalId":391931,"journal":{"name":"2010 International Conference on Anti-Counterfeiting, Security and Identification","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124903348","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
扫码关注我们
求助内容：
应助结果提醒方式：