基于短表检测和度量相结合的近容量性能软输出球解码

Jinhong Wu, B. Vojcic
{"title":"基于短表检测和度量相结合的近容量性能软输出球解码","authors":"Jinhong Wu, B. Vojcic","doi":"10.1109/CISS.2009.5054776","DOIUrl":null,"url":null,"abstract":"We introduce a low complexity iterative soft output sphere decoding algorithm for coded transmissions over multiple antenna channels. Before the iterative detection and decoding starts, a modified hard decision sphere decoder produces a short (base) list of vectors with maximum likelihood metrics. In subsequent iterative soft detections, two competing lists with a small number of vectors are further generated for each coded bit, by utilizing the base list vectors and a priori information from the channel decoder. The corresponding likelihood metrics of the vectors in each competing list are combined to produce soft detection output that approximates the optimal maximum a posteriori (MAP) solution. The performance improves as the base list size increases and a short list (hence a low number of competing vectors) can provide near-capacity performance after a few iterations. Compared with existing methods that adopt the max-log approximation and select only a single best competing vector, the proposed algorithm approaches the optimal performance better with significantly lower complexity requirements.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"2017 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Near-capacity performance soft output sphere decoding based on short list detection and metrics combining\",\"authors\":\"Jinhong Wu, B. Vojcic\",\"doi\":\"10.1109/CISS.2009.5054776\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a low complexity iterative soft output sphere decoding algorithm for coded transmissions over multiple antenna channels. Before the iterative detection and decoding starts, a modified hard decision sphere decoder produces a short (base) list of vectors with maximum likelihood metrics. In subsequent iterative soft detections, two competing lists with a small number of vectors are further generated for each coded bit, by utilizing the base list vectors and a priori information from the channel decoder. The corresponding likelihood metrics of the vectors in each competing list are combined to produce soft detection output that approximates the optimal maximum a posteriori (MAP) solution. The performance improves as the base list size increases and a short list (hence a low number of competing vectors) can provide near-capacity performance after a few iterations. Compared with existing methods that adopt the max-log approximation and select only a single best competing vector, the proposed algorithm approaches the optimal performance better with significantly lower complexity requirements.\",\"PeriodicalId\":433796,\"journal\":{\"name\":\"2009 43rd Annual Conference on Information Sciences and Systems\",\"volume\":\"2017 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 43rd Annual Conference on Information Sciences and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2009.5054776\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 43rd Annual Conference on Information Sciences and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2009.5054776","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对多天线信道的编码传输,提出了一种低复杂度迭代软输出球解码算法。在迭代检测和解码开始之前,一个改进的硬决策域解码器产生一个具有最大似然度量的短(基本)向量列表。在随后的迭代软检测中,利用基本列表向量和信道解码器的先验信息,为每个编码位进一步生成两个具有少量矢量的竞争列表。每个竞争列表中对应的向量的似然度量相结合,产生接近最优最大后验(MAP)解决方案的软检测输出。性能随着基本列表大小的增加而提高,短列表(因此竞争向量的数量较少)可以在几次迭代后提供接近容量的性能。与采用最大对数近似和只选择单个最佳竞争向量的现有方法相比,该算法更接近最优性能,且复杂度要求显著降低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Near-capacity performance soft output sphere decoding based on short list detection and metrics combining
We introduce a low complexity iterative soft output sphere decoding algorithm for coded transmissions over multiple antenna channels. Before the iterative detection and decoding starts, a modified hard decision sphere decoder produces a short (base) list of vectors with maximum likelihood metrics. In subsequent iterative soft detections, two competing lists with a small number of vectors are further generated for each coded bit, by utilizing the base list vectors and a priori information from the channel decoder. The corresponding likelihood metrics of the vectors in each competing list are combined to produce soft detection output that approximates the optimal maximum a posteriori (MAP) solution. The performance improves as the base list size increases and a short list (hence a low number of competing vectors) can provide near-capacity performance after a few iterations. Compared with existing methods that adopt the max-log approximation and select only a single best competing vector, the proposed algorithm approaches the optimal performance better with significantly lower complexity requirements.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信