Clock and data recovery method and apparatus

Abstract

A method of processing a serial data stream carrying data at a rate established by an underlying clock signal, the method involving: time-stamping each of the transitions of a sequence of transitions within the serial data stream to thereby generate a sequence of time-stamps; and based at least in part on the sequence of time-stamps, recovering the data from the serial data stream.

Description

TECHNICAL FIELD

[0002] This invention relates to methods and apparatus for recovering clock and data information from a serial data stream.

BACKGROUND OF THE INVENTION

[0003] Electronics devices contain many interfaces which transfer data serially. Some examples are USB, Ethernet, Firewire and Rambus. These interfaces have high bit rates which must be captured reliably at the receiver. Most receivers generate a clock at the serial bit rate to sample the serial data before decoding. To do this they typically use a phase-locked loop (PLL) circuit to find the clock signal within the received serial data. Then, they clock the received serial data into a shift register using a synchronized clock which is at the serial bit rate but offset in phase from the serial data transitions so as to sample the serial data when it is stable. Sampled serial data above a preselected threshold value is a one and sampled serial data that is below that threshold value is a zero.

[0004] This method works well at low bit frequencies, such as less than 100 MHz, since accumulated timing errors will still generate a clock edge near the correct time. At frequencies higher than 100 MHz, variation in the timing of the serial sampling clock, from process, temperature or voltage changes, can cause incorrect sampling of the data.

SUMMARY OF THE INVENTION

[0005] In general, in one aspect the invention features a method of processing a serial data stream carrying data at a rate established by an underlying clock signal. The method involves: time-stamping each of the transitions of a sequence of transitions within the serial data stream to thereby generate a sequence of time-stamps; and based at least in part on the sequence of time-stamps, recovering the data from the serial data stream.

[0006] Other embodiments include one or more of the following features. The method also involves generating a plurality of oscillatory signals that are the same frequency and are separated in phase by substantially equal amounts, and time-stamping of each of the transitions of the sequence of transitions within the serial data stream involves capturing the state of said plurality of oscillatory signals at the time of that transition. The method also includes supplying a reference clock signal; and time-stamping each of the transitions of a sequence of transitions within the reference clock signal to thereby generate a second sequence of time-stamps, wherein recovering the underlying clock signal and the data is based on both the first-mentioned sequence of time-stamps and the second sequence of time-stamps. The method additionally includes generating a plurality of oscillatory signals that are the same frequency and are separated in phase by substantially equal amounts, wherein time-stamping of each of the transitions of the sequence of transitions within the serial data stream involves capturing the state of said plurality of oscillatory signals at the time of that transition. Also, time-stamping of each of the transitions of the sequence of transitions within the reference clock involves capturing the state of said plurality of oscillatory signals at the time of that transition. The method further inclues generating a lap count which is a count of the number of times that a particular one of the plurality of oscillatory signal has gone through a complete cycle. The capturing of the state of the plurality of oscillatory signals at each of the transitions of the sequence of transitions within the serial data stream involves capturing the value of each of the plurality of oscillatory signals and the lap count at the time of that transition.

[0007] Further features found in other embodiments also include the following. The method also includes parallelizing the recovered data from the serial data stream. The parallelizing of the recovered data from the serial data stream involves clocking the recovered serial data into a shift register and outputting the clocked-in recovered data in parallel in groups of n bits where n is an integer greater than one. The recovering of the data from the serial data steam involves, based at least in part on the sequence of time-stamps for the sequence of transitions within the serial data stream, synthesizing the underlying clock signal and using the synthesized clock signal to recover the data from the serial data stream.

[0008] In general, in another aspect, the invention features a circuit for processing a serial data stream carrying data at a rate established by an underlying clock signal. The circuit includes: a free-running loop oscillator; a serial data stream capture module which during operation receives the serial data stream and for each of the transitions of the sequence of transitions captures a corresponding state of the free-running loop oscillator as a time-stamp of that transition; and a data recovery module which during operation recovers the data within the serial data steam based, at least in part, on the captured state for the sequence of transitions, said data recovery module including a processor component which analyzes the captured state for the sequence of transitions.

[0009] Other embodiments include one or more of the following features. The circuit also includes a reference clock capture module which during operation receives a reference clock that is a sequence of reference clock transitions and which for each of the reference clock transitions of the sequence of reference clock transitions captures a state of the free-running loop oscillator, wherein the processing module uses the captured state for the sequence of reference clock transitions along with the captured state for the sequence of transitions within the serial data stream to recover the data within the serial data stream. The data recovery module also includes a shift register arranged to receive the serial data stream and output parallel data, and a clock generator that generates a synthesized clock for the shift register in response to instructions received from the processor component. The circuit further includes a synthesized clock capture module which during operation receives the synthesized clock and for each of the transitions of the sequence of synthesized clock transitions captures a state of the free-running loop oscillator, wherein the data recovery module uses the captured state for the sequence of synthesized clock transitions to correct for undesired changes in the synthesized clock. The data recovery module additionally includes a second shift register arranged to receive a second the serial data stream and output corresponding parallel data, and a delay element which introduces a predetermined phase shift into the synthesized clock and provides the phase-shifted synthesized clock to the second shift register. The free-running loop oscillator includes a plurality of buffer stages connected in series to form a loop, wherein each of the buffer stages of the plurality of buffer stages introduces a substantially equal amount of delay into a signal which circulates around the loop when it is oscillating; and the oscillator also includes a plurality of taps each of which is associated with a different one of the buffer stages and outputs a signal that indicates the state of that buffer.

[0010] The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

[0011] FIG. 1 is a block diagram of a clock and data recovery circuit that uses a free-running loop oscillator.

[0012] FIG. 2 is a schematic diagram of a free-running loop oscillator.

[0013] FIG. 3A is a more detailed circuit diagram of the free-running loop that provides the differential tap signals to the capture module of FIG. 3.

[0014] FIG. 3B is a circuit diagram of a buffer stage that is used in the circuit of FIG. 3A.

[0015] FIG. 3C is a circuit diagram of the NAND gate that is used in the buffer stage of FIG. 3B.

[0016] FIG. 4 is a circuit diagram of the capture module.

[0017] FIGS. 5A-C illustrate the operation of the capture module shown in FIG. 3.

[0018] FIG. 6 is a block diagram of another clock and data recovery circuit that uses a free-running loop oscillator.

[0019] Note that the same reference numbers are used in different drawings to indicate that the identified components are the same or similar.

DETAILED DESCRIPTION

[0020] Two approaches to receiving high-speed serial data are described. Both approaches employ the free-running loop (FRL) technology described in U.S. Pat. No. 6,377,094, issued Apr. 23, 2002, entitled “Arbitrary Waveform Synthesizer Using a Free Running Oscillator;” and in U.S. Pat. No. 5,793,709, issued Aug. 11, 1998, entitled “Free Loop Interval Timer and Modulator,” both of which are incorporated herein by reference. The first approach generates a sampling clock using the free-running loop technology. The second approach uses the free-running loop technology to time-stamp transitions in the serial data and then decodes the data from the time-stamps. Both of the approaches can be extended to receive multiple simultaneous serial signals such as are used in PCI express.

[0021] A Clock and Data Recovery Circuit: Overview

[0022] Referring to FIG. 1, a first embodiment of a clock and data recovery circuit 10 includes a free-running loop oscillator 12 that generates an array of output signals 13 for time-stamping another signal and for generating a desired clock waveform. The free-running loop is a sequence of buffers connected in series with output taps between the buffers. The buffers function as delay elements which introduce an unknown but small amount of delay in a transition signal passing through each buffer. The buffers are connected in a closed loop so a transition signal (or change of state) that is propagating through the sequence of buffers feeds back to the beginning of the loop causing the transition signal to circulate continually around the loop. The free-running loop also includes a counter that keeps track of how many times the transition signal has made a complete circuit around the loop. So, at any point in time, the state of the buffers within the loop indicates the location of the transition signal. That location plus the lap count indicates how far the signal has traveled since the last time the state of the free-running loop was measured. Thus, the lap count plus the state of the buffers, which is obtainable by reading the signals on the taps, provides a convenient measure of time. Time-stamping involves capturing that information upon the occurrence of an event, such as a transition of a clock signal or data signal, to mark when that even occurred.

[0023] Clock and data recovery circuit 10 includes three capture modules 14, 16 and 18, each of which receives the output signal from free-running loop 12 (i.e., the signals on the array of taps plus the lap counter). Each capture module 14, 16, and 18 responds to a different input signal received over an associated input line. The input signals are the signals that are to be time-stamped by the capture module. Each time the respective input signal undergoes a transition that causes the capture module to capture the state of the free-running loop as a time-stamp of that transition. So, in response to receiving a sequence of transitions, the capture module outputs a stream of time-stamps for the transitions within that sequence.

[0024] Each of capture modules 14, 16 and 18 delivers its generated sequence of time-stamps to a clock generator algebra module 20. In general, clock generator algebra module 20, which is a programmed processing-based module (e.g. state machine or microprocessor), analyzes the multiple received streams of time-stamps so as to identify the clock signal within the serial data stream and then it causes a clock generator 22 to generate a clock signal 24 that is synchronized with the serial data stream. It also uses the received time stamps to monitor the stability of the generated clock signal 24 and to change the generated clock signal to compensate for changes in performance of clock generator 22 due to changes in supply voltages, temperature, and other environmental parameters.

[0025] Capture module 14 provides information for calibrating the free-running clock. It receives as its input a stable reference clock 9, the period of which is precisely known. In response to the reference clock, capture module 14 generates a stream of time-stamps from which the time spacing between the taps on the free-running loop can be accurately computed by a loop-averaging module 15 (not shown) within clock generator algebra module 20. In essence, loop averaging module 15 takes time-stamps for two successive positive transitions in the reference signal, computes the difference of those two time-stamps, and divides the computed difference into the known period of the reference clock. The result is an accurate measure of the spacing between the taps in terms of the time it takes for the transition to move from one tap to the next tap (i.e., time per tap).

[0026] Alternatively, the computation of the spacing of the taps can be avoided if the user knows the frequency of the clock that needs to be synthesized and provides that information to the algebra module. Thus, the number of taps that separate the transitions in the synthesized clock can be simply specified as the number of taps separating transitions in the reference clock times the ratio of the frequency of the synthesized clock to the frequency of the reference clock. If that ratio proves not to be precisely accurate, the algebra module can make appropriate adjustments during operation.

[0027] Capture module 16 provides information about the serial data stream for which clock and data recovery is being performed. More precisely, it time-stamps the detected transitions in the serial data signal. Clock generator algebra module 20 then uses this information, along with the input from capture module 14, to compute the timing of the transitions that would be required to construct a synthesized clock signal that is synchronized with the clock signal within the serial data stream and appropriately phase-shifted so as to accurately sample the data within the serial data stream. Based on the computed timing information, algebra module 20 causes clock generator 22 to select the appropriate transitions being output by free-running loop 12 and thereby construct synthesized clock 24 for the serial data stream.

[0028] This synthesized clock 24 is supplied to a shift register 30 where it clocks the data from the serial data stream into the register. Shift register 30 outputs the stored data as parallel data (i.e., groups of n bits wherein n might be 2, 4, 8, 16, or more bits) and also provides a parallel clock signal for that data.

[0029] With the synthesized clock there may be temperature and voltage variability that cannot be known in advance. This variability might be due to changes in the performance of the circuits as a result of changes in those parameters (i.e., PVT). Because such variability typically cannot be predicted in advance, algebra module 20 cannot pre-compute compensation for it. So, to eliminate timing errors caused by such changes, capture module 18 time-stamps the synthesized clock and provides that information to algebra module 20. By comparing these time-stamps with the expected timing of the synthesized clock, algebra module 20 detects timing variations and adjusts the control of clock generator 22 accordingly. That is, algebra module 20 “knows” when the transitions should have occurred and makes adjustments in the control signals that are sent to clock generator 22 to assure that they occur when they should. By this technique, the circuit is able to tune out the effects of PVT on the back end.

[0030] There is also a CPU interface 31 provided for controlling the processing, clock generation, and filtering in the algebra block as well as for setting the programmable delay in the programmable delay unit, which is discussed later.

[0031] The modules that were introduced above will now be described in greater detail starting with the free-running loop oscillator.

[0032] The Free-Running Loop Oscillator

[0033] The basic principles of operation of the free-running loop oscillator can be understood with the aid of FIG. 2, which illustrates a simplified implementation of a free-running loop oscillator. Free-running loop oscillator 40 includes an input 42 for an external reset signal, a series of delay modules or buffers 44(0), 44(1), . . . 44(14), and 44(15) (referred to generally as 44) and at least one inverting element 46. In this example, the delay modules are of the non-inverting type so a positive transition at the input causes a position transition at the output. The reset signal has two states, namely, a reset state and a run state. While the reset signal is in the reset state, the loop does not oscillate. When the reset signal transitions to the run state, the loop begins to oscillate. A transition or change in state propagates through the first delay element module 44(0) to the input of the next delay element module 44(1). Shortly after a signal is received at the input of a delay element module, the signal is output on the corresponding tap 0.

[0034] The transition continues to propagate to the next delay element module 44(1) where it next appears on tap 1. This continues as the transition passes through each successive delay element module 44. By examining the outputs of the collection of taps at any point in time, one can tell where in the sequence the transition is located.

[0035] To create the “looping” effect, one transition is selected (e.g., from delay element module 44(14) and fed back through inverting element 46 to the input of the first delay element module 44(0). In this example, it is shown as connected between delay element modules 44(14) and 44(0), but other arrangements could be used. The object is to provide positive feedback that sustains oscillation in the loop.

[0036] The loop oscillator also includes a lap counter module 50. The lap counter module is electrically connected to first delay element module 44(0) for receiving transition edges as they propagate through delay element module 44(0). The lap counter module includes two counters, namely a positive edge counter 52(1) and a negative edge counter 52(2). Positive edge counter 52(1) counts one each time a positive edge transition (e.g. transition from logic low to high) propagates through delay element module 44(0). Negative edge counter 52(2) counts one each time a negative edge transition (e.g. transition from logic high to low) propagates through the delay element module 44(0). Thus, negative edge counter 52(2) is 180° out-of-phase with positive edge counter 52(1). Two counters are used to ensure that while one counter is being updated, other modules have access to another counter that is stable and accurate from which to determine the lap number.

[0037] It turns out that the propagation time for a positive transition is usually different from the propagation time for a negative transition. Thus, to produce more consistent propagation times around the loop it is useful to use a differential design of the type mentioned below and in which edges of both types are produced all of the time. The differential design includes an inverting element in each delay element module and provides differential outputs, one being a rising edge and the being a falling edge. This approach also produces a more uniform loading on the power supply.

[0038] Also, note that the free-running loop oscillator can alternatively be viewed as generating 16 equally spaced phases of a lower frequency clock signal. Each phase is shifted from the preceding phase by an amount that is equal to the delay between the two taps of the free-running loop.

[0039] The Capture Modules

[0040] As noted above, the capture modules capture the outputs (i.e., the state) on the taps of the free-running loop oscillator when triggered to do so. Because detecting a rising edge often tends to produce slightly different results from detecting a falling edge, each delay element module in the described embodiment of the free-running loop oscillator is actually designed to produce both a rising edge output signal and a falling edge output signal in response to the circulating transition signal. That is, each delay element module has a differential pair of output lines for outputting both types of signals. This enables the capture module to always capture a rising edge by appropriately selecting the correct line of the differential pair at each delay element module.

[0041] Referring to FIG. 3A, the free-running loop oscillator that has differential outputs includes 16 buffer stages 60 connected in a loop. Each buffer stage includes two outputs 62(1) and 62(2) which make up the differential output pair for that stage. The internal design of the buffer stage is shown in FIG. 3B using conventional symbols for the circuit elements. The internal structure of the NAND gates is shown in FIG. 3C. Note that in the free-running loop oscillator shown in FIGS. 3A-C, the edge must go through loop twice before the loop arrives back to the same condition.

[0042] The free-running loop oscillator has sixteen delay taps, each of which is spaced from the last one by a similar amount of delay. There are sixteen outputs labeled [0] . . . [15], each of which is separated from the last one by an inversion. A transition passing through the loop circuit that first appears as a rising edge on line [0] will next appear as a falling edge on line [1] and then again as a rising edge on line [2], etc. There are another sixteen outputs labeled [16] . . . [31] which output the complements of the corresponding signals on the first sixteen lines [0] . . . [15]. That is, outputs [N] and [N+16], wherein N=0 . . . 15, form differential pairs with the signal on output [N+16] being the complement of the signal on output [N]. Thus, by using the appropriately designed capture circuitry, it is possible to always detect the state of the loop by monitoring rising edge signals and thereby avoid introducing possible errors into the measurements caused by alternating between monitoring rising edge signals and falling edge signals.

[0043] In general, each capture module includes a register that uses the input signal as its clock. Upon a transition of the input (typically a positive edge transition), the register stores or “captures” the state of the free-running loop oscillator. In the described embodiment, the register stores a 16-bit data word of which 11 bits are used for the value of the lap counter and four bits are used to represent the 16 taps. These four bits are used for the state of the taps, representing the last tap that the transition propagated through at the time of the capture. One bit is used to represent the state of the transition (i.e., positive edge or negative edge) as it passed through the first delay element module. That bit is indicates whether the transition edge selected by the algebra module is a positive edge or a negative edge and needs to be inverted by the switching module when constructing the synchronized clock.

[0044] A more detailed schematic of the design of a capture module 80 that is used with the differential outputs of the free-running loop oscillator is shown in FIG. 4. Capture module 80 includes a capture register 82 made up of an array of D flip-flops to capture the signals on the differential output lines of the free-running loop oscillator. The array includes 16 D flip-flops 84 from which the non-inverted signal is selected as its output and 16 D flip-flops 86 from which the inverting output signal is selected as its output. Each of the 16 non-inverting D flip-flops receives its signal from a corresponding different one of the sixteen outputs [0] . . . [15] and each of the inverting D flip-flops receives its signal from a corresponding different one of the sixteen outputs [16] . . . [31]. For each differential pair of lines coming into the capture register, there is a corresponding pair of output lines from the capture register. Note that if the signals on a differential pair of lines are settled and stable when the capture occurs, the two outputs from the capture register corresponding to that differential pair will carry the same value.

[0045] To select the appropriate signals on the outputs of the two arrays of D flip-flops, there is an array of 16 make-before-break MUXes 88, each receiving input from a different corresponding pair of output lines form the capture register. These MUXes are controlled so as to always select the rising edge signal as the signal from which to determine the state of the free-running oscillator whenever the two output signals from the capture register are not the same. As a rule, the two input signals to a MUX will in fact be the same. At locations away from the edge within the free-running oscillator, the output signals from the oscillator will be settled and stable and the MUXes will capture them cleanly. So, at those locations along the free-running loop, it does not matter which input signal to the MUX is selected as the output signal. However, this might not be the case near an edge within the free-running loop. Because of the difference between detecting rising edges versus detecting falling edges and because of other instabilities during transitions, it is possible that the two input signals to the MUX monitoring that location of the loop will be different. So, the select line to the MUX looks ahead at signal that is half way around the loop to determine which input signal to select. The rationale is that the control signal that is half way around the loop will be stable and thus can be used to accurately determine which signal to that MUX is the rising edge signal.

[0046] The outputs of MUXes 88 provide inputs to an array of XNOR gates 90. Each XNOR gate of the array looks at the output signals from two neighboring MUXes. In essence, the array of XNOR gates in combination with the array of MUXes detect where the edge is within the free-running loop at the moment that the time-stamp is captured.

[0047] How this circuitry works can be understood with the aid of the charts shown in FIGS. 5A-C. These charts show the signals at the differential outputs for taps 0 through 6 of the free-running loop and at the outputs of the D flip-flops, the MUXes, and the XNOR gates which capture and process those output signals.

[0048] FIG. 5A shows the output signals for taps 0 through 6 of the free-running loop oscillator after a transition has passed tap 3 and before it reaches tap 4 (see location 100). The two values in the row labeled “Output” represent the signals on the differential pair of lines for that tap. So, for example, the signal at output [0] of tap 0 is “0” and the signal at output [16] of tap 0 (i.e., the other output of the differential pair for the first delay element module) is “1.” As one can see, the pattern of output signals alternates between 0-1 and 1-0 as one moves along the taps until one gets to tap 4. Since the transition has not reached tap 4, the pattern on its outputs is the same as the pattern the outputs of tap 3. But from that point on, the pattern again alternates.

[0049] In the example illustrate by FIG. 5A, the D flip-flops are clocked when the transition is at location 100 in the loop. For each pair of D flip-flops associated with a particular tap, the output signals are the same, either 1 1 or 0 0. And as one moves from one pair of D flip-flops to the next their output values alternate between 0 0 and to 1 1 until one reaches tap 4 at which the outputs of the pair of D flip-flops is the same as for the pair at the immediately preceding tap 3. Again, this follows because the transition has not yet reached tap 4.

[0050] Since both inputs to each MUXes are the same, the MUX outputs either one of those values. And the XNOR gates detect when the outputs of two neighboring MUXes are the same. In this example, that occurs for taps 3 for which the associated XNOR gate outputs a 1, indicating that the transition was at that pointing in the free-running the loop oscillator when the state f the loop was captured.

[0051] FIG. 5B shows the state of the captured outputs of the various elements after the transition has passed tap 4 but has not yet reached tap 5 (at location 102). The interpretation of the various signals is precisely as presented above in connection with FIG. 5A except that everything has advanced in time by an amount equal to the separation of the taps.

[0052] A more interesting example is presented in FIG. 5C. In this case, the transition is near tap 4 and it has affected one of the differential outputs but not the other. As noted above, this can happen because the response of the circuitry to a rising edge is often different from the response of a circuit to a falling edge (though maybe not by much). As a consequence, the outputs of the differential pair are the same (i.e., 1 1 instead of 0 1). The outputs of the pair of D flip-flops that capture those signals are different. The associated MUX selects one of these signals based on the value of the inverting D flip-flop in the capture register eight taps ahead of the current tap. This is arranged so that the signal for the rising edge is selected, which in this case is the 0 value. In general, anytime such a condition occurs at tap, the sampled signal from the tap that is in front of the tap at which the ambiguity exists will tell the MUX which value is for the rising edge value.

[0053] The outputs of the array of XNOR gates 90 are processed by debouncer logic 92 of a type that is known among persons of ordinary skill in the art. Slight differences among the D flip-flops and paths can cause “bounce”, the edge appearing to be at three (or five, in extreme cases) nearby places in the loop. This is corrected by the debouncer logic which solves the problem and picks the first edge as the “real” one.

[0054] The output signals of debouncer logic 92 are then decoded by a convert-to-element count circuit 94 to generate a binary representation of the time-stamp which is in units of delay elements.

[0055] Clock Generator Algebra Module

[0056] Clock generator algebra module 20 is a data processing module which is implemented by one or more programmed digital processors. Algebra module 20 receives the external reference clock signal 9 and the sequences of time-stamps from capture modules 14, 16, and 18. Using these inputs, clock generator algebra module 20, based on programmed settings, analyzes the streams and computes what the frequency and phase of the synthesized clock should to be. It also calculates which of the transitions that will be generated by the free-running loop oscillator will need to be selected (by lap and tap location) to construct the synthesized clock. And it computes what changes need to be made to the selection of transition edges to compensate for drift and other changes within the generator module and other internal components. To perform all of these computations, it uses techniques known to persons of ordinary skill in the art.

[0057] In the described embodiment, algebra module 20 has four channels for calculating the next two rising edges and the corresponding falling edges of the synchronized clock. By calculating four edges in parallel, algebra module 20 can operate at a faster frequency, thus allowing the output signal to be a higher frequency. Of course, more channels can be sued based upon the computational requirements of the particular application.

[0058] Indeed, given the amount of computation that algebra module 20 needs to perform to analyze the three sequences of time-stamps that it receives from capture modules 14, 16, and 18, throughput could become an issue at higher clock speeds. To handle the higher computational loads, one could more processing power in the form of a multiple processor architecture in which the computational tasks can be distributed among the multiple processors and performed in parallel. Alternatively, since not all of the time stamps from the derail data stream are needed to perform the computations that are required, one could simply ignore some of the time-stamps for the serial data stream (e.g. take every nth).

[0059] The methods described above work well for serial data streams that have little noise or jitter on the data transitions. However, many data streams to which these techniques could be applied have considerable noise and jitter. Two good examples are the serial data streams produced from reading optical data or from RF communications applications. For such applications, it will be necessary to perform some filtering of the received data to reduce the negative effects of these signal quality problems. Some of this filtering, e.g. averaging the errors between the serial time-stamps and the expected time-stamps, can be performed by clock generator algebra module 20. Filtering at this stage would also help more accurately capture loop speed versus the reference clock.

[0060] Clock Generator Module

[0061] Clock generator module 22 includes an internal switching module (not shown) to which the taps of the free-running loop are connected. It operates as described in U.S. Pat. No. 6,377,094, mentioned above. In general, algebra module 20 transmits to clock generator module 22 the calculated transition edges that need to be used to generate the synthesized clock. This transmitted information from algebra module 20 controls the operation of the internal switching module, causing it to correctly select the taps of the free-running loop oscillator to construct the synthesized clock.

[0062] Additional Circuitry

[0063] Sometimes, a sender will transmit multiple lanes of serial data, all of which need to be received and sampled. Typically, when the multiple lanes of serial data come from the same sender, they all use the same clock, except that it might be phase-shifted by some predetermined different amount for each lane. If the phase shift information can be communicated to the receiver or derived in some way, then the above-described method and circuitry can be easily extended to receive the multiple lanes of serial data by simply adding an appropriate number of shift registers 32 and programmable delay units 34. Programmable delay unit 34 receives a copy of the synthesized clock from clock generator 22, phase shifts it by the required amount, and supplies it to shift register 32 to clock in the serial data from the corresponding lane.

[0064] On the other hand, if the clocks for the other lanes are not the same or the phase shifts are not known or readily determined, then one can simply use the approach described above to recover the clock and sample the received data for each channel individually. This means replicating capture modules 16 and 18 and clock generator 22 for each additional lane of serial data that is to be received.

[0065] There is other circuitry that would be included in a complete system for receiving and sampling a serial data stream. That additional circuitry is well known to persons of ordinary skill in the art and so will not be discussed here except to point out only a few of the more relevant components.

[0066] For example, there is a circuitry that sits in front of the clock and data recovery circuit and processes the received signal before it is passed to the clock and data recovery circuit. Typically, the received signal that might, for example, come over a cable is very low voltage and does not have enough swing to clock the flip-flops in the capture circuits. So, it needs to be amplified. In addition, it is usually transmitted in another form, e.g. as a differential signal, to make it more compatible for the medium over which it is being transmitted. That forms needs to be changed to a standard binary form. The front-end circuitry is usually an analog interface that does some of this processing. It converts the received signal from its transmitted form to a standard binary form having a clean wave shape with sufficient voltage swing for the downstream circuitry. It also includes ESD (electrostatic discharge) protection circuitry, automatic gain and offset control circuitry, and prefiltering circuitry.

[0067] Typically, there will also be backend circuitry that follows the clock and data recovery circuit and provides feedback control to correct for detected errors in the binary bit stream. For example, the analog circuit in the front end that decides which sampled signals are ones and which are zeros may have an undesired offset that causes errors in that process.

[0068] In many systems, the binary data is transmitted in a form in which the number of ones and the number of zeros within a certain period of time are equal. If the back-end circuitry detects that they are not appearing in equal numbers, that may indicate an offset error in the front-end circuitry. So, the back-end circuitry adjusts the offset that is used to correct this problem. It might also detect other patterns in the sampled data that suggest other automatic adjustments need to be made.

[0069] Another Clock and Data Recovery System

[0070] In a second embodiment, illustrated in FIG. 6, all of the work is done digitally. That is, instead of generating a synthesized clock for clocking the serial data into a shift register, as was described in connection with the circuit illustrated by FIG. 1, all time-stamps for the reference clock and the serial data stream(s) are processed digitally by parallel clock generator and data decoder algebra 90 to extract the received data and whatever other information is required from the received signal. The clock is recovered, for example, by using statistical averaging of the time-stamps and the data is recovered by using other known techniques to compute the data from the time-stamps for the serial data stream and the reference clock signal.

[0071] Typically, all transitions of both polarities are captured (i.e., time-stamped). The data decoder algebra works with the parallel clock generation algebra to digitally filter the signal transition time-stamps and receive the data. Various digital filtering techniques may be used depending on the expected transition patterns in the serial input, such as time-stamp averaging and pattern recognition. The data is output through a parallel interface with the generated data clock.

[0072] There are various filtering concepts that can be used to look at the time-stamps of the received signal transitions that are “noisy.” For example, from the specifications for the serial interface, the normal time between transitions in the received signal is known, so an error can be determined for each time stamp from the ideal values. Three examples of how time errors can be processed to look for trends are as follows:

[0073] 1. If the “ideal signal” is, on average, slightly faster or slightly slower than the received signal, the ideal signal can be corrected to match the bit rates.

[0074] 2. The errors would also be analyzed for frequency modulations, for example, such as when 60 Hz AC noise is coupling into the signal. In that case, the modulation can be modeled, predicted, and removed from the time-stamps before generating the received data.

[0075] 3. If the errors show a trend where 0 to 1 transitions are either earlier or later than 1 to 0 transitions, then the received threshold voltage in the interface can be adjusted to remove this error, or this effect can be modeled, predicted, and removed.

[0076] As with the approach illustrated by FIG. 1, this circuit can be extended to support multiple serial channels by adding capture blocks 92 and additional parallel outputs 94.

[0077] The approach represented by FIG. 6 has the advantage that a high-speed clock need not be generated. Instead, only a slower speed clock for the parallel data will be necessary. Moreover, performing the functions through digital processing provides much greater potential for correcting for problems in the signal and for doing so dynamically. Thus, the approach might be particularly appropriate if the signal quality of the serial data is so poor that a correct sampling time cannot be determined, when setup and hold times for the sampling flip-flop cannot be reliably met, or when multiple interface standards must be managed by one interface.

[0078] As a practical matter, when the above-described circuitry is implemented on an integrated circuit chip, it is desirable to locate the capture modules physically close to each other so that they will tend to see the same electrical environment and will more closely share the same processes parameters. That is, it is important to make those design choices that provide greater assurance that these modules will closely track each other in performance under different operating and environmental conditions to which the chip will likely be exposed.

[0079] Other embodiments are within the following claims. For example, though we have illustrated a free-running loop oscillator that has 16 taps (for generating 16 equally spaced phases of a signal), one could use fewer taps (e.g. 4 taps) or more taps (e.g. 32 taps). The number of taps that are used are depends on how much processing one wants to do in the clock generator algebra module and how fast the lap counter is. Fewer taps requires a faster lap counter and a larger number of taps requires greater processing power.

[0080] In addition, the methods and circuits described herein can be used for a wide variety of different applications that require clock and data recovery from serial data streams, including applications that involve the processing serial data from optical storage or from RF communications, both of which were mentioned above.

Claims

1. A method of processing a serial data stream carrying data at a rate established by an underlying clock signal, said method comprising: time-stamping each of the transitions of a sequence of transitions within the serial data stream to thereby generate a sequence of time-stamps; and based at least in part on the sequence of time-stamps, recovering the data from the serial data stream.

2. The method of claim 1, further comprising generating a plurality of oscillatory signals that are the same frequency and are separated in phase by substantially equal amounts, wherein time-stamping of each of the transitions of the sequence of transitions within the serial data stream involves capturing the state of said plurality of oscillatory signals at the time of that transition.

3. The method of claim 1, further comprising: supplying a reference clock signal; and time-stamping each of the transitions of a sequence of transitions within the reference clock signal to thereby generate a second sequence of time-stamps, wherein recovering the underlying clock signal and the data is based on both the first-mentioned sequence of time-stamps and the second sequence of time-stamps.

4. The method of claim 3 further comprising generating a plurality of oscillatory signals that are the same frequency and are separated in phase by substantially equal amounts, wherein time-stamping of each of the transitions of the sequence of transitions within the serial data stream involves capturing the state of said plurality of oscillatory signals at the time of that transition.

5. The method of claim 4, wherein time-stamping of each of the transitions of the sequence of transitions within the reference clock involves capturing the state of said plurality of oscillatory signals at the time of that transition.

6. The method of claim 4 further comprising generating a lap count which is a count of the number of times that a particular one of the plurality of oscillatory signal has gone through a complete cycle.

7. The method of claim 6 wherein capturing the state of said plurality of oscillatory signals at each of the transitions of the sequence of transitions within the serial data stream also involves capturing the value of each of the plurality of oscillatory signals at the time of that transition.

8. The method of claim 7 wherein capturing the state of said plurality of oscillatory signals at each of the transitions of the sequence of transitions within the serial data stream also involves capturing the lap count at the time of that transition.

9. The method of claim 1 further comprising parallelizing the recovered data from the serial data stream.

10. The method of claim 9 wherein parallelizing the recovered data from the serial data stream involves clocking the recovered serial data into a shift register and outputting the clocked-in recovered data in parallel in groups of n bits where n is an integer greater than one.

11. The method of claim 1 wherein recovering the data from the serial data steam involves, based at least in part on the sequence of time-stamps for the sequence of transitions within the serial data stream, synthesizing the underlying clock signal and using the synthesized clock signal to recover the data from the serial data stream.

12. A circuit for processing a serial data stream carrying data at a rate established by an underlying clock signal, said serial data stream including a sequence of transitions at locations in time determined by the underlying clock signal and data within the serial data stream, said circuit comprising: a free-running loop oscillator; a serial data stream capture module which during operation receives the serial data stream and for each of the transitions of the sequence of transitions captures a corresponding state of the free-running loop oscillator as a time-stamp of that transition; and a data recovery module which during operation recovers the data within the serial data steam based, at least in part, on the captured state for the sequence of transitions, said data recovery module including a processor component which analyzes the captured state for the sequence of transitions.

13. The circuit of claim 12 further comprising a reference clock capture module which during operation receives a reference clock that is a sequence of reference clock transitions and which for each of the reference clock transitions of the sequence of reference clock transitions captures a state of the free-running loop oscillator, wherein the processing module uses the captured state for the sequence of reference clock transitions along with the captured state for the sequence of transitions within the serial data stream to recover the data within the serial data stream.

14. The circuit of claim 13 wherein the data recovery module further comprises a shift register arranged to receive the serial data stream and output parallel data, and a clock generator that generates a synthesized clock for the shift register in response to instructions received from the processor component.

15. The circuit of claim 14 wherein the synthesized clock is a sequence of synthesized clock transitions, said circuit further comprising a synthesized clock capture module which during operation receives the synthesized clock and for each of the transitions of the sequence of synthesized clock transitions captures a state of the free-running loop oscillator, wherein the data recovery module uses the captured state for the sequence of synthesized clock transitions to correct for undesired changes in the synthesized clock.

16. The circuit of claim 14 wherein the data recovery module further comprises a second shift register arranged to receive a second the serial data stream and output corresponding parallel data, and a delay element which introduces a predetermined phase shift into the synthesized clock and provides the phase-shifted synthesized clock to the second shift register.

17. The circuit of claim 12 wherein the free-running loop oscillator comprises a plurality of buffer stages connected in series to form a loop, wherein each of the buffer stages of the plurality of buffer stages introduces a substantially equal amount of delay into a signal which circulates around the loop when it is oscillating, said oscillator further comprising a plurality of taps each of which is associated with a different one of the buffer stages and outputs a signal that indicates the state of that buffer.