{"title":"基于qrd的多用户海量MIMO零空间扩展预编码设计","authors":"Yuki Sasaki;Kabuto Arai;Kazuki Maruta","doi":"10.23919/comex.2024XBL0150","DOIUrl":null,"url":null,"abstract":"This article proposes a precoding weight suitable for null-space expansion (NSE) in multi-user massive multiple-input multiple-output (MU-mMIMO). NSE improves inter-user interference (IUI) suppression performance by steering multiple nulls for interfering user terminals (UTs). However, NSE faces challenges in effectively forming beams and nulls for IUI suppression, as well as in managing the computational complexity for precoding. We employ QR decomposition-based Gram-Schmidt orthogonalization (QRGSO) as a precoding algorithm suitable for NSE. Computer simulation demonstrates the superiority of the proposed scheme in terms of IUI suppression performance and computation complexity.","PeriodicalId":54101,"journal":{"name":"IEICE Communications Express","volume":"13 12","pages":"509-512"},"PeriodicalIF":0.3000,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10713513","citationCount":"0","resultStr":"{\"title\":\"QRD-Based Precoding Design for Multiuser Massive MIMO Null-Space Expansion\",\"authors\":\"Yuki Sasaki;Kabuto Arai;Kazuki Maruta\",\"doi\":\"10.23919/comex.2024XBL0150\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article proposes a precoding weight suitable for null-space expansion (NSE) in multi-user massive multiple-input multiple-output (MU-mMIMO). NSE improves inter-user interference (IUI) suppression performance by steering multiple nulls for interfering user terminals (UTs). However, NSE faces challenges in effectively forming beams and nulls for IUI suppression, as well as in managing the computational complexity for precoding. We employ QR decomposition-based Gram-Schmidt orthogonalization (QRGSO) as a precoding algorithm suitable for NSE. Computer simulation demonstrates the superiority of the proposed scheme in terms of IUI suppression performance and computation complexity.\",\"PeriodicalId\":54101,\"journal\":{\"name\":\"IEICE Communications Express\",\"volume\":\"13 12\",\"pages\":\"509-512\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2024-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10713513\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEICE Communications Express\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10713513/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEICE Communications Express","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10713513/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
QRD-Based Precoding Design for Multiuser Massive MIMO Null-Space Expansion
This article proposes a precoding weight suitable for null-space expansion (NSE) in multi-user massive multiple-input multiple-output (MU-mMIMO). NSE improves inter-user interference (IUI) suppression performance by steering multiple nulls for interfering user terminals (UTs). However, NSE faces challenges in effectively forming beams and nulls for IUI suppression, as well as in managing the computational complexity for precoding. We employ QR decomposition-based Gram-Schmidt orthogonalization (QRGSO) as a precoding algorithm suitable for NSE. Computer simulation demonstrates the superiority of the proposed scheme in terms of IUI suppression performance and computation complexity.