Blind spreading sequence estimation based on hill-climbing algorithm

Zhi-Chao Sha, Zhitao Huang, Yiyu Zhou, Fenghua Wang
{"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}
引用次数: 5

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.
基于爬坡算法的盲扩展序列估计
提出了一种同步系统中短码直接序列扩频信号的盲估计方法。该方法基于爬坡算法(HC),该算法用于估计扩展序列,具有高效、快速的局部优化搜索能力。首先,构造适应度函数来评价候选序列的质量;其次,根据适应度函数分析了HC算法估计扩频序列的可行性;最后,仿真结果表明,该方法能够以近似的性能检索扩展序列,而计算复杂度远低于以前的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信