Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Out-of-band exclusive frequency-domain MIMO equalization with the reduced-overlap-and-save method for scalable mode multiplexed signal transmission

Open Access Open Access

Abstract

We present computationally-efficient implementation techniques of multiple-input multiple-output (MIMO) frequency-domain equalization (FDE) that deals with a modal dispersion effect underlying in long-haul mode-division-multiplexed (MDM) signal transmission. Computational complexity reduction comes from twofold approaches: the first is out-of-band-exclusive (OBE) FDE for removing redundant computations in MIMO-FDE processing by taking a practical signal bandwidth occupation into account. A second appoarch, referred to as overlapping-reduced (OR) FDE, further reduces the complexity by modifying an overlapping ratio in the overlap-and-save FDE method to below 0.5. We show that OBE-FDE reduces complexity for processing with a larger number of spatial channels compared with the conventional FDE, and that the overlapping ratio is minimized up to 0.25 by the OR-FDE approach. Also shown is an experimental demonstration using the results of three-mode MDM transmission with different inter-mode coupling scenarios, verifying that the complexity is decreased by up to 37 % with negligible deterioration in signal performance by using the proposed method.

© 2023 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement

1. Introduction

Scaling transmission capacity per optical fiber is attained through increasing the number of information-carrying optical channels. The approach exploiting multiple spatial modes has been intensively studied as promising candidates of newly available spatial channels utilizing transmission media including multi-mode fiber/few-mode fiber (FMF) [15], or coupled-core multi-core fiber (CC-MCF) [68], known as the family of the mode-division-multiplexing (MDM) transmission strategy. Towards future deployment of MDM transmission technology to ultra-high-capacity optical transport systems, one technical challenge is how to handle the fundamental effect of modal dispersion (MD), arising from the difference of propagation constant in each spatial mode. With the increased transmission reach, MD exhibits an accumulation nature in a linear manner for weakly-coupled MDM transmission links where spatial channels are mutually interact with weak interference [9], or in squared-root manner for strongly-coupled ones [6,7]. While the multiple-input multiple-output (MIMO) equalization technique may provide a solution for undoing MD effects at a coherent MDM transceiver, enormous computational effort will be required for implementation of real-time high-throughput MIMO digital signal processing to deal with an MD-induced wide spread of an impulse response ranging up to several tens of nanoseconds [1012], likely occurring in MDM transmission links with long distances [4,5]. One common approach to mitigate the computational effort of MIMO equalization is to switch the processing domain from time to frequency [13], referred to as MIMO frequency-domain equalization (FDE). It offers computationally efficient processing especially in the filter output and the weight update by utilizing fast Fourier transform (FFT). Several experimental demonstrations have been conducted on long-distance MDM transmission compensating for MD effects by using MIMO-FDE technique [1315]. To date, MIMO-FDE algorithm in most of these reports is usually processed on the basis of the overlap-and-save (OS) method with an overlapping ratio of 0.5 in the same manner as other traditional applications of acoustical noise suppression [16]. One remaining task regarding MIMO-FDE for MDM links is to make it simpler and scalable for supporting many spatial channels.

In this paper, especially tailored to MDM transmission links, we introduce two MIMO-FDE techniques contributing to its lower-complexity implementation. The first approach is out-of-band-exclusive (OBE) FDE for omitting the redundant complex multiplications in MIMO-FDE processing with the consideration of signal-bandwidth occupation. Taking the physical property of MD accumulation into account, the second approach, overlapping-reduced (OR)-FDE, attempts to further decrease computational complexity by reducing the overlapping ratio of MIMO-FDE less than 0.5. We show that an effect of complexity reduction is enhanced in cases of MDM links with a larger number of spatial channels. Through an experimental results involving long-haul three-mode-multiplexed transmission links, we also verified the feasibility and equalization performance of the proposed approaches with decreased computational complexity in either weak or strong inter-mode coupling cases.

2. Proposed low-complexity MIMO-FDE algorithms

In this section, techniques for a design of low-complexity MIMO-FDE are introduced. We consider an MDM system where $D$ spatial channels including polarization ones are transmitted over MDM links as information carriers of independent data streams, and received by $D$ coherent receivers. After digitization with the twofold oversampling ratio, MIMO-FDE is carried out with the input signals $\mathbf {u}_i(k)$ reshaped for a block-by-block processing, where $i$ and $k$ denote the $i$-th spatial channel and the $k$-th block, respectively. To simplify discussion, we only consider the radix-2 FFT algorithm in MIMO-FDE processing, hence set a block size of $N$ with a sufficiently large integer of power of two. Since we assume an employmemt of the traditional OS MIMO-FDE algorithm working at the oversampling rate of 2 and the overlapping rate $\rho$ of 0.5 [13,14], each block processing produces $N/4$ output symbols per block per spatial channel. As the adaptation example of our approaches to MIMO-FDE, we employ the unconstrained least squared error (LMS) FDE [15,16] because of its easy-to-understand description. The benefit of the proposed low-complexity MIMO-FDE techniques will be generally expanded to other adaptation algorithms including constrained FDE which ensures that a time-domain filter update is exactly performed by a corresponding frequency-domain processing [17], although it is out of the main scope of this paper.

2.1 Conventional MIMO-FDE

We give a brief review of the conventional MIMO-FDE [13] (Fig. 1(a)). At the $k$-th block time, the $i$-th input blocks $\mathbf {u}_{i}(k)$ $\in \mathbb {C}^{N \times 1}$ is configured as

$$\mathbf{u}_{i}(k) = \left[u_{i}\left(1+ \frac{N}{2}(k-1) \right), u_{i}\left( 2+ \frac{N}{2}(k-1) \right), \ldots, u_{i}\left( N+ \frac{N}{2}(k-1) \right) \right]^T,$$
where superscript $T$ denotes the transpose operation, and $u_i$ is an $i$-th input signal sampled at the oversampling rate of 2. $\mathbf {u}_{i}(k)$ is then parallelized into odd and even blocks, denoted as $\mathbf {u}_{i}^o(k)$ $\in \mathbb {C}^{N/2 \times 1}$, and $\mathbf {u}_{i}^e(k)$ $\in \mathbb {C}^{N/2 \times 1}$, respectively, as
$$\mathbf{u}_{i}^o(k) = \left[u_{i}\left(1+ \frac{N}{2}(k-1) \right), u_{i}\left(3+ \frac{N}{2}(k-1)\right), \ldots, u_{i}\left(N-1+ \frac{N}{2}(k-1) \right) \right]^T,$$
and
$$\mathbf{u}_{i}^e(k) = \left[u_{i}\left(2+ \frac{N}{2}(k-1) \right), u_{i}\left(4+ \frac{N}{2}(k-1) \right), \ldots, u_{i}\left(N+ \frac{N}{2}(k-1)\right) \right]^T,$$
followed by FFT with a size of $N/2$ to obtain frequency-domain input signals $\mathbf {U}_{i}^o(k)$ $\in \mathbb {C}^{N/2 \times 1}$ and $\mathbf {U}_{i}^e(k)$ $\in \mathbb {C}^{N/2 \times 1}$:
$$\mathbf{U}_{i}^{o,e}(k) = \mathrm{FFT}\left[ \mathbf{u}_{i}^{o,e}(k) \right],$$
where FFT[$\cdot$] denotes the FFT operation. For the output symbols for the $j$-th spatial channel $\mathbf {v}_{j}(k)$ $\in \mathbb {C}^{N/4 \times 1}$, the sum of the product of these input blocks with relevant filter weight vectors, $\mathbf {W}_{i,j}^{o,e}(k)$ $\in \mathbb {C}^{N/2 \times 1}$, are again converted into the time-domain signals by inverse FFT (IFFT), IFFT[$\cdot$], the last half of which is saved :
$$\mathbf{v}_{j}(k) = \text{the last half of } \mathrm{IFFT}\left[ \sum_{i=1}^{D} \mathbf{W}_{i,j}^{o}(k)\odot \mathbf{U}_{i}^{o}(k) + \sum_{i=1}^{D} \mathbf{W}_{i,j}^{e}(k)\odot \mathbf{U}_{i}^{e}(k) \right],$$
where $\odot$ denotes the element-wise product (or Hadamard product). The time domain error vector $\mathbf {e}_{j}(k)$ for the $j$-th spatial channel is obtained as the difference between $\mathbf {v}_{i}(k)$ and the desired symbol vector $\mathbf {d}_{j}(k)$ $\in \mathbb {C}^{N/4 \times 1}$:
$$\mathbf{e}_{j}(k) = \mathbf{d}_{j}(k) - \mathbf{v}_{j}(k).$$

Each filter weight vector is then updated in the frequency domain as

$$\mathbf{W}_{i,j}^{o,e}(k+1) = \mathbf{W}_{i,j}^{o,e}(k) + \mu \mathbf{U}_{i}^{o,e*}(k) \odot \mathbf{E}_{j}(k),$$
where $\mu$ and $*$ are the step-size parameter and complex conjugate operation, respectively, and $\mathbf {E}_{j}(k)$ is the frequency-domain error vector constructed with $\mathbf {e}_{j}(k)$:
$$\mathbf{E}_{j}(k) = \mathrm{FFT} \begin{bmatrix} \mathbf{0}_{N/4} \\ \mathbf{e}_{j}(k) \end{bmatrix},$$
where $\mathbf {0}_{p}$ is the vector comprising $p$ zeros.

 figure: Fig. 1.

Fig. 1. Schematics of (a) conventional approach processing with sub-equalizers for odd/even input blocks, and of (b) proposed OBE-FDE preventing out-of-band multiplications in processing of filter output and filter weight update.

Download Full Size | PDF

As mentioned above, while the conventional MIMO-FDE performs prior down-sampling at its input into sub-equalizers, this may result in the loss of the a priori knowledge for signal occupation in the frequency domain. The fact that commercially available modern coherent transceiver is capable of producing Nyquist-shaped signals realizing densely packed wavelength division multiplexed (WDM) allocations motivates us to modify the algorithm to deal with twofold-oversampled input signals. The detailed description for this new FDE algorithm, OBE-FDE, is provided in Section 2.2. The approach in performing MIMO-FDE that accepts twofold-oversampled inputs for the standard single-mode fiber (SSMF) $2 \times 2$ transmission systems has been reported [18], while our main objective is to improve computational efficiency of MIMO-FDE by removing redundant processing for scalable MDM transmission systems.

Another issue is the discrete increase in the block size satisfying the condition of the power of two, which does not always match the required one in a physical sense. Since an MD-induced spread in the impulse response grows gradually with increased distance, symbols that are additionally available in $\mathbf {v}_{j}(k)$ in Eq. (5) may be discarded in the conventional MIMO-FDE with $\rho$ of 0.5. Our second approach, OR-FDE, increases the number of symbol outputs in Eq. (5), which decreases $\rho$ and improves computational efficiency. The description of OR-FDE is given in Section 2.3. Compared with a similar approach [19], in which the overlap-and-add FDE minimizes overlapping to compensate for chromatic dispersion, the main contribution of the presented work in terms of decreasing $\rho$ is that we introduce an OR-FDE method based on the OS method, and also that the verification of $\rho$ reduction with respect to MD is experimentally presented for the first time (Section 3).

2.2 Out-of-band exclusive (OBE) FDE

This subsection describes the newly-proposed OBE-FDE (Fig. 1(b)). With the a priori knowledge of signal bandwidth occupation (e.g., the roll-off factor), OBE-FDE selectively executes multiplications only for the in-band frequency components of the signals. In the rest of this subsection, OBE-FDE is described under the assumption of using a sufficiently small roll-off factor $\alpha \sim$ 0. OBE-FDE starts processing with the direct conversion of the input blocks $\mathbf {u}_{i}(k)$ into the frequency domain as

$$\mathbf{U}_{i}(k) = \mathrm{FFT}\left[ \mathbf{u}_{i}(k) \right].$$

The $i$-th filter weight vector for the $j$-th spatial channel $\mathbf {W}_{i,j}(k)$ $\in \mathbb {C}^{N \times 1}$ is exclusively multiplied by $\mathbf {U}_{i}(k)$, for only the components corresponding to the frequency bins of a signal’s presence. This roughly halves the number of complex multiplications from $N$ to $\sim N/2$ for the “rectangular-shaped” signals. For the rest (i.e., out-of-band entries of the size of $\sim N/2$), the multiplication results are set to zeros. Output signals are then obtained by saving only odd (or, even) components at the last half of the output from IFFT. The processing above for obtaining $\mathbf {v}_{j}(k)$ is mathematically written as

$$\mathbf{v}_{j}(k) = \text{the odd entries at the last half of } \mathrm{IFFT}\left[ \sum_{i=1}^{D} \mathbf{W}_{i,j}(k) \odot_{\text{in}} \mathbf{U}_{i}(k) \right],$$
where $\odot _{\text {in}}$ denotes the element-wise product performed only for the in-band components. What follows is the filter-weight vector update of
$$\mathbf{W}_{i,j}(k+1) = \mathbf{W}_{i,j}(k) + \mu \mathbf{U}_{i}^{*}(k) \odot_{\text{in}} \mathbf{E}_{j}^{\prime}(k),$$
where $\mathbf {E}_{j}^{\prime }(k)$ $\in \mathbb {C}^{N \times 1}$ is constructed as
$$\mathbf{E}_{j}^{\prime}(k) = \mathrm{FFT} \begin{bmatrix} \mathbf{0}_{N/2} \\ e_j(k)[1] \\ 0 \\ e_j(k)[2]\\ \vdots \\ e_j(k)[N/4] \\ 0 \end{bmatrix}.$$

Here, $e_j(k)[m]$ is the $m$-th entry of $\mathbf {e}_{j}(k)$. With the comparison of Eqs. (5) and (7), it is apparent that the number of complex multiplications is roughly halved in Eqs. (10) and (11). This complexity mitigation is attributed to the drop in the multiplication operations with respect to the out-of-band frequency components. We provide the detailed analysis on this complexity mitigation in Section 2.4.

2.3 Overlapping-reduced (OR) FDE

We introduce another approach of OR-FDE enabling an improvement of the complexity requirement by decreasing $\rho$, the input-output blocks of which are schematically illustrated in Fig. 2. With the aim of combining OBE-FDE and OR-FDE methods, we describe the algorithm by adding modifications to that of OBE-FDE. By denoting $\Delta$ as an increased number of symbol outputs per block processing which varies in the range of $0 \leq \Delta \leq N/8$ , an $i$-th input block for OR-FDE computation at a $k$-th block time $\mathbf {u}_{i}^\text {OR}$ $\in \mathbb {C}^{N \times 1}$ is configured as

$$\scalebox{0.82}{$\displaystyle\mathbf{u}_{i}^\text{OR}(k) = \left[u_{i}\left( 1+ \left(\frac{N}{2}+2\Delta\right)(k-1) \right), u_{i}\left( 2+ \left(\frac{N}{2}+2\Delta\right)(k-1) \right), \ldots, u_{i}\left( N+ \left(\frac{N}{2}+2\Delta\right)(k-1) \right) \right]^T,$}$$
and correpsonding frequency-domain input signal for OR-FDE $\mathbf {U}_{i}^\text {OR}(k)$ $\in \mathbb {C}^{N \times 1}$ is obtained as
$$\mathbf{U}_{i}^\text{OR}(k)= \mathrm{FFT}\left[ \mathbf{u}_{i}^\text{OR}(k) \right].$$

For a tentative use, we define $\mathbf {P}_{j}(k) \triangleq \mathrm {IFFT}\left [ \sum _{i=1}^{D} \mathbf {W}_{i,j}(k) \odot _{\text {in}} \mathbf {U}_{i}^\text {OR}(k)\right ]$. In a filter output computation in the OR-FDE approach, a discarded portion of the IFFT outputs is modified so as to discard its both sides, instead of one side taken in the conventional FDE approach (Fig. 2). If we perform it by saving output symbols in a “symmetrical” manner, Eq. (10) is modified as

$$\mathbf{v}_{j}^{\Delta}(k) = \text{the odd entries of} \begin{bmatrix} P_{j}(k)[1+N/4-\Delta] \\ P_{j}(k)[2+N/4-\Delta] \\ \vdots \\ P_{j}(k)[3N/4+\Delta] \end{bmatrix},$$
where $\mathbf {v}_{j}^{\Delta }(k)$ $\in \mathbb {C}^{(N/4+\Delta ) \times 1}$ is the output symbol vector with the OR-FDE. Correspondingly, with the augmented desired symbol vector $\mathbf {d}_{j}^{\Delta }(k)$ $\in \mathbb {C}^{(N/4+\Delta ) \times 1}$, Eqs. (6) and (12) are also respectively modified as
$$\mathbf{e}_{j}^{\Delta}(k) = \mathbf{d}_{j}^{\Delta}(k) - \mathbf{v}_{j}^{\Delta}(k).$$
and
$$\mathbf{E}_{j}^{\prime \prime}(k) = \mathrm{FFT} \begin{bmatrix} \mathbf{0}_{N/4-\Delta} \\ e_j^{\Delta}(k)[1] \\ 0 \\ e_j^{\Delta}(k)[2]\\ \vdots \\ e_j^{\Delta}(k)[N/4] \\ 0 \\ \mathbf{0}_{N/4-\Delta} \end{bmatrix},$$
where $e_j^{\Delta }(k)[m]$ is the $m$-th entry of $\mathbf {e}_{j}^{\Delta }(k)$. Using $\mathbf {E}_{j}^{\prime \prime }(k)$ in Eq. (17), the update of the filter-weight vector is performed as in Eq. (11).

 figure: Fig. 2.

Fig. 2. Schematics of FDE processing with consecutive blocks for (a) conventional FDE with $\rho = 0.5$, and for (b) OR-FDE scheme with $\rho < 0.5$.

Download Full Size | PDF

It is understood that the main modification of OR-FDE is the saved entries in Eqs. (15) and (17). Figure 2 illustrates how the conventional FDE and OR-FDE works at consecutive blocks. Note that each block size $N$ is represented on the two-fold oversampling basis. As shown in Fig. 2 (a), with the conventional FDE, one side of the filter output is picked up as $\mathbf {v}_{j}$. On the contrary, this area is shifted to the center portion of the filter output block with the size of $N/4+\Delta$ with OR-FDE (Fig. 2 (b)). On the design of the OR-FDE, it is not trivial how we can apply proper $\Delta$ to have no (or negligible) effect of inter-block interference in these output symbols. To consider this, we take a scenario of applying OR-FDE at an MDM transmission link where $N = N_1$ to cover MD-induced broadening of the impulse response at distance $L = L_1$. FDE processing produces $N_1/4$ symbol output per block processing per spatial channel. With a slight increase in the transmission distance $dL$, the block size is doubled as $N = 2N_1$ at $L=L_1 + dL$, providing the per-block processing output of $2N_1/4$ plus $\Delta \sim N_1/4$ symbols (equivalently, $N_1/4$ plus $\Delta \sim N_1/8$ symbols when $N = N_1$) without inter-block interference, because of the small increase in the pulse broadening. The number of these additional $\Delta$ will gradually decrease at longer distance for the fixed $N$. In the most optimistic scenario described above, $\rho$ is suppressed from 0.5 (=$N_1/(2N_1)$) to 0.25 (=$(N_1/2)/(2N_1)$).

2.4 Complexity analysis

This subsection discusses achieved computational complexity reduction by two computationally efficient FDE approaches introduced in Sections 2.2 and 2.3. We first discuss reduced complexity effect by using OBE-FDE. Table 1 lists the complexity requirements per block processing for $D$ spatial channels (i.e., $ND/4$ output symbols) between the conventional FDE and OBE-FDE schemes. All FFT/IFFT operations are assumed executed by the radix-2 FFT algorithm, requiring $(N/2) \log _2 N$ complex multiplications for an input block of the size $N$. For the conventional FDE, FFT/IFFT computations with a block size of $N/2$ are required $2D$, $D$, and $D$ times in Eqs. (4), (5), and (8), respectively. In addition, the element-wise product totally requires $ND^2$ and $ND^2 + ND$ complex multiplications in Eqs. (5) and (7), respectively. On the other hand, for the OBE-FDE scheme, $D$ FFT/IFFT computations with a block size of $N$ are performed each in Eqs. (9), (10), and (12). An additional number of complex multiplications in the element-wise product operations is $ND^2/2$ and $ND^2/2 + ND/2$ in Eqs. (10) and (11), respectively. The computational complexity per output symbol per spatial channel $C$ is used as a metric for fair comparisons with different $N$ and $D$, simply obtained by dividing the total number of complex multiplications with $ND/4$:

$$C_\text{conv} = 8D + 4\log_2 N,$$
for the conventional FDE, and
$$C_\text{OBE} = 4D + 2 + 6\log_2 N,$$
for OBE-FDE. We notice from the table that complexity reduction is achieved in the computation of the filter output (Eqs. (5) and (10)) and weight-vector update (Eqs. (7) and (11)), rather than in the FFT/IFFT operations. Clearly, this reduced-complexity effect is due to the selection of the in-band components in performing complex multiplications at these steps. Another important consequence is that complexity mitigation is enhanced at the larger count of spatial channels $D$. In other words, OBE-FDE is suitable for MDM transmission with higher-order spatial modes rather than lower-order ones including SSMF transmission.

Tables Icon

Table 1. Complexity requirement comparison between conventional FDE and OBE-FDE.

A simple example is given in Fig. 3 for MDM transmission links with the use of $D = \{2, 6, 8, 12, 20, 24\}$ and $N = \{256, 2048\}$ based on the evaluation of the complexity reduction ratio $\eta _\text {OBE} \triangleq C_\text {OBE}/C_\text {conv}$. Note that $D$ of 2, $\{6, 12, 20\}$, and $\{8, 24\}$ is obtained using SSMFs, FMFs [15], and CC-MCFs [68], respectively. We see that complexity reduction of $\eta _\text {OBE} < 1$ is achieved for almost all MDM links where $D \geq 6$, while complexity is not unfortunately reduced for $\{D, N\} =\{6, 2048\}$. The corresponding MD-induced pulse broadening reaches 51.2 ns with the use of 10-GBaud signals, which is considered to be too large to handle even with modern advanced DSP application specific integrated circuit (ASIC) technology [20]. It is noteworthy that smaller $\eta _\text {OBE}$ is obtained for larger $D$, indicating that OBE-FDE is suitable for scaling the spatial channels for MDM transmission. In the extreme case in which $D \gg \log _2{N}$, $\eta _\text {OBE}$ converges to 0.5. On the contrary, computational complexity of OBE-FDE processing would unfortunately rather increase as $\eta _\text {OBE} > 1$ for smaller $D$ scenarios including an application to SSMF transmission with $D = 2$. This is because, for both FDE schemes, a majority of the processing in the smaller $D$ regime would be governed by FFT/IFFT operations of which complexity is simply determined by its input FFT block size. Somewhat practical cases considered above give $\eta _\text {OBE}$ as $0.65 \leq \eta _\text {OBE} \leq 0.93$ for $N=256$, and $0.70 \leq \eta _\text {OBE} \leq 1$ for $N=2048$.

 figure: Fig. 3.

Fig. 3. Complexity reduction ratio $\eta _\text {OBE}$ achieved with OBE-FDE for $D = \{2, 6, 8, 12, 20, 24\}$ and $N = \{256, 2048\}$.

Download Full Size | PDF

To see a complexity reduction by the OR-FDE, recalling that output symbol count per block per spatial channel is enhanced from $N/4$ up to $N/4 + \Delta$ ($0 \leq \Delta \leq N/8$), the computational complexity metric $C$ should be changed accordingly:

$$C_\text{OR} = \frac{2ND + N \log_2 {N}}{N/4 + \Delta},$$
which gives a complexity reduction ratio $\eta _\text {OR} \triangleq C_\text {OR}/C_\text {conv}$ of
$$\eta_\text{OR} = \frac{N/4}{N/4 + \Delta}.$$

Hence OR-FDE gives $2/3 \leq \eta _\text {OR} \leq 1$ because of the variation of $\Delta$. When both OBE-FDE and OR-FDE are jointly employed, it is not difficult to show that the achieved complexity reduction ratio in the comparison to the conventional FDE, $\eta _{\textrm{OBE}\&\textrm{OR}}$ becomes

$$\eta_{\textrm{OBE}\&\textrm{OR}} = \eta_\text{OBE} \cdot \eta_\text{OR},$$
indicating that relevant parameters regarding both FDE schemes are independently optimized in a design of them. It is difficult to conduct more comprehensive analysis of reduced complexity because achieved $\eta _\text {OBE}$, $\eta _\text {OR}$, and $\eta _{\textrm{OBE}\&\textrm{OR}}$ is highly depending on system parameters including $D$, $N$, and MD values per unit fiber length. Nevertheless, we try to unveil the complexity reduction effects by both schemes with an experimental verification using three-mode FMFs in Section 3.

At a given mode-multiplexed transmission link over a certain distance, an amount of MD-induced pulse broadening behaves static rather than dynamic [12]. In a practial ASIC design scenario, FDE parameters including a FFT block size $N$ and an overlapping ratio $\rho$ would be pre-detemined at an initial stage of a system deployment with a joint consideration for other fundamental design parameters including latency and ASIC power consumption [21].

3. Experimental setup and results

In this section, we experimentally investigate the effects of the reduced complexity together with equalization performance when OBE-FDE and/or OR-FDE are employed in MDM transmission links with decreased overlapping portion in its block-wise processing. To this end, we constructed a setup for an MDM transmission experiment with a 51.2-km-long FMF supporting three modes (i.e., LP$_\text {01}$, LP$_\text {11a}$, and LP$_\text {11b}$), which is almost identical to the one we have previously reported [4]. In the experiment, 11-WDM dual 6-GBaud PDM-QPSK signals shaped with a roll-off factor $\alpha$ of 0.01 were transmitted over three-fold recirculating loop systems, received at the set of coherent receivers, and processed offline with each MIMO-FDE approach employing a step-size parameter $\mu$ of $10^{-4}$. One noteworthy feature of our setup is the switching capability of inter-mode coupling regimes by employing the method of cyclic mode permutation (CMP) [4,5]: without CMP, weak inter-mode coupling occurrs along with signal propagation, producing an almost linear growth in the spread of the impulse response. Alternatively, the introduction of the CMP scheme offers mutual interference for spatial channels during propagation, achieving quasi-strongly-coupling with a squared-root growth in the impulse response with respect to the transmission distance. Hereinafter the transmission without and with CMP is referred to as case-I and case-II, respectively. Figure 4 highlights the transitions of impulse response for (a) case-I and (b) case-II, showing a clear difference in its growth with increased transmission distance. In particular, the impulse response exhibited a “bell-shaped” one in case-II, which is typically observed in strongly coupled MDM transmission using CC-MCFs [68]. Figure 5 represents the required equalizer memory length for both transmission regimes, defined as the window covering the pulse power at 99%. As expected, the memory length accumulated in a linear manner for case-I, while this changed in a squared-root growth for case-II. From the evaluation based on the power approximation, the required memory length $M$ in ns for each transmission regime as a function of transmission distance $L$ in km is expressed as

$$M_{\text{I}} = 0.073 \times L^{0.91}$$
for weakly-coupled transmission in case-I, and
$$M_{\text{II}} = 0.251 \times L^{0.60}$$
for the (quasi) strongly-coupled transmission in case-II. On the basis of the results obtained in Eqs. (23) and (24), Fig. 6 shows the predicted output symbols per block per spatial channel for both schemes at different transmission distances. Letting $k$ be an integer satisfying $k = \lceil \log _2 (4BM) \rceil$ where $B$ and $\lceil \cdot \rceil$ are a symbol rate in GBaud and the ceil function which outputs a nearest integer larger than its input, respectively, FFT block size $N$ is designed as $N = 2^k$.

 figure: Fig. 4.

Fig. 4. Impulse response evolution with increased distance observed in three-mode multiplexed transmission for (a) weakly-coupled scenario (case-I) and (b) strongly-coupled scenario (case-II).

Download Full Size | PDF

 figure: Fig. 5.

Fig. 5. Required equalizer memory length as function of distance for (a) weakly-coupled scenario (case-I) and (b) strongly-coupled scenario (case-II).

Download Full Size | PDF

 figure: Fig. 6.

Fig. 6. Number of output symbols per block processing per spatial channel for the conventional FDE and OR-FDE in (a) case-I, and (b) case-II. Solid lines show the predicted ones based on Eqs. (23) and (24), while squares are ones obtained by OR-based MIMO equalization with negligible penalty in signal performance.

Download Full Size | PDF

We start the experimental analysis on the equalization performance of OBE-FDE. Denoting $N_\text {OBE}$ as the number of frequency-bin entries used in the OBE processing which is designed as $N_\text {OBE} = \lceil NB(1+\alpha )/2 \rceil$, we changed it in the range from 0 to $N$, whose results are depicted in Fig. 7 using the normalized general mutual information (NGMI) penalty in case-II at a distance of 1536 km. Note that the NGMI penalty in this figure is defined using the baseline when $N_\text {OBE} = N$. In contrast to a steep decrease in $N_\text {OBE}/N < 0.5$, negligible penalty was observed in $N_\text {OBE}/N \geq 0.5$, verifying that out-of-band multiplications can be avoided for the signals with the roll-off factor $\alpha$ of 0.01. These results assures the feasibility of reducing $N_\text {OBE}$ up to $N/2$, giving $\eta _\text {OBE}$ of 0.95 for the case of $\{D, N\} = \{6, 128\}$.

 figure: Fig. 7.

Fig. 7. NGMI penalty in OBE-FDE processing for various frequency-bin entries when MDM signals are transmitted over 1536 km in case-II.

Download Full Size | PDF

To further verify the effect of the lower complexity achieved with OR-FDE, the predicted output symbols per block per spatial channel for both schemes at different transmission distance are shown in Fig. 6. At each transition point changing the order of power of two for the FFT block size $N$, the largest $\Delta$ (and also, smallest $\eta _\text {OR}$) was obtained. Then $\Delta$ reached zero towards the next transition point, which is repeated in every region of a fixed $N$. To evaluate the signal performance, we swept number of output symbols $\Delta$ in the region with the fixed $N = 512$, corresponding to the distance ranging from 250 to 460 km for case-I, and one ranging from 560 to 1640 km for case-II. Figure 8 summarized the NGMI penalty for both transmission cases, defined as the NGMI decrease from the baseline when $\Delta = 0$. From the figure, we see that the substantial increase in $\Delta$ is possible for both cases. Interestingly, the NGMI penalty for case-II traced gentler negative curves compared with that for case-I, originating from the wider tail of the bell-shaped impulse response brought by CMP. We added obtained $\Delta$ to Fig. 6 (red squares) based on the NGMI results in Figs. 7 and 8 with an acceptable NGMI penalty of 0.01, confirming the excellent agreement with the predicted one. Signal constellations obtained by OR-FDE are displayed in Fig. 9 at a distance of 614 km with case-II, showing that inter-block interference appears with $\Delta = 64$. Figure 10 depicts complexity reduction ratios $\eta$ in each reduced-complexity FDE schemes, achieving $0.89 \leq \eta _\text {OBE} \leq 0.98$, $2/3 \leq \eta _\text {OR} \leq 1$, and $0.63 \leq \eta _{\textrm{OBE}\&\textrm{OR}} \leq 0.95$ at distances over 100 km for the case-II scenario with reduced pulse broadening presented in our three-mode-transmission setup. The complexity reduction obtained here seems relatively small in this low-$D$ configuration (see discussions in Section 2.4). We will extend the application of the schemes for MDM links supporting many spatial channels for future work.

 figure: Fig. 8.

Fig. 8. NGMI penalty in OR-FDE processing with fixed block size $N=512$ for (a) case-I at distances $L =\{256, 307, \ldots, 460\}$ km, and (b) case-II at distances $L =\{563, 614, \ldots, 1638\}$ km. Note that each curve is drawn with distance increase of 51 km.

Download Full Size | PDF

 figure: Fig. 9.

Fig. 9. Constellations obtained with OR-FDE at 614 km for (a) $\Delta = 0$ and (b) $\Delta = 64$.

Download Full Size | PDF

 figure: Fig. 10.

Fig. 10. Achieved complexity reduction ratio $\eta$ in the conducted three-mode transmission experiment with the strongly-coupled scenario (case-II).

Download Full Size | PDF

4. Conclusions

In this paper, novel schemes are presented to realize a computationally-effcient implementation of MIMO-FDE for a design of scalable MDM transmission systems. The OBE-FDE selectively performs complex multiplications only for in-band entries of frequency-domain signals, directly contributing to lower complexity especially for MDM links with an employment of a larger count of spatial channels. In addition, the OR-FDE approach modifies a traditional overlap-and-save FDE to have reduced overlapping ratio to less than 0.5, substantially improving computation effciency. The effects of complexity reduction together with equalization performance were investigated through three-mode MDM transmission experiments over 1000 km with two different inter-mode coupling scenarios, demonstrating that the complexity effort was decreased by up to 37 % with the combined use of OBE-FDE and OR-FDE. We believe that these FDE schemes will contribute to a realization of scalable long-haul MDM transmission systems in the near future.

Funding

National Institute of Information and Communications Technology (NICT).

Acknowledgments

Part of this research utilized the results of the project "Research and Development of Spatial-Mode-Controllable Optical Transmission System" (No. 01001) of the National Institute of Information and Communications Technology (NICT).

Disclosures

The authors declare no conflicts of interest.

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

References

1. E. Ip, M. J. Li, K. Bennett, Y. K. Huang, A. Tanaka, A. Korolev, K. Koreshkov, W. Wood, E. Mateo, J. Hu, and Y. Yano, “146λ × 6 × 19-Gbaud wavelength-and mode-division multiplexed transmission over 10 × 50-km spans of few-mode fiber with a gain-equalized few-mode EDFA,” J. Lightwave Technol. 32(4), 790–797 (2014). [CrossRef]  

2. G. Rademacher, R. Ryf, N. K. Fontaine, H. Chen, R. J. Essiambre, B. J. Puttnam, R. S. Luis, Y. Awaji, N. Wada, S. Gross, N. Riesen, M. Withford, Y. Sun, and R. Lingle, “3500-km mode-multiplexed transmission through a three-mode graded-index few-mode fiber link,” Proc. 43rd European Conference on Optical Communication (ECOC 2017), p. M.2.E.4, (2017).

3. R. Ryf, N. K. Fontaine, S. Wittek, K. Choutagunta, M. Mazur, H. Chen, J. Carlos Alvarado-Zacarias, R. Amezcua-Correa, M. Capuzzo, R. Kopf, A. Tate, H. Safar, C. Bolle, D. T. Neilson, E. Burrows, K. Kim, M. Bigot-Astruc, F. Achten, P. Sillard, A. Amezcua-Correa, J. M. Kahn, J. Schroder, and J. Carpenter, “High-spectral-efficiency mode-multiplexed transmission over graded-index multimode fiber,” Proc. 44th European Conference and Exhibition on Optical Communications (ECOC 2018) p. Th3B.1 (2018).

4. K. Shibahara, T. Mizuno, L. Doowhan, Y. Miyamoto, H. Ono, K. Nakajima, S. Saitoh, K. Takenaga, and K. Saitoh, “DMD-unmanaged long-haul SDM transmission over 2500-km 12-core × 3-mode MC-FMF and 6300-km 3-mode fmf employing intermodal interference cancelling technique,” Proc. 43rd Optical Fiber Communications Conference and Exhibition (OFC 2018), p. Th4C.6 (2018).

5. K. Shibahara, T. Mizuno, H. Ono, K. Nakajima, and Y. Miyamoto, “Long-haul dmd-unmanaged 6-mode-multiplexed transmission employing cyclic mode-group permutation,” Proc. 43rd Optical Fiber Communications Conference and Exhibition (OFC 2020) p. Th3H.3 (2020).

6. R. Ryf, N. K. Fontaine, B. Guan, R. J. Essiambre, S. Randel, A. H. Gnauck, S. Chandrasekhar, A. Adamiecki, G. Raybon, B. Ercan, R. P. Scott, S. J. B. Yoo, T. Hayashi, T. Nagashima, and T. Sasaki, “1705-km transmission over coupled-core fibre supporting 6 spatial modes,” Proc. 40th European Conference on Optical Communication (ECOC 2014), p. PD.3.2 (2014).

7. R. Ryf, J. C. Alvarado, B. Huang, J. Antonio-Lopez, S. H. Chang, N. K. Fontaine, H. Chen, R. J. Essiambre, E. Burrows, R. Amezcua-Correa, T. Hayashi, Y. Tamura, T. Hasegawa, and T. Taru, “Long-distance transmission over coupled-core multicore fiber,” Proc. 42nd European Conference on Optical Communication (ECOC 2016), p. Th.3.C.3 (2016).

8. T. Sakamoto, S. Aozasa, T. Mori, M. Wada, T. Yamamoto, S. Nozoe, Y. Sagae, K. Tsujikawa, and K. Nakajima, “Randomly-coupled single-mode 12-core fiber with highest core density,” Proc. 40th Optical Fiber Communications Conference and Exhibition (OFC 2017), p. Th1H.1 (2017).

9. P. Sillard, K. Benyahya, D. Soma, G. Labroille, P. Jian, K. Igarashi, R. Ryf, N. K. Fontaine, G. Rademacher, and K. Shibahara, “Few-mode fiber technology, deployments, and systems,” Proc. IEEE 110(11), 1804–1820 (2022). [CrossRef]  

10. S. Randel, S. Corteselli, D. Badini, D. Pilori, S. Caelles, S. Chandrasekhar, J. Gripp, H. Chen, N. K. Fontaine, R. Ryf, and P. J. Winzer, “First real-time coherent MIMO-DSP for six coupled mode transmission,” Proc. 2015 IEEE Photonics Conference (IPC), p. PD4 (2015).

11. S. Beppu, K. Igarashi, H. Mukai, M. Kikuta, M. Shigihara, D. Soma, T. Tsuritani, and I. Morita, “Real-time strongly-coupled 4-core fiber transmission,” Proc. 43rd Optical Fiber Communications Conference and Exhibition (OFC 2020), p. Th3H.2 (2020).

12. M. Mazur, L. Dallachiesa, N. K. Fontaine, R. Ryf, E. Börjeson, H. Chen, H. Sakuma, T. Ohtsuka, T. Hayashi, T. Hasegawa, H. Tazawa, D. T. Neilson, and P. Larsson-Edefors, “Real-time transmission over 2×55 km all 7-core coupled-core multi-core fiber link,” Proc. 45th Optical Fiber Communication Conference (OFC 2022), p. Th4A.1 (2022).

13. M. S. Faruk and K. Kikuchi, “Adaptive frequency-domain equalization in digital coherent optical receivers,” Opt. Express 19(13), 12789–12798 (2011). [CrossRef]  

14. N. Bai and G. Li, “Adaptive frequency-domain equalization for mode-division multiplexed transmission,” IEEE Photonics Technol. Lett. 24(21), 1918–1921 (2012). [CrossRef]  

15. S. Randel, P. J. Winzer, M. Montoliu, and R. Ryf, “Complexity analysis of adaptive frequency-domain equalization for MIMO-SDM transmission,” Proc. 39th European Conference and Exhibition on Optical Communication (ECOC 2013), p. Th.2.C.4 (2013).

16. D. Mansour and A. Gray, “Unconstrained frequency-domain adaptive filter,” IEEE Trans. Acoust., Speech, Signal Process. 30(5), 726–734 (1982). [CrossRef]  

17. S. S. Haykin, Adaptive filter theory (Pearson Education India, 2008).

18. W. Yi, E. Sillekens, D. Lavery, H. Dzieciol, S. Zhou, K. Law, J. Chen, P. Bayvel, and R. I. Killey, “Performance of momentum-based frequency-domain MIMO equalizer in the presence of feedback delay,” Opt. Express 28(13), 19133–19143 (2020). [CrossRef]  

19. T. Xu, G. Jacobsen, S. Popov, M. Forzati, J. Mårtensson, M. Mussolin, J. Li, K. Wang, Y. Zhang, and A. T. Friberg, “Frequency-domain chromatic dispersion equalization using overlap-add methods in coherent optical system,” J. Opt. Commun. 32(2), 131–135 (2011). [CrossRef]  

20. E. Yamazaki, S. Yamanaka, Y. Kisaka, T. Nakagawa, K. Murata, E. Yoshida, T. Sakano, M. Tomizawa, Y. Miyamoto, S. Matsuoka, J. Matsui, A. Shibayama, J. ichi Abe, Y. Nakamura, H. Noguchi, K. Fukuchi, H. Onaka, K. Fukumitsu, K. Komaki, O. Takeuchi, Y. Sakamoto, H. Nakashima, T. Mizuochi, K. Kubo, Y. Miyata, H. Nishimoto, S. Hirano, and K. Onohara, “Fast optical channel recovery in field demonstration of 100-Gbit/s Ethernet over OTN using real-time DSP,” Opt. Express 19(14), 13179–13184 (2011). [CrossRef]  

21. C. Rasmussen, Y. Pan, M. Aydinlik, M. Crowley, J. C. Geyer, P. Humblet, F. Liu, B. Mikkelsen, P. Monsen, N. Nadarajah, G. Pendock, and B. Shah, “Real-time DSP for 100+ Gb/s,” Proc. Optical Fiber Communication Conference/National Fiber Optic Engineers Conference (OFC 2013) p. OW1E.1 (2013).

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (10)

Fig. 1.
Fig. 1. Schematics of (a) conventional approach processing with sub-equalizers for odd/even input blocks, and of (b) proposed OBE-FDE preventing out-of-band multiplications in processing of filter output and filter weight update.
Fig. 2.
Fig. 2. Schematics of FDE processing with consecutive blocks for (a) conventional FDE with $\rho = 0.5$, and for (b) OR-FDE scheme with $\rho < 0.5$.
Fig. 3.
Fig. 3. Complexity reduction ratio $\eta _\text {OBE}$ achieved with OBE-FDE for $D = \{2, 6, 8, 12, 20, 24\}$ and $N = \{256, 2048\}$.
Fig. 4.
Fig. 4. Impulse response evolution with increased distance observed in three-mode multiplexed transmission for (a) weakly-coupled scenario (case-I) and (b) strongly-coupled scenario (case-II).
Fig. 5.
Fig. 5. Required equalizer memory length as function of distance for (a) weakly-coupled scenario (case-I) and (b) strongly-coupled scenario (case-II).
Fig. 6.
Fig. 6. Number of output symbols per block processing per spatial channel for the conventional FDE and OR-FDE in (a) case-I, and (b) case-II. Solid lines show the predicted ones based on Eqs. (23) and (24), while squares are ones obtained by OR-based MIMO equalization with negligible penalty in signal performance.
Fig. 7.
Fig. 7. NGMI penalty in OBE-FDE processing for various frequency-bin entries when MDM signals are transmitted over 1536 km in case-II.
Fig. 8.
Fig. 8. NGMI penalty in OR-FDE processing with fixed block size $N=512$ for (a) case-I at distances $L =\{256, 307, \ldots, 460\}$ km, and (b) case-II at distances $L =\{563, 614, \ldots, 1638\}$ km. Note that each curve is drawn with distance increase of 51 km.
Fig. 9.
Fig. 9. Constellations obtained with OR-FDE at 614 km for (a) $\Delta = 0$ and (b) $\Delta = 64$.
Fig. 10.
Fig. 10. Achieved complexity reduction ratio $\eta$ in the conducted three-mode transmission experiment with the strongly-coupled scenario (case-II).

Tables (1)

Tables Icon

Table 1. Complexity requirement comparison between conventional FDE and OBE-FDE.

Equations (24)

Equations on this page are rendered with MathJax. Learn more.

$$\mathbf{u}_{i}(k) = \left[u_{i}\left(1+ \frac{N}{2}(k-1) \right), u_{i}\left( 2+ \frac{N}{2}(k-1) \right), \ldots, u_{i}\left( N+ \frac{N}{2}(k-1) \right) \right]^T,$$
$$\mathbf{u}_{i}^o(k) = \left[u_{i}\left(1+ \frac{N}{2}(k-1) \right), u_{i}\left(3+ \frac{N}{2}(k-1)\right), \ldots, u_{i}\left(N-1+ \frac{N}{2}(k-1) \right) \right]^T,$$
$$\mathbf{u}_{i}^e(k) = \left[u_{i}\left(2+ \frac{N}{2}(k-1) \right), u_{i}\left(4+ \frac{N}{2}(k-1) \right), \ldots, u_{i}\left(N+ \frac{N}{2}(k-1)\right) \right]^T,$$
$$\mathbf{U}_{i}^{o,e}(k) = \mathrm{FFT}\left[ \mathbf{u}_{i}^{o,e}(k) \right],$$
$$\mathbf{v}_{j}(k) = \text{the last half of } \mathrm{IFFT}\left[ \sum_{i=1}^{D} \mathbf{W}_{i,j}^{o}(k)\odot \mathbf{U}_{i}^{o}(k) + \sum_{i=1}^{D} \mathbf{W}_{i,j}^{e}(k)\odot \mathbf{U}_{i}^{e}(k) \right],$$
$$\mathbf{e}_{j}(k) = \mathbf{d}_{j}(k) - \mathbf{v}_{j}(k).$$
$$\mathbf{W}_{i,j}^{o,e}(k+1) = \mathbf{W}_{i,j}^{o,e}(k) + \mu \mathbf{U}_{i}^{o,e*}(k) \odot \mathbf{E}_{j}(k),$$
$$\mathbf{E}_{j}(k) = \mathrm{FFT} \begin{bmatrix} \mathbf{0}_{N/4} \\ \mathbf{e}_{j}(k) \end{bmatrix},$$
$$\mathbf{U}_{i}(k) = \mathrm{FFT}\left[ \mathbf{u}_{i}(k) \right].$$
$$\mathbf{v}_{j}(k) = \text{the odd entries at the last half of } \mathrm{IFFT}\left[ \sum_{i=1}^{D} \mathbf{W}_{i,j}(k) \odot_{\text{in}} \mathbf{U}_{i}(k) \right],$$
$$\mathbf{W}_{i,j}(k+1) = \mathbf{W}_{i,j}(k) + \mu \mathbf{U}_{i}^{*}(k) \odot_{\text{in}} \mathbf{E}_{j}^{\prime}(k),$$
$$\mathbf{E}_{j}^{\prime}(k) = \mathrm{FFT} \begin{bmatrix} \mathbf{0}_{N/2} \\ e_j(k)[1] \\ 0 \\ e_j(k)[2]\\ \vdots \\ e_j(k)[N/4] \\ 0 \end{bmatrix}.$$
$$\scalebox{0.82}{$\displaystyle\mathbf{u}_{i}^\text{OR}(k) = \left[u_{i}\left( 1+ \left(\frac{N}{2}+2\Delta\right)(k-1) \right), u_{i}\left( 2+ \left(\frac{N}{2}+2\Delta\right)(k-1) \right), \ldots, u_{i}\left( N+ \left(\frac{N}{2}+2\Delta\right)(k-1) \right) \right]^T,$}$$
$$\mathbf{U}_{i}^\text{OR}(k)= \mathrm{FFT}\left[ \mathbf{u}_{i}^\text{OR}(k) \right].$$
$$\mathbf{v}_{j}^{\Delta}(k) = \text{the odd entries of} \begin{bmatrix} P_{j}(k)[1+N/4-\Delta] \\ P_{j}(k)[2+N/4-\Delta] \\ \vdots \\ P_{j}(k)[3N/4+\Delta] \end{bmatrix},$$
$$\mathbf{e}_{j}^{\Delta}(k) = \mathbf{d}_{j}^{\Delta}(k) - \mathbf{v}_{j}^{\Delta}(k).$$
$$\mathbf{E}_{j}^{\prime \prime}(k) = \mathrm{FFT} \begin{bmatrix} \mathbf{0}_{N/4-\Delta} \\ e_j^{\Delta}(k)[1] \\ 0 \\ e_j^{\Delta}(k)[2]\\ \vdots \\ e_j^{\Delta}(k)[N/4] \\ 0 \\ \mathbf{0}_{N/4-\Delta} \end{bmatrix},$$
$$C_\text{conv} = 8D + 4\log_2 N,$$
$$C_\text{OBE} = 4D + 2 + 6\log_2 N,$$
$$C_\text{OR} = \frac{2ND + N \log_2 {N}}{N/4 + \Delta},$$
$$\eta_\text{OR} = \frac{N/4}{N/4 + \Delta}.$$
$$\eta_{\textrm{OBE}\&\textrm{OR}} = \eta_\text{OBE} \cdot \eta_\text{OR},$$
$$M_{\text{I}} = 0.073 \times L^{0.91}$$
$$M_{\text{II}} = 0.251 \times L^{0.60}$$
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.