The present disclosure relates generally to receivers. More particularly, the present disclosure relates to reducing jitter and inter-symbol interference in receivers.
High speed data communication between physically separated integrated components is a common function in current communication infrastructure systems. The separated integrated circuits can be physically separated on a common circuit board, or on separate circuit boards connected by a backplane, cable, or other communication medium.
As the data rate increases, as the physical separation distance increases, and/or the quality of the communication medium decreases, the transmitted signal will be increasingly impaired by a process commonly called Inter-Symbol Interference (ISI). ISI effectively smears the transmitted pulse waveform such that, at the receiver, each received pulse contains portions of signal energy from previously transmitted symbols (called Post-Cursor ISI) and may even contain portions of signal energy from symbols yet to be received (called Pre-Cursor ISI).
The phenomenon of ISI is well understood by those knowledgeable in the art. It is also well known that the impairment process of ISI can largely be mitigated through the use of equalizers, whether they are analog equalizers, digital equalizers, or combination of both. Within the scope of digital equalization, the equalizer can be in the form of a Finite Impulse Response (FIR), Infinite Impulse Response (IIR), Decision Feedback Equalizer (DFE), among others. Within the scope of analog equalization, the equalizer can be in the form of a Continuous Time Linear Equalizer (CTLE), Analog FIR, among others.
Often, a complicating issue is that the characteristic response of the transmission channel is unknown and can change from one installation to another. In these cases, a calibration, or adaptation process must be implemented to determine the required configuration of the receive equalizer that will exhibit the least ISI.
One type of common receiver architecture has the receiver sampling the received signal at a frequency that is twice the baud rate of the received signal. Using timing recovery strategies of known art, such as, for example, the Gardner method (F. M. Gardner, “A BPSK/QPSK Timing—Error Detector for Sampled Receivers”, IEEE Transactions on Communications, vol. COM-34, No. 5, May 1986), the sampling of the received waveform is adjusted such that one set of alternating samples aligns with the center of the received symbol waveform pulse with the opposite alternating samples aligning with the point mid-way between consecutive symbol pulses.
Shown in
The timing digital signal 38 and the data signal 37 are provided to a timing error detector (TED) 39, which controls the timing of a sample clock 40; the sample clock 40 controls the ADC 32. With respect to the data signal 37, it is processed by a slicer 42, whose output symbol signal 48 can be Boolean values “0”, or “1”, or, can be the constellation equivalent of the Boolean values, i.e., a “−1” or a “+1”. A summation device 44 takes the difference between the output symbol signal 48 and the data signal 37. The difference 45 is provided to a controller (or adapter) 46, which controls the FIR EQ 34 as a function of the difference 45, and as a function of the digitized output 33.
A common means of adapting a digital FIR receiver equalizer is to use the Least Mean Square (LMS) algorithm to minimize the signal variation of the signal samples centered in the middle of the eye. Those knowledgeable in the art will recognize that the LMS algorithm is a simple to implement method of approximating the Minimum Mean Square Estimate (MMSE) which minimizes the combination of ISI and noise power at the Baud Sample.
While the LMS algorithm applied to eye-centered samples is a commonly used approach to receiver EQ adaptation, and one that optimizes the vertical eye opening at the location of the center eye sample, it is known to be sub-optimal with respect to the horizontal eye opening (for example, see A. C. Carusone, “An Equalizer Adaptation Algorithm to Reduce Jitter in Binary Receivers”, IEEE Transactions on Circuits and Systems—II: Express Briefs, Vol. 53, No. 9, September 2006). For example, the exemplary eye diagram of
To mitigate this problem, a common technique in current art is to adapt the receiver EQ (e.g., the FIR EQ 34 in
Therefore, improvements in receiver equalization are desirable.
In a first aspect, the present disclosure provides a method of controlling a receiver equalizer. The method comprises: receiving an analog signal having a baud rate; sampling the analog signal at a sampling rate of twice that of the baud rate, the sampling to obtain a sampled signal that includes two interleaved digital signals, a first signal of the two interleaved digital signals being a data signal, the data signal comprising data samples sampled at the center of each consecutive symbol of the analog signal, a second of the two interleaved digital signal being a timing signal, the timing signal comprising timing samples sampled between the consecutive symbols; calculating a timing error term for timing samples comprised between data samples that define non-zero crossing transitions; and controlling the receiver equalizer as a function of the timing error term.
In a second aspect, the present disclosure provides a receiver. The receiver comprises: a sampling means for sampling an analog signal having a baud rate, the sampling means to sample the analog signal at a sampling rate of twice that of the baud rate, the sampling to obtain a sampled signal that includes two interleaved digital signals, a first signal of the two interleaved digital signals being a data signal, the data signal comprising data samples sampled at the center of each consecutive symbol of the analog signal, a second of the two interleaved digital signal being a timing signal, the timing signal comprising timing samples sampled between the consecutive symbols; processing means operationally connected to the sampling means, the processing means to calculate a timing error term of timing samples comprised between data samples that define non-zero crossing transitions; an equalizer to equalize one of the sampled signal and the analog signal; and a control module operationally connected to the processing means and to the equalizer the control module to control the equalizer as a function of the timing error term.
Other aspects and features of the present disclosure will become apparent to those ordinarily skilled in the art upon review of the following description of specific embodiments in conjunction with the accompanying figures.
Embodiments of the present disclosure will now be described, by way of example only, with reference to the attached Figures.
The present disclosure recognizes that with linear electrical channels, the pre- and post-cursor ISI experienced at Timing Sample N (TSn) is similar for the two following cases: DSn has the opposite logical value as DSn+1 (i.e., a case of Zero-Crossing Transition, ZCT); and DSn has the same logical value as DSn+1 (ie. a case of Non-Zero-Crossing Transition, NZCT). This is shown in
Unlike prior art which adapts the receiver EQ based on information at the Timing Sample for cases of ZCT, the present disclosure uses information at the Timing Sample for cases of NZCT, that is, when DSn+1 and DSn are on the same side of the zero signal level. Under benign jitter and spread spectrum clocking conditions, the disclosed method provides similar adapted EQ performance to prior art with respect to horizontal eye opening. Under conditions of strong jitter and spread spectrum clocking, the present disclosure provides much more robust adaptation than current art. Where current art may fail to adapt properly and provide an acceptable eye opening, the method of the present disclosure continues to work well.
For greater certainty, data samples DSn and DSn+1 will define a ZCT when one of them has a positive value and the other has a negative value. A positive value can be “1” or close to “1”; a negative value can be “−1” or close to “−1”. Data samples DSn and DSn+1 will define a NZCT when both of them have a positive value or both of them have a negative value.
Examples of the present disclosure are provided in the context of binary non-return to zero (NRZ) transmission as an example. Those knowledgeable in the art will recognize that the present disclosure is also applicable to other types of transmissions such as, for example, PAM-4 where four amplitude levels are used to carry 2-bits of information per baud symbol.
Returning to
The equalized data signal 86 and the equalized timing signal 88 are provided to a timing error detector 90, which provides an output signal 92 to a loop filter 94. The loop filter 94 outputs a control signal 96 that controls the timing of a sample clock 98; the sample clock 98 controls the ADC 77 in terms of the frequency at which the ADC 76 samples the received signal 75 and at which portion of a symbol the analog to digital conversion is effected by the ADC 77. In the present example, the sampling frequency is twice that of the baud rate.
Referring again to the equalized data signal 86, it is provided also to a slicer 100, which, in the present example, outputs “+1” if an equalized data sample N (EDSn) has a value larger than “0”, or outputs a “−1” if EDSn does not have value larger than “0”. Reference numeral 101 represents the output of the slicer 100.
Additionally, the equalized data signal 86 is provided to a data signal error computing module 102, which computes a data signal error term as a function of the equalized data signal 86. The data signal error computing module 102 can compute the data signal error term, εDS 103 for each EDSn as, for example:
εDS=sign(EDSn)−EDSn (1)
where the sign( ) function outputs “+1” if the argument (EDSn in this case) is positive, “0” if the argument is zero, and “−1” if the argument is negative.
The SerDes receiver 73 example of
εTS=[sign(ETSn)−ETSn]·xnor(EDSn+1>0,EDSn>0) (2)
where the sign( ) function outputs “+1” if the argument (ETSn in this case) is positive, “0” if the argument is zero, and “−1” if the argument is negative. The xnor( ) function outputs “1” if both of its arguments have the same value and outputs “0” if its arguments are different (one of the arguments is “1” and the other is “0”). As such, as per equation 2, εTS will have a non-zero value only when EDSn+1>0 and EDSn>0, or when EDSn+1<0 and EDSn<0. Otherwise, if EDSn+1>0 and EDSn<0, or vice versa, the value of εTS will be nil. That is, the timing signal error εTS for a timing signal sample TSn will be nil in all cases where DSn and DSn+1 define a ZCT. εTS can be non-nil only when DSn and DSn+1 define a NZCT. As will be understood by the skilled worker, an equivalent form of equation 2 is:
εTS=[sign(ETSn)−ETSn]·xnor(EDSn+1<0,EDSn<0) (3)
That is, as per equation 3, εTS will have a non-zero value only when EDSn+1<0 and EDSn<0, or when EDSn+1>0 and EDSn>0.
In the example of
According to equations 1 and 2 (or 1 and 3), the computed value of εTS will be zero unless successive baud symbols are the same, that is, when a zero-transition is not expected. Those knowledgeable in the art will recognize that if the xnor( ) function in equation 2 (or equation 3) is replaced with a xor( ) function, the operation of the circuit will be similar to a number of the prior art techniques that adapt the FIR EQ based on the zero-crossing transition between baud symbols.
The adapt module 106 controls the FIR EQ 80 to equalize the sampled signal 79, which contains the data signal 108 interleaved with the timing signal 110, as a function of the timing signal error term εTS and the data signal error term εDS. When only the timing signal error term is considered, the adapt module 106 controls the FIR EQ 80 in accordance with:
Pre2′=Pre2+μTS·εTS·TSn+1 (4)
Pre1′=Pre1+μTS·εTS·DSn+1 (5)
Curs′=Curs+μTS·εTS·TSn (6)
Post1′=Post1+μTS·εTS·DSn (7)
Post2′=Post2+μTS·εTS·TSn−1 (8)
When only the data signal error term is considered, the adapt module 106 controls the FIR EQ 80 in accordance with:
Pre2′=Pre2+μDS·εDS·DSn+1 (9)
Pre1′=Pre1+μDS·εDS·TSn (10)
Curs′=Curs+μDS·εDS·DSn (11)
Post1′=Post1+μDS·εDS·TSn−1 (12)
Post2′=Post2+μDS·εDS·DSn−1 (13)
When both the timing signal error and the data signal error terms are taken into account, the adapt module 106 controls the FIR EQ 80 in accordance with:
Pre2′=Pre2+μTS·εTS·TSn+1+μDS·εDS·DSn+1 (14)
Pre1′=Pre1+μTS·εTS·DSn+1+μDS·εDS·TSn (15)
Curs′=Curs+μTS·εTS·TSn+μDS·εDS·DSn (16)
Post1′=Post1+μTS·εTS·DSn+μDS·εDS·TSn−1 (17)
Post2′=Post2+μTS·εTS·TSn−1+μDS·εDS·DSn−1 (18)
In equations 4-18, the FIR EQ taps (Pre2, Pre1, Curs, Post1, and Post2) are spaced at intervals of ½ baud duration. If a baud-spaced EQ is desired, Pre1 and Post1 are set to zero and not updated. If more taps than specified in equations 4-18 are desired, equations 4-18 can easily be adapted, as would be understood by the skilled worker. The choice of adapting based on eye-center criterion or non-zero-crossing criterion, or both, is supported through the independent scaling parameters μDS and μTS. Setting either to zero removes that criterion from the adaptation. Setting the scaling parameters μDS and μTS to a small positive value includes that criterion in the adaptation. When non-zero, the values selected for the scaling parameters can be less than 1, such as 1/32, or 1/64, or any other suitable value. Those knowledgeable in the art will understand the fundamental tradeoffs of selecting larger or smaller values for the scaling parameters. In the present example, the signal sample at the output of the FIR EQ 80 is described by equation 18a, where the signal 79 is denoted by Sn and the signal 82 is denoted by ESn.
ESn=Pre2·Sn+4+Pre1·Sn+2+Curs·Sn+Post1·Sn−2+Post2·Sn−4 (18a)
A block diagram of an exemplary implementation of equations 14-18 is shown in
The exemplary embodiments of
A SIPO device 136 receives the binary signal 135 and de-interleaves the data signal from the timing signal. The data signal 138 and the timing signal 140 are shown at the output of the SIPO device 136.
The data samples DSn, DSn+1, DSn+2, . . . of the data signal 138, and the timing samples are TSn, TSn+1, TSn+2, . . . of the timing signal 140 are used by a timing recovery circuit such that the data samples are aligned in the middle of the eye and the timing samples are aligned with the zero-crossing transitions between baud intervals. The data samples and the timing samples at the output to the SIPO device 136 have a value of either “+1” or “−1”.
The data samples 138 and the timing samples 140 are provided to a timing error detector 142, which provides an output signal 143 to a loop filter 144. The loop filter 144 outputs a control signal 145 that controls the timing of a sample clock 146; the sample clock 146 controls the 1-bit slicer 134 in terms of the frequency at which the 1-bit slicer 134 samples the received signal 130 and at which portion of a symbol the analog to digital conversion is effected by the 1-bit slicer 134.
Additionally, the SerDes receiver 126 comprises a slicer 150 set to output utility lower samples (ULn) and a slicer 152 set to output utility upper samples (UUn). The threshold level of the slicer 150 and of the slicer 152 are adjustable. For example, the slicer 150 can be set to output a value of “1” when the signal at the input of the slicer 150 has a value greater than a first threshold value, and a value of “0” otherwise; the slicer 152 can be set to output a value of “1” when the signal at the input of the slicer 152 has a value greater than a second threshold value, and a value of “0” otherwise.
Further, the slicers 150 and 152 are operationally connected to the sample clock 146, which causes the slicers 150 and 152 to sample the equalized signal 132 at a frequency equal to that of the baud rate of the equalized received analog signal 130. A time delay module 148 controls where, with respect to the bits of the received analog signal 130, the sampling is effected. The slicers 150 and 152 can also be referred to as sampling means or as additional sampling means.
An example of the sampling of the equalized signal 132 with the 1-bit slicers 150 and 152 is shown at
In the case of
εTS={1−2·[(UUn∩TSn)∪(ULn∩not(TSn))]}·xnor(DSn,DSn+1) (19)
As an example, if UUn and TSn are equal to “1” or, if ULn=1 and TSn=0 (not(TSn)=1), εTS will be equal to −1, assuming that DSn and DSn+1 have the same value. However, if either one of UUn or TSn is equal to “0” and if ULn=0 or not(TSn)=0, then εTS will be equal to “+1”, again, assuming that DSn and DSn+1 have the same value. In any case, if DSn and DSn+1 have different values, εTS will be equal to zero. Table 1 shows εTS for different combinations of UUn, TSn, ULn, not(TSn), DSn, and DSn+1. Table 1 recognizes that the only valid combinations of (UUn, TSn, ULn) are {000, 001, 011, 111}. Other combinations are possible only when the threshold voltages are defined such that the condition VUU>VTS>VUL is not satisfied. For invalid codes, it is optional to implement circuitry to detect these conditions and force the error term εTS to a zero value.
The error calculation module 154 provides the error on the timing signal to an adapt module 155, which controls the AFIR 128.
If, instead of having the time delay module 148 is set to have the slicer 150 and the slicer 152 sample the equalized signal 132 coincidently with the slicer 134 sampling the equalized signal 132 to output a timing sample, as shown at
εDS={1−2·[(UUn∩DSn)∪(ULn∩not(DSn))]} (20)
Table 2 shows εDS for different combinations of UUn, ULn, DSn, and not(DSn). Table 2 recognizes that the only valid combinations of (UUn, DSn, ULn) are {000, 001, 011, 111}. Other combinations are possible only when the threshold voltages are defined such that the condition VUU>VDS>VUL is not satisfied. For invalid codes, it is optional to implement circuitry to detect these conditions and force the error term εDS to a zero value.
The computation of the timing sample error and of the data sample error defined at equations 19 and 20 use standard Boolean notation. The terms inside the square brackets, [ ], yield Boolean values that are then converted to unit amplitude signed values. The multiplication by the xnor( ) term preserves the value or forces to zero. It is important to emphasize that the UU samples used in computing of εTS have the timing alignment illustrated in
The adapt module 155 controls the AFIR 128 to equalize the received analog signal 130. When only the timing signal error term is considered, i.e., in the case of the non-zero-crossing criterion related to the SerDes receiver 126 of
Pre′=Pre+μTS·εTS·DSn+2 (21)
Curs′=Curs+μTS·εTS·DSn (22)
Post′=Post+μTS·εTS·DSn−1 (23)
Equations 21, 22, and 23 assume that the AFIR 128 is a 3-tap FIR with baud spacing.
When only the data signal error term is considered, i.e., in the case of the eye-center criterion related to the SerDes receiver 156 of
Pre′=Pre+μDS·εDS·DSn+1 (24)
Curs′=Curs+μDS·εDS·DSn (25)
Post′=Post+μDS·εDS·DSn−1 (26)
Equations 24, 25, and 26 assume that the AFIR 128 is a 3-tap FIR with baud spacing.
When both the data signal error term and the timing signal error term are considered, the adapt module 155 controls the AFIR 128 in accordance with:
Pre′=Pre+μTS·εTS·DSn+2+μDS·εDS·DSn+1 (27)
Curs′=Curs+μTS·εTS·DSn+1+μDS·εDS·DSn+1 (28)
Post′=Post+μTS·εTS·DSn−1+μDS·εDS·DSn−1 (29)
The terms μTS and μDS are non-negative scalars, having a value typically less than 1, that control the adaptation. When set to zero, they remove that criterion from adaptation. When set to small positive values such as 1/32 or 1/64, they include that criterion in the adaptation of the AFIR 128.
A block diagram of an exemplary implementation of equations 21, 22, and 23 is shown at
In the embodiment of
The present disclosure provides details on ADC and slicer based NRZ SerDes receivers, with variations for baud-spaced versus fractional-spaced FIR EQs and Analog versus Digital FIR EQs.
The present disclosure is also applicable to multi-level SerDes signaling schemes such as PAM-4 (4-level Pulse Amplitude Modulation). The computation of the error terms εDS and εTS will need to be generalized but this should be relatively simple for someone knowledgeable in the art based on the inventive description herein. This applies to both ADC and slicer based receivers. For slicer based receivers, additional alterations will be required for the Adapt block to convert the slicer bit pattern to a numerical value representing the received symbol (e.g., +/−1, +/−3 for PAM-4).
The present disclosure is presented in the context of a serialized architecture. At very high SerDes data rates, such as above 1 GHz for example, it is often necessary to implement the receiver in a parallel manner to simultaneously process multiple baud periods. The scope of the present disclosure includes such parallel implementations.
Examples of the present disclosure describe updating all of the available EQ coefficients. In some cases, it may be desirable to fix some of the EQ coefficients at specific values and use the corresponding update equations to adjust other circuit parameters. For example, the cursor tap coefficient can be fixed at a unit value and the update equation used to adjust the gain setting of a variable gain amplifier in the signal path.
Examples of the present disclosure show the adaptation of an equalizer located within a receiver. It is equally possible to adapt an equalizer located within the sending transmitter. There will likely be increased adaptation loop latency in this case which must be managed, but this is common knowledge to those in the art. An exemplary design of a receiver that adapts a feed forward equalizer (FFE) of an upstream Transmitter is shown in
Returning to
Again with reference to
Referring yet again to
Examples of the present disclosure show the combination of center eye adaptation criterion and non-zero-crossing adaptation criterion. This is not restrictive and numerous other criteria may be included in the adaptation process without departing from the scope of the present disclosure.
Examples of the present disclosure assume a sampling rate of twice the signal baud rate. This is the minimum sample rate. Higher sample rates can easily be accommodated, as will be understood by the skilled worker.
This present disclosure provides an improved method and apparatus for adapting inter-symbol interference compensating equalizers in a SerDes receiver. The improved adaptation provides increased tolerance to other jitter sources and is more robust in the presence of strong timing impairments. Advantageously, the present disclosure provides better jitter performance with less complex and lower power SerDes architectures.
In some embodiments of the present disclosure for high speed serdes receivers, it is possible to incorporate the computation of the error terms and the adaptation of the EQ filter taps in RTL (Register Transfer Level) cast in a standard CMOS silicon device. The adaptation portion can be part of a larger adaptation engine that implements the adaptation of several components in a round-robin fashion, or it can be separate and dedicated for each and every SerDes receiver. A state machine to orchestrate the adaptation procedure can also be implemented within RTL.
In other embodiments can have the error computation and filter tap adaptation performed by a firmware based processor using data captured by the SerDes. This processor could be incorporated within the same device as the SerDes receiver or could be off-chip. It is further possible that the computation burden can be shared by RTL and firmware based processing.
In the preceding description, for purposes of explanation, numerous details are set forth in order to provide a thorough understanding of the embodiments. However, it will be apparent to one skilled in the art that these specific details are not required. In other instances, well-known electrical structures and circuits are shown in block diagram form in order not to obscure the understanding. For example, specific details are not provided as to whether the embodiments described herein are implemented as a software routine, hardware circuit, firmware, or a combination thereof.
Embodiments of the disclosure can be represented as a computer program product stored in a machine-readable medium (also referred to as a computer-readable medium, a processor-readable medium, or a computer usable medium having a computer-readable program code embodied therein). The machine-readable medium can be any suitable tangible, non-transitory medium, including magnetic, optical, or electrical storage medium including a diskette, compact disk read only memory (CD-ROM), memory device (volatile or non-volatile), or similar storage mechanism. The machine-readable medium can contain various sets of instructions, code sequences, configuration information, or other data, which, when executed, cause a processor to perform steps in a method according to an embodiment of the disclosure. Those of ordinary skill in the art will appreciate that other instructions and operations necessary to implement the described implementations can also be stored on the machine-readable medium. The instructions stored on the machine-readable medium can be executed by a processor or other suitable processing device, and can interface with circuitry to perform the described tasks.
The above-described embodiments are intended to be examples only. Alterations, modifications and variations can be effected to the particular embodiments by those of skill in the art without departing from the scope, which is defined solely by the claims appended hereto.
Number | Name | Date | Kind |
---|---|---|---|
8243782 | Mobin et al. | Aug 2012 | B2 |
8428113 | Katic et al. | Apr 2013 | B1 |
20020027963 | Imanaka et al. | Mar 2002 | A1 |
20080049350 | Bruner et al. | Feb 2008 | A1 |
20090304064 | Liu et al. | Dec 2009 | A1 |
20100008414 | Lee et al. | Jan 2010 | A1 |
20100177816 | Malipatil et al. | Jul 2010 | A1 |
20100329319 | Dai et al. | Dec 2010 | A1 |
20100329322 | Mobin et al. | Dec 2010 | A1 |
20120076508 | Mezer et al. | Mar 2012 | A1 |
20120269305 | Hogeboom | Oct 2012 | A1 |
20130101000 | Warke et al. | Apr 2013 | A1 |
20130202022 | Cai | Aug 2013 | A1 |
20130287088 | Mobin et al. | Oct 2013 | A1 |
Entry |
---|
USPTO office action dated Sep. 5, 2014, U.S. Appl. No. 13/957,852, 8 pages. |
Cox et al., “Information technology—Serial Attached SCSI-3 (SAS-3)”, Working Draft—American National Standard—Project T10/BSR INCITS 519, American National Standards Institute (ANSI), Nov. 7, 2013, 340 pages, Global Engineering Documents, an IHS Company, Englewood, CO. |
Eshet et al., “An Adaptive 4-Tap Analog FIR Equalizer for 10-Gb/s Over Backplane Serial Link Receiver”, Solid-State Circuits Conference, Sep. 15-19, 2008, pp. 178-181, Edinburgh. |
Ungerboeck, “Fractional Tap-Spacing Equalizer and Consequences for Clock Recovery”, IEEE Transactions on Communications, Aug. 1976, pp. 856-864, vol. COM-24, No. 8. |
Carusone, “An Equalizer Adaptation Algorithm to Reduce Jitter in Binary Receivers”, IEEE Transactions Circuits & Systems II, Sep. 2006, vol. 53, No. 9, pp. 807-811. |
Wong et al., “Modified LMS Adaptation Algorithm for a Discrete-Time Edge Equalizer of Serial I/O”, IEEE Asian Solid-State Circuits Conference (ASSCC), Nov. 13-15, 2006, pp. 387-390. |
Toifl et al., “Low-Complexity Adaptive Equalization for High-Speed Chip-to-Chip Communication Paths by Zero-Forcing of Jitter Components”, IEEE Transactions on Communications, Sep. 2006, vol. 54, No. 9, pp. 1554-1557. |
Brunn, “Edge-equalized NRZ”, Xilinx [Online]. Available: http://www.ieee802.org/3/ap/public/jul04/ and dated Jul. 9, 2004 as specific document http://www.ieee802.org/3/ap/public/jul04/brunn—01—0704.pdf, 11 pages. |
Boyd et al., “Common Electrical I/O (CEI)—Electrical and Jitter Interoperability agreements for 6G+ bps, 11G+ bps and 25G+ bps I/O”, Optical Internetworking Forum (O1F), OIF-CEI-03.0, Sep. 1, 2011, 242 pages. |
Cox et al., “Serial Attached SCSI-3 (SAS-3)”, American National Standards Institute (ANSI) Project T10/2212-D, Jan. 31, 2013, 325 pages. |
Gardner, “A BPSK/QPSK Timing-Error Detector for Sampled Receivers”, IEEE Transactions on Communications, May 1986, vol. COM-34, No. 5, pp. 423-429. |
U.S. Appl. No. 13/957,852, Office Action Issued dated Sep. 5, 2014, 8 pages. |
U.S. Appl. No. 13/957,852, Notice of Allowance dated Jan. 22, 2015, 11 pages. |