Fundamental Limits of Two-Hop MIMO Channels: An Asymptotic Approach

Multi-antenna relays and intelligent reflecting surfaces (IRSs) have been utilized to construct favorable channels to improve the performance of wireless systems. A common feature between relay systems and IRS-aided systems is the two-hop multiple-input multiple-output (MIMO) channel. As a result, the mutual information (MI) of two-hop MIMO channels has been widely investigated with very engaging results. However, a rigorous investigation on the fundamental limits of two-hop MIMO channels, i.e., the first and second-order analysis, is not yet available in the literature, due to the difficulties caused by the two-hop (product) channel and the noise introduced by the relay (active IRS). In this paper, we employ large random matrix theory, specifically Gaussian tools, to derive the closed-form deterministic approximation for the mean and variance of the MI. Additionally, we determine the convergence rate for the mean, variance and the characteristic function of the MI, and prove the asymptotic Gaussianity. Furthermore, we also investigate the analytical properties of the fundamental equations that describe the closed-form approximation and prove the existence and uniqueness of the solution. An iterative algorithm is then proposed to obtain the solutions for the fundamental equations. Numerical results validate the accuracy of the theoretical analysis.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Information Theory
Published
2025-03-27
DOI
https://doi.org/10.1109/tit.2025.3554593
Citations
2
Primary Topic
Advanced MIMO Systems Optimization
Type
article
Field-Weighted Citation Impact
1.46
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fundamental Limits of Two-Hop MIMO Channels: An Asymptotic Approach

Dongfang Xu, Shenghui Song, Xin Zhang, Zeyan Zhuang
2 citations
IEEE Transactions on Information Theory
Advanced MIMO Systems Optimization
1.46
article

Fundamental Limits of Two-Hop MIMO Channels: An Asymptotic Approach

Dongfang Xu, Shenghui Song, Xin Zhang, Zeyan Zhuang
article en
2 citations

Abstract

Multi-antenna relays and intelligent reflecting surfaces (IRSs) have been utilized to construct favorable channels to improve the performance of wireless systems. A common feature between relay systems and IRS-aided systems is the two-hop multiple-input multiple-output (MIMO) channel. As a result, the mutual information (MI) of two-hop MIMO channels has been widely investigated with very engaging results. However, a rigorous investigation on the fundamental limits of two-hop MIMO channels, i.e., the first and second-order analysis, is not yet available in the literature, due to the difficulties caused by the two-hop (product) channel and the noise introduced by the relay (active IRS). In this paper, we employ large random matrix theory, specifically Gaussian tools, to derive the closed-form deterministic approximation for the mean and variance of the MI. Additionally, we determine the convergence rate for the mean, variance and the characteristic function of the MI, and prove the asymptotic Gaussianity. Furthermore, we also investigate the analytical properties of the fundamental equations that describe the closed-form approximation and prove the existence and uniqueness of the solution. An iterative algorithm is then proposed to obtain the solutions for the fundamental equations. Numerical results validate the accuracy of the theoretical analysis.

IEEE Transactions on Information TheoryVol. 71(6)
Hong Kong University of Science and Technology (HK)
Openalex Percentile: Top 19%
Advanced MIMO Systems Optimization
1.46
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.