Search arXivSearch

arXiv · 2505.01187

Spectral Efficiency Analysis of Near-Field Holographic MIMO over Ricean Fading Channels

Abstract

With the denser distribution of antenna elements, stronger mutual coupling effects would kick in among antenna elements, which would eventually affect the communication performance. Meanwhile, as the holographic array usually has large physical size, the possibility of near-field communication increases. This paper investigates a near-field multi-user downlink HMIMO system and characterizes the spectral efficiency (SE) under the mutual coupling effect over Ricean fading channels. Both perfect and imperfect channel state information (CSI) scenarios are considered. (i) For the perfect CSI case, the mutual coupling and radiation efficiency model are first established. Then, the closed-form SE is derived under maximum ratio transmission (MRT). By comparing the SE between the cases with and without mutual coupling, it is unveiled that the system SE with mutual coupling might outperform that without mutual coupling in the low transmit power regime for a given aperture size. Moreover, it is also unveiled that the inter-user interference cannot be eliminated unless the physical size of the array increases to infinity. Fortunately, the additional distance term in the near-field channel can be exploited for the inter-user interference mitigation, especially for the worst case, where the users' angular positions overlap to a great extent. (ii) For the imperfect CSI case, the channel estimation error is considered for the derivation of the closed-form SE under MRT. It shows that in the low transmit power regime, the system SE can be enhanced by increasing the pilot power and the antenna element density, the latter of which will lead to severe mutual coupling. In the high transmit power regime, increasing the pilot power has a limited effect on improving the system SE. However, increasing the antenna element density remains highly beneficial for enhancing the system SE.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mengyu Qian, Xidong Mu, Li You, Hyundong Shin, Michail Matthaiou. 2025-05-02. Spectral Efficiency Analysis of Near-Field Holographic MIMO over Ricean Fading Channels. https://doi.org/10.1109/tcomm.2025.3595728

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT