JPH0497423A - Adder - Google Patents

Adder

Info

Publication number
JPH0497423A
JPH0497423A JP21600490A JP21600490A JPH0497423A JP H0497423 A JPH0497423 A JP H0497423A JP 21600490 A JP21600490 A JP 21600490A JP 21600490 A JP21600490 A JP 21600490A JP H0497423 A JPH0497423 A JP H0497423A
Authority
JP
Japan
Prior art keywords
carry
circuit
signal
bit
adder
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.)
Granted
Application number
JP21600490A
Other languages
Japanese (ja)
Other versions
JP2552028B2 (en
Inventor
Yasutaka Sakaguchi
坂口 靖孝
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC IC Microcomputer Systems Co Ltd
Original Assignee
NEC IC Microcomputer Systems Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by NEC IC Microcomputer Systems Co Ltd filed Critical NEC IC Microcomputer Systems Co Ltd
Priority to JP2216004A priority Critical patent/JP2552028B2/en
Publication of JPH0497423A publication Critical patent/JPH0497423A/en
Application granted granted Critical
Publication of JP2552028B2 publication Critical patent/JP2552028B2/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Abstract

PURPOSE:To attain rapid addition by providing this adder with an n-bit carry by-pass control signal generating circuit having circuits for finding out OR operation of respective bits and an AND circuit for inputting the outputs of OR circuits corresponding to n-bits. CONSTITUTION:The OR circuit 2 is a circuit block for finding out OR operation between two signals X(i), Y(i) and outputs an 1-bit carry by-pass control signal. The n-bit input AND circuit 3 finds out AND of respective 1-bit carry by-pass control signals and outputs a signal for controlling the carry by-passes of n-bits. A 2-input AND circuit 4 propagates a carry from a carry signal Cin when the output of the circuit 3 is '1' or masks the carry from the carry signal Cin when the output of the circuit is '0'. A 2-input OR circuit 5 outputs a carry signal Cout when a faster signal out of a carry outputted from a ripple carry line and a carry passed through a CLA is determined. Thereby, an average operation time depending upon data can be shortened.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は加算器に係り、特に桁上げ先見回路(以下CL
Aと略す)を用いた加算器に関する。
[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to an adder, and particularly to a carry look-ahead circuit (hereinafter referred to as CL).
This invention relates to an adder using an adder (abbreviated as A).

〔従来の技術〕[Conventional technology]

従来のCLAを用いた加算器は、第2図に示すように、
各ビット加算ブロック1内のり・・lプルキャリー伝達
制御信号Pのnビ・/ト分の論理積をとった信号で、最
下位ビット加算ブロックへ入力されるキャリーをnビッ
ト分バイパスさせるための制御信号B′としている。こ
こで、各ビット加算ブロック1のリップルキャリー制御
信号Pは各ビット毎の2つの入力データの[Exc l
us 1ve−OR〕をとったものである。
The conventional adder using CLA is as shown in Fig. 2.
In each bit addition block 1, it is a signal obtained by ANDing n bits of pull carry transmission control signal P, and is a control for bypassing the carry input to the least significant bit addition block by n bits. The signal is designated as B'. Here, the ripple carry control signal P of each bit addition block 1 is [Exc l
us 1ve-OR].

第2図において、E−ORゲートと電界効果トランジス
タとからなる1ビツト全加算ブロツク1が、多数配列さ
れ、加算器入力nビットデータX(n)、Y(n)、加
算器入力キャリー信号Ci、が入力され、演算結果nビ
ットデータ5(n)、加算器出力キャリー信号Cc+ 
u Lが出力される。加算プロ・ツク1がらの1ビツト
キヤリ一バイパス制御信号Bは、r1人力AND回路に
入力され、nピッ1〜キヤリーバイパス制御信号B′を
出力し、さらに2人力AND回路4を介して、2人力O
R回路5を経て、出力キャリー信号C1eとして出力さ
れる。
In FIG. 2, a large number of 1-bit full addition blocks 1 consisting of E-OR gates and field effect transistors are arranged, and adder input n-bit data X(n), Y(n), adder input carry signal Ci , is input, the operation result is n-bit data 5(n), and the adder output carry signal Cc+
uL is output. The 1-bit carry-bypass control signal B from the adder circuit 1 is input to the r1 manual AND circuit, which outputs the n-pi1 to carry-bypass control signal B', and further passes through the 2-man AND circuit 4 to the 2 Human power O
It passes through the R circuit 5 and is output as an output carry signal C1e.

〔発明が解決しようとする課題〕[Problem to be solved by the invention]

従来の加算器は、各ビ・ント加算プロ・ツク1のキヤリ
−バイパス制御信号Bに、各ビット加算ブロックのデー
タ2人力の(EOR)をとった信号、つまりリップルキ
ャリー伝達制御信号Pをそのまま流用していたため、キ
ャリーがnビット分の加算ブロックをバイパスする条件
は限られていた。
The conventional adder uses the carry-bypass control signal B of each bit addition block 1 as a signal obtained by taking the EOR of the data 2 of each bit addition block, that is, the ripple carry transmission control signal P. Because of the diversion, there were limited conditions for the carry to bypass the addition block for n bits.

よってnビット加算ブロック内でキャリーが発生し、そ
のキャリーがnビット加算ブロック外へ出て行く条件で
、最下位ビット加算ブロックへキャリーが入力される場
合に、CLA回路が動作せず、リップルキャリーライン
のスピードが直接加算全体のスピードとなり、加算器の
高速化への妨げとなっていた。
Therefore, if a carry occurs in the n-bit addition block and the carry is input to the least significant bit addition block under the condition that the carry goes out of the n-bit addition block, the CLA circuit will not operate and a ripple carry will occur. The speed of the line directly became the speed of the entire addition, which was an obstacle to increasing the speed of the adder.

本発明の目的は、前記問題点と解決し、高速で加算でき
るようにした加算器と提供することにある。
SUMMARY OF THE INVENTION An object of the present invention is to solve the above-mentioned problems and provide an adder that can perform addition at high speed.

〔課題を解決するための手段〕[Means to solve the problem]

本発明の加算器の構成は、各ビット毎の入力データの論
理和をとる回路と、nビット分の論理和回路出力を受け
る論理積回路とを有するnビア t−キャリーバイパス
制御信号発生回路を備えでいることを特徴とする。
The configuration of the adder of the present invention includes an n-via t-carry bypass control signal generation circuit having a circuit that takes the logical sum of input data for each bit, and an AND circuit that receives the output of the logical sum circuit for n bits. Characterized by being prepared.

〔実施例〕 次に図面を参照しながら本発明を説明する。〔Example〕 Next, the present invention will be explained with reference to the drawings.

第1図は本発明の一実施例の加算器を示すブロック図で
ある。第1図において、本実施例は、1ビツト加算ブロ
ツク1がOR回路を含み、構成される。
FIG. 1 is a block diagram showing an adder according to an embodiment of the present invention. In FIG. 1, in this embodiment, a 1-bit addition block 1 includes an OR circuit.

この1ビツト加算ブロツク1は、加算器入力X(i)、
 Y(i)<i=0.1.−n−1>と下位ブロックが
らのキャリー信号c1.を入力して、演算結果5(j)
とキャリー信号Ca u Iを出力する1ビツトのりノ
ブルキャリー加算プロ・・lりである。
This 1-bit addition block 1 has adder inputs X(i),
Y(i)<i=0.1. -n-1> and the carry signal c1. from the lower block. Input the calculation result 5(j)
This is a 1-bit node carry addition program which outputs a carry signal Ca u I and a carry signal Ca u I.

OR回路2は、X(i)、’r−(i)(i=0゜1、
・・、n−1)の2信号の論理和をとる回路ブロックで
あり、1ビツトキヤリ一バイパス制御信号を出力する。
The OR circuit 2 has X(i), 'r-(i) (i=0°1,
..., n-1), and outputs a 1-bit carry-bypass control signal.

n人カAND回路3は、各ヒ・/トのキャリーバイパス
制御信号のCAND)をとり、「lビット分のキャリー
バイパスを制御する信号を出力する。2人カAND回路
4は、AND回路3の出力が”l”のときキャリー信号
c1..がらのキャリーを伝搬し、AND回路3の出力
が“0”のときは、キャリー信号C1゜がらのキャリー
をマスクする働きをする。2人力OR回路5は、リップ
ルキャリーラインから来るキャリーと、CLAき通って
来るキャリーのうち速い信号とが決まり次第、キャリー
信号C0U、を出力する回路である。この加算器入力X
(i)、Y(i>が、共に°゛0”でなければ、当ビッ
トのキャリーバイパス制御信号Bが”1”となり、キャ
リーのバイパスを許可する。
The n-person AND circuit 4 takes the carry-bypass control signals of each person (CAND) and outputs a signal for controlling the carry-bypass for l bits. When the output of the AND circuit 3 is "L", the carry from the carry signal c1.. is propagated, and when the output of the AND circuit 3 is "0", it functions to mask the carry from the carry signal C1. Circuit 5 is a circuit that outputs a carry signal C0U as soon as the faster signal of the carry coming from the ripple carry line and the carry passing through CLA is determined.This adder input X
If both (i) and Y(i>) are not 0, the carry bypass control signal B of the relevant bit becomes 1, permitting carry bypass.

更にnビット分即ちn本のキャリーバイパス制御信号B
が“1°゛になると、n入力AND回路3の出力が“1
”となり、キャリー信号C0がらのキャリーをバイパス
させることができる。このとき、キャリー信号C11l
の入力が“○”即ちキャリーが入って来なければキャリ
ー信号C0,、tの出力はりップルキャリーラインから
来るキャリーが出力され、またキャリー信号C+fiの
入力が“1”つまりキャリーが入って来れば、キャリー
信号Coutの出力はリップルキャリーラインから来る
キャリーと、CLAを通って来るキャリーの内速い方と
が決まり次第、キャリーが出方される。
Furthermore, n bits, that is, n carry bypass control signals B
becomes “1°”, the output of the n-input AND circuit 3 becomes “1°”.
”, and the carry from the carry signal C0 can be bypassed. At this time, the carry signal C11l
If the input of is "○", that is, there is no carry coming in, the output of the carry signal C0,,t is the carry coming from the ripple carry line, and the input of the carry signal C+fi is "1", which means that the carry is not coming in. For example, the carry signal Cout is output as soon as the faster one of the carry coming from the ripple carry line and the carry coming through the CLA is determined.

〔発明の効果〕〔Effect of the invention〕

以上説明したように、本発明は、各ビットキャリーバイ
パス制御信号を各ビット加算ブロックのデータ2人力の
論理和とし、キャリーがCLA回路を通ること、つまり
nヒフ8分バイパスする入力データの組み合わせ条件が
増えたことで、リップルキャリーのラインでのみキャリ
ーを伝達していた条件でもCLA回路を使うようになり
、ブタに依存する平均演算時間が短くなるという効果を
有する。
As explained above, in the present invention, each bit carry bypass control signal is the logical sum of two data of each bit addition block, and the combination condition of the input data is such that the carry passes through the CLA circuit, that is, the input data is bypassed by n high 8 minutes. As a result of this increase, the CLA circuit is now used even under conditions where carry is transmitted only on the ripple carry line, which has the effect of shortening the average calculation time that depends on the pig.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図は本発明の一実施例の加算器のブロック図、第2
図は従来の加算器のブロック図である。 ]・・・1ビット全加算ブロック、2・・・1ビ・lト
キャリーバイパス制御信号発生回路、3−・・n大カA
ND@B、4・−・2人カAND回路、5・2人ヵOR
回路、X (n) 、 Y (n)−加算器入力nビッ
トデータ、C1゜・・・加算器入力キャリー信号、Co
ut・・・加算器出力キャリー信号、5(n)・・・演
算結果nビットデータ、B・・・1ビツトキヤリ一バイ
パス制御信号、B′・・・nビットキャリーバイパス制
御信号、P−・・リップルキャリー伝達制御信号。
FIG. 1 is a block diagram of an adder according to an embodiment of the present invention, and FIG.
The figure is a block diagram of a conventional adder. ]...1-bit full addition block, 2...1-bit carry bypass control signal generation circuit, 3-...n large power A
ND@B, 4--2 person AND circuit, 5-2 person OR
Circuit, X (n), Y (n) - Adder input n-bit data, C1゜... Adder input carry signal, Co
ut...Adder output carry signal, 5(n)...Arithmetic result n-bit data, B...1-bit carry-bypass control signal, B'...n-bit carry-bypass control signal, P-... Ripple carry transfer control signal.

Claims (1)

【特許請求の範囲】[Claims] 加算器の入力データの各ビット毎の論理和をとる回路と
、前記nビット分の論理和回路の出力を入力とする論理
積回路とを有するnビットキャリーバイパス制御信号発
生回路とを備えたことを特徴とする加算器。
comprising an n-bit carry bypass control signal generation circuit having a circuit for calculating the logical sum of each bit of the input data of the adder, and an logical product circuit whose input is the output of the logical sum circuit for the n bits; An adder featuring:
JP2216004A 1990-08-16 1990-08-16 Adder Expired - Lifetime JP2552028B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2216004A JP2552028B2 (en) 1990-08-16 1990-08-16 Adder

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2216004A JP2552028B2 (en) 1990-08-16 1990-08-16 Adder

Publications (2)

Publication Number Publication Date
JPH0497423A true JPH0497423A (en) 1992-03-30
JP2552028B2 JP2552028B2 (en) 1996-11-06

Family

ID=16681802

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2216004A Expired - Lifetime JP2552028B2 (en) 1990-08-16 1990-08-16 Adder

Country Status (1)

Country Link
JP (1) JP2552028B2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9594317B2 (en) 2014-01-09 2017-03-14 Samsung Electronics Co., Ltd. Organic photoreceptor, and electrophotographic cartridge and electrophotographic imaging apparatus including the same

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5930328A (en) * 1982-08-14 1984-02-17 Agency Of Ind Science & Technol Unit cell for logical operation

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5930328A (en) * 1982-08-14 1984-02-17 Agency Of Ind Science & Technol Unit cell for logical operation

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9594317B2 (en) 2014-01-09 2017-03-14 Samsung Electronics Co., Ltd. Organic photoreceptor, and electrophotographic cartridge and electrophotographic imaging apparatus including the same

Also Published As

Publication number Publication date
JP2552028B2 (en) 1996-11-06

Similar Documents

Publication Publication Date Title
US4707800A (en) Adder/substractor for variable length numbers
US6301600B1 (en) Method and apparatus for dynamic partitionable saturating adder/subtractor
JP3388819B2 (en) Process for executing numerical calculation and arithmetic unit for implementing the process
JPH0225537B2 (en)
JPH0651953A (en) Adder
US4704701A (en) Conditional carry adder for a multibit digital computer
JPH0497423A (en) Adder
JPH056263A (en) Adder and absolute value calculation circuit using the adder
JPS60156139A (en) Absolute difference calculating circuit
JP2885402B2 (en) Carry propagation circuit of parallel type full adder
KR0144416B1 (en) Full adder
EP1081590A1 (en) An incrementer/decrementer having a reduced fan-out architecture
JPS60140425A (en) Carry circuit
EP0984356A1 (en) A carry lookahead adder having a reduced fanout architecture
JPH0479014B2 (en)
JPS63100536A (en) Adding circuit
JP3234621B2 (en) Carry look-ahead adder
JPS648858B2 (en)
JPH0436829A (en) Full adder circuit
JPH11143684A (en) Carry look-ahead circuit and parallel adder
JPH07191830A (en) Arithmetic unit
JPH026683Y2 (en)
JPH0367327A (en) Addition circuit
JPH02231629A (en) Floating point arithmetic unit
JPH0192831A (en) Adding circuit