Search arXivSearch

arXiv · 2404.04477

Fundamental Limits of Optical Fiber MIMO Channels With Finite Blocklength

Abstract

The multiple-input and multiple-output (MIMO) technique is regarded as a promising approach to boost the throughput and reliability of optical fiber communications. However, the fundamental limits of optical fiber MIMO systems with finite block-length (FBL) are not available in the literature. This paper studies the fundamental limits of optical fiber multicore/multimode systems in the FBL regime when the coding rate is a perturbation within $\mathcal{O}(\frac{1}{\sqrt{ML}})$ of the capacity, where M and L represent the number of transmit channels and blocklength, respectively. Considering the Jacobi MIMO channel, which was proposed to model the nearly lossless propagation and the crosstalks in optical fiber systems, we derive the upper and lower bounds for the optimal error probability. For that purpose, we first set up the central limit theorem for the information density in the asymptotic regime where the number of transmit, receive, available channels and the blocklength go to infinity at the same pace. The result is then utilized to derive the upper and lower bounds for the optimal average error probability with the concerned rate. The derived theoretical results reveal interesting physical insights for Jacobi MIMO channels with FBL. First, the derived bounds for Jacobi channels degenerate to those for Rayleigh channels when the number of available channels approaches infinity. Second, the high signal-to-noise (SNR) approximation indicates that a larger number of available channels results in a larger error probability. Numerical results validate the accuracy of the theoretical results and show that the derived bounds are closer to the performance of practical LDPC codes than outage probability.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xin Zhang, Dongfang Xu, Shenghui Song, Mérouane Debbah. 2024-04-06. Fundamental Limits of Optical Fiber MIMO Channels With Finite Blocklength. https://arxiv.org/abs/2404.04477

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

KEEP EXPLORING

Related papers

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT