TY - JOUR
T1 - Compressing MIMO Channel Submatrices with Tucker Decomposition: Enabling Efficient Storage and Reducing SINR Computation Overhead
AU - Zhang , Yuanwei
AU - Zhu , Ya-Nan
AU - Zhang , Xiaoqun
JO - CSIAM Transactions on Applied Mathematics
VL - 3
SP - 615
EP - 635
PY - 2024
DA - 2024/08
SN - 5
DO - http://doi.org/10.4208/csiam-am.SO-2023-0051
UR - https://global-sci.org/intro/article_detail/csiam-am/23310.html
KW - MIMO, SINR, Tucker decomposition, storage reduction, acceleration.
AB - <p style="text-align: justify;">Massive multiple-input multiple-output (MIMO) systems employ a large
number of antennas to achieve gains in capacity, spectral efficiency, and energy efficiency. However, the large antenna array also incurs substantial storage and computational costs. This paper proposes a novel data compression framework for massive MIMO channel matrices based on tensor Tucker decomposition. To address the
substantial storage and computational burdens of massive MIMO systems, we formulate the high-dimensional channel matrices as tensors and propose a novel groupwise
Tucker decomposition model. This model efficiently compresses the tensorial channel
representations while reducing SINR estimation overhead. We develop an alternating
update algorithm and HOSVD-based initialization to compute the core tensors and
factor matrices. Extensive simulations demonstrate significant channel storage savings with minimal SINR approximation errors. By exploiting tensor techniques, our
approach balances channel compression against SINR computation complexity, providing an efficient means to simultaneously address the storage and computational
challenges of massive MIMO.</p>