Capacity-Achieving Precoding with Low-Complexity for Terahertz LOS Massive MIMO using Uniform Planar Arrays

Hwanjoon Cho, Chanhoo Park, N. Lee
{"title":"Capacity-Achieving Precoding with Low-Complexity for Terahertz LOS Massive MIMO using Uniform Planar Arrays","authors":"Hwanjoon Cho, Chanhoo Park, N. Lee","doi":"10.1109/ICTC49870.2020.9289295","DOIUrl":null,"url":null,"abstract":"Terahertz (THz) line-of-sight (LOS) massive multiple-input multiple-output (MIMO) communication is promising to achieve a few terabit rates for beyond 5G. The tiny wavelength in THz allows us to pack massive antenna elements onto a small aperture size. As the number of antenna elements scales, it is critical to improving the energy efficiency in the baseband processing while maintaining spectral efficiency performance. In this paper, we present a two-stage precoding method that achieves the MIMO channel capacity with significantly reduced computational complexity. The principal idea is to decompose a uniform planner array (UPA) into a superposition of multi-layered uniform circular subarrays (UCAs) at both ends. Thanks to the structure of the circulant channel matrix between the subarrays, the proposed precoding exploits the Fast Fourier Transform (FFT)-based inner precoding per subarray conjunction with singular value decomposition (SVD) outer precoding per eigen-mode. We show that this two-stage precoding method provides a multiplicative gain in the computational complexity reduction compared to the conventional SVD precoding.","PeriodicalId":282243,"journal":{"name":"2020 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"49 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Information and Communication Technology Convergence (ICTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTC49870.2020.9289295","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Terahertz (THz) line-of-sight (LOS) massive multiple-input multiple-output (MIMO) communication is promising to achieve a few terabit rates for beyond 5G. The tiny wavelength in THz allows us to pack massive antenna elements onto a small aperture size. As the number of antenna elements scales, it is critical to improving the energy efficiency in the baseband processing while maintaining spectral efficiency performance. In this paper, we present a two-stage precoding method that achieves the MIMO channel capacity with significantly reduced computational complexity. The principal idea is to decompose a uniform planner array (UPA) into a superposition of multi-layered uniform circular subarrays (UCAs) at both ends. Thanks to the structure of the circulant channel matrix between the subarrays, the proposed precoding exploits the Fast Fourier Transform (FFT)-based inner precoding per subarray conjunction with singular value decomposition (SVD) outer precoding per eigen-mode. We show that this two-stage precoding method provides a multiplicative gain in the computational complexity reduction compared to the conventional SVD precoding.
基于均匀平面阵列的太赫兹LOS大规模MIMO低复杂度容量预编码
太赫兹(THz)视距(LOS)大规模多输入多输出(MIMO)通信有望实现超过5G的几个太比特速率。太赫兹的微小波长允许我们将大量的天线元件封装在一个小孔径尺寸上。随着天线单元数量的不断增加,在保持频谱效率性能的同时提高基带处理的能量效率是至关重要的。在本文中,我们提出了一种两阶段预编码方法,该方法在显著降低计算复杂度的情况下实现了MIMO信道容量。其主要思想是将一个均匀规划阵列(UPA)分解为两端的多层均匀圆形子阵列(uca)的叠加。基于子阵列之间循环信道矩阵的结构,提出了基于快速傅立叶变换(FFT)的每子阵列内部预编码与基于奇异值分解(SVD)的每特征模式外部预编码相结合的预编码方法。我们表明,与传统的奇异值分解预编码相比,这种两阶段预编码方法在计算复杂度降低方面提供了成倍的增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信