一种改进V-BLAST迭代检测算法的方案

Wenbai Chen, Xiaoqin Zhang, Wei Li
{"title":"一种改进V-BLAST迭代检测算法的方案","authors":"Wenbai Chen, Xiaoqin Zhang, Wei Li","doi":"10.1109/WCINS.2010.5541743","DOIUrl":null,"url":null,"abstract":"Traditional detection algorithm for V-BLAST is based on Order Successive Interference Cancellation (OSIC). Using iterative algorithm, the low-diversity substreams are decoded by decisions form of high-diversity substreams, the performance is highly improved at a cost of too much iterative repetition. To decrease computational complexity, an improved scheme for iterative detection method was proposed in this paper. Improving the performance of the first substream greatly and reducing iterative repetition, the improved scheme achieves the balance of performance and computation complexity. Simulation results show that the improve scheme obtains nearly the same performance with that of normal iterative OSIC algorithm, but the computational complexity is low comparatively.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An scheme improved on iterative detection algorithm for V-BLAST\",\"authors\":\"Wenbai Chen, Xiaoqin Zhang, Wei Li\",\"doi\":\"10.1109/WCINS.2010.5541743\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditional detection algorithm for V-BLAST is based on Order Successive Interference Cancellation (OSIC). Using iterative algorithm, the low-diversity substreams are decoded by decisions form of high-diversity substreams, the performance is highly improved at a cost of too much iterative repetition. To decrease computational complexity, an improved scheme for iterative detection method was proposed in this paper. Improving the performance of the first substream greatly and reducing iterative repetition, the improved scheme achieves the balance of performance and computation complexity. Simulation results show that the improve scheme obtains nearly the same performance with that of normal iterative OSIC algorithm, but the computational complexity is low comparatively.\",\"PeriodicalId\":156036,\"journal\":{\"name\":\"2010 IEEE International Conference on Wireless Communications, Networking and Information Security\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"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.5541743\",\"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.5541743","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

传统的V-BLAST检测算法基于序次逐次干扰抵消(OSIC)。在迭代算法中,低分集子流被高分集子流的决策形式解码,性能得到了很大的提高,但代价是迭代重复过多。为了降低计算复杂度,本文提出了一种改进的迭代检测方法。改进方案大大提高了第一子流的性能,减少了迭代重复,实现了性能与计算复杂度的平衡。仿真结果表明,改进方案的性能与常规迭代OSIC算法基本一致,但计算量相对较低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An scheme improved on iterative detection algorithm for V-BLAST
Traditional detection algorithm for V-BLAST is based on Order Successive Interference Cancellation (OSIC). Using iterative algorithm, the low-diversity substreams are decoded by decisions form of high-diversity substreams, the performance is highly improved at a cost of too much iterative repetition. To decrease computational complexity, an improved scheme for iterative detection method was proposed in this paper. Improving the performance of the first substream greatly and reducing iterative repetition, the improved scheme achieves the balance of performance and computation complexity. Simulation results show that the improve scheme obtains nearly the same performance with that of normal iterative OSIC algorithm, but the computational complexity is low comparatively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信