有限速率反馈等增益传输的低复杂度码本索引搜索算法研究

N. Park, Xun Li, Young Ju Kim
{"title":"有限速率反馈等增益传输的低复杂度码本索引搜索算法研究","authors":"N. Park, Xun Li, Young Ju Kim","doi":"10.1109/ICTC.2011.6082554","DOIUrl":null,"url":null,"abstract":"In this paper, an efficient three-stage codebook index search algorithm is proposed for quantized equal gain transmission (QEGT) based closed-loop multiple-input multiple-output systems. At the 1st stage, the codewords are grouped into a small number of categories by utilizing Grassmannian criterion or Lloyd's algorithm. At the 2nd stage, the optimal centroid is selected within those of the groups, which maximizes the capacity criterion. At the 3rd stage, the optimal index of QEGT codebook is determined within the group of the selected centroid. Monte-Carlo simulations are presented to show that the codebook index search complexity is halved whilst maintaining the almost same symbol error rate.","PeriodicalId":191169,"journal":{"name":"ICTC 2011","volume":"139 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on reduced complexity codebook index search algorithm for equal gain transmission with finite rate feedback\",\"authors\":\"N. Park, Xun Li, Young Ju Kim\",\"doi\":\"10.1109/ICTC.2011.6082554\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an efficient three-stage codebook index search algorithm is proposed for quantized equal gain transmission (QEGT) based closed-loop multiple-input multiple-output systems. At the 1st stage, the codewords are grouped into a small number of categories by utilizing Grassmannian criterion or Lloyd's algorithm. At the 2nd stage, the optimal centroid is selected within those of the groups, which maximizes the capacity criterion. At the 3rd stage, the optimal index of QEGT codebook is determined within the group of the selected centroid. Monte-Carlo simulations are presented to show that the codebook index search complexity is halved whilst maintaining the almost same symbol error rate.\",\"PeriodicalId\":191169,\"journal\":{\"name\":\"ICTC 2011\",\"volume\":\"139 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICTC 2011\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTC.2011.6082554\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICTC 2011","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTC.2011.6082554","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对基于量化等增益传输(QEGT)的闭环多输入多输出系统,提出了一种高效的三级码本索引搜索算法。在第一阶段,利用格拉斯曼准则或劳埃德算法将码字分组为少量类别。第二阶段,在群中选择最优质心,使容量准则最大化。第三阶段,在所选质心所在组内确定QEGT码本的最优索引。蒙特卡洛仿真表明,在保持几乎相同的符号错误率的情况下,码本索引搜索复杂度降低了一半。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on reduced complexity codebook index search algorithm for equal gain transmission with finite rate feedback
In this paper, an efficient three-stage codebook index search algorithm is proposed for quantized equal gain transmission (QEGT) based closed-loop multiple-input multiple-output systems. At the 1st stage, the codewords are grouped into a small number of categories by utilizing Grassmannian criterion or Lloyd's algorithm. At the 2nd stage, the optimal centroid is selected within those of the groups, which maximizes the capacity criterion. At the 3rd stage, the optimal index of QEGT codebook is determined within the group of the selected centroid. Monte-Carlo simulations are presented to show that the codebook index search complexity is halved whilst maintaining the almost same symbol error rate.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信