This invention relates to circuitry and methods for detecting transitions or edges in a time-varying signal such as a serial data signal. Such edge detection may also be referred to as determining the phase of the time-varying signal (or the phase of the edges in that signal). Edge detection may be used to determine where the edge-detected signal can best be sampled to reliably recover data from that signal (e.g., by avoiding sampling in the vicinity of edges where the signal may be changing in level and therefore not stable enough for reliable sampling).
Prior Wortman et al. U.S. patent application Ser. No. 10/722,665, filed Nov. 26, 2003 (which is hereby incorporated by reference herein in its entirety) shows circuitry for determining the phase of a serial data signal so that an advantageous phase selection can be made for the clock signal that will be used to sample that signal for data recovery. The circuitry in the above-mentioned application employs circuitry for storing and recirculating data bits of a training pattern. There may be some applications in which it is desirable to avoid a need for such training-pattern-handling circuitry.
In accordance with the present invention, the phase of transitions in a time-varying signal (generally referred to for convenience herein as a serial data signal) can be detected by using a clock signal to time the taking of samples of the data signal at the rate of data bits in the data signal. The phase of the clock signal is periodically changed so that a plurality of different clock signal phases are used one after another. Any phase of the clock signal that causes successive data signal samples to have a relationship to one another that is not as expected for samples of two successive bits in the data signal is identified as being a phase that is at or near the phase of the data signal. If it is desired to select a clock signal phase that will be advantageous for subsequent sampling of the data signal to recover data from it, that can be a phase that was not identified as described in the preceding sentence, but that is between phases that were identified as described in the preceding sentence.
Double data rate (“DDR”) circuitry refers to circuitry for handling a data signal having a data bit rate that is twice the frequency of a clock signal used in that circuitry. The present invention is not limited to use in or with DDR circuitry, but DDR circuitry can be a convenient context in which to implement the invention. Thus circuitry in accordance with the invention for detecting phase of edges in a serial data signal may include DDR circuitry for normally capturing samples of two successive bits in each of a plurality of successive pairs of bits in the data signal. The DDR circuitry operates to capture the samples in synchronism with a clock signal. The circuitry may further include circuitry for causing the clock signal to have changing phase. And the circuitry may still further include circuitry for detecting any phase of the clock signal that causes two successive samples captured by the DDR circuitry to not have a normal relationship to one another (i.e., the relationship expected for the two bits in one of the bit pairs in the data signal).
Further features of the invention, its nature and various advantages will be more apparent from the accompanying drawings and the following detailed description.
An illustrative embodiment of edge detection circuitry 500 in accordance with this invention is shown in
The CLOCK signal in
Initially there is no particular or necessary phase relationship or alignment between DATAIN and CLOCK, and indeed during any training period of operation of the circuitry the phase of CLOCK changes over time in accordance with this invention. An object of the invention is to use CLOCK with progressively different phases to detect edges (transitions) in DATAIN, and thereafter to select a final phase for CLOCK that will avoid sampling DATAIN too close to its transitions (e.g., preferably near the center of UIs in DATAIN).
DATAIN is applied to DDIO flip-flops 510 and 520. Flip-flop 510 is clocked by CLOCK. Flip-flop 510 therefore samples DATAIN at each rising edge in CLOCK. Flip-flop 520 is clocked by the inverse of CLOCK. Flip-flop 520 therefore samples DATAIN at each falling edge in CLOCK. Because the bit rate of DATAIN is twice the CLOCK rate, flip-flops 510 and 520 collectively act to demultiplex successive pairs of bits in DATAIN. For example, if successive bits in DATAIN are identified as A, B, C, D, E, F, etc., with the successive bit pairs being A/B, C/D, E/F, etc., the output of flip-flop 520 may be A, C, E, etc., and the output of flip-flop 510 may be B, D, F, etc.
The output signal of flip-flop 510 is applied to D flip-flop 512 and to one input terminal of multiplexer 514 (in particular the input of multiplexer 514 that is selected when the output signal of T flip-flop 540 is 0). Flip-flop 512 is also clocked by CLOCK. The output signal of flip-flop 512 is applied to the other input terminal of multiplexer 514 (i.e., the input that is selected when the output of flip-flop 540 is 1). The output signal of multiplexer 514 is applied to D flip-flop 516 (also clocked by CLOCK). The output signal of flip-flop 516 is applied to one input terminal of multiplexer 518, and also to one input terminal of EXCLUSIVE OR (“XOR”) gate 530. The multiplexer 518 input terminal just mentioned is the one selected when the output signal of flip-flop 540 is 0. A further destination of the output signal of flip-flop 516 is one input terminal of multiplexer 528 (i.e., the input terminal of that multiplexer that is selected when the output signal of flip-flop 540 is 1).
The output signal of flip-flop 520 is applied to D flip-flop 526, also clocked by CLOCK. The output signal of flip-flop 526 is applied to one input terminal of multiplexer 528, and also to the second input terminal of XOR gate 530. The multiplexer 528 input terminal just mentioned is the one selected when the output signal of flip-flop 540 is 0. A further destination of the output signal of flip-flop 526 is the input of multiplexer 518 that is selected when the output signal of flip-flop 540 is 1.
The output signal of XOR gate 530 is the data input to flip-flop 540 (when AND gate 532 is enabled by the ENABLE signal). Flip-flop 540 is a toggle-type flip-flop. Accordingly, flip-flop 540 changes state in response to each CLOCK signal rising edge if and only if its data input is then 1.
When circuitry 500 first begins to operate (in what may be called “training mode”), flip-flop 540 is reset to 0. CLOCK is selected to be the “candidate” clock signal that has the lowest or smallest phase angle of several differently phased “candidate” clock signals. (The manner in which such differently phased clock signals can be provided is described in more detail later in this specification.) At this time the DATAIN signal is training data as described above. Flip-flops 510 and 520 begin to demultiplex successive bits in DATAIN. For ease of explanation it will be assumed that transitions in CLOCK are not too close to transitions in DATAIN at this time. The initial demultiplexing performed by flip-flops 510 and 520 may cause flip-flops 516 and 526 to both, concurrently, register 1s or 0s from the demultiplexed data. For example, if circuitry 500 starts operating as shown in
Another possible condition in which circuitry 500 may start up is shown in
The effect of the operations described in the two preceding sentences is that if the demultiplexing performed by flip-flops 510 and 520 is not initially aligned with pairs 601, 602, 603, etc. of training bits, in DATAIN that are of equal value, the first comparison of unequal samples brings flip-flop 512 into active use so that thereafter the comparisons performed by XOR gate 530 will be of equal-valued samples.
The discussion thus far has related to achieving proper alignment of the pairs of samples of DATAIN that are compared by XOR gate 530 during each successive cycle of CLOCK. These sample pairs 601, 602, 603, 604, 605, etc. are either initially properly aligned as shown in
Circuitry 500 operates with each of several different candidate clock signals as CLOCK during successive periods of time. All of the candidate clock signals have the same frequency, which is half the DATAIN data rate (e.g., as shown in
Circuitry 500 continues to operate with CLOCK having progressively greater phase until a condition like that illustrated by
After all of the candidate clock signals have been used in turn for CLOCK, the accumulated data about which of those candidate clocks caused one or more is in COMPARE can be used to determine which of the candidate clock signals it will be best to select for CLOCK for use in sampling the “real” data in DATAIN that follows the training data. For example, it is typically desired to select a candidate clock having transitions that are as far as possible from transitions in DATAIN (i.e., a candidate clock having transition that are as close as possible to the centers of the UIs in DATAIN). As an illustration of this, if 16 candidate clocks having equal phase spacing were used, and if the occurrences of 1 in COMPARE were as shown in
If circuitry 500 continues to be used for capturing real DATAIN data following the training data, it can be necessary to make sure that circuitry 500 is demultiplexing the real data with the proper phase. For example, if the circuitry downstream from circuitry 500 expects to receive the first bit of real data on the DATA1OUT lead (
On the other hand, if CLOCK has a rising edge when the first bit of real data arrives, flip-flop 512 must be put into use, DATA1OUT must be derived from the channel including flip-flop 510, and DATA2OUT must be derived from the channel including flip-flop 520 in order for the data to be properly demultiplexed. Circuitry 500 can be controlled to make these choices by making the output signal of flip-flop 5401.
Flip-flop 540 can be placed in the proper state for handling real data as described in the two preceding paragraphs in the following manner. After a final choice for CLOCK has been made and implemented, training data continues to be supplied for some time. If all samples of this training data that are compared by XOR gate 530 are equal-valued, then the state of flip-flop 540 is correct. This can be either the 0 or the 1 state of flip-flop 540. The choices controlled by that flip-flop output state (i.e., the choices made by multiplexers 514, 518, and 528 will be the correct ones for properly demultiplexing real data when it begins to arrive following orderly and controlled completion of the training data. On the other hand, if XOR gate 530 makes a comparison of samples that are not equal-valued, then the resulting 1 output from XOR gate 530 toggles the state of flip-flop 540. This changes the choices controlled by the output of that flip-flop and makes those choices the correct ones for properly demultiplexing the real data that follows the orderly and controlled completion of the training data. After this phase of the operation of circuitry 500, the state of flip-flop 540 can be effectively locked (e.g., by deasserting the ENABLE input to AND gate 532). This prevents any further changes in state of flip-flop 540 in response to the subsequent real data, which may, of course, have 1s and 0s in any order.
It will be appreciated that the foregoing discussion is somewhat simplified. For example, successive candidate clock signals may not cleanly avoid or skip over all transitions in training DATAIN. A candidate clock signal may cause transitions in CLOCK to be sufficiently close to transitions in training DATAIN that COMPARE is 1 several or many times during use of that candidate. This will cause corresponding repeated toggling of flip-flop 540. But the principles described above remain the same. Any candidate clock that causes COMPARE to be 1, whether once or several times, is probably not a good candidate for final selection as the CLOCK for sampling real data. (The sole exception to this is that a 1 in COMPARE relatively early in use of the first candidate clock can probably be ignored as only attributable to initially aligning the operation of circuitry 500 with equal-valued pairs of bits in the training data.
For completeness, illustrative circuitry for providing and selecting among several candidate clock signals is shown in
Selection control circuitry 740 is initially operated to control multiplexer 730 to select the candidate clock signals one after another in order of increasing phase. The currently selected candidate becomes the CLOCK signal (
It will be understood that the foregoing is only illustrative of the principles of the invention, and that various modifications can be made by those skilled in the art without departing from the scope and spirit of the invention. For example, each of the various locations in circuitry 760 could be a counter for counting the occurrences of 1 in the COMPARE signal directed to that location. Circuitry 770 could then use the magnitudes of these various counts to help determine the best candidate clock for subsequent use in capturing real data. As another example of a possible modification, it might be preferred to select the final CLOCK so that its transitions are somewhat ahead of the center of each UI in DATAIN, or somewhat behind the center of each UI. Circuitry 770 can implement any desired decision criteria.
This is a continuation of, commonly-assigned U.S. patent application Ser. No. 10/819,556, filed Apr. 6, 2004 and now U.S. Pat. No. 7,940,877, which is a continuation-in-part of commonly-assigned U.S. patent application Ser. No. 10/722,665, filed Nov. 26, 2003 and now U.S. Pat. No. 7,295,641, each of which is hereby incorporated by reference herein in its respective entirety.
Number | Name | Date | Kind |
---|---|---|---|
4821297 | Bergmann et al. | Apr 1989 | A |
5459753 | Co et al. | Oct 1995 | A |
5485490 | Leung et al. | Jan 1996 | A |
5533072 | Georgiou et al. | Jul 1996 | A |
5533073 | Eriksson | Jul 1996 | A |
5535252 | Kobayashi | Jul 1996 | A |
5673295 | Read et al. | Sep 1997 | A |
5696800 | Berger | Dec 1997 | A |
5745530 | Baek et al. | Apr 1998 | A |
5974097 | Julyan et al. | Oct 1999 | A |
6222380 | Gerowitz et al. | Apr 2001 | B1 |
6288656 | Desai | Sep 2001 | B1 |
6304623 | Richards et al. | Oct 2001 | B1 |
6307869 | Pawelski | Oct 2001 | B1 |
6347128 | Ransijn | Feb 2002 | B1 |
6359946 | Ryan | Mar 2002 | B1 |
6363129 | Agazzi | Mar 2002 | B1 |
6650140 | Lee et al. | Nov 2003 | B2 |
7031420 | Jenkins et al. | Apr 2006 | B1 |
7138837 | Venkata et al. | Nov 2006 | B2 |
7149914 | Asaduzzaman et al. | Dec 2006 | B1 |
7167534 | Nakamura | Jan 2007 | B2 |
7180966 | Vallet et al. | Feb 2007 | B2 |
7221725 | Tinker | May 2007 | B2 |
7265690 | Vining | Sep 2007 | B2 |
7295641 | Wortman et al. | Nov 2007 | B1 |
7340021 | Churchill et al. | Mar 2008 | B1 |
7366267 | Lee et al. | Apr 2008 | B1 |
7415089 | Su et al. | Aug 2008 | B2 |
7433397 | Garlepp et al. | Oct 2008 | B2 |
7486752 | Kwasniewski et al. | Feb 2009 | B1 |
20010033188 | Aung et al. | Oct 2001 | A1 |
20040199522 | Edpalm | Oct 2004 | A1 |
Number | Date | Country | |
---|---|---|---|
Parent | 10819556 | Apr 2004 | US |
Child | 13097252 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10722665 | Nov 2003 | US |
Child | 10819556 | US |