DS-CDMA系统盲(类训练)解码器辅助波束形成

R. Pacheco, D. Hatzinakos
{"title":"DS-CDMA系统盲(类训练)解码器辅助波束形成","authors":"R. Pacheco, D. Hatzinakos","doi":"10.1109/ICASSP.2003.1202672","DOIUrl":null,"url":null,"abstract":"We propose an iterative blind beamforming strategy for short-burst high-rate DS-CDMA systems. The blind strategy works by creating a set of \"training sequences\" in the receiver that is used as input to a semi-blind beamforming algorithm, thus producing a corresponding set of beamformers. The objective then becomes to find which beamformer gives the best performance (smallest bit error). Two challenges we face are: (1) to find a semi-blind algorithm that requires very few training symbols (to minimize the search time); (2) to find an appropriate criterion for picking the beamformer that offers the best performance. Different semi-blind algorithms and criteria are tested. The recently proposed SBCMACI (semi-blind CMA with channel identification) (Casella, I.R.S. et al., PIMRC, p.1972-6, 2002) is demonstrated to be ideal because of how few training symbols it needs for convergence. Of the tested criteria, one based on feedback from the decoder (essentially using trellis information) is shown to achieve nearly optimal performance.","PeriodicalId":104473,"journal":{"name":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Blind (training-like) decoder assisted beamforming for DS-CDMA systems\",\"authors\":\"R. Pacheco, D. Hatzinakos\",\"doi\":\"10.1109/ICASSP.2003.1202672\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose an iterative blind beamforming strategy for short-burst high-rate DS-CDMA systems. The blind strategy works by creating a set of \\\"training sequences\\\" in the receiver that is used as input to a semi-blind beamforming algorithm, thus producing a corresponding set of beamformers. The objective then becomes to find which beamformer gives the best performance (smallest bit error). Two challenges we face are: (1) to find a semi-blind algorithm that requires very few training symbols (to minimize the search time); (2) to find an appropriate criterion for picking the beamformer that offers the best performance. Different semi-blind algorithms and criteria are tested. The recently proposed SBCMACI (semi-blind CMA with channel identification) (Casella, I.R.S. et al., PIMRC, p.1972-6, 2002) is demonstrated to be ideal because of how few training symbols it needs for convergence. Of the tested criteria, one based on feedback from the decoder (essentially using trellis information) is shown to achieve nearly optimal performance.\",\"PeriodicalId\":104473,\"journal\":{\"name\":\"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP.2003.1202672\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.2003.1202672","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种用于短突发高速率DS-CDMA系统的迭代盲波束形成策略。盲策略的工作原理是在接收机中创建一组“训练序列”,作为半盲波束形成算法的输入,从而产生一组相应的波束形成器。然后,目标变成找到哪个波束形成器提供最好的性能(最小的误码)。我们面临的两个挑战是:(1)找到一种需要很少训练符号的半盲算法(以最小化搜索时间);(2)寻找合适的准则来选择性能最佳的波束形成器。测试了不同的半盲算法和准则。最近提出的SBCMACI(带信道识别的半盲CMA) (Casella, I.R.S.等人,PIMRC, p.1972- 6,2002)被证明是理想的,因为它需要很少的训练符号来收敛。在测试的标准中,基于解码器反馈的标准(基本上是使用网格信息)显示出接近最佳的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Blind (training-like) decoder assisted beamforming for DS-CDMA systems
We propose an iterative blind beamforming strategy for short-burst high-rate DS-CDMA systems. The blind strategy works by creating a set of "training sequences" in the receiver that is used as input to a semi-blind beamforming algorithm, thus producing a corresponding set of beamformers. The objective then becomes to find which beamformer gives the best performance (smallest bit error). Two challenges we face are: (1) to find a semi-blind algorithm that requires very few training symbols (to minimize the search time); (2) to find an appropriate criterion for picking the beamformer that offers the best performance. Different semi-blind algorithms and criteria are tested. The recently proposed SBCMACI (semi-blind CMA with channel identification) (Casella, I.R.S. et al., PIMRC, p.1972-6, 2002) is demonstrated to be ideal because of how few training symbols it needs for convergence. Of the tested criteria, one based on feedback from the decoder (essentially using trellis information) is shown to achieve nearly optimal performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信