This Application relates to “High Frequency Divider Circuit With Data Path Correction”, AUS920031086US1 filed concurrently herewith.
The present invention relates generally to error correction and, more particularly, to error correction in a state machine circuit.
There is a type of incrementer called a high frequency divider. In a high frequency divider, the values within the incrementer change in a predefined fashion, but not necessarily by a mathematical addition or subtraction. For instance, 000000 could be the first state, 000001 could be the second number, 000011 could be the third, 000111 could be the fourth, 001111 could be the fifth, 011111 could be the sixth, 111111 could be the seventh, 011111 could be the eighth state, and so on. The values could represent the generation of a square wave, although other uses are also possible. The particular incrementing from state value to state value is a function of the internal logic of the high frequency divider.
However, there is a problem with high frequency dividers. One such problem is if the system starts up in an invalid state. For instance, what if it starts in state 010101? This can happen when a system first powers up, as the states of the latches within the system can be indeterminate. Alternatively, a catastrophic event can happen, such as an electromagnetic pulse. If this happens, the states within the divide by 8 counter can be forced into an undesired state.
However, in conventional technology, if left uncorrected, the states could cycle from one undesired state to another undesired state, without ever becoming a desired state and getting back on track. The system can be reset, and a preloaded “seed” state can be entered into the system. However, this is time-wise an expensive proposition, and errors can creep in if the initial “seed” state is somehow inaccurate. If an electromagnetic pulse changes the state within the circuit to an invalid state or sequence. This invalid state or sequence should be deleted, which costs additional time and circuitry area, and a system reset is issued, which also costs additional time.
Therefore, there is a need to ensure that a desired state is arrived at after a certain number of state transitions in a manner that addresses at least some of the problems associated with the prior art.
The present invention provides for state correction. A first value in a state circuit is received from a flip flop. The received value is transmitted to a second flip flop. The received value within the second flip flop is altered if an error condition arises. The received value is transmitted to a third flip flop. In one aspect, the received value transmitted to the third flip flop comprises an unaltered received value. In another aspect, the received value transmitted to the third flip flop comprises transmitting an altered received value.
For a more complete understanding of the present invention, and the advantages thereof, reference is now made to the following Detailed Description taken in conjunction with the accompanying drawings, in which:
In the following discussion, numerous specific details are set forth to provide a thorough understanding of the present invention. However, those skilled in the art will appreciate that the present invention may be practiced without such specific details. In other instances, well-known elements have been illustrated in schematic or block diagram form in order not to obscure the present invention in unnecessary detail. Additionally, for the most part, details concerning network communications, electro-magnetic signaling techniques, and the like, have been omitted inasmuch as such details are not considered necessary to obtain a complete understanding of the present invention, and are considered to be within the understanding of persons of ordinary skill in the relevant art.
In the remainder of this description, a processing unit (PU) may be a sole processor of computations in a device. In such a situation, the PU is typically referred to as an MPU (main processing unit). The processing unit may also be one of many processing units that share the computational load according to some methodology or algorithm developed for a given computational device. For the remainder of this description, all references to processors shall use the term MPU whether the MPU is the sole computational element in the device or whether the MPU is sharing the computational element with other MPUs, unless otherwise indicated.
It is further noted that, unless indicated otherwise, all functions described herein may be performed in either hardware or software, or some combination thereof. In a preferred embodiment, however, the functions are performed by a processor, such as a computer or an electronic data processor, in accordance with code, such as computer program code, software, and/or integrated circuits that are coded to perform such functions, unless indicated otherwise.
Turning to
For instance, in
Turning now to
Turning now to
The Q states of DFF1, DFF2, DFF3 and DFF4215, 220, 225, 230 are coupled to a logical operator 210. The logical operator 210 is coupled to a gate of the DFF2220. In other implementations, only flip flops 215, 220 and 225 are used. Gate Memory 205 can be used to introduce a time delay. Otherwise, there could be problems with substantially simultaneous feedback, and the logic states might not converge, an error condition. This configuration enables the state transition from the undesired states to desired states of
Turning now to
As is understood by those of skill in the art, if a flip-flop is enabled by a clock signal, the flip flop will pass on the signal data state from the input to the output on the data, or Q line. However, if the flip flop is disabled by a clock signal, the input D value will not be propagated to the output, and instead the previously stored D value will be output of the D input.
In
However, for instance, in the next clock pulse, the input clock pulse goes “low”. Therefore, the input data does not propagate from the Data input to the Q or qint output in this flip flop, and the qint value of the previous clock cycle is retained by this first D latch 310. However, because the input clock value is inverted to “high”, the second flip flop propagated the qint value into the output Q, the “3” value. Hence, for the DFF1215 to change an output state, it takes at least one full clock cycle, and it only accepts as input data states from alternating clock cycles.
Turning back to
However, if an undesired state comes up, the system 200 can work as follows. For instance, what if a conventional divide by 8 system starts as 01100111 as its starting state? A conventional system would then transition to 00110011, also an invalid state, without correction this would further transition to 00011001.
However, the logic of
The system 200 detects invalid states can be as follows. The outputs q1, q2 (inverted) and q3 are input into the OR 110. When xxxxxxxx (“x” a variable), have the values of x0x1x0xx, the OR gate output becomes negative, the output invalidb state goes low, and there is enabled a transition from an unallowed state to an allowed state. Turning briefly to
Turning now to
In
In
In other words, when the output of OR 210, the gate input to the XOR 430, is zero, the D latch1410 and the D Latch2420 both have the same clock values within DFF 2115. In the context of
Furthermore, if the input clock pulse is positive and the gate input is zero, the input D value propagates through both D latches 410, 420, through qint2 and then out through Q. Also, because the clock state is positive as input into DFF3225, the qint of the third flip flop q3int is also equal to q2. In other words, D value becomes Q, which was not true in the prior art.
In other words, for a gate value of 0, and a positive clock cycle, the q1 value gets propagated to the qint2 value and the q2 output value, and the q3 int value. In the context of
Turning now to
A divider correction circuit 550 is coupled between the inverted output of DFF2520 (q2b) and the data input into DFF3530. As is understood by those of skill in the art, the voltage produced by a CMOS circuit is a function of a supply voltage, and which transistors of the CMOS circuit are turned on and off. Correction circuit 550 is one embodiment of logic implementing the truth table of Table 1 below.
In the above truth table, q1b (inverted output of DFF1510) is employed, Q2b (inverted output of DFF2520) is employed, and q3b (inverted output of DFF3530) is employed. In
In the system 500, q1B (inverted) value, the q2b (inverted) value, and the q3b(inverted) value are input into the circuit 550. If q1b is a zero, D3new equals the opposite of q2B. The state of q3 or q3b is not a factor in the above truth table.
However, if q1b equals a one, and if q2b equals a zero, and if q3b equals zero, then D3new is set to equal one. Hence, error correction arises.
Furthermore, there is no state among the desired states that would create a “skip” to an undesired state. For instance, if q1 and q3 equal zero of a desired state, this would be x0xxx0xx By definition of the truth table of
As is understood by those of skill the art, the voltage across the drain and source of a CMOS circuit is a function of overall function of the circuit and whether the circuit is turned on or off. In 550, this is one embodiment of logic corresponding to the following truth table. The truth table represents two conditions wherein Q1 does not equal D2new.
In the system 500, we are using q1b (inverted) value, and the q3b (inverted) value, so there is an actual change of state when q1b equals D3new. This occurs when q0 is 0 and q3 is 0. Therefore, the next value input into the next flip-flop after this is also zero, and both q3 and qint3 becomes 0 instead of 1, the value of Q1. In
Furthermore, there is no state among the desired states that would create a “skip” to an undesired state. For instance, if q1 and q3 equal zero in a desired state, this would be x0xxx0xx By definition of the truth table of
Turning now to
It is understood that the present invention can take many forms and embodiments. Accordingly, several variations may be made in the foregoing without departing from the spirit or the scope of the invention. The capabilities outlined herein allow for the possibility of a variety of programming models. This disclosure should not be read as preferring any particular programming model, but is instead directed to the underlying mechanisms on which these programming models can be built.
Having thus described the present invention by reference to certain of its preferred embodiments, it is noted that the embodiments disclosed are illustrative rather than limiting in nature and that a wide range of variations, modifications, changes, and substitutions are contemplated in the foregoing disclosure and, in some instances, some features of the present invention may be employed without a corresponding use of the other features. Many such variations and modifications may be considered desirable by those skilled in the art based upon a review of the foregoing description of preferred embodiments. Accordingly, it is appropriate that the appended claims be construed broadly and in a manner consistent with the scope of the invention.
Number | Name | Date | Kind |
---|---|---|---|
3530284 | Wood | Sep 1970 | A |
3609391 | Hatano et al. | Sep 1971 | A |
4442748 | Kaneko et al. | Apr 1984 | A |
4691331 | Bayruns et al. | Sep 1987 | A |
4993051 | Feldbrugge | Feb 1991 | A |
5339345 | Mote, Jr. | Aug 1994 | A |
6531903 | Wichman | Mar 2003 | B1 |
6826250 | Groo | Nov 2004 | B1 |
20020114422 | Masahiko | Aug 2002 | A1 |
Number | Date | Country | |
---|---|---|---|
20050262406 A1 | Nov 2005 | US |