applied sciences
Review Recent Advances in DSP Techniques for Mode Division Multiplexing Optical Networks with MIMO Equalization: A Review
Yi Weng 1, Junyi Wang 2 and Zhongqi Pan 1,*
1 Department of Electrical and Computer Engineering, University of Louisiana at Lafayette, Lafayette, LA 70504, USA; [email protected] 2 Qualcomm Technologies Inc., San Diego, CA 95110, USA; [email protected] * Correspondence: [email protected]; Tel.: +1-337-482-5899
Received: 12 February 2019; Accepted: 7 March 2019; Published: 20 March 2019
Abstract: This paper provides a technical review regarding the latest progress on multi-input multi-output (MIMO) digital signal processing (DSP) equalization techniques for high-capacity fiber-optic communication networks. Space division multiplexing (SDM) technology was initially developed to improve the demanding capacity of optic-interconnect links through mode-division multiplexing (MDM) using few-mode fibers (FMF), or core-multiplexing exploiting multicore fibers (MCF). Primarily, adaptive MIMO filtering techniques were proposed to de-multiplex the signals upon different modes or cores, and to dynamically compensate for the differential mode group delays (DMGD) plus mode-dependent loss (MDL) via DSP. Particularly, the frequency-domain equalization (FDE) techniques suggestively lessen the algorithmic complexity, compared with time-domain equalization (TDE), while holding comparable performance, amongst which the least mean squares (LMS) and recursive least squares (RLS) algorithms are most ubiquitous and, hence, extensively premeditated. In this paper, we not only enclose the state of the art of MIMO equalizers, predominantly focusing on the advantage of implementing the space–time block-coding (STBC)-assisted MIMO technique, but we also cover the performance evaluation for different MIMO-FDE schemes of DMGD and MDL for adaptive coherent receivers. Moreover, the hardware complexity optimization for MIMO-DSP is discussed, and a joint-compensation scheme is deliberated for chromatic dispersion (CD) and DMGD, along with a number of recent experimental demonstrations using MIMO-DSP.
Keywords: digital signal processing; multi-input multi-output; mode-division multiplexing; least mean squares; frequency-domain equalization; recursive least squares; space–time block-coding; mode-dependent loss
1. Introduction The space division multiplexing (SDM) systems were proposed to improve the capacity of fiber-optic transmission links, either by means of core multiplexing exploiting multicore fibers (MCF), or with mode-division multiplexing (MDM) using few-mode fibers (FMF) [1–3]. Device integration is the most likely approach to accomplish power consumption and cost reduction, through a variety of proposals for realizing parallel spatial channels, including integrating parallel transmitters, receivers, and amplifiers in the same device, as well as utilizing various multimode or multicore fibers, as shown in Figure1[4]. Amongst these proposals, the simplest solution is to solely apply fiber bundles to have the same behavior as N single-mode fibers, which can consist of a fiber ribbon or a multi-element fiber as
Appl. Sci. 2019, 9, 1178; doi:10.3390/app9061178 www.mdpi.com/journal/applsci Appl. Sci. 2019, 9, 1178 2 of 28
Appl. Sci. 2019, 9, x FOR PEER REVIEW 2 of 29 displayed in Figure1a. Such a multi-element fiber provides a smooth upgrade path where all existing fiber bundles. In contrast, MCFs epitomize the next step in parallel fiber integration, where the components can be reused, and the power consumption and cost go up with the scale of the fiber adjacent fiber cores are enclosed in the same glass cladding, and it allows novel system architectures bundles. In contrast, MCFs epitomize the next step in parallel fiber integration, where the adjacent such as local oscillator sharing with less temperature-dependent fluctuation, as revealed in Figure fiber cores are enclosed in the same glass cladding, and it allows novel system architectures such as 1b. It is worth mentioning that MCFs are usually designed with low inter-core cross-talk; thus, local oscillator sharing with less temperature-dependent fluctuation, as revealed in Figure1b. It is multiple-input multiple-output (MIMO) digital signal processing (DSP) is not required at the worth mentioning that MCFs are usually designed with low inter-core cross-talk; thus, multiple-input receiver. On the other hand, mode coupling is difficult to avoid in FMFs and, hence, necessitates the multiple-output (MIMO) digital signal processing (DSP) is not required at the receiver. On the other usage of MIMO DSP in the SDM systems, where orthogonal spatial modes within the same fiber core hand, mode coupling is difficult to avoid in FMFs and, hence, necessitates the usage of MIMO DSP form the parallel channels, as exposed in Figure 1c. Furthermore, strongly coupled MCFs that in the SDM systems, where orthogonal spatial modes within the same fiber core form the parallel behave like FMFs were also proposed with certain combined advantages, which shows there is great channels, as exposed in Figure1c. Furthermore, strongly coupled MCFs that behave like FMFs were potential to combine MCF with few-mode cores in next-generation optical-fiber communication also proposed with certain combined advantages, which shows there is great potential to combine systems [5,6]. MCF with few-mode cores in next-generation optical-fiber communication systems [5,6].
Figure 1. The typical examples of optical fibers for space division multiplexing (SDM) technology: (a) multi-element fiber; (b) multicore fiber; (c) multi-mode fiber [4]. Figure 1. The typical examples of optical fibers for space division multiplexing (SDM) technology: (a) multi-elementPrincipally, thefiber; adaptive (b) multicore multi-input fiber; (c multi-output) multi-mode fiber (MIMO) [4]. frequency-domain equalization (FDE) techniques were recognized to de-multiplex the signals upon diverse modes, as well as compensate for the differentialPrincipally, modethe adaptive group delay multi-input (DMGD) dynamicallymulti-output through (MIMO) digital frequency-domain signal processing equalization (DSP) [7–9 ]. (FDE)TheFDE techniques techniques were can recognized reduce the to algorithmicde-multiplex complexity the signals evocatively, upon diverse in comparison modes, as withwell theas compensatetime-domain for equalization the differential (TDE), mode while holdinggroup dela equivalenty (DMGD) performance, dynamically amongst through which digital the least signal mean processingsquares (LMS) (DSP) and [7–9]. recursive The FDE least techniques squares (RLS) can algorithmsreduce the arealgorithmic most widely complexity held and, evocatively, hence, broadly in comparisonstudied [10 –with12]. Although the time-domain the LMS approachequalization has lower(TDE), complexity, while holding it suffers equivalent from severe performance, performance amongstdeprivation which and the exhibits least mean slower squares convergence, (LMS) and while recursive encountering least squares a large (RLS) number algorithms of parameters are most to widelybe simultaneously held and, hence, adapted broadly in futurestudied SDM [10–12]. channels Although [13]. the Alternatively, LMS approach faster has convergence lower complexity, can be itaccomplished suffers from severe by applying performance RLS with deprivation a moresophisticated and exhibits slower algorithmic converge conformationnce, while encountering at the price of ahigher large complexitynumber of [ 14parameters,15]. Hereafter, to itbe is simultaneously significant to develop adapted a MIMO-DSP in future FDESDM algorithm channels with [13]. the Alternatively,intention of achieving faster convergence an RLS-level can performance be accomplished at an by LMS-adapted applying RLS complexity with a more for ansophisticated SDM-based algorithmicoptical communication conformation system. at the price of higher complexity [14,15]. Hereafter, it is significant to developAnother a MIMO-DSP bewildering FDE algorithm deficiency with of FMF-based the intention optical of achieving fiber systems an RLS-level is the mode-dependent performance at lossan LMS-adapted(MDL), which complexity soars from for inline an SDM-based component optical defectiveness communication and disorders system. the modal orthogonality, consequentlyAnother bewildering degrading thedeficiency overall of capacity FMF-based of MIMO optical channels fiber systems [16]. With is the the mode-dependent aim of lessening loss the (MDL),impact which of MDL, soars old-fashioned from inline tacticscomponent take accountdefectiveness of mode and scrambler disorders and the specialtymodal orthogonality, fiber designs. consequentlyThese approaches degrading were the primarily overall disadvantagedcapacity of MIMO with channels high cost, [16]. yet With they the cannot aim of utterly lessening eradicate the impact of MDL, old-fashioned tactics take account of mode scrambler and specialty fiber designs. the accumulated MDL in optical links [17]. Furthermore, the space–time trellis codes (STTC) were These approaches were primarily disadvantaged with high cost, yet they cannot utterly eradicate the proposed to reduce the MDL, but they suffered from great complexity as well [18]. Henceforward, accumulated MDL in optical links [17]. Furthermore, the space–time trellis codes (STTC) were MDL is categorically another key challenge that needs to be triumphed for next-generation optical proposed to reduce the MDL, but they suffered from great complexity as well [18]. Henceforward, transmission systems. MDL is categorically another key challenge that needs to be triumphed for next-generation optical The spatial multiplicity versus the transmission distance accomplished in recent SDM- wavelength transmission systems. division multiplexing (WDM) transmission experiments is plotted in Figure2[ 19], where the region The spatial multiplicity versus the transmission distance accomplished in recent SDM- with a spatial multiplicity over 30 is designated as the “DSDM region”. The dots in Figure2 represent wavelength division multiplexing (WDM) transmission experiments is plotted in Figure 2 [19], the cases of multimode fiber (MMF), MCF, and coupled-core fibers (only three-core and six-core), where the region with a spatial multiplicity over 30 is designated as the “DSDM region”. The dots in as well as the latest multicore multimode fiber experiments [20]. Figure 2 represent the cases of multimode fiber (MMF), MCF, and coupled-core fibers (only three-core and six-core), as well as the latest multicore multimode fiber experiments [20]. Appl. Sci. 2019,, 9,, 1178x FOR PEER REVIEW 33 of of 2829
Figure 2. The recent records of spatial multiplicity vs. the transmission distance in the state-of-the-art SDM-WDMFigure 2. The experiments recent records [19 ].of spatial multiplicity vs. the transmission distance in the state-of-the-art SDM-WDM experiments [19]. The outline of this review article is sketched as follows: Section2 describes the principles of MIMO equalizers, the LMS and RLS techniques, and the space–time block-coding (STBC) assisted The outline of this review article is sketched as follows: Section 2 describes the principles of RLS algorithms, while Section3 introduces the configuration of a typical multimode coherent MIMO equalizers, the LMS and RLS techniques, and the space–time block-coding (STBC) assisted transmission system transmission system with FMFs for high-order modulation formats. In Section4, RLS algorithms, while Section 3 introduces the configuration of a typical multimode coherent the performance analysis of various adaptive filtering schemes is presented for quadrature phase shift transmission system transmission system with FMFs for high-order modulation formats. In Section keying (QPSK), 16 quadrature amplitude modulation (16QAM), and 64QAM, correspondingly. Then, 4, the performance analysis of various adaptive filtering schemes is presented for quadrature phase Section5 explores the STBC-based enhancement amongst different modulation formats. In Section6, shift keying (QPSK), 16 quadrature amplitude modulation (16QAM), and 64QAM, correspondingly. we further investigate the bit error rate (BER) versus optical signal-to-noise ratio (OSNR) curves Then, Section 5 explores the STBC-based enhancement amongst different modulation formats. In of mode-dependent loss equalization. Last but not least, Section7 demonstrates the complexity Section 6, we further investigate the bit error rate (BER) versus optical signal-to-noise ratio (OSNR) optimization using the proposed single-stage architecture. Finally, Section8 provides a summary curves of mode-dependent loss equalization. Last but not least, Section 7 demonstrates the of recent expressive experiments of SDM transmission using MIMO DSP for short-, medium- and complexity optimization using the proposed single-stage architecture. Finally, Section 8 provides a long-haul distances. summary of recent expressive experiments of SDM transmission using MIMO DSP for short-, 2.medium- Principle and long-haul distances.
2. PrincipleThis section introduces the theoretical background of MIMO equalizers, including LMS, RLS, and the space–time block-coding (STBC) algorithm for SDM optical transmission. Moreover, we This section introduces the theoretical background of MIMO equalizers, including LMS, RLS, also cover the aspects of polarization-related dynamic equalization, orthogonal frequency-division and the space–time block-coding (STBC) algorithm for SDM optical transmission. Moreover, we also multiplexing (OFDM) FDE requirements, and the MIMO hardware requirements in this section. cover the aspects of polarization-related dynamic equalization, orthogonal frequency-division Although hypothetically any modal cross-talk can be electronically managed by DSP, the algorithmic multiplexing (OFDM) FDE requirements, and the MIMO hardware requirements in this section. complexity of the MDM coherent receiver remains one of the main limiting factors to the MIMO Although hypothetically any modal cross-talk can be electronically managed by DSP, the equalization scheme. In general, the total complexity of the DSP algorithm can be measured by the algorithmic complexity of the MDM coherent receiver remains one of the main limiting factors to the number of complex multiplications per symbol per mode, for the reason that the complex multipliers MIMO equalization scheme. In general, the total complexity of the DSP algorithm can be measured are usually the most resource-consuming arithmetic logics in terms of power consumption, area, and by the number of complex multiplications per symbol per mode, for the reason that the complex cost in application-specific integrated circuit (ASIC) design [21]. Appl. Sci. 2019, 9, x FOR PEER REVIEW 4 of 29
Appl.multipliers Sci. 2019 , 9are, 1178 usually the most resource-consuming arithmetic logics in terms of power4 of 28 consumption, area, and cost in application-specific integrated circuit (ASIC) design [21].
2.1. MIMO Equalizers: State of the Art Although the SDM conception was present for quite a long time,time, the realreal SDMSDM transmissiontransmission systems were not pursued in industry until recent yearsyears [[22].22]. This is because, in MDM systems, it is assumed that signals could be immaculately conveyedconveyed under a particular mode without interfering with otherother spatialspatial channelschannels within within an an ideal ideal FMF; FMF; however, however, in in reality, reality, that that might might not not be thebe the case, case, for thefor signalsthe signals in numerous in numerous modes modes are often are cross-coupledoften cross-coupled to each to other each dueother to bending,due to bending, twisting, twisting, and/or fiberand/or fabrication fiber fabrication imperfections; imperfections; henceforward, hencefor theward, orthogonality the orthogonality of modes might of modes only be might preserved only forbe apreserved very short for distance a very short in industrial distance SDM in industrial applications. SDM applications. In orderorder to to resolve resolve such such issue, issue, MIMO MIMO signal signal processing processing was developed was developed to undo channelto undo cross-talk channel andcross-talk recover and the transmittedrecover the data transmitted quality. The data coherent quality. receiver The structure coherent for areceiver single-carrier structure system for with a asingle-carrier 6 × 6 MIMO system FDE is exemplifiedwith a 6 × 6 in MIMO Figure 3FDE, where is exemplified the coefficient in adaptationFigure 3, where can be accomplishedthe coefficient withadaptation LMS or can RLS be algorithms accomplished along with with LMS data-aided or RLS algorithms training. along with data-aided training.
Figure 3. The typical coherent receiver configuration for a single-carrier transmission system with a 6Figure× 6 multi-input 3. The typical multi-output coherent receiver (MIMO) configuration frequency-domain for a single-carrier equalization transmission (FDE) [7]. system with a 6 × 6 multi-input multi-output (MIMO) frequency-domain equalization (FDE) [7]. The conventional time-domain equalization (TDE) uses a finite impulse response (FIR) filter matrixThe adapted conventional by the LMStime-domain algorithm. equa Thelization complexity (TDE) for uses the TDEa finite CTDE impulseis given response by [23] (FIR) filter matrix adapted by the LMS algorithm. The complexity for the TDE C is given by [23] CTDE = 3·m·∆β1·L·RS, (1) 𝐶 =3∙𝑚∙∆𝛽 ∙𝐿∙𝑅 , (1) where ∆β indicates the DMGD of the fiber, m signifies the number of modes within the fiber, where ∆𝛽1 indicates the DMGD of the fiber, 𝑚 signifies the number of modes within the fiber, 𝐿 L represents the length of the fiber, and R denotes the symbol rate. Subsequently, the complexity represents the length of the fiber, and 𝑅 S denotes the symbol rate. Subsequently, the complexity of ofTDE TDE scales scales linearly linearly with with the the mode mode group group delay delay of of the the optical optical link, link, the the number number of of modes, and the symbol rate. Meanwhile, the complexity for FDE C can be written in the form of symbol rate. Meanwhile, the complexity for FDE CFDE can be written in the form of C =4∙(𝑚+1) ∙log (2∙∆𝛽 ∙𝐿∙𝑅 ) +8∙𝑚. (2) C FDE = 4·(m + 1)· log2 (2·∆β1· L·RS) + 8·m. (2) It can be resolved from the equations above that FDE might substantially reduce the complexity It can be resolved from the equations above that FDE might substantially reduce the complexity compared with TDE. Characteristically, a block length equal to twice the equalizer length is applied compared with TDE. Characteristically, a block length equal to twice the equalizer length is applied for the adaptive FDE. By dint of even and odd sub-equalizers, an equivalent half-symbol period for the adaptive FDE. By dint of even and odd sub-equalizers, an equivalent half-symbol period delay delay spacing finite impulse response (FIR) filter can be realized in the frequency domain. The spacing finite impulse response (FIR) filter can be realized in the frequency domain. The required required MIMO equalizer duration to compensate for DMGD in the weak-coupling regime can be MIMO equalizer duration to compensate for DMGD in the weak-coupling regime can be transcribed as transcribed as
NNDMGD = ⌈∆∆𝛽β1 ·∙𝐿∙𝑅L·ROS ·R∙𝑅S, ⌉, (3)
where ⌈… ⌉ means the ceiling function, Δβ signifies the DMGD in the fiber, and R represents where ... means the ceiling function, ∆β1 signifies the DMGD in the fiber, and ROS represents the oversamplingthe oversampling rate. rate. Furthermore, Furthermore, the MDLthe MDL can can be expressed be expressed as [24 as] [24] Appl. Sci. 2019, 9, 1178 5 of 28
Appl. Sci. 2019, 9, x FOR PEER REVIEW 5 of 29
2 2 MDL = max λk / min λk , (4) k=1∼N k=1∼N MDL = max 𝜆 min , 𝜆 ~ ~ (4) where λk stands for singular values of the coupler transfer matrix, which can be calculated by employing thewhere singular λ stands value for decomposition singular values (SVD). of the coupler transfer matrix, which can be calculated by employingTo achieve the singular the MIMO value equalization, decomposition the (SVD). impulse-response matrix measurement needs to be performedTo achieve first. the An MIMO example equalization, of the squared the magnitudeimpulse-response of the polarization-divisionmatrix measurement multiplexingneeds to be (PDM)performed SDM first. 6 × An6 impulse example responses of the squared for 96 kmmagnitude of a six-mode of the FMFpolarization-division is depicted in Figure multiplexing4, where the(PDM) columns SDM correspond6 × 6 impulse to responses the transmitted for 96 portskm of and a six-mode the rows FMF correspond is depicted to the in Figure received 4, where ports [ 25the]. Incolumns Figure correspond4, the sharp to peaks the transmitted in the subplots ports identify and the the rows main correspond coupling to points the received evidently, ports which [25]. are In Figure 4, the sharp peaks in the subplots identify the main coupling points evidently, which are divided into four regions designated with A (the coupling between the polarization modes LP01x divided into four regions designated with A (the coupling between the polarization modes LP01x and and LP01y), B (the coupling between the spatial and polarization modes LP11ax, LP11ay, LP11bx, and LP01y), B (the coupling between the spatial and polarization modes LP11ax, LP11ay, LP11bx, and LP11by), LP11by), and C and D (the cross-talk between LP01 and LP11 modes). Such channel estimation provides aand clear C and picture D (the of thecross-talk cross-talk between introduced LP01 and by theLP11 mode modes). multiplexer Such channel and the estimation propagation provides through a clear the six-modepicture of FMF, the whichcross-talk allows introduced a better understandingby the mode ofmultiplexer the MIMO and DSP the performance. propagation through the six-mode FMF, which allows a better understanding of the MIMO DSP performance.
Figure 4. The squared magnitude of the 6 × 6 impulse responses for MIMO equalization [25]. Figure 4. The squared magnitude of the 6 × 6 impulse responses for MIMO equalization [25]. Furthermore, a typical eye diagram is shown below of two de-correlated 12.5-Gbps NRZ 7 Furthermore, a typical eye diagram is shown below of two de-correlated 12.5-Gbps NRZ 27-1 2 -1 pseudorandom binary sequences (PRBSs) launched into one fundamental mode LP01 and a pseudorandom binary sequences (PRBSs) launched into one fundamental mode LP01 and a higher-order LP12 mode, with power adjusted such that both channels received the same power of −12 dBm at the receiver, with decent isolation, low los,s and minimal modal mixing [26]. Consequently, we can observe any substantial coupling between the modal groups within the FMF Appl. Sci. 2019, 9, 1178 6 of 28
Appl. Sci. 2019, 9, x FOR PEER REVIEW 6 of 29 higher-order LP12 mode, with power adjusted such that both channels received the same power of −12 dBm at the receiver, with decent isolation, low los,s and minimal modal mixing [26]. Consequently, which would easily close the eye at the receiver. The eye diagram with heavy modal dispersion can we can observe any substantial coupling between the modal groups within the FMF which would easily be seen in Figure 5b, while the eyes of multiplexing independent channels LP01 and LP12 are close the eye at the receiver. The eye diagram with heavy modal dispersion can be seen in Figure5b, displayed in Figures 5c,d. while the eyes of multiplexing independent channels LP01 and LP12 are displayed in Figure5c,d.
Figure 5. Eye diagrams of a typical mode-division multiplexing (MDM) transmission system for (a)
Figureback-to-back; 5. Eye diagrams (b) over-fill of launcha typical without mode-division coupler; (multiplexingc) LP01 channel; (MDM) (d) LP transmission12 channel [26 system]. for (a) back-to-back; (b) over-fill launch without coupler; (c) LP01 channel; (d) LP12 channel [26]. 2.2. LMS and RLS Techniques 2.2. LMSBoth and LMS RLS and Techniques RLS algorithms are intended to iteratively minimalize the squared error at all discreteBoth frequencies. LMS and RLS The algorithms LMS algorithm are intended stands as to a it stochasticeratively gradientminimalize descent the squared minimization error at using all discreteinstantaneous frequencies. error estimates,The LMS algorithm with the corresponding stands as a stochastic weight updategradient as descent [27] minimization using instantaneous error estimates, with the corresponding weight update as [27] W(k + 1) = W(k) + µ[U(k) − W(k)V(k)], (5) 𝑊(𝑘+1) =𝑊(𝑘) +𝜇 𝑈(𝑘) −𝑊(𝑘)𝑉(𝑘) , (5) where W(k) signifies the MIMO channel matrix vector at frequency k, U(k) indicates fast Fourier where W(𝑘) signifies the MIMO channel matrix vector at frequency 𝑘, U(𝑘) indicates fast Fourier transform (FFT) of detected data blocks, µ denotes the step size, and V(k) represents the FFT of transform (FFT) of detected data blocks, 𝜇 denotes the step size, and V(𝑘) represents the FFT of sampled received signals. sampled received signals. In conventional LMS, the convergence rate and equalization performance depend on the same In conventional LMS, the convergence rate and equalization performance depend on the same value of the scalar step size µ. The convergence speed can be enlarged by choosing an adaptive step value of the scalar step size μ. The convergence speed can be enlarged by choosing an adaptive step size based on the power spectral density (PSD) of input signal, which can be conveyed as [28] size based on the power spectral density (PSD) of input signal, which can be conveyed as [28] αα µ𝜇((k𝑘))== ,, (6) (6) SS((k𝑘)) wherewhere S(k) S(k) signifies signifies the the PSD PSD of of a a posterior posterior error error block, block, and and αα symbolizessymbolizes the the adaptation adaptation rate, rate, which which determinesdetermines both thethe convergenceconvergence speed speed and and equalization equalization performance performance of the of noisethe noise PSD directedPSD directed (NPD) (NPD)LMS algorithm. LMS algorithm. The basic The schematic basic schematic of an MDM of an transmission MDM transmission system using system the LMSusing algorithm the LMS is algorithmshown in Figureis shown6. in Figure 6. In contrast, the RLS algorithm depends on the iterative minimization of an exponentially weighted cost function, whose convergence speed is not strongly dependent on the input statistics, with the corresponding weight update as h i W(k + 1) = W(k) + [U(k) − W(k)V(k)]·V(k)H· R(k)·β−1 , (7) Appl. Sci. 2019, 9, 1178 7 of 28 where R(k) symbolizes a tracked inverse time-averaged weighted correlation matrix, the superscript H signifies the Hermitian conjugate, and β denotes a forgetting factor, which gives an exponentially lower weight to older error samples. Consequently, the main difference between the conventional LMS and RLS algorithms is that RLS has a growing memory due to R(k) and β, and, thus, might achieve an even lower OSNR and faster adaptation. Specifically, the tracked inverse time-averaged weighted correlation matrix can be denoted as [29] ( ) h i R(k)·β−1·V(k)·V(k)H·R(k)·β−1 R(k + 1) = R(k)·β−1 − , (8) 1 + V(k)H·[R(k)·β−1]·V(k) which assigns a different step size to each adjustable RLS equalizer’s coefficient at their updates, rendering all frequency bins with a uniform convergence speed, thus cultivating the total algorithmic performance.
2.3. STBC-Assisted RLS Algorithms One of the primary issues regarding the conventional RLS implementation might be its comparatively sophisticated computational complexity, attributable to the recursive updating with a growing memory. Henceforth, in order to accomplish a quasi-RLS performance at a quasi-LMS cost, the STBC technique can be applied to aid the RLS approach, which is defined as follows: assuming multiple copies of data stream are transmitted across a number of spatial modes in an FMF transmission, some of the received copies are better than the others under the same scattering, reflection, or thermal noise;Appl. Sci. thus, 2019,the 9, x variousFOR PEER received REVIEW versions of the data can be exploited to increase the overall system7 of 29 reliability [30].
Figure 6. Schematic of an MDM system utilizing the MIMO FDE [31]. Figure 6. Schematic of an MDM system utilizing the MIMO FDE [31]. The space and time allocation for the STBC-aided RLS algorithm can be briefly represented In contrast, the RLS algorithm depends on the iterative minimization of an exponentially as shown in Figure7, as a matrix of spatial channels and time slots, whereby each element is the weighted cost function, whose convergence speed is not strongly dependent on the input statistics, modulated symbol to be transmitted in mode i at time slot j. We may choose different combinations, with the corresponding weight update as and we can apply one or more of received copies to properly decode the received signal and, therefore, achieve better performance.W(𝑘+1) =W(𝑘) + U(𝑘) −W(𝑘)V(𝑘) ∙V(𝑘) ∙ R(𝑘) ∙𝛽 , (7) The architecture of the adaptive STBC-RLS equalizer in an m-mode FMF transmission system is where R (k) symbolizes a tracked inverse time-averaged weighted correlation matrix, the illuminated in Figure8. At coherent detection, the serial-to-parallel (S/P) converters split each data superscript H signifies the Hermitian conjugate, and β denotes a forgetting factor, which gives an sequence y , . . . y into even/odd sequences, while two consecutive blocks are concatenated. After the exponentially1 lowerm weight to older error samples. Consequently, the main difference between the FFT, the samples of the k-th block are overlapped with the (k − 1)th block at frequency k, which are conventional LMS and RLS algorithms is that RLS has a growing memory due to R(k) and β, and, further alienated into sequential blocks yP(k), where superscript P specifies an even or odd sequence. thus, might achieve an even lower OSNRq and faster adaptation. Specifically, the tracked inverse P Eachtime-averaged block is then weighted converted correlation to the matrix frequency can domainbe denoted with as FFT[29] as Yq(k), which goes through an inversed channel filter for the data matrix production with the even or odd tributaries, while HP (k) 𝑅(𝑘) ∙𝛽 ∙V(𝑘) ∙V(𝑘) ∙ 𝑅(𝑘) ∙𝛽 q,j stands for the inversed𝑅(𝑘+1 channel) = 𝑅 filter(𝑘) ∙𝛽 in Jones-vector − notation, while both q and j denote , mode indices(8) 1+V(𝑘) ∙ 𝑅(𝑘) ∙𝛽 ∙V(𝑘) between 1 and m. After an adaptive MIMO equalization, the carrier recovery is applied to mitigate which assigns a different step size to each adjustable RLS equalizer’s coefficient at their updates, rendering all frequency bins with a uniform convergence speed, thus cultivating the total algorithmic performance.
2.3. STBC-Assisted RLS Algorithms One of the primary issues regarding the conventional RLS implementation might be its comparatively sophisticated computational complexity, attributable to the recursive updating with a growing memory. Henceforth, in order to accomplish a quasi-RLS performance at a quasi-LMS cost, the STBC technique can be applied to aid the RLS approach, which is defined as follows: assuming multiple copies of data stream are transmitted across a number of spatial modes in an FMF transmission, some of the received copies are better than the others under the same scattering, reflection, or thermal noise; thus, the various received versions of the data can be exploited to increase the overall system reliability [30]. The space and time allocation for the STBC-aided RLS algorithm can be briefly represented as shown in Figure 7, as a matrix of spatial channels and time slots, whereby each element is the modulated symbol to be transmitted in mode 𝑖 at time slot 𝑗. We may choose different combinations, and we can apply one or more of received copies to properly decode the received signal and, therefore, achieve better performance.
Appl. Sci. 2019, 9, x FOR PEER REVIEW 8 of 29
Appl. Sci. 2019, 9, 1178 8 of 28
the laser phase noise, the outputs of which are transformed back to the time domain using inverse FFT (IFFT),Figure 7. compared The space toand the time desired allocation response for the to space–time generate block-coding an error vector, (STBC)-aided and to update recursive the least receiver coefficients in a training mode untilsquares they converge. (RLS) algorithm Then, [31]. it switches to a decision-directed mode, whereby reconstructed data are transformed back using FFT through the zero padding to update the Appl. Sci. 2019, 9, x FOR PEER REVIEW 8 of 29 coefficientsThe architecture [31]. of the adaptive STBC-RLS equalizer in an m-mode FMF transmission system is illuminated in Figure 8. At coherent detection, the serial-to-parallel (S/P) converters split each data
sequence y ,…y into even/odd sequences, while two consecutive blocks are concatenated. After the FFT, the samples of the k-th block are overlapped with the (k − 1)th block at frequency k, which are further alienated into sequential blocks y (k), where superscript P specifies an even or odd sequence. Each block is then converted to the frequency domain with FFT as Y (k), which goes through an inversed channel filter for the data matrix production with the even or odd tributaries, while H , (k) stands for the inversed channel filter in Jones-vector notation, while both q and j denote mode indices between 1 and m. After an adaptive MIMO equalization, the carrier recovery is applied to mitigate the laser phase noise, the outputs of which are transformed back to the time domain using inverse FFT (IFFT), compared to the desired response to generate an error vector, and to update the receiver coefficients in a training mode until they converge. Then, it switches to a Figure 7. The space and time allocation for the space–time block-coding (STBC)-aided recursive least decision-directed mode, whereby reconstructed data are transformed back using FFT through the Figuresquares 7. (RLS)The space algorithm and time [31]. allocation for the space–time block-coding (STBC)-aided recursive least zero padding to update the coefficients [31]. squares (RLS) algorithm [31].
The architecture of the adaptive STBC-RLS equalizer in an m-mode FMF transmission system is illuminated in Figure 8. At coherent detection, the serial-to-parallel (S/P) converters split each data sequence y ,…y into even/odd sequences, while two consecutive blocks are concatenated. After the FFT, the samples of the k-th block are overlapped with the (k − 1)th block at frequency k, which are further alienated into sequential blocks y (k), where superscript P specifies an even or odd sequence. Each block is then converted to the frequency domain with FFT as Y (k), which goes through an inversed channel filter for the data matrix production with the even or odd tributaries, while H , (k) Figurestands 8. forThe the architecture inversed of channel an STBC-aided filter RLSin Jones-vector equalizer for MDMnotation, receivers while [29 ].both q and j Figure 8. The architecture of an STBC-aided RLS equalizer for MDM receivers [29]. denote mode indices between 1 and m. After an adaptive MIMO equalization, the carrier recovery is appliedThe to weight mitigate update the laser of thephase STBC-aided noise, the RLS outputs algorithm of which follows are transformed the rules below, back whereasto the time the The weight update of the STBC-aided RLS algorithm follows the rules below, whereas the domaincorresponding using inverse equalizer FFT coefficients (IFFT), compared are updated to the every desired two response blocks (k +to 2generate) instead an of error each blockvector, (k and+ 1 ) corresponding equalizer coefficients are updated every two blocks (k+2) instead of each block (k+ toin update the recursion. the receiver coefficients in a training mode until they converge. Then, it switches to a 1) in the recursion. decision-directed mode, whereby reconstructed data! are transformed back using FFT through the PkP+ 2 00 ∗ ∗ zero padding to updateW(kW+( 𝑘+2the2) = coefficients)W=W(k)(+𝑘) + [31]. ((UU k+)2)∙ · [DD k+2−U− U k+2∙W·W((𝑘k) )],, (9) 00P Pk +2 where U denotes the Alamouti matrix containing the received symbols from block k+2 and where U denotes the Alamouti matrix containing the received symbols from block k + 2 and k + 3, k+3, andk+ 2D represents the desired response vector for training and decision-directed tracking and D represents the desired response vector for training and decision-directed tracking [32], while [32], whilek+2 the superscript * indicates the complex conjugation. Meanwhile, the diagonal term P the superscript * indicates the complex conjugation. Meanwhile, the diagonal term P is given by is given by k+2
− 1 h − 1 i PPk+ 2 ==𝛽β · ∙P Pk −−𝛽β ·P∙Pk· Ω∙Ωk+ 2·Pk∙P, , (10)
where 𝛽 is the forgetting factor, and the term Ω is given by where β is the forgetting factor, and the term Ωk+2 is given by Figure 8. The architecture of an STBC-aided RLS equalizer for MDM receivers−1 [29]. 2 2 −1 −1 Ωk+2 = {Diagonal[|V(k)| + |V(k + 1)| ] + β ·Pk} , (11) The weight update of the STBC-aided RLS algorithm follows the rules below, whereas the where V(k) stands for the FFT of sampled received signals. By utilizing the STBC scheme, we may corresponding equalizer coefficients are updated every two blocks (k+2) instead of each block (k+ choose different combinations, and apply one or more of received copies to correctly decode the 1) in the recursion. received signal, and, thus, attain a better performance. Meanwhile, the STBC is able to accomplish an P 0 RLS-level performanceW(𝑘+2 with) a=W much(𝑘) lower+ computational (U complexity,)∗ ∙ D −U because∙W( no𝑘) matrix, inversion is 0P (9) essential during the recursion. Instead of adding a training sequence to each data block, only a few where U denotes the Alamouti matrix containing the received symbols from block k+2 and k+3, and D represents the desired response vector for training and decision-directed tracking [32], while the superscript * indicates the complex conjugation. Meanwhile, the diagonal term P is given by