{"title":"基于最小均方误差的Tomlinson Harashima预编码近最优用户选择","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":"{\"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}","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}
Near Optimum User Selection for Minimum Mean Square Error Based Tomlinson Harashima Precoding
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.