Patent Abstract:
A signal equaliser for compensating impairments of an optical signal received through a link of a high speed optical communications network. At least one set of compensation vectors are computed for compensating at least two distinct types of impairments. A frequency domain processor is coupled to receive respective raw multi-bit in-phase (I) and quadrature (Q) sample streams of each received polarization of the optical signal. The frequency domain processor operates to digitally process the multi-bit sample streams, using the compensation vectors, to generate multi-bit estimates of symbols modulated onto each transmitted polarization of the optical signal. The frequency domain processor exhibits respective different responses to each one of the at least two distinct types of impairments.

Full Description:
[0001]    This application is a continuation of U.S. patent application Ser. No. 13/160,579, filed Jun. 15, 2011, which is a continuation of U.S. patent application Ser. No. 11/850,585, filed Dec. 5, 2007 which issued to U.S. Pat. No. 8,005,368 on Aug. 23, 2011 the entire contents of both applications are hereby incorporated herein by reference. 
     
    
     TECHNICAL FIELD 
       [0002]    The present invention relates to high-speed optical communications networks, and in particular to a signal equalizer in a coherent optical receiver. 
       BACKGROUND OF THE INVENTION 
       [0003]    Optical signals received through conventional optical links are typically distorted by significant amounts of chromatic dispersion (CD) and polarization dependent impairments such as Polarization Mode Dispersion (PMD), polarization angle changes and polarization dependent loss (PDL). Chromatic dispersion (CD) on the order of 30,000 ps/nm, and polarisation rotation transients at rates of 10 6  Hz are commonly encountered. Various methods and systems intended to address some of these limitations are known in the art. 
         [0004]      FIG. 1  schematically illustrates a representative coherent optical receiver capable of implementing the methods of Applicant&#39;s U.S. Pat. No. 7,555,227 issued Jun. 30, 2009 and entitled “Polarization Compensation In A Coherent Optical Receiver”; U.S. Pat. No. 7,606,498 issued Oct. 20. 2009 and entitled “Carrier Recovery in A Coherent Optical Receiver”; and U.S. Pat. No. 7,635,525 issued Dec. 22, 2009 and entitled “Signal Acquisition in A Coherent Optical Receiver”, the content, of ail of which are hereby incorporated herein by reference. 
         [0005]    As may be seen in  FIG. 1 , an inbound optical signal is received through an optical link  2 , split into orthogonal received polarizations by a Polarization Beam Splitter  4 , and then mixed with a Local Oscillator (LO) signal  8  by a conventional 90° optical hybrid  8 . The composite optical signals emerging from the optical hybrid  8  are supplied to respective photodetectors  10 , which generate corresponding analog electrical signals. The photodetector signals are sampled by respective Analog-to-Digital (A/D) converters  12  to yield raw multi-bit digital signals I X , Q X  and I Y , Q Y  corresponding to in-phase (I) and Quadrature (Q) components of each of the received polarizations. 
         [0006]    Preferably, the raw multi-bit digital signals have resolution of n=5 or 6 bits which has been found to provides satisfactory performance at an acceptable cost. In the above-noted U.S. patent applications: the sample rate of the A/D converters  12  is selected to satisfy the Nyquist criterion for the highest anticipated symbol rate of the received optical signal. Thus, for example, in the case of an optical network link  2  having a line rate of 10 GBaud, the sample rate of the A/D converters  12  will he approximately 20 GHz. 
         [0007]    From the A/D converter  12  block, the respective n-bit signals I X , Q X  and I Y , Q Y  of each received polarization are supplied to s respective dispersion compensator  14 , which operates on the raw digital signals to at least partially compensate chromatic dispersion of the received optical signal. The dispersion compensators  14  may be configured to operate as described in Applicant&#39;s co-pending U.S. patent application Ser. No. 11/550.042 filed Oct. 17, 2006, and summarized below with reference to  FIGS. 2   a  and  2   b.    
         [0008]    As may he seen in  FIG. 2   a ; each dispersion compensator (CD-COMP)  14  is provided as a high speed digital signal processor (or, equivalently, either an Application Specific Integrated Circuit, ASIC, or a Field Programmable Gate Array, FPGA) which is capable of implementing a variety of processing functions in the illustrated embodiment, two substantially identical CD-COMPs  14  are provided, each of which is connected to receive and process raw in-phase and Quadrature digital signals of a respective received polarization. For simplicity only the X-polarization CD-COMP  14 , is illustrated in  FIG. 2   a , if being understood that the Y-polarization CD-COMP  14   y  will be substantially identical. 
         [0009]    In the embodiment of  FIG. 2   a , the CO-COMP  14  generally comprises a pipelined series of functional blocks, including a deserializer  24 , a Fast Fourier Transform (FFT) filter  26 , a frequency domain processor (FDP)  28  and an Inverse Fast Fourier Transform (IFFT) filter  30 . 
         [0010]    The deserializer  24  operates to accumulate successive n-bit words of the in-phase and Quadrature digital signals I X  and Q X  from the X-polarization A/D converters  12   IX  and  12   QX  during a predetermined clock period. The accumulated n-bit words are then latched into the FFT  28  as a parallel input vector {r 1   X +jr Q   X }. Preferably, each of the real and imaginary components of the parallel vector {r 1   X +jr Q   X } have the same resolution (n=5 or 6 hits, for example) as the raw digital signals. In general, the width (m), in words, of the input vector {r 1   X +jr Q   X } is selected to be half the width (M) of the FFT  26 . In some embodiments, the FFT  26  has a width of M=256 taps, which implies an input vector width of m=128 complex values. However, a different FFT width may be selected, as desired, in practice, the FFT width is selected based on a compromise between circuit size and the amount of dispersion compensation desired. 
         [0011]    The input vector {r 1   X +jr Q   X } is augmented with a null vector {0, 0, 0, . . . 0} 32 which provides a zero data fill to the remaining input taps of the FFT  26 . 
         [0012]    The FFT filter  26  performs a conventional FFT operation to generate an array {R A   X } representing the frequency domain spectrum of the input vector {r 1   X +jr Q   X }. The FDP  28  can then implement any of a variety of frequency domain processing functions, as will be described in greater detail below, to yield a modified array {V A   X }, which is supplied to the IFFT filter  30 . 
         [0013]    The IFFT filter  30  performs a conventional Inverse Fast Fourier Transform operation to yield time domain data  34 . In the form of a complex valued vector having a width equal to the IFFT  30 , which. In the illustrated embodiment is M taps. In the embodiment of  FIG. 2   a , the IFFT output data  34  is divided Into two blocks and {V Q   X }, of which {v 1   X } is delayed by one clock cycle (at  36 ) and added to {v Q   X } (at  38 ) to yield the CD-COMP output  16  in the form of a complex valued vector {v 1   X +jv Q   X } encompassing m(=128) complex values. 
         [0014]    In the system of  FIGS. 2   a  and  2   b , the FDP  28  Implements a transpose-and-add function, along with dispersion compensation. In general, the transpose-and-add function operates to add the FFT output vector {R A   X } to a transposed version of itself with respective different compensation vectors, implementing the transpose-and-add operation between the complex FFT and IFFT filters has the effect of emulating a pair of parallel real-FFT and IFFT functions through the CD-COMP  14 , without requiring the additional circuits needed for parallel real FFT and IFFT filters. The transpose-and-add function can foe conveniently implemented in hardware, by providing a pair of parallel paths between the FFT output and a vector addition block  40 . One of these paths may be referred to as a direct path  42 , in which the tap-order of the FFT output {R A   X } Is retained. The other path, which may be referred to as a transpose path  44 , includes a transposition block  46  which operates to reverse the tap-order of the FFT output upstream of the vector addition block  40 . In this respect, it will be recognised that the transposition block  48  can be readily Implemented in hardware, which provides an advantage in that the transposition step does not incur a significant propagation delay penalty. 
         [0015]    Preferably, the direct and transpose paths  42  and  44  are provided with a respective multiplication block  48 , which enables various filter functions to be implemented by the FDP  28 . For example, in the embodiment of  FIG. 2   b , a pair of compensation vectors {C 0   X } and {C T   X }  50  are applied to the direct and transpose paths,  42  and  44  respectively. Each of the compensation vectors {C Q   X } and {C T   X } is composed of a respective set of coefficients which are calculated to apply a desired function, in the frequency-domain, to the digital signals. For example, {C Q   X } and {C T   X } may be calculated to apply a first-order dispersive function to at least partially compensate chromatic dispersion of the optical link. {C Q   X } and {C T   X } may also incorporate a transform of a differential delay function, so as to compensate residual sample phase errors In the I and Q digital signals. When both of these functions are implemented by the compensation vectors {C Q   X } and {C T   X }, the CD-COMP output  16  will represent a dispersion-compensated and phase-error corrected version of the raw I X  and O X  digital Signals received from the A/D converters  12 . 
         [0016]    Returning to  FIG. 1 , the dispersion-compensated digital signals  16  appearing at the output of the dispersion compensators  14  are then supplied to a polarisation compensator  18  which operates to compensate polarization effects, and thereby de-convolve transmitted symbols from the complex signals  16  output from the dispersion compensators  14 . If desired, the polarization compensator  18  may operate as described in Applicant&#39;s U.S. Pat. No. 7,565,227 issued Jun. 30, 2009 and U.S. Pat. No. 7,806,498 issued Oct. 20, 2009. The output of the polarization compensator  18  is a pair of multi-bit estimates X′(n) and Y′(n),  20  of the symbols encoded on each transmitted polarization. The symbol estimates X′(n), Y′(n) appearing at the output of the polarization compensator  18  are then supplied to a carrier recovery block  22  for LO frequency control, symbol detection and data recovery, such as described in Applicant&#39;s U.S. Pat. No. 7,806,498 issued Oct. 20, 2009. 
         [0017]    In the above described system, the dispersion compensators  14  operates across a large number of successive samples (e.g. 126 samples), which permits compensation of relatively severe chromatic dispersion, but at a cost of a relatively slow response to changing dispersion. This slow response is acceptable, because of the known slow rate of change of dispersion in real-world optical links. The polarization compensator  18 , in contrast, is comparatively very narrow (e.g. on the order of about 5 samples), to enable a rapid update frequency, which is necessary to track observed high-speed polarisation transients. 
         [0018]    The above-described system provides reliable signal acquisition, compensation of dispersion and polarization effects, carrier recovery and data recovery even in the presence of moderate-to-severe optical impairments. This, in turn, enables the deployment of a coherent optical receiver in real-world optical networks, with highly attractive signal reach and line rate characteristics. For example, a receiver implementing the above methods has demonstrated a signal reach of 1500 km at a line rate of 10 Gbaud (i.e. 10 9  symbols/second). It is noteworthy that this performance has been measured with real-time continuous processing, not just burst data acquisition followed by off-line processing or simulation The system described above with reference to  FIGS. 1 and 2  is the only coherent optical receiver known to the applicants to have achieved such real-time performance. 
         [0019]    With increasing demand for link band-width. It would be desirable to increase the line rate beyond 10 Gbaud. For example, lines rates of 35 GBaud and higher have been proposed. However, as the symbol rate is increased, the amount of distortion compensation that is required in order to obtain the same signal reach also increases. For example, the required amount of dispersion compensation increases proportional to the square of the symbol rate, while the required amount of compensation for polarization effects increases proportional to the symbol rate. These increases in distortion compensation can be met, using the system described above, but at a cost of increased size and/or complexity of the dispersion and polarization compensation blocks. 
         [0020]    At the same time, increasing the line rate also necessitates an increase In the sample rate of the A/D converters and downstream digital circuits, in order to maintain Nyquist sampling, 
         [0021]    It will be appreciated that both increased circuit size and increased sample rate imply that the power consumption of the receiver must necessarily also increase, as will the heat generated by the circuits during run-time. This can Impose an effective “thermal barrier” to increasing the line rate, as higher temperatures degrade system reliability. 
         [0022]    Accordingly, methods and techniques that enable reliable operation of a coherent optical receiver at line rates above 10 Gbaud are highly desirable. 
       SUMMARY OF THE INVENTION 
       [0023]    The present invention addresses the above-noted problems by providing a signal equalizer capable of compensating both dispersion and polarization, but which Is nevertheless agile enough to track high-speed polarization transients. 
         [0024]    Thus, an aspect of the present invention provides a signal equalizer for compensating impairments of an optical signal received through a link of a high speed optical communications network. At least one set of compensation vectors are computed for compensating at least two distinct types of impairments. A frequency domain processor is coupled to receive respective raw multi-bit in-phase (I) and quadrature (Q) sample streams of each received polarization of the optical signal. The frequency domain processor operates to digitally process the multi-bit sample streams, using the compensation vectors, to generate multi-bit estimates of symbols modulated onto each transmitted polarization of the optical signal. The frequency domain processor exhibits respective different responses to each one of the at least two distinct types of impairments. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0025]    Further features and advantages of the present invention will become apparent from the following detailed description, taken in combination with the appended drawings, in which: 
           [0026]      FIG. 1  is a block diagram schematically illustrating principal elements and operations of a coherent optical receiver known from Applicant&#39;s U.S. Pat. Nos. 7,556,227: 7,827,252; 7,532,322: 7,806,498; and 7,635,525; 
           [0027]      FIGS. 2   a  and  2   b  are a block diagram schematically illustrating principal elements and operations of the dispersion compensation block of  FIG. 1 , known from Applicant&#39;s U.S. Pat. No. 7,894,728: 
           [0028]      FIG. 3  Is a block diagram schematically illustrating principal elements and operations of a coherent optical receiver in accordance with an embodiment of the present invention: 
           [0029]      FIG. 4  is a block diagram schematically illustrating principal elements and operations of the equalizer of  FIG. 3 ; 
           [0030]      FIGS. 5   a  and  5   b  illustrate representative LMS loops for computing polarization compensation vectors in accordance with a first embodiment of the present invention; 
           [0031]      FIG. 6  illustrates a representative LMS loop for computing polarization compensation vectors in accordance with a second embodiment of the present invention; and 
           [0032]      FIGS. 7   a  and  7   b  Illustrate representative frequency domain filters usable in the LMS loop of  FIG. 8 . 
       
    
    
       [0033]    It will be noted that throughout the appended drawings, like features are identified by like reference numerals. 
       DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
       [0034]    The present invention provides an agile signal equalizer for compensating dispersion and polarization impairments in a coherent optical receiver of a high speed optical network. Embodiments of the present invention are described below, by way of example only, with reference to  FIGS. 3-7 . 
         [0035]      FIG. 3  illustrates principle elements of a coherent optical receiver which incorporates an agile signal equalizer  52  in accordance with the present invention. As may be seen in  FIG. 3 , the agile signal equalizer  52  combines the functionality of the dispersion compensation and polarization compensation blocks  14  and  18  of the system of  FIG. 1  Thus, the agile signal equalizer  52  is capable of correcting timing errors between I and Q sample streams of each received polarization, compensating moderate to severe chromatic dispersion, and compensating polarization effects to thereby de-convolve symbols modulated onto each of the transmitted polarizations from the received signals. 
         [0036]    As described in Applicant&#39;s U.S. Pat. No. 7,555,227 issued Jun. 30, 2009, separating the dispersion and polarization compensation blocks, in the manner described above in respect of  FIGS. 1 and 2 , has the advantage of enabling different compensation response times for each compensation block. Thus, the dispersion compensation block  14  is very wide to enable compensation of moderate to severe dispersion, and the associated slow response (for recalculating the compensation coefficients C X  and C Y ) is acceptable because dispersion is typically a slowly changing phenomenon. Conversely, the polarization compensation block  18  is, by comparison, very narrow, to facilitate a rapid response to polarization rotation transients. Combining both dispersion and polarization compensation into a common equaliser would be beneficial because it reduces the total number of gates required by the compensation circuitry, thereby reducing power consumption and associated heat dissipation problems. However; these potential advantages come at a cost of reductions in either or both of dispersion compensation performance and responsiveness to polarization transients. 
         [0037]    The present invention overcomes this difficulty by providing an agile signal equalizer  52  which has sufficient width to enable compensation of moderate-to-severe dispersion. A high-speed Least Mean Squares (LMS) update block  54  provides recalculation of compensation coefficients at a sufficiently high speed to enable tracking of polarization transients. A representative coherent optical receiver incorporating the signal equalizer is described below with reference to  FIG. 3 . A representative embodiment of the signal equalizer  52  is illustrated in  FIG. 4 . Representative embodiments of the LMS update block  54  are described below with reference to  FIGS. 5-7 . 
         [0038]    As may be seen in  FIG. 3 , a coherent optical receiver incorporating the signal equalizer  52  of the present invention generally comprises a Polarization Beam Splitter  4 ; 90° optical hybrid  8 ; photodetectors  10 ; and A/D converters  12 , all of which may operate as described above With reference to  FIG. 1 . The raw digital sample streams I X , Q X , and I Y , Q Y  generated by the A/D converters  12  are then supplied to the signal equalizer  52 . If desired, timing control methods described in Applicant&#39;s co-pending U.S. patent application Ser. No. 11/550,042 filed Oct. 17, 2008, including the use of elastic stores (not shown in  FIG. 3 ) between the A/D converters  12  and the equalizer  52  may be used to ensure at least coarse phase alignment between samples at the equalizer input. 
         [0039]    In general, the equalizer  52  operates to compensate chromatic dispersion and polarization rotation impairments. Consequently, the compensated signals  20  output from the equalizer  52  represent multi-bit estimates X′(n) and Y′(n) of the symbols encoded on each transmitted polarization of the received optical signal. The symbol estimates  20  X′(n), Y′(n), are supplied to a carrier recovery block  22  for LO frequency control, symbol detection and data recovery, such as described in Applicants U.S. Pat. No. 7,806,498 issued Oct. 20, 2009. 
         [0040]    In the embodiment of  FIG. 4 , the equalizer  52  generally follows the construction of the dispersion compensators  14  described above with reference to  FIGS. 1 and 2 . Thus, the raw digital sample streams I X , Q X , and I Y , Q Y  generated by the A/D converters  12  are deserialized (at  24 ) and the resulting m-word Input vectors {r 1   X +jr Q   X } and {r 1   Y +jr Q   Y } latched into /the respective X- and Y-polarization FFT blocks  28 . The arrays {R A   X } and {R A   Y } output by the FFT blocks  28  are then supplied to a Frequency Domain Processor (FDP)  56 , as will be described below. 
         [0041]    The modified arrays {V A   X } and {V A   Y } output by the FDP  56  are supplied to respective IFFT blocks  30 , and the resulting lime domain data  34  processed using respective overlap-and-add as described above with reference to  FIG. 2   a , to yield the equalizer output  20  in the form of complex valued vectors {v 1   x +jv Q   x } and {v 1   Y +jv Q   Y }, each of which encompasses m complex valued estimates X′(n) and Y′(n) of the transmitted symbols. 
         [0042]    In the embodiment of  FIG. 4 , the FDP  58  comprises a respective transpose-and-add functional block  58  for each polarization, and a cross-compensation block. The transpose-and-add block  58  operates in generally the same manner as described above with reference to  FIG. 2   b . Thus, the X-polarization transpose-and-add block  58   x  operates to add the FFT output array {R A   X } to a transposed version of itself {  R   Y   A }, with respective different compensation vectors {C 0   x } and {C T   X }, to yield intermediate array ΔT A   X }. As described above, compensation vectors {C 0   X } and {C T   X } can be computed to at least partially compensate chromatic dispersion of the optical link and/or to compensate residual sample phase errors in the raw digital signals generated by the A/D converters  12 . Of course, the Y-polarization transpose-and-add block  58   x  will operate in an exactly analogous manner. 
         [0043]    The cross-compensation block  80  applies X-polarization vectors H XX , H XY  to the X-polarization intermediate array {T A   x }, and Y-polarization vectors H YY , H YX  to the Y-polarization intermediate array {T A   Y }. The multiplication results are then added together to generate modified vectors {V A   X } and ΔV A   Y }: as may be seen in  FIG. 4  The X- and Y-polarization vectors H XX , H XY . H YY  and H YX  are preferably computed using a transform of the total distortion at the output of the equalizer  52 , as will be described In greater detail below. At a minimum, the X- and Y-polarization vectors H XX , H XY , H YY  and H YX  impose a phase rotation which compensates polarization impairments of the optical signal, and so de-convolve the transmitted symbols from the raw digital sample streams I X , G X , and I Y , Q Y  generated by the A/D converters  12 . Those of ordinary skill in the art will recognise that the illustrated cross-compensation block  60  implements an inverse-Jones matrix transfer function, which compensates the polarization effects, in this formulation, the vectors H XX , H XY , H YY  and H YX  are provided as the coefficients of the inverse-Jones matrix. The width of the inverse-Jones matrix is equal to that of the intermediate arrays {T A   X } and {T A   Y } and so is based on the expected maximum dispersion of the received optical signal to be compensated by the equalizer  52 . 
         [0044]    Preferably, the X- and Y-polarization vectors H XX , H XY , H YY  and H YX  are computed at sufficient speed to enable tracking, and thus compensation, of high-speed polarization rotation transients. This may be accomplished using the Least Mean Squares (LMS) update loop illustrated in  FIG. 4 , and described in greater detail below with reference to  FIGS. 5 and 6 . 
         [0045]      FIG. 5   a  shows an LMS update loop, according to one embodiment of the Invention, for calculating polarization vectors H XX  and H YX . A directly analogous LMS loop for calculating the polarization vectors H XY  and H YY  is shown in  FIG. 5   b , in the embodiment of  FIGS. 5   a  and  5   b , the carrier recovery block  22  operates as described in Applicant&#39;s U.S. Pat. No. 7,808,498 issued Oct. 20, 2009. Thus, the carrier recovery block  22  is divided into two parallel processing paths  80  (only the X-polarization path  60   x  is shown in FIG,  5   a , and the Y-polarization path  60   y  is shown in  FIG. 5   b ),each of which includes a decision circuit  62  and a carrier recovery loop comprising a carrier phase detector  64  and a phase rotator  68 . In general, the phase rotators  68  use a carrier phase estimate generated by the respective carrier phase detector  64  to compute and apply a phase rotation K(n) to the symbol estimates X′(n) and Y′(n) received from the signal equalizer  52 . The decision circuits  62  use the phase-rotated symbol estimates X′(n)e −jk(n)  and Y′(n)e −jk(n)  to generate recovered symbol values X(n) and Y(n), and the phase detectors  84  operate to detect respective phase errors Δφ between the rotated symbol estimates X′(n)e −jk(n)  and Y′(n)e −jk(n)  and the corresponding recovered symbol values X(n) and Y(n), 
         [0046]    Referring to FIG,  5   a , the H XX  LMS update loop receives the phase error Δφ X (n) of each successive symbol estimate X′(n), which is calculated by the phase detector  64  as described in Applicant&#39;s U.S. Pat. No. 7,808,498 issued Oct. 20, 2009. In addition, the rotated symbol estimate X′(n)e −jk(n)  and its corresponding decision value X(n) are also received from the earner recovery block  22 , and compared (at  88 ) to obtain a complex symbol error value e x ; which is indicative of residual distortion of the symbol estimate X′(n). In some embodiments it is desirable to format the optical signal into data bursts comprising a plurality of data symbols separated by a SYNC burst having a known symbol sequence. In such cases, a selector can be used to supply a selected one of the decision values X(n) and the known SYNC symbols to the comparator  68 . With this arrangement, the selector can be controlled to supply the known SYNC symbol sequence to the comparator during each SYNC burst, so that the error value e x  is computed using the known SYNC symbols rather than the (possibly erroneous) decision values X(n). 
         [0047]    In order minimize calculation complexity through the LMS update loop, the resolution of the complex symbol error e x  is preferably lower than that of the symbol estimate X′(n). For example, in an embodiment in which the symbol estimate X′(n) has a resolution of 7 bits for each of the real and imaginary parts (denoted herein as “7+7 bits”), the complex symbol error e x  may have a resolution of, for example, 3+3 bits. It will be noted, however, that the present invention Is not limited to these resolution values. 
         [0048]    The phase error Δφ X (n) is processed, for example using a Look-up-Table (LUT)  70 , to generate a corresponding complex value φ X  having a unit amplitude arid the same phase as Δφ X (n) with a desired resolution (e.g. 3+3 bits) matching that of the symbol error e X . This allows the phase error φ X  and symbol error e X  to be multiplied together (at  72 ) to obtain a complex vector d x  indicative of the total residual distortion of the symbol estimate X′(n). 
         [0049]    Applicant&#39;s U.S. Pat. No. 7,835,525 issued Dec. 22, 2009 describes methods and systems for signal acquisition in a coherent optical receiver. As described in U.S. Pat. No. 7,635,525, during a start-up operation of the receiver (or during recovery from a “loss-of frame” condition), LO frequency control, clock recovery, dispersion compensation and polarization compensation loops implement venous methods to acquire signal, and stabilize to steady-state operation. During this “acquisitions period”, the rotated symbol estimates X′(n)e −jk(n)  and their corresponding decision values X(n) are probably erroneous. Accordingly, in the embodiment illustrated in  FIGS. 5   a  and  5   b , a window select line may be used to zero out those values of the distortion vector d x  which are computed from non-sync symbols, Values of the distortion vector d X , which are computed from the known SYNC symbols are likely to be valid, even during signal acquisition, and thus are left unchanged. 
         [0050]    In the illustrated embodiments, values of the distortion vector d x  are generated at the symbol timing, in the case of Nyquist sampling, this is half the sample rate of the raw digital sample streams I X , Q X , and I Y , Q Y  generated by the A/D converters  12 , and it is therefore necessary to adjust the timing of the error values d x  to match the sample timing. In the case of T/2 sampling (that is, the sample period is one/half the symbol period T, which satisfies the Nyquist criterion), retiming of the error values d x  can be accomplished by inserting one zero between each successive error value, if desired, Interpolation or other filtering can be performed upon the retimed stream of error values to enhance the loop stability and performance. 
         [0051]    The resulting T/2 sampled symbol distortion vector is then input to a Fast Fourier Transform (FFT) block  74 , which calculates the frequency domain spectrum of the symbol distortion vector d x . 
         [0052]    Preferably, the width of the FFT block  74  corresponds with that of the intermediate array {T A   X }. With this arrangement, each value of the intermediate array {T A   X } can be truncated at  76  to match the resolution of the FFT block output (e,g. 3+3 bits), and then a conjugate of the truncated array multiplied with the FFT output army (at  78 ), to compute a low-resolution correlation between {T A   X } and the FFT output This correlation vector Is then scaled (at  80 ) to obtain an update vector {u xx }, which is accumulated (at  82 ) to obtain a vector representation of the total distortion of the Intermediate array {T A   X }. Truncating the total distortion vector, for example by taking the 7+7 most significant bits, yields the cross-compensation vector H XX . 
         [0053]    As noted above, directly analogous methods can be used to compute each of the other cross-compensation vectors H XY , H YY  and H YX , which are therefore not described herein in detail, 
         [0054]    In embodiments in which the compensation vectors {C 0   X }, {C T   X }, {C 0   Y } and {C T   Y } are computed to compensate only, residual sample phase errors in the raw digital sample streams I X , Q X , and I Y , Q Y , the symbol error e x  will contain substantially ail of the dispersion of the received optical signal  2 . In this case, the dispersion will propagate through the LMS update loop(s) and the resulting cross compensation vectors H XX , H XY , H YY  and H YX  will provide at least partial compensation of the dispersion, in addition to applying a phase rotation to de-convolve the symbols modulated onto each polarization of the transmitted optical signal, from the raw digital sample streams I X , Q X , and I Y , Q Y . 
         [0055]    In embodiments in which the compensation vectors {C 0   X }, {C T   X }, {C 0   Y } and {C T   Y } are computed to compensate both residual sample phase errors and chromatic dispersion, the symbol error e x  will contain only a residual portion of the dispersion. In these embodiments, the cross-compensation vectors H XX , H XY , H YY  and H YX  will provide little or no additional dispersion compensation, but will still apply the needed phase rotation to de-convolve the symbols modulated onto the transmitted polarizations. 
         [0056]    A limitation of the embodiment of  FIG. 5  is that noise tends to increase as the speed of the tracking of polarization rotation transients increases, e.g. to 50 kHz it would be preferable to provide low noise, accurate, compensation, while at the same time enabling close tracking of polarization rotation transients of 50kHz or more.  FIG. 6  illustrates a modification of the LMS update loop of  FIG. 5 , in which this issue is addressed. 
         [0057]    In the embodiment of  FIG. 6 , the H XX  LMS update loop of  FIG. 5   a  is modified by the addition of a “supercharger” block  84 , which is inserted into the LMS loop between the scaling function  80  and the accumulator  82 . In this embodiment, it is assumed that the compensation vectors {C 0   X }, {C T   X }, {C 0   Y } and {C T   Y } are computed to compensate at least the majority of the chromatic dispersion, as described above. In this case, the inventors have observed that as the polarization rotation rate tend towards zero, the intermediate arrays {T K   X } and {T A   Y } become highly de-correlated with the output of the respective LMS loop FFTs  74 , and the resulting update vectors have very low magnitudes. Conversely, as the polarization rotation rate increases, the intermediate arrays and {T A   X } and {T A   Y } become significantly correlated with their respective FFT outputs, and this is reflected In an increasing magnitude of the update vectors. 
         [0058]    The Inventors have further observed that under these conditions the time duration of the majority of a time domain version of the update vector {u xx } is relatively short. This limited time duration occurs because of the limited memory inherent in optical polarization effects. The long memory effects of chromatic dispersion have already been substantially compensated, as noted above. Any residual dispersion or other long memory effects generally only need slow tracking. 
         [0059]    The supercharger block  84  exploits these observations by implementing an arrangement in which; 1) portions of the update vector {u xx } that lie outside the time duration of a polarization effect are suppressed; 2) fully detailed updates are allowed to slowly accumulate, enabling the slow tracking of long memory effects such as chromatic dispersion and line filtering; and 3) the magnitude of the enhanced update vector {u′ xx } supplied to the accumulator  82  is scaled in proportion to the polarization rotation rate. 
         [0060]    The suppression of portions of the update vector {u xx } lying outside the time duration of a polarization effect reduces the noise contribution from those portions, and so allows a higher LMS tracking speed without excessive added noise. However, since this suppression Is incomplete, fully detailed updates are allowed to slowly accumulate, thereby enabling accurate tracking of slowly-changing impairments such as chromatic dispersion and line filtering, indeed, rather than suppressing, the illustrated embodiment actually enhances the magnitude of the relevant time domain portions of the update vector. Finally, scaling the magnitude of the update vector {u xx } in proportion to the polarization rotation rate effectively increases the update step size of the important aspects of the update vectors during high speed transients, substantially without affecting the ability of the LMS update loop to provide accurate compensation (via a small update step size) during periods of low-speed polarization rotation. 
         [0061]    As may be appreciated, there are various ways in which the Supercharger function may be implemented, in the embodiment of  FIG. 6 : the supercharger  84  is implemented as a frequency-domain digital filter  86  which receives the update vector {u xx } and a summation block  88  for adding the filter output vector {s xx } to the update vector {u xx } to yield the enhanced update vector {u′ xx }. 
         [0062]    If desired, a threshold block  90  can be inserted at the output of the digital filter  86 , as shown in dashed line in  FIG. 8 . The threshold block  90  can implement any of a variety of suitable linear and/or nonlinear functions to improve loop performance. A low gate-count embodiment is to implement a zeroing function. In which the “raw” filter output {s xx } from the digital filter  88  is multiplied by zero whenever the magnitude of {s xx } is less than a predetermined threshold. This can be done individually for each term of {s xx }, or by making one decision for the whole vector based upon a vector magnitude metric, such as peak absolute value or sum of the squared magnitude of each of the vector terms. 
         [0063]    As may be appreciated, the frequency domain filter  86  may be implemented in various ways.  FIG. 7   a  illustrates a low-gate-count embodiment in which the frequency domain filter  86  is implemented as a cascade of summation blocks. Thus, for example, consider an embodiment in which the update vector {u xx } has a width of N=128 taps. These  128  taps can be separated into K=16 groups of  8  taps each. Within each group, the complex values on each tap are summed {at  92 }, to yield a corresponding group sum B(k). A respective weighted summation value S(k) is then computed (at  94 ) for each group, using the group sum values B(k) of the group, and those of the three nearest neighbouring groups. In the embodiment of  FIG. 6 , for each group k, the weighted summation value S(k) is computed using the equation 
         [0000]    
       
         
           
             
               
                 S 
                  
                 
                   ( 
                   k 
                   ) 
                 
               
               = 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     
                       k 
                       - 
                       3 
                     
                   
                   
                     k 
                     + 
                     3 
                   
                 
                  
                 
                     
                 
                  
                 
                   
                     w 
                      
                     
                       ( 
                       i 
                       ) 
                     
                   
                   · 
                   
                     B 
                      
                     
                       ( 
                       i 
                       ) 
                     
                   
                 
               
             
             , 
           
         
       
     
         [0000]    where the weighting factor w(i)=2 −|k−1| , and modular arithmetic on the i provides the desirable circular wrap around characteristic. 
         [0064]    For example, consider group k=8. The group sum B(k=8) will he the sum of the complex values on taps i=64 . . . 71 of the update vector. The weighted summation value S(k) will be computed as a weighted sum of the respective group sums B(i), i=5 . . . 11. The respective weighting factor w(i) applied to each group sum B(i) will be w(i)=2 5 =1 for j=k, and then descending by powers of two for each of the three neighbouring groups. Thus, w(i)=2 −1  for i=k±1; w(i)=2 −2  for j=k±2; and w(i)= −3  for i=k±3. 
         [0065]    The filter output vector {s xx }, comprising the weighted summation value S(k) for each group, is optionally processed by the threshold block  90 , and then added (at  88 ) to each of the group tap values of the update vector{u xx } to yield the enhanced update vector {u′ xx }. Thus, continuing the above example, the weighted summation value S(k=8) will be added back to each of the complex values on taps i=64 . . . 71 of the update vector {u xx }. 
         [0066]    With this arrangement, the value of S(k) will depend on the degree of correlation between the X-Polarization intermediate array {T A   X } and the FFT output vector. When the X-Polarization intermediate array {T A   X } and the FFT output vector are highly correlated, S(k) will have relatively large magnitude (in embodiments in which the threshold block  90  is used, S(k) will often be larger than the threshold), and so will have a strong effect on the enhanced update vector {u′ xx }, thereby improving the ability of the LMS update loop to track a rapidly changing polarization angle. 
         [0067]    Conversely, when the X-Polarization intermediate array {T A   X } and the FFT output vector are highly uncorrected (that is, when the polarisation angle of the received optical signal is not significantly changing), S(k) will have a very low magnitude (in embodiments in which the threshold block  90  is used, S(k) will usually be lower then the threshold, and thus forced to zero), and so will have little or no effect upon the enhanced update vector {u′ xx }, thereby keeping the added noise to a small level. 
         [0068]      FIG. 7   b  illustrates an alternative embodiment In which the frequency domain filter  88  is Implemented as an IFFT  98 , Time-domain filter (TDF)  98  and FFT  100  blocks in sequence, in this case, the IFFT block  98  converts the update vector {u xx } to the time-domain, so that the TDF  98  can implement a windowing function that suppresses portions of the update vector {u xx } lying outside an expected duration of the polarization effect. The thus “windowed” time-domain update vector is then converted back Into the frequency domain by the FFT block  100 , to yield the output vector {s x }. Various other time-domain filter functions may also be implemented by the TDF  98  (either m addition to or instead of the windowing function) as desired. 
         [0069]    The above description uses frequency domain LMS. Other adaptive methods can be used. Zero-forcing is a well known alternative algorithm, which suffers from less than optimal noise filtering. Time domain versions of LMS or other algorithms could be used. This frequency domain version of LMS has the advantage of a small gate-count and relatively fast convergence. 
         [0070]    The configuration of  FIG. 4  can be simplified by omitting the multiplication of the arrays {R A   X } and {R A   Y } by the compensation vectors {C 0   X } and {C 0   Y }. Mathematical equivalence, to yield identical modified vectors {V A   X } and {V A   Y }, can be obtained by dividing the transpose compensation vectors {C T   X } and {C T   Y } by {C 0   X } and {C 0   Y }, respectively, and multiplying cross compensation vectors H XX  and H XY  by {C 0   X }, and multiplying H YY  and H YX  by {C 0   Y }. In a simple implementation, the {C 0   X } and {C 0   Y } multiplication blocks in the embodiment of  FIG. 4  are omitted. The compensation vectors {C T   X } and {C T   Y } and cross compensation vectors H XX , H XY , H YY  and H YX  are then computed using the techniques described above, which will yield the appropriate values. 
         [0071]    Other ways may be used for separating the response to slow long memory effects from the response to more rapid short memory effects. Pattern matching, transient speed measurement, time moments, error rates, nonlinear equalization, Jones Matrix calculations, and parameter estimations, are examples of methods that may be used, with varying gate-count requirements. Some of the slower parts of functions could be Implemented in firmware. 
         [0072]    Power based scaling or other scaling methods can be used to enhance the speed of the LMS tracking of the slower frequency components. 
         [0073]    The embodiments of the invention described above are intended to be Illustrative only. The scope of the invention is therefore intended to be limited solely by the scope of the appended claims.

Technology Classification (CPC): 7