Abstract:
A differentiating circuit is disclosed for use in asynchronous networks which associates the transfer of information through the circuit with the occurrence of the acquisition of the information by a utilizing circuit. The circuit can be used as a differential signal producer or, in combination with other circuits, to form AND, OR etc. logical circuits having a differentiated signal output.

Description:
This application is a continuation, abandoned of application Ser. No. 370,155, filed Jun. 22, 1989, which in turn is a continuation of application Ser. No. 165,908, filed Mar. 9, 1988 abandoned. 
    
    
     BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The present invention is directed to a differentiating circuit for asynchronous systems and, more particularly to a self-clocking, self-timing differentiating circuit for digital asynchronous systems which can be used alone as a differentiating circuit or in combination with other circuits to form AND, OR, etc. logical circuits having a differentiated signal output. 
     2. Description of the Prior Art 
     Boolean algebra is frequently used to specify the states entered by logical circuits by means of tables that indicate output values in connection with inputs for combinatorial networks, and also to specify inside states for sequential networks. The representation is a description of &#34;steady&#34; variables, as of the elements that perform the logical operations were ideal elements lacking any physical feature whatever. Of course, in actual circuit implementation the physical parameters that &#34;deviate&#34; from the ideal behavior of these circuits must also be considered. The usual methods for implementation of digital circuits takes into account such deviating parameters in a merely &#34;statistical&#34; manner, without considering the variables of interest during signal transitions, since under this circumstance they would assume values generally defined as arbitrary. To avoid effects of such arbitrary values a &#34;clock&#34; element is typically used which enables the circuit to settle for the necessary time in order that the transients caused by the various transit times, particularly of physical devices, may expire. In other words, the clock enables the operations to occur in orderly fashion by connecting the timing with only the stable circuit conditions evoked by Boolean algebra so that transient arbitrary values are not used. 
     It is also known that circuits which utilize signals from a logic circuit may use signals having transient variations. The concept of variation is, however, tied to the mathematical concept of the first derivative of the variable as compared with time. 
     The solution of the practical problem of utilization of the &#34;time derivative&#34; signal is achieved by circuits that are edge triggered. Edge triggered circuits have associated therewith a certain time which is likely sufficient so that circuits which use the meaning of the signal variation may utilize it as required. Thus, the derivative is built up by artiface using a local clock, the start of which of controlled by the variation of the variable and the stop of which is determined by a previously set time value. Naturally, the use of clock circuits to control the timing of various digital circuits introduces additional complexity and expense to the overall circuit design. 
     SUMMARY OF THE INVENTION 
     Applicant has discovered that the time constraint represented by the presence of the clock may be overcome by means of a differentiating circuit which operates under the condition that the signal. Which represents the derivative of the variable, continues to exist until the user of the meaning of the occurred signal variation has utilized it as required. This is accomplished by introducing into the differentiation circuit a feedback signal which is generated when a circuit receiving the derivative signal of the differentiation circuit utilizes that derivative signal. The feedback signal is used to disable the derivative signal. This will be the &#34;minimum time&#34; associated with the time derivative. A shorter time might not let the derivative assume any meaning, since the derivative signal might not have been utilized by the user. 
     It is exactly &#34;the utilization of the meaning of occurred signal variation&#34; that actually supplies the concept of &#34;time discretization&#34; inasmuch as, by definition, there will exist, under that circumstance, no &#34;lesser time&#34; for the acquisition of that meaning. 
     Borrowing a definition having a relativity character one might introduce a new concept of &#34;space-time discrete&#34; and draw a different methodology for the description of logical networks. Besides a simple differentiating circuit, performing the transfer of one only meaning through the feedback signal previously described, other differential logical circuits such as NOT, AND, OR and also more complex functions obtained by combining these can be realized. Therefore, the subject matter of the present invention is hereinafter called a DERIVER circuit for asynchronous systems which has at least one input signal of a variable (X), a derivative output signal (Y) produced by a change in state of the input signal(s) (X) and a feedback input signal (F) which controls how long the derivative output is available to a circuit which utilizes it. 
     Namely, the subject matter of the present invention, a so-called DERIVER, is a class of circuits that perform any logical function, be it simple or complex, both combinatorial and sequential, at different integration grades and that utilize both positive and negative logics, and which control the duration of the existence of derivative output signal by a feedback signal from a circuit which utilizes the derivative output signal. 
     The invention will be better understood by reference to the following detailed description which is provided in connection with the accompanying drawings. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 is a block diagram illustrating the operation of a DERIVER circuit in accordance with the present invention; 
     FIG. 2 is a general timing diagram of the DERIVER circuit operation; 
     FIG. 3 is a table illustrating the general operation of the DERIVER circuit; 
     FIG. 4 is a schematic diagram of a first embodiment of a DERIVER circuit of the invention; 
     FIG. 5 is a timing diagram for the DERIVER illustrated in FIG. 4; 
     FIG. 6 is a schematic diagram of a second embodiment of a DERIVER circuit of the invention; 
     FIG. 7 is a table illustrating operation of the FIG. 6 DERIVER circuit; 
     FIG. 8 is a specific timing diagram of the FIG. 6 DERIVER circuit; 
     FIG. 9 is a schematic diagram of a third embodiment of a DERIVER circuit of the invention; 
     FIG. 10 is schematic diagram of DERIVER circuit of the invention implementing an AND function; 
     FIG. 11 is a schematic diagram of another DERIVER circuit of the invention implementing an AND function; 
     FIG. 12 is a schematic diagram of a DERIVER circuit of the invention implementing an OR function; 
     FIG. 13 is a schematic diagram of another DERIVER circuit of the invention implementing an OR function. 
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     The following discussion will use the terms &#34;active logical level =1&#34; (positive logic), and &#34;active variation =(0→1)&#34; (positive edge) in describing the invention. However, it should be understood that the invention could also be described with an active logical =O and the active variation (1→0), or other combinations of active level and signal transition. Accordingly, the notation used is by no means limiting of the invention. 
     FIG. 1 represents the block diagram of a ΔX DERIVER 11 placed in environment of use. FIG. 2 shows the time representation of signal variations in accordance with the invention associated with the FIG. 1 DERIVER circuit, which may be summarized as follows: &#34;only the variation (0→1) of variable X produces an equivalent variation (0 →1) of variable Y. This occurs independently from the state of feedback variable F. Only the variation (0→1) of variable F which occurs when the derivative signal Y is used by a downstream utilization circuit 15 will cause the variable Y to return to its rest state, i.e., (1→0). Now the DERIVER circuit is ready for the next operation. It is clear that variable X on which the differentiating operation is performed will have to remain steady during the operation itself. 
     A feedback signal E (0→1) heading back to the source 13 of signals to the DERIVER circuit ΔX can be easily obtained from the same DERIVER; it is the complement of output signal Y. In other words if the source S itself is a DERIVER circuit, the signal E from the ΔDERIVER is the feedback signal to the source S. 
     The logical signal table for the FIG. 1 DERIVER is represented in FIG. 3, while FIG. 4 illustrates the schematic diagram of the DERIVER 11. 
     The FIG. 4 embodiment includes an AND gate 21 which receives the input signal X and an output signal P from NAND gate 23 which is one of two NAND gates (23, 25) cross-coupled to form a flip-flop. Another input to NAND gate 23 is taken from the output of NAND gate 25, which receives as its inputs, the signal P and the output of a NAND gate 27. NAND gate 27 receives as inputs thereto, the feedback signal F and the S output of NAND gate 29, which is one of two NAND gates (29, 31) cross-coupled to form another flip-flop. NAND gate 29, receives at its inputs, the feedback signal F and the output of NAND gate 31, and NAND gate 31 in turn receives as its input the signal Y and the signal S. An inverter 33 also receives the signal Y and provides an inverted signal Y as the signal E. 
     The logical equation of the FIG. 4 circuit is: 
     
         Y=X∩P∩(F∩S∩Y), 
    
     where ∩ indicates an AND function and ∩ indicates a negative AND function. FIG. 5 shows the complete timing diagram for the FIG. 4 circuit. 
     The operation of this device, namely, the generation of the derivative signal Y in connection with the significant transition applied to input signal X, is fully independent from the current state of feedback signal F; disabling of the derivative signal Y (1→0) will occur only through a significant transition (0→1) of the feedback signal F. 
     Specific applications allow some significant circuit simplifications that are suggested by assigning apriori the values of variables. The simplification is obtained by assigning the value F=0 to feedback during transition (0→1) of the input variable X. It ensues the equality: 
     
         F=F∩S∩Y 
    
     This allows eliminating the circuit comprising gates 27, 29 and 31 that makes independent the logical level of feedback during transition X (0→1) of the input variables, and replacing it with an inverter 35. The simplified DERIVER circuit is shown in FIG. 6. The logical equation of the FIG. 6 device is: 
     
         Y=X∩(P∩F). 
    
     Its Boolean operation table and the timing diagram are represented in FIGS. 7 and 8, respectively. 
     An analysis of the transition diagram shows the existence of a static hazard in output in case the assignment F=0 during the transition X (0→1) is disregarded. This static hazard is eliminated by adding one connection, as shown in FIG. 9, and the use of a three input AND gate 37 in place of the two input AND gate 21, with AND gate 37 receiving the signals X, P and F. It is observed that the logical equation for the circuit has not changed: Y=X∩(P∩F). 
     DERIVER circuits constructed in accordance with the invention, in their elementary form, can be considered as having two separate parts: the first one is the logical operator that is an AND gate (e.g., gate 21) in the case of non-inverting DERIVER; the second part is an RS flip-flop (e.g., formed by gates 23, 25) that has the function of memorizing the inside state of the DERIVER. 
     FIG. 4 depicts a first type of DERIVER constructed in accordance with the invention, while the simplified circuit of FIG. 6 depicts a second type. The FIG. 9 circuit represents yet a third type of DERIVER. 
     Summarizing, a DERIVER circuit of the invention can use the feedback signal in different ways, the first type generate the output signal Y in full independence from the feedback signal (FIG. 4) while the second and the third (FIGS. 6, 9) generate the output signal Y depending on the status of the feedback signal F, but, in any event, all circuits share the characteristic that the active transition of the feedback signal F is needed to return the output signal Y to a rest state (1→0). 
     Using the DERIVER circuits thus described, it is possible to perform simple logical functions. The function of a NOT DERIVER (Δ NOT) is obtained by complementing the DERIVER Y output signal, using an inverter. 
     The logical function AND is produced by the product of values of input x 19  , x 2  signals as Y=(x 1  ∩x 2 ); in this case the AND function in output Y will depend also on the state of the DERIVER (P∩F), thus the equation and the AND DERIVER (Δ AND) will be: 
     
         Y=(x.sub.1 ∩x.sub.2)∩(P∩F) 
    
     The logical function will be realized by either placing before the DERIVER an ordinary AND circuit 41, as shown in FIG. 10, or realizing the function inside the DERIVER itself, as shown in FIG. 11. In FIG. 11, the input signals x 1 . . . x n  (only two x 1 , x 2  shown for convenience) are applied to respective inputs of AND gate 67 and NAND gate 63, the latter of which is cross-coupled with NAND gate 65, the latter of which is cross-coupled with NAND gate 65 to produce a flip-flop. NAND gate 65 also receives the feedback signal F through inverter 35. AND gate 67 also receives as an input, the output P of NAND gate 63. 
     The OR logical function is given by the sum of the values of input signal Y=X 1  ∪X 2  V. . . X n ) (where V represents an OR function; for simplification only two inputs X 1  and X 2  are described); in the present case the function in output will depend again on the state of the DERIVER, hence the equation of the OR DERIVER (ΔOR) will be: 
     
         Y=(X.sub.1 ∪X.sub.2)∩(P∩F) 
    
     The function will be performed by either placing before the DERIVER an ordinary OR circuit 51, as shown in FIG. 12 or realizing the function inside the DERIVER itself, as shown in FIG. 13. The logical function of this last circuit will be: 
     
         Y=(X.sub.1 ∩P.sub.1 ∩F)∪(X.sub.2 ∩P.sub.2 ∩F) 
    
     As shown in FIG. 13, the two input signals X 1 , X 2  are respectively applied to NAND gates 73 and 75 and to respective inputs of AND gates 83 and 85, NAND gates 73 and 75 also receive as an input thereto, the output of NAND gate 61, which in turn receives as input signals, the outputs of NAND gates 73 and 75 and inverter 35 (for the feedback signal F). AND gate 83 also receives the output of gate 73 and inverter 35, while AND gate 85 also receives the output signals from gate 75 and inverter 35. 
     The functions NAND and NOR are obviously obtained by logical negation of the output of the AND and OR DERIVERS herein described, for example, by adding an inverter to the output of the circuits shown in FIGS. 10-13. 
     Thus, a DERIVER in accordance with the invention in its form of a Boolean differentiating network operator has two parts: the first one assumes the structure of the function to be performed, such as derivative, NOT, AND, OR as well as the combination of the same, while the second part, namely the flip-flop (formed by gates 23, 25) for the feedback state memorization, remains substantially unchanged. 
     It is also possible to perform the same function placing the memorization flip-flop of the DERIVER state either before or after the operator that identifies the function. For any of the DERIVER circuits described herein it is possible to adopt the connection that cancels the static hazard discussed earlier, as represented by the dotted lines in each of FIGS. 10, 11, 12, and 13; the DERIVER circuit logical equation will remain unchanged. 
     It will obviously be possible to realize, for all types of DERIVER circuits, the full independence from the feedback state by utilizing the basic circuit shown in FIG. 4. DERIVERS which form part of the present invention can also be constructed to perform complex functions, for example XOR, by adding logical gates to perform such function, e.g., XOR, to any of the three types of DERIVERS discussed above with respect to FIGS. 4, 6 and 9, in the manner described above for FIGS. 10, 11, 12 and 13 for the AND and OR functions.