Several decades since the invention of optical fiber, its capacity to carry information remains a vexing conundrum. Furthermore, the AIRs of the current methods such as WDM vanish at high powers due to treating interference (arising from the application of the linear multiplexing to the nonlinear channel) as noise.
In this regard, two representative results obtained in the project are summarized below.
* The first result is on fundamental limits of optical communication. We showed that the capacity of a discrete-time continuous-space model of optical fiber is lower bounded by C >= (1/2) log(1+SNR) - (1/2) + o(1) [1, Thm. 1]. Further, although the AIR of the SSFM with back-propagation vanishes at high SNRs, if the SNR is increased further, AIR will increase again tending towards the infinity. The AIR-cost function is thus given by a double-ascent curve, out of which only the initial window had been observed in the prior work; see Fig. 1. The result illustrates that nonlinearity doesn’t necessarily limit the capacity.
We intend to investigate the implications of this theoretical result in practical WDM systems, and extend it to the finite power regime.
* The second result is on the design of the transmitter and receivers to approach the fundamental limits. We realized that nonlinear interactions do not limit the capacity in the deterministic models of optical networks. These interactions arise from the linear communication methods (e.g. WDM, orthogonal frequency-division multiplexing, time-division multiplexing, polarization-division multiplexing, and space-division multiplexing) which disregard nonlinearity. NFDM, on the other hand, modulates the nonlinear Fourier modes, that propagate independently in the channel. We showed that the NFDM AIR is greater than the WDM AIR in a representative system [3].
Although NFDM addresses the nonlinearity problem, it is computationally complex, sensitive to noise, and subject to numerical error at high amplitudes. We will tackle these problems in the remaining time.
[1] Sefidgaran et al., T-IT, 68(4), 2022.
[2] Sefidgaran et al., ITW’21.
[3] Yousefi et al., T-IT, 66(1), 2020.
[4] Fahs et al., T-IT, 67(9), 2021.
[5] Fahs et al., ISIT’19.