Near Optimum User Selection for Minimum Mean Square Error Based Tomlinson Harashima Precoding

S. Denno, T. Baba, Kenta Asaka, Yafei Hou
{"title":"Near Optimum User Selection for Minimum Mean Square Error Based Tomlinson Harashima Precoding","authors":"S. Denno, T. Baba, Kenta Asaka, Yafei Hou","doi":"10.15344/2456-4451/2019/142","DOIUrl":null,"url":null,"abstract":"This paper proposes novel user selection techniques for the Tomlinson-Harashima precoding (THP) based on the minimum mean square error (MMSE) criterion. These techniques utilize a part of the intermediate values in the derivation of the THP weight, which makes it possible to implement the techniques with lower computational complexity. For further complexity reduction, we propose successive user selection techniques based on the techniques proposed above where user terminals are selected one by one. It is confirmed by computer simulations that the proposed techniques outperform conventional selection techniques. The computational complexity of the successive selection techniques is about 1/20 as small as that of the original selection techniques when 4 user terminals are selected out of 10 terminals.","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"25 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Software Engineering and Computer Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15344/2456-4451/2019/142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes novel user selection techniques for the Tomlinson-Harashima precoding (THP) based on the minimum mean square error (MMSE) criterion. These techniques utilize a part of the intermediate values in the derivation of the THP weight, which makes it possible to implement the techniques with lower computational complexity. For further complexity reduction, we propose successive user selection techniques based on the techniques proposed above where user terminals are selected one by one. It is confirmed by computer simulations that the proposed techniques outperform conventional selection techniques. The computational complexity of the successive selection techniques is about 1/20 as small as that of the original selection techniques when 4 user terminals are selected out of 10 terminals.
基于最小均方误差的Tomlinson Harashima预编码近最优用户选择
提出了基于最小均方误差(MMSE)准则的Tomlinson-Harashima预编码(THP)用户选择新技术。这些技术在THP权重的推导中利用了一部分中间值,这使得实现这些技术具有较低的计算复杂度。为了进一步降低复杂性,我们在上述技术的基础上提出了逐次选择用户终端的用户选择技术。计算机模拟结果表明,该方法优于传统的选择方法。当从10个终端中选择4个用户终端时,连续选择技术的计算复杂度约为原始选择技术的1/20。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
14
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信