直接序列扩频信号的盲扩频序列集估计

P. Qiu, Dan Xu, Zhitao Huang, Wenli Jiang
{"title":"直接序列扩频信号的盲扩频序列集估计","authors":"P. Qiu, Dan Xu, Zhitao Huang, Wenli Jiang","doi":"10.1109/WCINS.2010.5541917","DOIUrl":null,"url":null,"abstract":"In the non-cooperative context, the M-ary direct sequence spread spectrum (DSSS) signals are much more difficult to be intercepted than the conventional DSSS signals. Few literatures can be found to provide the information of this kind of signal in such circumstances. In this paper, a blind spreading sequence set estimation algorithm for the M-ary DSSS signals is proposed. This method exploits the signal structure and the cross-correlation properties between the spreading sequences. Firstly, the received signal samples are divided into a set of vectors. Secondly, using a correlation-based iteration, one of the spreading sequences is recovered. And, the vectors corresponding to this sequence are removed from the signal vector set. Thirdly, by repeating the above procedure, a set of estimates are obtained. Finally, false answers are removed by checking the estimates with the original signal samples, then, the spreading sequence set is recovered. This method is capable of providing good estimates when the signal-to-noise ratio is greater than −1dB. Besides, the proposed method is much faster and more robust than the existing K-means clustering dispreading method. Simulation results verify the capabilities of the proposed method.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Blind spreading sequence set estimation of the M-ary direct sequence spread spectrum signals\",\"authors\":\"P. Qiu, Dan Xu, Zhitao Huang, Wenli Jiang\",\"doi\":\"10.1109/WCINS.2010.5541917\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the non-cooperative context, the M-ary direct sequence spread spectrum (DSSS) signals are much more difficult to be intercepted than the conventional DSSS signals. Few literatures can be found to provide the information of this kind of signal in such circumstances. In this paper, a blind spreading sequence set estimation algorithm for the M-ary DSSS signals is proposed. This method exploits the signal structure and the cross-correlation properties between the spreading sequences. Firstly, the received signal samples are divided into a set of vectors. Secondly, using a correlation-based iteration, one of the spreading sequences is recovered. And, the vectors corresponding to this sequence are removed from the signal vector set. Thirdly, by repeating the above procedure, a set of estimates are obtained. Finally, false answers are removed by checking the estimates with the original signal samples, then, the spreading sequence set is recovered. This method is capable of providing good estimates when the signal-to-noise ratio is greater than −1dB. Besides, the proposed method is much faster and more robust than the existing K-means clustering dispreading method. Simulation results verify the capabilities of the proposed method.\",\"PeriodicalId\":156036,\"journal\":{\"name\":\"2010 IEEE International Conference on Wireless Communications, Networking and Information Security\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Wireless Communications, Networking and Information Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCINS.2010.5541917\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCINS.2010.5541917","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在非合作环境下,直接序列扩频(DSSS)信号比传统的DSSS信号更难被截获。很少有文献能在这种情况下提供这种信号的信息。本文提出了一种适用于多路DSSS信号的盲扩展序列集估计算法。该方法利用了扩频序列之间的信号结构和相互关联特性。首先,将接收到的信号样本分成一组矢量。其次,利用基于相关性的迭代,恢复其中一个扩展序列;并且,从信号向量集中移除与该序列对应的向量。再次,通过重复上述步骤,得到一组估计。最后,通过对原始信号样本的估计进行检验,去除错误答案,恢复扩展序列集。当信噪比大于- 1dB时,该方法能够提供良好的估计。此外,该方法比现有的k均值聚类扩散方法更快,鲁棒性更强。仿真结果验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Blind spreading sequence set estimation of the M-ary direct sequence spread spectrum signals
In the non-cooperative context, the M-ary direct sequence spread spectrum (DSSS) signals are much more difficult to be intercepted than the conventional DSSS signals. Few literatures can be found to provide the information of this kind of signal in such circumstances. In this paper, a blind spreading sequence set estimation algorithm for the M-ary DSSS signals is proposed. This method exploits the signal structure and the cross-correlation properties between the spreading sequences. Firstly, the received signal samples are divided into a set of vectors. Secondly, using a correlation-based iteration, one of the spreading sequences is recovered. And, the vectors corresponding to this sequence are removed from the signal vector set. Thirdly, by repeating the above procedure, a set of estimates are obtained. Finally, false answers are removed by checking the estimates with the original signal samples, then, the spreading sequence set is recovered. This method is capable of providing good estimates when the signal-to-noise ratio is greater than −1dB. Besides, the proposed method is much faster and more robust than the existing K-means clustering dispreading method. Simulation results verify the capabilities of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信