Abstract:
An adder cell in which the sum signal and the carry signal are formed with equal speed is provided for employment in &#34;carry-save&#34; adders, wherein the sum signal and the carry signal are separately forwarded to separate inputs of following adder cells. The circuit of the adder cell is designed such that the sum signal as well as the carry signal each have to traverse only two gates, so that the running times of sum signal and carry signal are approximately identical and shorter than the maximum running time of conventional adder cells.

Description:
BACKGROUND OF THE INVENTION 
     The invention is directed to an adder cell for constructing a carry-save adder. 
     A carry-save adder is known from the book &#34;Computer Arithmetic&#34; by K. Hwang, John Wiley and Sons, New York, 1979, pages 98 through 103 particularly FIG. 4.1 and FIG. 4.2. Every first adder cell has three inputs, each of which receives equivalent bits of three binary numbers to be added to one another. The carry-save adder of FIG. 4.1 is composed of n adder cells that are also referred to as a full adder. The carry output of every adder cell is intermediately stored in a carry-save register and is supplied to the next higher adder cell. A combination between a carry-save and carry-propagate adder, by contrast, is shown in FIG. 4.2. The sum outputs of the first carry-save adder cells are conducted to first inputs of the carry-propagate adder; the carry outputs of the first adder cells (with the exception of the most significant adder cell) are linked via carry-save registers to second inputs of the carry-propagate adder. A sum word resulting from the addition appears at the outputs of the carry-propagate adder. Differing from an adder arrangement using the carry-propagate principle, the carries of all first adder cells, in an addition to three binary numbers, are simultaneously formed and, in addition to the intermediate sum word taken at the first adder cells, are available as a carry word. An adder constructed in this fashion functions according to the &#34;carry-save&#34; principal. 
     In conventional adder cells, the sum running time is usually considerably longer than the carry running time. The reason for this difference is that the sum signal must traverse a greater number of logical gates. These different running times are rather meaningful given &#34;carry-propagate&#34; adders such as, for example, the &#34;carry-ripple&#34; adder because the carry signal must traverse many stages, while the sum signal traverses only one stage. However, the situation is different for &#34;carry-save&#34; adders, in which the sum signal and the carry signal are separately forwarded to arbitrary inputs of following adders. It is advantageous that the sum signal and carry signal be formed with identical speed, insofar as possible. 
     SUMMARY OF THE INVENTION 
     The object of the invention is to provide adder cells for &#34;carry-save&#34; adders wherein a sum signal and a carry signal are formed approximately at the same time and very quickly. This is achieved by the present invention. 
     The advantage obtainable with the invention is particularly that the signals at the sum input and carry input each need to traverse only two gates in order to reach the adder output, and that a low number of switching transistors is required for constructing the adder cell of the invention. 
    
    
     SUMMARY OF THE DRAWINGS 
     The invention shall be set forth in greater detail below with reference to an exemplary embodiment shown in the drawings, in which: 
     FIG. 1 shows a conventional adder cell; 
     FIG. 2 is a schematic diagram of the adder cell of the present invention for &#34;carry-save&#34; arithmetic; and 
     FIG. 3 illustrates a function table for the adder cells of FIG. 1 and FIG. 2. 
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     FIG. 1 shows a conventional adder cell that is composed of three ORNAND Gates ORNAND1, ORNAND2, ORNAND3, two NAND Gates NAND1, NAND2 and an inverter I1. The ORNAND gates each have two OR inputs (X and Y) and one AND input (Z) and produce an output signal corresponding to (X+Y).Z. The adder cell contains three inputs; two thereof are sum operand inputs A, B, whereas the third input is intended for the carry C i  ; the adder cell also contains two outputs, one sum output S and one carry output C 0 . The carry input C i  is connected via an inverter I1 to a first OR input of the first ORNAND Gate ORNAND1, whereas the operand inputs A, B are each connected to an input of a first NAND Gate NAND1 and to a respective OR input of a second ORNAND Gate ORNAND2. The output of the NAND Gate NAND1 is connected both to the AND input of the second ORNAND Gate ORNAND2 as well to the AND input of the first ORNAND Gate ORNAND1. The output of the first ORNAND Gate ORNAND1 thereby forms the carry output C 0  of the conventional adder cell. 
     The output of the second ORNAND Gate ORNAND2 is wired, first, to the second OR input of the first ORNAND Gate ORNAND1, to a first input of the second NAND Gate NAND2, as well as to the first OR input of the third ORNAND Gate ORNAND3. The carry input C i  of the adder cell, finally, is wired to the second input of the second NAND Gate NAND2 and to the second OR input of the third ORNAND Gate ORNAND3, whereas the output of the second NAND Gate NAND2 is connected to the AND input of the third ORNAND Gate ORNAND3. The output of the third ORNAND Gate ORNAND3 thereby forms the sum output S. 
     In this conventional adder cell, the sum running time, i.e., the time that is required for the formation of the sum from the operand inputs A and B, is usually considerably longer than the carry running time. This is because the sum signal must traverse a greater plurality of gates. In order to form the sum signal in the adder cell of FIG. 1, a signal at the operand inputs A, B must respectively traverse a maximum of four gates; for the formation of the carry signal at the carry output C 0 , a signal has to traverse only a maximum of three gates proceeding from the operand inputs A, B or, respectively, two gates proceeding from the carry input C i . FIG. 3 illustrates a function table related to the conventional adder cell of FIG. 1, and which is also related to the &#34;carry-save arithmetic&#34; adder cell of the invention. 
     FIG. 2 shows the adder cell of the present invention for &#34;carry-save&#34; arithmetic. Just like the conventional adder cell, it comprises three inputs, namely two sum operand inputs A, B and one carry input C i . It also comprises two outputs, a sum output S and a carry output C 0  The adder cell of the invention contains a NAND Gate NAND1, and ORNAND Gate ORNAND1, as well as an inverter I1, analogous to the conventional adder cell. The operand inputs A and B are each connected to an input of a first NAND Gate NAND1 at whose output the ORNAND Gate ORNAND1 has its AND input connected. The carry input C i  is connected via an inverter I1 to the first OR input of the ORNAND Gate ORNAND1, whereas the output of the ORNAND Gate ORNAND1 forms the carry output C 0  of the adder cell of the invention. Further, the two operand inputs A, B and the output of the NAND Gate NAND1 are connected to a first circuit arrangement SA1 (shown in broken lines) and the carry input C i  and the output of the inverter I1 are connected to a second circuit arrangement SA2 (shown in broken lines). A first output of SA1 is wired to a second OR input of the ORNAND Gate ORNAND1 and a second, third and fourth output SA1 are wired to the second circuit arrangement SA2; one output of SA2 forms the sum output S. 
     The first circuit arrangement SA1 contains three p-channel and three n-channel switching transistors P1, P2, P3 and N1, N2, N3, in which a first and second p-channel switching transistor P1, P2 form a first series circuit and a third p-channel switching transistor P3 is connected in parallel thereto. A first terminal of the first series circuit and a first terminal of third p-channel switching transistor P3 are connected to a supply voltage V DD , whereas a second terminal of the third p-channel switching transistor P3 is connected to a second terminal of the first series circuit and, further, to a first terminal of a first parallel circuit composed of a first of a second n-channel switching transistor N1, N2 and, via a first output of the first circuit arrangement SA1, to a second OR input of the ORNAND Gate ORNAND1 and, via a second, third and fourth input of the first circuit arrangement SA1, is connected to the second circuit arrangement SA2. 
     A second terminal of the first parallel circuit is wired via a third n-channel switching transistor N3 to ground GND, whereas the first operand input A is connected to a gate of the first p-channel switching transistor P1 and to a gate of the second n-channel switching transistor N2 and the second summand input B is connected to a gate of the second p-channel switching transistor P2 and to a gate of the first n-channel switching transistor N1. The output of the NAND Gate NAND1, further, is connected to a gate of third p-channel switching transistor P3 and to a gate of the third n-channel switching transistor N3. 
     Two p-channel switching transistors P4, P5 as well as two n-channel switching transistors N4 and N5, are located in the second circuit arrangement SA2. A first terminal of the fourth p-channel switching transistor P4 is connected to an output of the inverter I1 and to a gate of a fifth p-channel switching transistor P5. A first terminal of the fourth n-channel switching transistor N4 is connected to the carry input C i  and to a gate of a fifth n-channel switching channel N5. The fifth p-channel switching transistor P5 and the fifth n-channel switching transistor N5 form a second parallel circuit, whereby a first terminal of the fifth p-channel switching transistor P5 is connected to the first circuit arrangement SA1 via a second output of the first circuit arrangement SA1, a first terminal of the fifth n-channel switching transistor N5 is connected to the first circuit arrangement SA1 via a third output of the first circuit arrangement SA1 and gate terminals of the fourth p-channel switching transistor P4 and of the fourth n-channel switching transistor N4 are connected to the first circuit arrangement SA1 via a fourth output of the first circuit arrangement SA1. The sum output S is thus respectively connected both to the second terminal of the fourth p-channel switching transistor P4 and of the fourth n-channel switching transistor N4 as well as being respectively connected to the second terminal of the fifth p-channel switching transistor P5 and of the fifth n-channel switching transistor N5. 
     In the adder cell of the invention, the second ORNAND Gate ORNAND2 that was described in connection with FIG. 1, was (functionally) parted in the middle and the two n-channel and p-channel switching transistors N5 and P5 were inserted, these being driven by the carry signal or, respectively, by the inverted carry signal. In addition, the two n-channel and p-channel switching transistors N4 and P4 were inserted, these being driven by the output signal of the second ORNAND Gate ORNAND2 and transmitting the carry signal or, respectively, the inverted carry signal. The adder cell then functions such that, given an identity of the input signals at the operand inputs A and B, the carry input signal at the carry input C i  is transmitted to the sum output S via the fourth n-channel switching transistor N4 and given a non-identity of the operand inputs A and B, the inverted carry input signal at the carry input C i  is transmitted to the sum output S via the fourth p-channel switching transistor P4. The fifth n-channel switching transistor N5 and the fifth p-channel switching transistor P5 thereby intensify this charge flow whenever a &#34;1&#34;  is to be transmitted via the fourth n-channel switching transistor N4 or a &#34;0&#34; is to be transmitted via the fourth p-channel switching transistor P4 and thus avoid a drop by a threshold voltage of the switching transistors N4 or, respectively, P4. As a result of this structure of the adder cell of the invention, the signals both from the operand inputs A, B as well as from the carry input C i  need to traverse only two gates to the sum output S or, respectively, to the carry output C 0 . Simulations with realized adder cells confirm that these running times of sum signal and carry signal are approximately identical and shorter than the maximum running time for signals in a conventional adder cell. 
     FIG. 3 shows a function table for the adder cell of FIG. 1 and for the inventive adder cell of FIG. 2. One can thereby see that the sum output S is equal to &#34;1&#34; when the operand inputs are A=0, B=1 and the carry input is C i  =0 or when the operand input is A=1, B=0 and the carry input is C i  =0 or when the operand inputs are A=0, B=0 and the carry input is C i  =1 or when the operand inputs are A=1 and B=1 and the carry input is C i  =1. The carry output C 0  contains a &#34;1&#34; precisely when the operand inputs are A=1, B=1 and the carry input is C i  =0 or when the operand inputs are A=0, B=1 and the carry input is C i  =1 or when the operand inputs are A=1, B=0 and C i  =1 or when the operand inputs are A=1, B=1 and the carry input is likewise 1. For all other input combinations of the operand inputs A, B and of the carry input C i , the sum output S and the carry output C 0  are set to &#34;0&#34;. 
     It will be understood that variations and modifications may be effected without departing from the spirit and scope of the novel concepts of the present invention.