Zhi-Chao Sha, Zhitao Huang, Yiyu Zhou, Fenghua Wang
{"title":"基于爬坡算法的盲扩展序列估计","authors":"Zhi-Chao Sha, Zhitao Huang, Yiyu Zhou, Fenghua Wang","doi":"10.1109/ICOSP.2012.6491814","DOIUrl":null,"url":null,"abstract":"In this paper an efficient method is proposed for blind estimation of short-code direct sequence spread spectrum (DS-SS) signal in synchronous system. This method is based on hill-climbing algorithm (HC), which is developed to estimate the spreading sequence for the capability of efficiency and speediness local optimization search. Firstly, The fitness function is constructed to value the quality of candidate sequence. Sencondly, the feasibility that HC algorithm is used to estimate the spreading sequence is analysed according to the fitness function. Lastly, simulation results show that the novel method is capable of retrieving the spreading sequences with approximate performance to previous methods, whereas the computational complexity is much lower than previous methods.","PeriodicalId":143331,"journal":{"name":"2012 IEEE 11th International Conference on Signal Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Blind spreading sequence estimation based on hill-climbing algorithm\",\"authors\":\"Zhi-Chao Sha, Zhitao Huang, Yiyu Zhou, Fenghua Wang\",\"doi\":\"10.1109/ICOSP.2012.6491814\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper an efficient method is proposed for blind estimation of short-code direct sequence spread spectrum (DS-SS) signal in synchronous system. This method is based on hill-climbing algorithm (HC), which is developed to estimate the spreading sequence for the capability of efficiency and speediness local optimization search. Firstly, The fitness function is constructed to value the quality of candidate sequence. Sencondly, the feasibility that HC algorithm is used to estimate the spreading sequence is analysed according to the fitness function. Lastly, simulation results show that the novel method is capable of retrieving the spreading sequences with approximate performance to previous methods, whereas the computational complexity is much lower than previous methods.\",\"PeriodicalId\":143331,\"journal\":{\"name\":\"2012 IEEE 11th International Conference on Signal Processing\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE 11th International Conference on Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOSP.2012.6491814\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 11th International Conference on Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOSP.2012.6491814","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Blind spreading sequence estimation based on hill-climbing algorithm
In this paper an efficient method is proposed for blind estimation of short-code direct sequence spread spectrum (DS-SS) signal in synchronous system. This method is based on hill-climbing algorithm (HC), which is developed to estimate the spreading sequence for the capability of efficiency and speediness local optimization search. Firstly, The fitness function is constructed to value the quality of candidate sequence. Sencondly, the feasibility that HC algorithm is used to estimate the spreading sequence is analysed according to the fitness function. Lastly, simulation results show that the novel method is capable of retrieving the spreading sequences with approximate performance to previous methods, whereas the computational complexity is much lower than previous methods.