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 spee...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhi-Chao Sha, Zhi-Tao Huang, Yi-Yu Zhou, Feng-Hua Wang
Format: Conference Proceeding
Language:English
Subjects:
DS-SS
Hill-climbing (HC)
Non-cooperative signal processing
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c224t-5cfb811d54c4161017d3db4f0ad81258a18a014c3e24a1260f12148de87fda943
cites
container_end_page 1302
container_issue
container_start_page 1299
container_title
container_volume 2
creator Zhi-Chao Sha
Zhi-Tao Huang
Yi-Yu Zhou
Feng-Hua Wang
description 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. Secondly, 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.
doi_str_mv 10.1109/ICoSP.2012.6491814
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_6491814</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6491814</ieee_id><sourcerecordid>6491814</sourcerecordid><originalsourceid>FETCH-LOGICAL-c224t-5cfb811d54c4161017d3db4f0ad81258a18a014c3e24a1260f12148de87fda943</originalsourceid><addsrcrecordid>eNo1kM1OwzAQhI0AiVLyAnDJCyR47Y1jH6H8VaoEEnCuHHvTGjlJicOBt6eIcpoZ6dNoNIxdAi8BuLleLobXl1JwEKVCAxrwiJ0DqloKMDUes8zU-j8rc8JmAhQWlRBwxrKUPjjnErRWUs3Y3W0Mvc_TbiTrQ7_JE31-Ue8opzSFzk5h6PPGJvL53mxDjIWLoWt-URs3wximbXfBTlsbE2UHnbP3h_u3xVOxen5cLm5WhRMCp6JybaMBfIUOQQGH2kvfYMut1yAqbUFbDugkCbQgFG9BAGpPum69NSjn7OqvNxDRejfu943f68MJ8gfaTE34</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Blind spreading sequence estimation based on hill-climbing algorithm</title><source>IEEE Xplore All Conference Series</source><creator>Zhi-Chao Sha ; Zhi-Tao Huang ; Yi-Yu Zhou ; Feng-Hua Wang</creator><creatorcontrib>Zhi-Chao Sha ; Zhi-Tao Huang ; Yi-Yu Zhou ; Feng-Hua Wang</creatorcontrib><description>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. Secondly, 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.</description><identifier>ISSN: 2164-5221</identifier><identifier>ISBN: 9781467321969</identifier><identifier>ISBN: 1467321966</identifier><identifier>EISBN: 1467321974</identifier><identifier>EISBN: 9781467321952</identifier><identifier>EISBN: 1467321958</identifier><identifier>EISBN: 9781467321976</identifier><identifier>DOI: 10.1109/ICoSP.2012.6491814</identifier><language>eng</language><publisher>IEEE</publisher><subject>DS-SS ; Hill-climbing (HC) ; Non-cooperative signal processing</subject><ispartof>2012 IEEE 11th International Conference on Signal Processing, 2012, Vol.2, p.1299-1302</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c224t-5cfb811d54c4161017d3db4f0ad81258a18a014c3e24a1260f12148de87fda943</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6491814$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6491814$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zhi-Chao Sha</creatorcontrib><creatorcontrib>Zhi-Tao Huang</creatorcontrib><creatorcontrib>Yi-Yu Zhou</creatorcontrib><creatorcontrib>Feng-Hua Wang</creatorcontrib><title>Blind spreading sequence estimation based on hill-climbing algorithm</title><title>2012 IEEE 11th International Conference on Signal Processing</title><addtitle>ICoSP</addtitle><description>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. Secondly, 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.</description><subject>DS-SS</subject><subject>Hill-climbing (HC)</subject><subject>Non-cooperative signal processing</subject><issn>2164-5221</issn><isbn>9781467321969</isbn><isbn>1467321966</isbn><isbn>1467321974</isbn><isbn>9781467321952</isbn><isbn>1467321958</isbn><isbn>9781467321976</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo1kM1OwzAQhI0AiVLyAnDJCyR47Y1jH6H8VaoEEnCuHHvTGjlJicOBt6eIcpoZ6dNoNIxdAi8BuLleLobXl1JwEKVCAxrwiJ0DqloKMDUes8zU-j8rc8JmAhQWlRBwxrKUPjjnErRWUs3Y3W0Mvc_TbiTrQ7_JE31-Ue8opzSFzk5h6PPGJvL53mxDjIWLoWt-URs3wximbXfBTlsbE2UHnbP3h_u3xVOxen5cLm5WhRMCp6JybaMBfIUOQQGH2kvfYMut1yAqbUFbDugkCbQgFG9BAGpPum69NSjn7OqvNxDRejfu943f68MJ8gfaTE34</recordid><startdate>201210</startdate><enddate>201210</enddate><creator>Zhi-Chao Sha</creator><creator>Zhi-Tao Huang</creator><creator>Yi-Yu Zhou</creator><creator>Feng-Hua Wang</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201210</creationdate><title>Blind spreading sequence estimation based on hill-climbing algorithm</title><author>Zhi-Chao Sha ; Zhi-Tao Huang ; Yi-Yu Zhou ; Feng-Hua Wang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c224t-5cfb811d54c4161017d3db4f0ad81258a18a014c3e24a1260f12148de87fda943</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>DS-SS</topic><topic>Hill-climbing (HC)</topic><topic>Non-cooperative signal processing</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhi-Chao Sha</creatorcontrib><creatorcontrib>Zhi-Tao Huang</creatorcontrib><creatorcontrib>Yi-Yu Zhou</creatorcontrib><creatorcontrib>Feng-Hua Wang</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zhi-Chao Sha</au><au>Zhi-Tao Huang</au><au>Yi-Yu Zhou</au><au>Feng-Hua Wang</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Blind spreading sequence estimation based on hill-climbing algorithm</atitle><btitle>2012 IEEE 11th International Conference on Signal Processing</btitle><stitle>ICoSP</stitle><date>2012-10</date><risdate>2012</risdate><volume>2</volume><spage>1299</spage><epage>1302</epage><pages>1299-1302</pages><issn>2164-5221</issn><isbn>9781467321969</isbn><isbn>1467321966</isbn><eisbn>1467321974</eisbn><eisbn>9781467321952</eisbn><eisbn>1467321958</eisbn><eisbn>9781467321976</eisbn><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. Secondly, 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.</abstract><pub>IEEE</pub><doi>10.1109/ICoSP.2012.6491814</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2164-5221
ispartof 2012 IEEE 11th International Conference on Signal Processing, 2012, Vol.2, p.1299-1302
issn 2164-5221
language eng
recordid cdi_ieee_primary_6491814
source IEEE Xplore All Conference Series
subjects DS-SS
Hill-climbing (HC)
Non-cooperative signal processing
title Blind spreading sequence estimation based on hill-climbing algorithm
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T14%3A18%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Blind%20spreading%20sequence%20estimation%20based%20on%20hill-climbing%20algorithm&rft.btitle=2012%20IEEE%2011th%20International%20Conference%20on%20Signal%20Processing&rft.au=Zhi-Chao%20Sha&rft.date=2012-10&rft.volume=2&rft.spage=1299&rft.epage=1302&rft.pages=1299-1302&rft.issn=2164-5221&rft.isbn=9781467321969&rft.isbn_list=1467321966&rft_id=info:doi/10.1109/ICoSP.2012.6491814&rft.eisbn=1467321974&rft.eisbn_list=9781467321952&rft.eisbn_list=1467321958&rft.eisbn_list=9781467321976&rft_dat=%3Cieee_CHZPO%3E6491814%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c224t-5cfb811d54c4161017d3db4f0ad81258a18a014c3e24a1260f12148de87fda943%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6491814&rfr_iscdi=true