JP3242226B2 - Full adder - Google Patents
Full adderInfo
- Publication number
- JP3242226B2 JP3242226B2 JP20618493A JP20618493A JP3242226B2 JP 3242226 B2 JP3242226 B2 JP 3242226B2 JP 20618493 A JP20618493 A JP 20618493A JP 20618493 A JP20618493 A JP 20618493A JP 3242226 B2 JP3242226 B2 JP 3242226B2
- Authority
- JP
- Japan
- Prior art keywords
- signal
- circuit
- negation
- exclusive
- carry
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Landscapes
- Logic Circuits (AREA)
Description
【0001】[0001]
【産業上の利用分野】この発明は全加算器に関するもの
である。BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a full adder.
【0002】[0002]
【従来の技術】従来の全加算器として、図2に示すよう
なものがある。この全加算器は、和出力用の回路と桁上
げ出力用の回路の完全に2つに分かれており、閾値電圧
0VのNMOSのトランスファゲートトランジスタと、
出力バッファ用のインバータを有している。2. Description of the Related Art FIG. 2 shows a conventional full adder. This full adder is completely divided into a sum output circuit and a carry output circuit, and includes an NMOS transfer gate transistor having a threshold voltage of 0 V,
It has an output buffer inverter.
【0003】加算値をA,被加算値をBとし、それぞれ
の否定をA#,B#、下位からの桁上げをC、その否定
をC#とする。和出力をS、その否定をS#、桁上げ出
力をC0、その否定をC0#とする。The added value is A, the added value is B, the respective negations are A # and B #, the carry from the lower order is C, and the negation is C #. The sum output is S, its negation is S #, the carry output is C 0 , and its negation is C 0 #.
【0004】和出力Sとその否定S#は、次のようにし
て行われる。まず、トランスファゲートN101により
AとBの論理積(以下論理積をABと記す)、N102
により(AB)#が生成されるため、接点S101の論
理値はAB+(AB)#(以下、論理和をA+Bと記
す)、すなわちAとBの排他的論理和の否定(以下排他
的論理和の否定を(A*B)#と記す)となる。同様に
してN103によりA#Bが、N104によりAB#が
生成され、接点S102の論理値はAとBの排他的論理
和(以下、排他的論理和をA*Bと記す)となる。ここ
までを第1段とする。[0004] The sum output S and its negative S # are performed as follows. First, a logical product of A and B (hereinafter, a logical product is described as AB) by a transfer gate N101, N102
Generates (AB) #, the logical value of the node S101 is AB + (AB) # (hereinafter, the logical sum is described as A + B), that is, the negation of the exclusive OR of A and B (hereinafter, the exclusive OR) Is written as (A * B) #). Similarly, A # B is generated by N103 and AB # is generated by N104, and the logical value of the node S102 is an exclusive OR of A and B (hereinafter, the exclusive OR is described as A * B). This is the first stage.
【0005】第2段目では、A*Bと(A*B)#と、
下位からの桁上げCとC#により、上述の回路と全く同
じ構成をとることで、トランスファゲートN105,N
106により接点S103には(A*B*C)#が、N
107,N108,N109により接点S104にはA
*B*Cが生成される。その後、第3段目で、バッファ
としてのインバータ1101,1102を介して外部に
出力される。In the second stage, A * B and (A * B) #,
By using the carry C and C # from the lower part, the configuration exactly the same as that of the above-described circuit is adopted, so that the transfer gates N105, N105
(A * B * C) # is added to the contact S103 by N
107, N108, N109 make contact A
* B * C is generated. Thereafter, in the third stage, the data is output to the outside via the inverters 1101 and 1102 as buffers.
【0006】桁上げ出力C0,C0#は、同様にして、接
点S109には(A#B+(BC)#)A+((AB)
#+BC#)A#、接点S101IF(AB+B#C)
A+(AB#+BC)A#が生成される。これらは、
(AB+C(A*B))#、AB+C(A*B)、すな
わち、桁上げ出力と同値である。最後に和出力と同様、
バッファ用のインバータを介して外部に出力する。Similarly, the carry outputs C 0 and C 0 # are supplied to the contact S109 at (A # B + (BC) #) A + ((AB)
# + BC #) A #, contact S101IF (AB + B # C)
A + (AB # + BC) A # is generated. They are,
(AB + C (A * B)) #, AB + C (A * B), that is, the same value as the carry output. Finally, like the sum output,
Output to the outside via the buffer inverter.
【0007】[0007]
【発明が解決しようとする課題】しかしながら、上記従
来技術による構成の全加算器においては、次のような問
題がある。However, the full adder having the configuration according to the above-mentioned prior art has the following problems.
【0008】すなわち、全加算器を構成するのにNMO
Sが24個とPMOSがある4個の合計28個という多
くの素子が必要になる。しかもこの時、閾値電圧0Vの
NMOSを使うため、定常状態においても電流が流れ続
ける。That is, the NMO is used to construct the full adder.
As many as twenty-four elements, 24 S elements and four PMOS elements, are needed. In addition, at this time, since an NMOS having a threshold voltage of 0 V is used, current continues to flow even in a steady state.
【0009】上記電流を抑えるために、通常のNMOS
を使って構成することができるが、この場合、NMOS
のトランスファゲートを2段通過するため、高電位側の
信号が閾値電圧の約2倍程度電圧が降下している。この
ままでは、高電位側の信号がインバータに入ってきたと
き、NMOS,PMOSとも常にON状態になるため、
常に貫通電流が流れ、消費電力が増大する。また電源電
圧を下げると、出力バッファのゲート入力が閾値電圧以
下になり、誤動作する可能性がある。このため高電位側
の電圧を電源であるにする必要があり、プルアップ回路
用にPMOSが更に4個余分に必要となり、合計32個
のトランシスタを要するため。高集積化には不利とな
る。In order to suppress the above current, an ordinary NMOS
, But in this case, NMOS
, The signal on the high potential side drops about twice the threshold voltage. In this state, when a signal of high potential side came into the inverter, since NMOS, always ON state also PMOS,
Through current always flows, and power consumption increases. Further, when the power supply voltage is lowered, the gate input of the output buffer becomes lower than the threshold voltage, which may cause a malfunction. For this reason, it is necessary to set the voltage on the high potential side to be a power supply, so that four more PMOSs are required for the pull-up circuit, and a total of 32 transistors are required. This is disadvantageous for high integration.
【0010】[0010]
【課題を解決するための手段】本発明は、加算値をA、
被加算値をB、下位からの桁上げをCとする相補型パス
ゲートロジックによる全加算器において、加算値A信号
と被加算値B信号とから、AとBの排他的論理和(A*
B)信号と排他的論理和の否定(A*B)#信号とを生
成する第1の回路と、上記第1の回路で生成された(A
*B)信号と(A*B)#信号と下位からの桁上げC信
号とから、桁上げ出力信号および和出力信号をそれぞれ
生成する第2の回路と第3の回路とを備え、上記第1の
回路と第2の回路と第3の回路とを同一の回路で構成す
ることを特徴とする全加算器を提供する。また、本発明
は、上記第2の回路は、AとBの排他的論理和とCとの
論理積と、AとBの排他的論理和の否定とAとの論理積
との論理和とから桁上げ出力信号を生成し、AとBの排
他的論理和とCの否定との論理積と、AとBの排他的論
理和の否定とAの否定との論理積との論理和とから桁上
げ出力の否定信号を生成することを特徴とする請求項1
に記載の全加算器を提供する。 According to the present invention, the added value is represented by A,
Complementary path where the value to be added is B and the carry from the lower order is C
In the full adder by the gate logic, the addition value A signal
And the augmented value B signal, the exclusive OR of A and B (A *
B) Generate a signal and exclusive-OR NOT (A * B) # signal
And a first circuit generated by the first circuit.
* B) signal, (A * B) # signal, and carry C signal from lower order
From the carry signal and the sum output signal, respectively.
A second circuit for generating the signal and a third circuit for generating the signal.
The circuit, the second circuit and the third circuit are constituted by the same circuit.
A full adder is provided. In addition, the present invention
Is that the second circuit calculates the exclusive OR of A and B and C
Logical product, logical product of A and negation of exclusive OR of B and A
A carry output signal is generated from the logical sum of
The logical product of the logical disjunction and the negation of C, and the exclusive theory of A and B
Carry out the logical sum of the negation of the logical sum and the logical product of the negation of A
2. A signal for generating a negative signal of an output signal.
And a full adder according to (1).
【0011】[0011]
【作用】この発明による全加算器では、第1段目の回路
を排他的論理和/排他的論理和の否定を出力する回路と
して、和出力と桁上げ出力とで共通化する。このことに
より、素子数が28から26に低減できる。In the full adder according to the present invention, the first stage circuit is used as a circuit for outputting an exclusive OR / negation of the exclusive OR, and is shared between the sum output and the carry output. Thus, the number of elements can be reduced from 28 to 26.
【0012】また、NMOSのトランスファゲート1段
の直後に必ずPMOSによるプルアップ回路をつけるこ
とで、フルスイング動作させている。A full-swing operation is performed by always providing a pull-up circuit of PMOS immediately after one stage of NMOS transfer gate.
【0013】[0013]
【実施例】以下、この発明の全加算器を実施例により詳
細に説明する。DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The full adder according to the present invention will be described below in detail with reference to embodiments.
【0014】図1は本発明による全加算器の回路構成図
を示している。この全加算器は、加算値Aと被加算値B
の排他的論理和(A*B)と排他的論理和の否定(A*
B)#を作る第1段と、第1段により作られたA*B、
(A*B)#と下位からのキャリー信号Cからキャリー
出力C0,C0#と和出力S,S#を作る第2段および出
力バッファとしてのインバータよりなる第3段からな
る。FIG. 1 is a circuit diagram of a full adder according to the present invention. This full adder includes an adder A and an adder B
Exclusive OR (A * B) and negation of exclusive OR (A *
B) The first stage of making #, A * B made by the first stage,
(A * B) # and a second stage for generating carry outputs C 0 and C 0 # and sum outputs S and S # from the carry signal C from the lower order, and a third stage including an inverter as an output buffer.
【0015】さて、第1段では加算値Aとその否定A#
と、被加算値Bとその否定B#を図1に示すようにトラ
ンスファゲートN1,N2に入力することによって、節
点S1はA#B+AB#、すなわちA*Bを示す。同様
に、節点S2にはトランスファゲートN3,N4によ
り、(A*B)#が現れる。さて、ここで節点S1,S
2の高電位側の電圧は、トランスファゲートの閾値電圧
分だけ電圧降下を起こしているため、このまま次のゲー
トに入力すると、更にそこで電圧降下を引き起こし、第
3段のインバータに貫通電流が流れてしまう。このた
め、S1とS2の間にプルアップ回路として、PMOS
によるP1,P2をつけて、高電位側の電圧を電源電圧
まで引き上げている。In the first stage, the addition value A and its negation A #
And the addition value B and its negation B # are input to the transfer gates N1 and N2 as shown in FIG. 1, so that the node S1 indicates A # B + AB #, that is, A * B. Similarly, (A * B) # appears at the node S2 by the transfer gates N3 and N4. Now, here, nodes S1 and S
2 has a voltage drop by the threshold voltage of the transfer gate, and if it is input to the next gate as it is, a further voltage drop will occur there and a through current will flow through the third stage inverter. I will. Therefore, as a pull-up circuit between S1 and S2, PMOS
, The voltage on the high potential side is raised to the power supply voltage.
【0016】和出力S,S#F、論理式より、そのまま
A*BとCの排他的論理和を取ればいいので、第1段と
同じ構成を取ればいい。節点S5,S6はそれぞれ、
(A*B*C)#,A*B*Cとなる。第1段と同様
に、トランスファゲートを通過した後の節点S5,S6
は電圧降下を起こしているので、高電位側をインバータ
に入力すると貫通電流が流れる。これを防ぐため、第1
段と同様にプルアップP5,P6をつけ、高電位側を電
源電圧にし、貫通電流を防ぐ。和信号S,S#は、第3
段でバッファとしてのインバータを介して外部に出力さ
れる。From the sum output S, S # F, and the logical expression, the exclusive OR of A * B and C can be obtained as it is, so that the same configuration as in the first stage can be used. Nodes S5 and S6 are respectively
(A * B * C) #, A * B * C. As in the first stage, the nodes S5 and S6 after passing through the transfer gate
Since a voltage drop occurs, a through current flows when the high potential side is input to the inverter. To prevent this, the first
Pull-ups P5 and P6 are provided in the same manner as the stage, and the high potential side is set to the power supply voltage to prevent a through current. The sum signals S and S # are the third signals
The signal is output to the outside through an inverter as a buffer in the stage.
【0017】次に、桁上げ信号C0,C0#、加算値Aと
被加算値Bの排他的論理和、排他的論理和の否定と、加
算値Aとその否定A#、下位からの桁上げCとその否定
C#より、それぞれ(A*B)C+(A*B)#A、
(A*B)#A#+(A*B)C#で得られ、変形する
とそれぞれ、(AB+C(A*B))#,AB+C(A
*B)となる。従って、図1に示すように、トランスフ
ァゲートN5,N6によって節点S3の論理値はC
0#,トランスファゲートN7,N8によって節点S4
の論理値はC0となる。和信号同様、出力インバータ1
1,12を介して出力されるため、プルアップ回路のP
MOS,P3,P4によって高電位側の電圧を電源電圧
に引き上げる。Next, the carry signals C 0 and C 0 #, the exclusive OR of the addition value A and the addend B, the negation of the exclusive OR, the addition value A and its negation A #, From carry C and its negation C #, (A * B) C + (A * B) #A,
(A * B) #A # + (A * B) C #, and when deformed, they are (AB + C (A * B)) # and AB + C (A
* B). Accordingly, as shown in FIG. 1, the logical value of the node S3 is changed to C by the transfer gates N5 and N6.
0 #, node S4 by transfer gates N7 and N8
Is C 0 . As with the sum signal, output inverter 1
1 and 12, so that the pull-up circuit P
The voltage on the high potential side is raised to the power supply voltage by the MOSs, P3 and P4.
【0018】[0018]
【発明の効果】以上より明らかなように、本発明による
全加算器は、従来技術の、NMOS24個,PMOS4
個の合計28個、通常のトランジスタを使った場合は合
計32個のトランジスタを有する従来の全加算器に比べ
て、NMOS16個,PMOS10個の合計26個とよ
り少ない素子数で全加算器を構成できる。PMOSの素
子数が従来型に比べて多いが、プルアップ用として使っ
ているため駆動力は必要とせず、サイズは小さくてよ
い。また、全ての節点において、信号がフルスイングす
るため、定常状態においてはほとんど電力を消費しな
い。As is apparent from the above description, the full adder according to the present invention is composed of 24 NMOS transistors and 4 PMOS transistors of the prior art.
A total adder is composed of a total of 28 NMOS transistors and a total of 26 PMOS transistors and a smaller number of elements compared to a conventional full adder having a total of 32 transistors when a normal transistor is used. it can. Although the number of PMOS elements is larger than that of the conventional type, it does not require a driving force and is small in size because it is used for pull-up. Further, since the signal makes a full swing at all nodes, almost no power is consumed in a steady state.
【0019】従って、全加算器のチップ上における占有
面積を少なくして、かつ、消費電力の低減が可能な全加
算器を提供できる。Therefore, it is possible to provide a full adder capable of reducing the area occupied by the full adder on a chip and reducing power consumption.
【図1】この発明の全加算器の実施例の回路構成を示す
図である。FIG. 1 is a diagram showing a circuit configuration of an embodiment of a full adder according to the present invention.
【図2】従来の加算器の回路構成を示す図である。FIG. 2 is a diagram showing a circuit configuration of a conventional adder.
A,A# 加算値とその否定 B,B# 被加算値とその否定 C,C# 下位からの桁上げとその否定 S,S# 和出力とその否定 C0,C0# 桁上げ出力とその否定 N1〜N12 NMOSのトランスファゲート P1〜P6 プルアップ用のPMOS I1〜I4 出力インバータ S1〜S6 節点 N101〜N120 NMOSのトランスファゲート I101〜I104 出力インバータ S101〜S110 節点A, A # Addition value and its negation B, B # Addition value and its negation C, C # Carry from lower order and its negation S, S # Sum output and its negation C 0 , C 0 # Carry output N1 to N12 NMOS transfer gates P1 to P6 PMOSs for pull-up I1 to I4 Output inverters S1 to S6 Nodes N101 to N120 NMOS transfer gates I101 to I104 Output inverters S101 to S110 Nodes
Claims (2)
桁上げをCとする相補型パスゲートロジックによる全加
算器において、加算値A信号と被加算値B信号とから、AとBの排他的
論理和(A*B)信号と排他的論理和の否定(A*B)
#信号とを生成する第1の回路と、 上記第1の回路で生成された(A*B)信号と(A*
B)#信号と下位からの桁上げC信号とから、桁上げ出
力信号および和出力信号をそれぞれ生成する第2の回路
と第3の回路とを備え、 上記第1の回路と第2の回路と第3の回路とを同一の回
路で構成することを 特徴とする全加算器。1. A full adder using complementary pass gate logic in which an adder value is A, an addend value is B, and a carry from the lower order is C, an A signal is obtained from an adder A signal and an adder value B signal. And exclusive of B
Logical OR (A * B) signal and exclusive OR NOT (A * B)
# Signal, a (A * B) signal generated by the first circuit, and (A *
B) Carry out from # signal and carry C signal from lower
Second circuit for generating a force signal and a sum output signal, respectively
And a third circuit, wherein the first circuit, the second circuit, and the third circuit are operated in the same circuit.
A full adder characterized by comprising a road .
的論理和の否定とAとの論理積との論理和とから桁上げ
出力信号を生成し、 AとBの排他的論理和とCの否定との論理積と、AとB
の排他的論理和の否定とAの否定との論理積との論理和
とから桁上げ出力の否定信号を生成することを特徴とす
る請求項1に記載の全加算器。 2. The second circuit according to claim 1, wherein: an exclusive OR of A and B and a logical product of C;
Carry from negation of logical disjunction and disjunction of logical product of A
Generating an output signal ; ANDing the exclusive OR of A and B with the negation of C;
Of the exclusive negation of n and the negation of negation of A
And generating a carry output negation signal from
The full adder according to claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP20618493A JP3242226B2 (en) | 1993-08-20 | 1993-08-20 | Full adder |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP20618493A JP3242226B2 (en) | 1993-08-20 | 1993-08-20 | Full adder |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPH0756711A JPH0756711A (en) | 1995-03-03 |
| JP3242226B2 true JP3242226B2 (en) | 2001-12-25 |
Family
ID=16519209
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP20618493A Expired - Fee Related JP3242226B2 (en) | 1993-08-20 | 1993-08-20 | Full adder |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JP3242226B2 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| NL1020289C2 (en) * | 2002-04-02 | 2003-10-03 | Jan Hendrik Van De Pol | Device for adding or subtracting. |
-
1993
- 1993-08-20 JP JP20618493A patent/JP3242226B2/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| JPH0756711A (en) | 1995-03-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6498514B2 (en) | Domino circuit | |
| US5920218A (en) | Single-phase edge-triggered dual-rail dynamic flip-flop | |
| US5334888A (en) | Fast exclusive-or and exclusive-nor gates | |
| EP0822663A2 (en) | Separate set/reset paths for time critical signals | |
| US6107853A (en) | Sense amplifier based flip-flop | |
| US6566932B2 (en) | On-chip system with voltage level converting device for preventing leakage current due to voltage level difference | |
| US6081153A (en) | Latch circuit and flip-flop circuit having voltage level converting function | |
| US5708386A (en) | CMOS output buffer with reduced L-DI/DT noise | |
| US5808492A (en) | CMOS bidirectional buffer without enable control signal | |
| JP3582967B2 (en) | Latch circuit and flip-flop circuit with clock signal level conversion function | |
| US6005418A (en) | Low power consuming logic circuit | |
| JP3242226B2 (en) | Full adder | |
| JP3464425B2 (en) | Logic interface circuit and semiconductor memory device | |
| US5767696A (en) | Tri-state devices having exclusive gate output control | |
| US5650735A (en) | Low power, high performance latching interfaces for converting dynamic inputs into static outputs | |
| KR100278992B1 (en) | Full adder | |
| JPH0795040A (en) | Output buffer circuit with noise reducing circuit | |
| US5686851A (en) | Variable delay circuit | |
| JP3072888B2 (en) | Field programmable gate array | |
| KR100305710B1 (en) | Sense amplifier-based CMOS flip-flop with enhanced output transition speed | |
| JP3080038B2 (en) | Semiconductor integrated circuit | |
| Kumar et al. | Design and Simulation of Non-Inverting and Inverting Mixed Logic 2x4 Decoder Using Mentor Graphics 16nm Technology | |
| KR950002085B1 (en) | Data Output Buffer with Improved Latch Circuit | |
| KR100223763B1 (en) | Low noise output buffer circuit | |
| JP3080048B2 (en) | Clock supply circuit |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20071019 Year of fee payment: 6 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20081019 Year of fee payment: 7 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20081019 Year of fee payment: 7 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20091019 Year of fee payment: 8 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20091019 Year of fee payment: 8 |
|
| FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20101019 Year of fee payment: 9 |
|
| LAPS | Cancellation because of no payment of annual fees |