Pub Date : 2008-12-16DOI: 10.1109/ICCT.2008.4716089
He Jia-fu, Jiang Yong, Bian Dong-ming, Li Guang-xia
In LEO satellite constellation communication system, the routing strategy becomes a big challenge for the movement between satellites. According to researching on the 24/3/1 walker satellite constellation with inter-orbit ISLs and intra-orbit ISLs, two routing optimization scenarios based on ISL state and topology snapshot are suggested. At the same time, some valuable conclusions are provided according to computer simulation about the routing optimization scenarios and the MDA(Minimum Distance Algorithm).
{"title":"Routing strategy research based on ISL states and topology snapshot in LEO satellite constellation","authors":"He Jia-fu, Jiang Yong, Bian Dong-ming, Li Guang-xia","doi":"10.1109/ICCT.2008.4716089","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716089","url":null,"abstract":"In LEO satellite constellation communication system, the routing strategy becomes a big challenge for the movement between satellites. According to researching on the 24/3/1 walker satellite constellation with inter-orbit ISLs and intra-orbit ISLs, two routing optimization scenarios based on ISL state and topology snapshot are suggested. At the same time, some valuable conclusions are provided according to computer simulation about the routing optimization scenarios and the MDA(Minimum Distance Algorithm).","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"432 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122874330","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716149
Lei Wang, Tongsen Wang
Focus on anti-monitoring problem of the mobile object in sensory fields, a novel dynamic heuristic anti-monitoring path searching algorithm in sensory field by combining prior property of eight-neighbor quadratic cell and A* algorithm is designed. Theoretical analyses and experimental results show that, compared with conventional works, the new algorithm has better anti-monitoring performance which guarantee the mobile object move along the path with less risk to destination.
{"title":"Dynamic heuristic anti-monitoring path searching algorithm in sensory field","authors":"Lei Wang, Tongsen Wang","doi":"10.1109/ICCT.2008.4716149","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716149","url":null,"abstract":"Focus on anti-monitoring problem of the mobile object in sensory fields, a novel dynamic heuristic anti-monitoring path searching algorithm in sensory field by combining prior property of eight-neighbor quadratic cell and A* algorithm is designed. Theoretical analyses and experimental results show that, compared with conventional works, the new algorithm has better anti-monitoring performance which guarantee the mobile object move along the path with less risk to destination.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125621945","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716114
Wenhua Wang, Qingguo Shen, Zhong Qin
Based on a simplified BGP routing model, the paper analyses the upper bound of BGP convergence delay for four basic network topologies. Then we give a method for calculating the upper bound of BGP convergence delay for any topology. With simulation under ssfnet, we observe the deviation between our proposed delay upper bound and convergence delay in simulation, and reach to the conclusion that our results have accuracy under certain conditions. We also analyze the relationship between topology parameters and route convergence delay, which is helpful to choose topology among topology structures.
{"title":"On the relationship between BGP convergence delay and network topology","authors":"Wenhua Wang, Qingguo Shen, Zhong Qin","doi":"10.1109/ICCT.2008.4716114","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716114","url":null,"abstract":"Based on a simplified BGP routing model, the paper analyses the upper bound of BGP convergence delay for four basic network topologies. Then we give a method for calculating the upper bound of BGP convergence delay for any topology. With simulation under ssfnet, we observe the deviation between our proposed delay upper bound and convergence delay in simulation, and reach to the conclusion that our results have accuracy under certain conditions. We also analyze the relationship between topology parameters and route convergence delay, which is helpful to choose topology among topology structures.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114168059","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716100
Zhidong Zhao, M. Chan
ECG recording is often corrupted by power line interference. A novel method is proposed for removal of power line frequency from ECG signals based on Empirical Mode Decomposition (EMD) and adaptive filter. EMD is a relatively new, data-driven adaptive technique used to decompose ECG signal into a series of Intrinsic Mode Functions (IMFs). The adaptive power line cancellation filter is designed to remove the power line interference, the reference signal of which is produced by selectively reconstruction of IMFs. To evaluate the performance of the filter, Clinic ECG signals are used. Results indicate that the power line interference of ECG is removed effectively by this new method.
{"title":"A novel cancellation method of powerline interference in ECG signal based on EMD and adaptive filter","authors":"Zhidong Zhao, M. Chan","doi":"10.1109/ICCT.2008.4716100","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716100","url":null,"abstract":"ECG recording is often corrupted by power line interference. A novel method is proposed for removal of power line frequency from ECG signals based on Empirical Mode Decomposition (EMD) and adaptive filter. EMD is a relatively new, data-driven adaptive technique used to decompose ECG signal into a series of Intrinsic Mode Functions (IMFs). The adaptive power line cancellation filter is designed to remove the power line interference, the reference signal of which is produced by selectively reconstruction of IMFs. To evaluate the performance of the filter, Clinic ECG signals are used. Results indicate that the power line interference of ECG is removed effectively by this new method.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114487150","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716199
Z. Dong, Mingxia Li
Aiming at the problems of the detection of long pseudo-random code DSSS (direct sequence spread spectral) Signals and the estimation of the pseudo-random code period and the chip width, the paper proposes a method based on the processing of delay-multiply with the signals. The method does processing of delay-multiply on the received signals at first, then calculates the autocorrelation and gets correlation peaks, which can reflect the characteristics of the long pseudo-random code DSSS signals, in the autocorrelation domain; In the detection of the long pseudo-random code DSSS signals we can realize the detection and achieve the estimation of the pseudo-random code period and the chip width by checking the correlation peaks. The computer simulations show that the proposed method has good performance.
{"title":"A method for the detection of long pseudo-random code DSSS signals based on the processing of delay-multiply (I) - the estimation of the pseudo-random code period and the chip width","authors":"Z. Dong, Mingxia Li","doi":"10.1109/ICCT.2008.4716199","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716199","url":null,"abstract":"Aiming at the problems of the detection of long pseudo-random code DSSS (direct sequence spread spectral) Signals and the estimation of the pseudo-random code period and the chip width, the paper proposes a method based on the processing of delay-multiply with the signals. The method does processing of delay-multiply on the received signals at first, then calculates the autocorrelation and gets correlation peaks, which can reflect the characteristics of the long pseudo-random code DSSS signals, in the autocorrelation domain; In the detection of the long pseudo-random code DSSS signals we can realize the detection and achieve the estimation of the pseudo-random code period and the chip width by checking the correlation peaks. The computer simulations show that the proposed method has good performance.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114806252","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716293
Xue Yanming, Gao-lei Fei
This paper proposes a novel blind channel estimation method for STC-OFDM with two transmit antennas and one receive antenna. The number of received blocks needed for blind channel estimation is significantly reduced by repeated use of the same blocks. This feature makes it more realistic when the channel state is fast-varying. Simulation results confirm that the proposed method is effective.
{"title":"Subspace-based blind channel estimation for STC-OFDM using few received blocks","authors":"Xue Yanming, Gao-lei Fei","doi":"10.1109/ICCT.2008.4716293","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716293","url":null,"abstract":"This paper proposes a novel blind channel estimation method for STC-OFDM with two transmit antennas and one receive antenna. The number of received blocks needed for blind channel estimation is significantly reduced by repeated use of the same blocks. This feature makes it more realistic when the channel state is fast-varying. Simulation results confirm that the proposed method is effective.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123954857","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716230
Y. Ling, Yiming Xiang, Xun Sun
In this paper we criticize the claimed security of an identity-based strong designated verifier signature (IBSDVS) scheme proposed recently based on bilinear pairings. In particular, we show that, contrary to the authorspsila claim, this scheme is delegatable if the computational Diffie-Hellman problem in the underlying group is intractable. We also explain why the claimed proof fails, in the hope that similar mistake is not repeated in future research.
{"title":"Delegatability of an ID-based designated verifier signature scheme","authors":"Y. Ling, Yiming Xiang, Xun Sun","doi":"10.1109/ICCT.2008.4716230","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716230","url":null,"abstract":"In this paper we criticize the claimed security of an identity-based strong designated verifier signature (IBSDVS) scheme proposed recently based on bilinear pairings. In particular, we show that, contrary to the authorspsila claim, this scheme is delegatable if the computational Diffie-Hellman problem in the underlying group is intractable. We also explain why the claimed proof fails, in the hope that similar mistake is not repeated in future research.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124263092","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716132
Hua Jiao, Jie Chen, Wei Wei
In this paper, we mainly present a general home network architecture, which can integrate various devices and networks. As a general interface, YT0101 communication board is a key component for the control network. It solidifies the standard communication protocol of home wired network. Various appliances can be accessed by home network after they are equipped with YT0101 interface board. We also give the design of Home Gateway, which completes the protocol conversion between networks, and provides the control and management to appliances. We aim to provide a standardization method to solve the network interconnection and device interoperability question.
{"title":"The design and realization of home general control network","authors":"Hua Jiao, Jie Chen, Wei Wei","doi":"10.1109/ICCT.2008.4716132","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716132","url":null,"abstract":"In this paper, we mainly present a general home network architecture, which can integrate various devices and networks. As a general interface, YT0101 communication board is a key component for the control network. It solidifies the standard communication protocol of home wired network. Various appliances can be accessed by home network after they are equipped with YT0101 interface board. We also give the design of Home Gateway, which completes the protocol conversion between networks, and provides the control and management to appliances. We aim to provide a standardization method to solve the network interconnection and device interoperability question.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122085009","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716202
Feng-lian Li, Xue-Ying Zhang
A novel perceptual weighting filter for improving the perceptual quality of wideband speech codecs (such as ITU-T G.722.2 Adaptive Multi-rate Wideband codec AMR-WB) is proposed.The perceptual processing is based on the cepstral difference of ISP multiplied-polynomial cepstrum and LPC cepstral coefficients. The paper introduces the concepts of ISP pseudo-cepstrum, deduces the ISP pseudo-cepstrum and ISP multiplied-polynomial cepstrum.The spectral tilt is more pronounced in wideband signals due to the wide dynamic range between low and high frequencies. The proposed filter significantly compensates the spectral tilt of wideband signals that codec does not require an additional tilt compensation as traditional technique.The frequency response of proposed perceptual weighting filter is consistent with the auditory masking theory. Simulation results indicate that the objective assessment scores obtained using wideband Perceptual Evaluation of Speech Quality (w-PESQ) can be improved significantly by the proposed method.
{"title":"A rerceptual weighting filter on cepstrum domain for wideband speech codecs","authors":"Feng-lian Li, Xue-Ying Zhang","doi":"10.1109/ICCT.2008.4716202","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716202","url":null,"abstract":"A novel perceptual weighting filter for improving the perceptual quality of wideband speech codecs (such as ITU-T G.722.2 Adaptive Multi-rate Wideband codec AMR-WB) is proposed.The perceptual processing is based on the cepstral difference of ISP multiplied-polynomial cepstrum and LPC cepstral coefficients. The paper introduces the concepts of ISP pseudo-cepstrum, deduces the ISP pseudo-cepstrum and ISP multiplied-polynomial cepstrum.The spectral tilt is more pronounced in wideband signals due to the wide dynamic range between low and high frequencies. The proposed filter significantly compensates the spectral tilt of wideband signals that codec does not require an additional tilt compensation as traditional technique.The frequency response of proposed perceptual weighting filter is consistent with the auditory masking theory. Simulation results indicate that the objective assessment scores obtained using wideband Perceptual Evaluation of Speech Quality (w-PESQ) can be improved significantly by the proposed method.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"39 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116655841","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 : 2008-12-16DOI: 10.1109/ICCT.2008.4716284
Fulai Liu, Jinkuan Wang, Ruiyan Du
ESPRIT is a high-resolution parameter estimation techniques based on the translational invariance structure of a sensor array, which has recently been applied to the problem of determining the directions and center frequencies of a number of narrowband sources in a band of interest. Here, we present a simple and efficient method for the joint angle-frequency estimation (JAFE), named as unitary-JAFE algorithm. In the final stage of the proposed algorithm, the real and imaginary parts of the ith eigenvalue of a matrix are one-to-one related to the frequency and direction of arrival of the ith source. Unitary-JAFE offers a number of advantages over other recently proposed ESPRIT based closed-form JAFE estimation techniques, such as except for the final eigenvalue decomposition of dimension equal to the number of sources, it is efficiently formulated in terms of real-valued computation throughout. Finally, Simulation results are presented verifying the efficacy of the method.
{"title":"Unitary-JAFE: A high accuracy and resolution algorithm for joint angle and frequency estimation","authors":"Fulai Liu, Jinkuan Wang, Ruiyan Du","doi":"10.1109/ICCT.2008.4716284","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716284","url":null,"abstract":"ESPRIT is a high-resolution parameter estimation techniques based on the translational invariance structure of a sensor array, which has recently been applied to the problem of determining the directions and center frequencies of a number of narrowband sources in a band of interest. Here, we present a simple and efficient method for the joint angle-frequency estimation (JAFE), named as unitary-JAFE algorithm. In the final stage of the proposed algorithm, the real and imaginary parts of the ith eigenvalue of a matrix are one-to-one related to the frequency and direction of arrival of the ith source. Unitary-JAFE offers a number of advantages over other recently proposed ESPRIT based closed-form JAFE estimation techniques, such as except for the final eigenvalue decomposition of dimension equal to the number of sources, it is efficiently formulated in terms of real-valued computation throughout. Finally, Simulation results are presented verifying the efficacy of the method.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117148306","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
扫码关注我们
求助内容：
应助结果提醒方式：