JPH01266627A - Logic circuit - Google Patents

Logic circuit

Info

Publication number
JPH01266627A
JPH01266627A JP9533688A JP9533688A JPH01266627A JP H01266627 A JPH01266627 A JP H01266627A JP 9533688 A JP9533688 A JP 9533688A JP 9533688 A JP9533688 A JP 9533688A JP H01266627 A JPH01266627 A JP H01266627A
Authority
JP
Japan
Prior art keywords
carry
input
bit
circuit
logic circuit
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.)
Pending
Application number
JP9533688A
Other languages
Japanese (ja)
Inventor
Ritsu Kusaba
律 草場
Takeshi Takeya
武谷 健
Takao Yano
矢野 隆夫
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.)
Nippon Telegraph and Telephone Corp
Original Assignee
Nippon Telegraph and Telephone Corp
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 Nippon Telegraph and Telephone Corp filed Critical Nippon Telegraph and Telephone Corp
Priority to JP9533688A priority Critical patent/JPH01266627A/en
Publication of JPH01266627A publication Critical patent/JPH01266627A/en
Pending legal-status Critical Current

Links

Abstract

PURPOSE:To obtain a high integrated logic circuit by a simple circuit by using the uppermost bit of a unit circuit as multi-input AND. CONSTITUTION:Input data In-In+3 are inputted from the 1 side at every N bits, and On-On+3 are outputted from the 2 side. A carry input Cn-1 is inputted from the 3 side, and outputted to Cn+3 of the 4 side. When this unit circuit is a 4-bit unit, the carry propagates successively 3 bits, and the fourth bit goes to multi-input AND. As a result, the circuit constitution is simplified, and also, a delay time caused by propagation of the carry in a unit circuit can be made the same as that of a CLA system.

Description

【発明の詳細な説明】 〔発明の属する技術分野〕 本発明は、ディジタル論理におけるインクリメンタの論
理構成に関するものである。
DETAILED DESCRIPTION OF THE INVENTION [Technical field to which the invention pertains] The present invention relates to a logical configuration of an incrementer in digital logic.

〔従来の技術〕[Conventional technology]

インクリメンタとは、入力データと前段からのキャリ入
力を加算して出力と次段へのキャリを計算する機能を有
するものである。従来のインクリメント方式の代表例に
は、キャリ・ルック・アヘッド(OLA)方式がある。
The incrementer has a function of adding input data and a carry input from the previous stage to calculate an output and a carry to the next stage. A typical example of the conventional incremental method is the carry look ahead (OLA) method.

図3は、従来のN(uXn)ピッ) CLA方式の例で
、μビットごとに入力データエ、〜工。+8が、lより
入り、λよ!1IOn〜On+8が出力される。キャリ
入力0n−1(n=0のときC+n)は3から入力し、
≠のC1+3に出力される。
FIG. 3 shows an example of the conventional N(uXn) CLA method, in which input data is input for each μ bit. +8 comes in from l, λ! 1IOn to On+8 are output. Carry input 0n-1 (C+n when n=0) is input from 3,
It is output to C1+3 of ≠.

OLA方式では、キャリの計算を高速化するため各ピッ
)nで、そのビット以下の入力データの多入力AND(
工。・工。−1・・工1−CIn)から、各ビットごと
の繰シ上がり出力Cnをデータ入力と同時に計算してい
る。多大、力ANDのファンイン数は、回路動作の制約
上最大jビット程度に抑える必要がある。
In the OLA method, in order to speed up carry calculation, at each bit)n, multiple input AND(
Engineering.・Eng. -1...C1-CIn), the carry output Cn for each bit is calculated at the same time as data input. The fan-in number of the large AND must be suppressed to a maximum of about j bits due to circuit operation constraints.

そのため、!ピット以上のインクリメンタを構成する場
合には、グ〜!ピット単位で図3のような一つの決まま
た論理回路を作り、図tのように基本回路を複数個、キ
ャリが伝搬するよりに構成する。従って、単位回路間は
、キャリが逐次伝搬している。このインクリメンタが最
も時間を要するのは、キャリが最下位ビットから最上位
ビットまで繰上がる場合である。CLA方式の場合、単
位回路内の最上位ビットのキャリ計算に比べ、下位のビ
ットは直接キャリの伝搬時間に影響しない。全体のハー
ドウェアの量に関しては、単位回路のハードウェアに単
位回路の数を乗じたものとなりLSIで構成した場合に
は大きなバタン占有面積を占める。
Therefore,! When configuring an incrementer over a pit, go! One fixed logic circuit as shown in FIG. 3 is created for each pit, and a plurality of basic circuits are constructed in such a way that carries propagate as shown in FIG. t. Therefore, carries propagate sequentially between unit circuits. This incrementer takes the most time when the carry is carried from the least significant bit to the most significant bit. In the case of the CLA method, compared to the carry calculation of the most significant bit within a unit circuit, the lower bits do not directly affect the carry propagation time. Regarding the total amount of hardware, it is equal to the hardware of a unit circuit multiplied by the number of unit circuits, and when constructed using an LSI, it occupies a large area.

〔目 的〕〔the purpose〕

本発明の目的は、回路が簡単で高集積な論理回路を提案
するものである。
An object of the present invention is to propose a logic circuit that is simple and highly integrated.

〔発明の構成〕[Structure of the invention]

かかる目的を達成するために、単位回路の最上位ビット
のキャリ計算のみをキャリが入力されるのと同時に行う
多入力ANDとし、下位ビットは回路の簡単なキャリを
逐次計算する2入力ANDとすることで、ハードウェア
量が軽減されたCLA方式のインクリメンタを構成する
To achieve this purpose, a multi-input AND is used to calculate only the most significant bit of the unit circuit at the same time as the carry is input, and a two-input AND is used to sequentially calculate the simple carries of the circuit for the lower bits. This constitutes a CLA type incrementer with a reduced amount of hardware.

〔実施例〕〔Example〕

以下に、図面を用いて本発明を具体的に説明する。 The present invention will be specifically explained below using the drawings.

i/の実施例を図7に示す。単位回路がμビット単位の
場合は、3ビツト目までをキャリが逐次伝搬し、グピッ
ト目を多入力ANDとする。こうすることによって、回
路構成を簡単化し、しかも単位回路のキャリの伝播によ
る遅延時間はCLA方式と同じにできる。本発明とCL
A方式を比較した結果を表/に示す。この表で遅延時間
とは、本発明とOLA方式のμビット単位回路の実施例
において73μmルールの0MO8論理シミュレータに
よって入力データが全て/のときに、キャリ入力を/に
した場合出力データが遅れて出力される遅延時間を算出
した結果である。トランジスタ数とは、この論理を0M
O8で実現した場合、exclusive ORを除(
AND部のPch、N−chトランジスタの合計を比較
したものである。
An example of i/ is shown in FIG. When the unit circuit is in units of μ bits, carries propagate successively up to the third bit, and the second bit is used as a multi-input AND. By doing so, the circuit configuration can be simplified, and the delay time due to carry propagation in the unit circuit can be made the same as in the CLA system. The present invention and CL
The results of comparing Method A are shown in Table/. In this table, the delay time means that in the embodiment of the present invention and OLA type μ-bit unit circuit, when all the input data is / and the carry input is /, the output data will be delayed using the 0MO8 logic simulator with the 73μm rule. This is the result of calculating the delay time to be output. The number of transistors refers to this logic as 0M
When realized in O8, exclusive OR is excluded (
This is a comparison of the total of Pch and N-ch transistors in the AND section.

本発明の方式は各ゲート3ビツト目までのキャリ計算は
CLAより遅いがグピット目でCLA方式に追いつくた
め、インクリメンタ全体のキャリ伝搬速度は双方とも同
じである。ハードウェアの量において、発明した方式は
面積的に弘ビット単位の場合、CLA方式に比べて約2
0% トランジスタ数の削減が可能となり、高集積化に
有利となる。
In the method of the present invention, the carry calculation up to the third bit of each gate is slower than the CLA method, but it catches up with the CLA method in the third bit, so the carry propagation speed of the entire incrementer is the same for both. In terms of the amount of hardware, the invented method is approximately 2 times smaller than the CLA method in terms of area per Hirobit.
0% The number of transistors can be reduced, which is advantageous for high integration.

表  / 図2は、下位のキャリ伝搬の計算をトランスファ・ゲー
トで実現した第2の実施例である。実現しにくい多入力
ANDをトランスファ・ゲートで下位ビットのキャリ計
算できるのも本発明の利点の7つであり、トランスファ
・ゲートを用いる事で従来CLA方式よりも高速化が図
れる。
Table/FIG. 2 shows a second embodiment in which calculation of lower carry propagation is realized by a transfer gate. Another advantage of the present invention is that it is possible to perform carry calculations of lower bits using transfer gates for multi-input AND, which is difficult to implement, and by using transfer gates, it is possible to achieve higher speed than the conventional CLA method.

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

以上説明したように本発明によれば、回路が簡単で、高
集積なインクリメンタを構成できる。
As explained above, according to the present invention, it is possible to configure a highly integrated incrementer with a simple circuit.

これを個別回路やLSIに使用することにより論理装置
、及びLSI等の高性能化に寄与し、特にプロセッサの
制御並びに演算用に応用が可能である。
By using this in individual circuits and LSIs, it contributes to higher performance of logic devices, LSIs, etc., and is particularly applicable to processor control and arithmetic operations.

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

第1図は本発明の実施例/、第2図は本発明の実施例!
、第3図は従来のCLA方式の回路例、第≠図はインク
リメンタの構成である。 /・・・入力データ、2・・・出力データ、3・・・キ
ャリ入力、≠・・・キャリ出力、!・・・単位回路。
Figure 1 is an example of the present invention/ Figure 2 is an example of the present invention!
, FIG. 3 shows an example of a conventional CLA system circuit, and FIG. 3 shows the configuration of an incrementer. /...input data, 2...output data, 3...carry input, ≠...carry output,! ...Unit circuit.

Claims (1)

【特許請求の範囲】[Claims] Nビットの数値データを複数のブロックに分割して入力
し、各々のブロックのキャリ出力端子が他のブロックの
キャリ入力端子に接続されて構成されるNビットインク
リメント機能を有する論理回路において、上記キャリ出
力端子に供給するキャリ出力信号を多入力ゲートの論理
積ゲートで出力し、上記ブロック内で使用される他のキ
ャリ信号を最上位ビットを除く2入力の論理積ゲートで
遂次出力するように各ブロックを構成したことを特徴と
する論理回路。
In a logic circuit having an N-bit increment function, in which N-bit numerical data is input divided into a plurality of blocks and a carry output terminal of each block is connected to a carry input terminal of another block, the above-mentioned carry The carry output signal supplied to the output terminal is outputted by a multi-input AND gate, and the other carry signals used in the above block are successively outputted by a 2-input AND gate excluding the most significant bit. A logic circuit characterized by comprising each block.
JP9533688A 1988-04-18 1988-04-18 Logic circuit Pending JPH01266627A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP9533688A JPH01266627A (en) 1988-04-18 1988-04-18 Logic circuit

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP9533688A JPH01266627A (en) 1988-04-18 1988-04-18 Logic circuit

Publications (1)

Publication Number Publication Date
JPH01266627A true JPH01266627A (en) 1989-10-24

Family

ID=14134867

Family Applications (1)

Application Number Title Priority Date Filing Date
JP9533688A Pending JPH01266627A (en) 1988-04-18 1988-04-18 Logic circuit

Country Status (1)

Country Link
JP (1) JPH01266627A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05233219A (en) * 1992-02-18 1993-09-10 Nec Ic Microcomput Syst Ltd Carry prefetching circuit for semiconductor integrated circuit

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05233219A (en) * 1992-02-18 1993-09-10 Nec Ic Microcomput Syst Ltd Carry prefetching circuit for semiconductor integrated circuit

Similar Documents

Publication Publication Date Title
US4525797A (en) N-bit carry select adder circuit having only one full adder per bit
US5818743A (en) Low power multiplier
US5151875A (en) MOS array multiplier cell
US4682303A (en) Parallel binary adder
US4592005A (en) Masked arithmetic logic unit
US4369500A (en) High speed NXM bit digital, repeated addition type multiplying circuit
US3524977A (en) Binary multiplier employing multiple input threshold gate adders
JPS6131890B2 (en)
JP4607604B2 (en) 4: 2 CSA cell and 4: 2 carry save addition method
JPH02217920A (en) Adder using carry-look ahead
JPS60116034A (en) Adding circuit
JPS6159014B2 (en)
US7024445B2 (en) Method and apparatus for use in booth-encoded multiplication
US7325025B2 (en) Look-ahead carry adder circuit
US4815019A (en) Fast ALU equals zero circuit
JPH01266627A (en) Logic circuit
JPS61120245A (en) Carry retentionn propagation adder
JPH0450614B2 (en)
JP2608600B2 (en) Apparatus for calculating parity bit of sum of two numbers
US6631393B1 (en) Method and apparatus for speculative addition using a limited carry
US5493525A (en) Carry-chain compiler
US6954773B2 (en) Providing an adder with a conversion circuit in a slack propagation path
JPH09185493A (en) Integrated circuit for adder
JP2643576B2 (en) Address generation circuit for fast Fourier transform
US6990509B2 (en) Ultra low power adder with sum synchronization