JPH05342302A - Multilevel logic optimizing device - Google Patents

Multilevel logic optimizing device

Info

Publication number
JPH05342302A
JPH05342302A JP4153742A JP15374292A JPH05342302A JP H05342302 A JPH05342302 A JP H05342302A JP 4153742 A JP4153742 A JP 4153742A JP 15374292 A JP15374292 A JP 15374292A JP H05342302 A JPH05342302 A JP H05342302A
Authority
JP
Japan
Prior art keywords
factor
cost
wiring
area
delay
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
JP4153742A
Other languages
Japanese (ja)
Other versions
JP2970227B2 (en
Inventor
Naotaka Maeda
直孝 前田
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 Corp
Original Assignee
NEC 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 NEC Corp filed Critical NEC Corp
Priority to JP4153742A priority Critical patent/JP2970227B2/en
Publication of JPH05342302A publication Critical patent/JPH05342302A/en
Application granted granted Critical
Publication of JP2970227B2 publication Critical patent/JP2970227B2/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Abstract

PURPOSE:To reduce the circuit area and to increase the calculation speed by determining an optimum factor in consideration of not only the area cost of the factor itself and the delay cost but also the wiring cost. CONSTITUTION:A factor candidate enumerating means 2 enumerates factor candidates of an object circuit. An area candidate calculating means 3 and a delay cost calculating means 4 calculate area costs and delay costs of these factor candidates by constraint conditions. A wiring cost calculating means 5 calculates the fan-out number of each factor by a fan-out number calculating means, and a wiring area cost calculating means calculates the area cost of wiring based on this fan-out number in accordance with a calculation formula preliminarily estimated for each technology, and a wiring delay cost calculating means calculates the delay cost of wiring in the same manner. A wiring cost adding means adds these costs related to wiring to costs obtained by the area cost calculating means 3 and the delay cost calculating means 4 to calculate the total cost. A factor determining means 6 selects and determines one having the optimum total cost out of factor candidates.

Description

【発明の詳細な説明】Detailed Description of the Invention

【0001】[0001]

【産業上の利用分野】本発明は、論理回路の最適化手段
に利用する。特に、多段論理の最適化手段に関する。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention is used for optimizing logic circuits. In particular, it relates to optimization means for multi-level logic.

【0002】[0002]

【従来の技術】従来、この種の多段論理最適化装置は、
対象回路の因子候補を列挙した後に、これらの因子自身
の面積コストおよび遅延コストのみによって最適な因子
を決定していた。
2. Description of the Related Art Conventionally, this type of multistage logic optimizing device is
After enumerating the candidate factors of the target circuit, the optimum factor was determined only by the area cost and delay cost of these factors themselves.

【0003】[0003]

【発明が解決しようとする課題】このような従来例で
は、最適な因子を因子自身の面積コストおよび遅延コス
トのみで決定し、因子を採用した場合の配線コストを考
慮に入れていないので、配線による面積または遅延が無
視できないほどに増大し、結果として最適な回路が得ら
れない場合が生ずる欠点がある。
In such a conventional example, the optimum factor is determined only by the area cost and delay cost of the factor itself, and the wiring cost when the factor is adopted is not taken into consideration. However, there is a drawback in that the area or the delay due to is increased to a non-negligible amount, and as a result, an optimum circuit may not be obtained.

【0004】本発明は、このような欠点を除去するもの
で、一層の回路面積の縮小および高速化が図れる手段を
もつ多段論理回路最適化装置を提供することを目的とす
る。
An object of the present invention is to eliminate such drawbacks and to provide a multi-stage logic circuit optimizing device having means capable of further reducing the circuit area and increasing the speed.

【0005】[0005]

【課題を解決するための手段】本発明は、与えられた入
力端子への信号到着時刻および出力端子への信号要求時
刻を含む制約条件を格納する制約条件入力手段と、多段
論理最適化対象回路の因子候補を列挙する因子候補列挙
手段と、制約条件入力手段に格納された制約条件に基づ
き上記因子候補列挙手段で列挙された因子候補の面積コ
ストおよび遅延コストを計算するコスト計算手段と、上
記因子候補列挙手段で列挙された因子候補の内でトータ
ルコストが最適な因子を決定する因子決定手段と、この
因子決定手段で決定された因子が所定の閾値を超えると
きにこの因子を採用する終了判定手段と、この終了判定
手段で採用された因子を上記多段論理回路へ適用して回
路構成を変更する因子代入手段とを備えた論理最適化装
置において、上記因子候補列挙手段で列挙された因子候
補のファンアウト数に基づき配線に関する面積コストお
よびまたは遅延コストを計算し、この計算結果の和であ
る配線コストに上記コスト計算手段で求まるコストを加
算した結果をトータルコストとして生成する配線コスト
計算手段を備えたことを特徴とする。
According to the present invention, there is provided constraint condition input means for storing constraint conditions including a signal arrival time at a given input terminal and a signal request time at an output terminal, and a multi-stage logic optimization target circuit. Factor candidate enumerating means for enumerating the factor candidates, cost calculating means for calculating area cost and delay cost of the factor candidates enumerated by the factor candidate enumerating means based on the constraint condition stored in the constraint condition inputting means, and Factor determining means for determining the factor with the optimum total cost among the factor candidates listed by the factor candidate listing means, and adopting this factor when the factor determined by this factor determining means exceeds a predetermined threshold value. A logic optimizing device comprising: a determining means; and a factor substituting means for applying a factor adopted by the end determining means to the multi-stage logic circuit to change a circuit configuration, The area cost and / or the delay cost related to the wiring are calculated based on the fan-out numbers of the factor candidates listed by the child candidate listing means, and the result obtained by adding the cost obtained by the cost calculating means to the wiring cost which is the sum of the calculation results is calculated. It is characterized in that it is provided with a wiring cost calculation means for generating it as a total cost.

【0006】[0006]

【作用】最適な因子を因子自身の面積コスト、遅延コス
トの他に配線コストも考慮に入れて決定する。これによ
り、配線による面積または遅延が無視できないほどに増
大し、結果として最適回路が得られなくなるのを回避で
きる。
The optimum factor is determined in consideration of the area cost and delay cost of the factor itself and the wiring cost. As a result, it is possible to prevent the area or delay due to the wiring from increasing so much that it cannot be ignored, and as a result, the optimum circuit cannot be obtained.

【0007】[0007]

【実施例】以下、本発明の一実施例について図面を参照
して説明する。図1はこの実施例を示す全体構成図で、
この実施例は、制約条件入力手段1、因子候補列挙手段
2、面積コスト計算手段3、遅延コスト計算手段4、配
線コスト計算手段5、因子決定手段6、終了判定手段7
および因子代入手段8から構成されている。図2を参照
すると、配線コスト計算手段5は、ファンアウト数計算
手段21、配線面積コスト計算手段22、配線遅延コス
ト計算手段23および配線コスト加算手段24から構成
されている。すなわち、この実施例は、図1および図2
または図3に示すように、与えられた入力端子への信号
到着時刻および出力端子への信号要求時刻を含む制約条
件を格納する制約条件入力手段1と、最適化の対象にな
る多段論理回路の因子候補を列挙する因子候補列挙手段
2と、制約条件入力手段1に格納された制約条件に基づ
き因子候補列挙手段2で列挙された因子候補の面積コス
トおよび遅延コストを計算するコスト計算手段である面
積コスト計算手段3および遅延コスト計算手段4と、因
子候補列挙手段2で列挙された因子候補の内でトータル
コストが最適な因子を決定する因子決定手段6と、この
因子決定手段6で決定された因子が所定の閾値を超える
ときにこの因子を採用する終了判定手段7と、この終了
判定手段7で採用された因子を上記多段論理回路へ適用
して回路構成を変更する因子代入手段8とを備え、さら
に、本発明の特徴とする手段として、因子候補列挙手段
2で列挙された因子候補のファンアウト数に基づき配線
に関する面積コストおよびまたは遅延コストを計算し、
この計算結果の和である配線コストに上記コスト計算手
段で求まるコストを加算した結果をトータルコストとし
て生成する配線コスト計算手段5を備える。
DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is an overall configuration diagram showing this embodiment.
In this embodiment, constraint condition input means 1, factor candidate enumeration means 2, area cost calculation means 3, delay cost calculation means 4, wiring cost calculation means 5, factor determination means 6, end determination means 7
And factor substitution means 8. Referring to FIG. 2, the wiring cost calculation means 5 is composed of a fanout number calculation means 21, a wiring area cost calculation means 22, a wiring delay cost calculation means 23, and a wiring cost addition means 24. That is, this embodiment is similar to FIG.
Alternatively, as shown in FIG. 3, a constraint condition input means 1 for storing constraint conditions including a signal arrival time at a given input terminal and a signal request time at an output terminal, and a multi-stage logic circuit to be optimized. A factor candidate enumeration unit 2 that enumerates the factor candidates and a cost calculation unit that calculates the area cost and delay cost of the factor candidates enumerated by the factor candidate enumeration unit 2 based on the constraint condition stored in the constraint condition input unit 1. The area cost calculating means 3 and the delay cost calculating means 4, the factor determining means 6 for determining the optimum factor of the total cost among the factor candidates listed by the factor candidate listing means 2, and the factor determining means 6. When the factor exceeds a predetermined threshold value, the end determination means 7 that employs this factor, and the factor adopted by this end determination means 7 are applied to the multi-stage logic circuit to change the circuit configuration. And a factor assignment means 8 for further as a means which is a feature of the present invention, the area cost and or delay costs for wiring calculated based on the number of fan-out of the listed factors candidates factor candidate enumeration means 2,
The wiring cost calculation means 5 is provided for generating the total cost by adding the cost obtained by the cost calculation means to the wiring cost which is the sum of the calculation results.

【0008】次に、この実施例の動作について図面を参
照して説明する。入力端子への信号の到着時刻、出力端
子への信号の要求時刻等の制約条件が入力されると、制
約条件入力手段1はこれを内部データ構造に変換して格
納する。次に因子候補列挙手段2は対象回路の因子候補
を列挙する。面積コスト計算手段3、遅延コスト計算手
段4は制約条件よりこれらの因子候補の面積コスト、遅
延コストを計算する。次に配線コスト計算手段5は、フ
ァンアウト数計算手段21により各因子のファンアウト
数を計算する。これを元に、配線面積コスト計算手段2
2はあらかじめテクノロジごとに見積もられた計算式よ
り配線の面積コストを、同様に、配線遅延コスト計算手
段23は配線の遅延コストを計算する。配線コスト加算
手段24は、これらの配線に関するコストを、面積コス
ト計算手段3、遅延コスト計算手段4で求めたコストに
加えてトータルのコストを計算する。因子決定手段6は
因子候補の中からトータルコストの最適なものを選択し
因子と決定する。次に終了判定手段7は、この決定され
た因子のコストが特定のしきい値を満たすかどうかのチ
ェックを行い、満たす場合には因子代入手段8により実
際に因子を対象回路に代入して回路構成を変更し、因子
候補列挙手段2からの処理を繰り返す。また、満たさな
い場合にはこれ以上の多段化は不可能と判断し処理を終
了する。
Next, the operation of this embodiment will be described with reference to the drawings. When a constraint condition such as a signal arrival time at the input terminal and a signal request time at the output terminal is input, the constraint condition input means 1 converts the constraint condition into an internal data structure and stores it. Next, the factor candidate listing means 2 lists the factor candidates of the target circuit. The area cost calculation means 3 and the delay cost calculation means 4 calculate the area cost and delay cost of these factor candidates based on the constraint conditions. Next, the wiring cost calculation means 5 calculates the fanout number of each factor by the fanout number calculation means 21. Based on this, the wiring area cost calculation means 2
Reference numeral 2 calculates the wiring area cost from the calculation formula estimated in advance for each technology, and similarly, the wiring delay cost calculation means 23 calculates the wiring delay cost. The wiring cost adding means 24 adds the costs related to these wirings to the costs obtained by the area cost calculating means 3 and the delay cost calculating means 4, and calculates the total cost. The factor determining means 6 selects an optimal total cost from the factor candidates and determines it as a factor. Next, the end judging means 7 checks whether or not the cost of the decided factor satisfies a specific threshold value, and if it does, the factor substituting means 8 actually substitutes the factor into the target circuit to make the circuit. The configuration is changed and the processing from the factor candidate listing means 2 is repeated. If not satisfied, it is determined that further steps cannot be performed, and the process ends.

【0009】図3は図2に示す実施例の配線コスト計算
手段5を別な手段で実現した実施例の構成図であり、フ
ァンアウト数計算手段31、配線遅延コスト計算手段3
2、配線コスト加算手段33から構成されている。この
実施例では、配線コストの計算は遅延コストのみによっ
て行っている。また、配線コストの計算を面積コストの
みにより行うこともできる。
FIG. 3 is a block diagram of an embodiment in which the wiring cost calculation means 5 of the embodiment shown in FIG. 2 is realized by another means. The fanout number calculation means 31 and the wiring delay cost calculation means 3 are shown.
2. Wiring cost adding means 33 is included. In this embodiment, the wiring cost is calculated only by the delay cost. Further, the wiring cost can be calculated only by the area cost.

【0010】[0010]

【発明の効果】本発明は、以上説明したように、因子自
身のコストに加えて因子を採用した場合の配線コストも
考慮することにより、多段論理最適化後の回路の面積を
より小さくしたり、スピードをより速くすることができ
る効果がある。
As described above, the present invention makes it possible to further reduce the area of the circuit after the multi-stage logic optimization by considering the wiring cost when the factor is adopted in addition to the cost of the factor itself. , There is an effect that the speed can be made faster.

【図面の簡単な説明】[Brief description of drawings]

【図1】本発明実施例の全体構成を示す図。FIG. 1 is a diagram showing the overall configuration of an embodiment of the present invention.

【図2】図1に含まれる配線コスト計算手段の第一の構
成を示す図。
FIG. 2 is a diagram showing a first configuration of a wiring cost calculation means included in FIG.

【図3】図1に含まれる配線コスト計算手段の第二の構
成を示す図。
FIG. 3 is a diagram showing a second configuration of the wiring cost calculation means included in FIG.

【符号の説明】[Explanation of symbols]

1 制約条件入力手段 2 因子候補列挙手段 3 面積コスト計算手段 4 遅延コスト計算手段 5 配線コスト計算手段 6 因子決定手段 7 終了判定手段 8 因子代入手段 21、31 ファンアウト数計算手段 22 配線面積コスト計算手段 23、32 配線遅延コスト計算手段 24、33 配線コスト加算手段 1 constraint condition input means 2 factor candidate enumeration means 3 area cost calculation means 4 delay cost calculation means 5 wiring cost calculation means 6 factor determination means 7 end determination means 8 factor substitution means 21, 31 fanout number calculation means 22 wiring area cost calculation Means 23, 32 Wiring delay cost calculating means 24, 33 Wiring cost adding means

Claims (1)

【特許請求の範囲】[Claims] 【請求項1】 与えられた入力端子への信号到着時刻お
よび出力端子への信号要求時刻を含む制約条件を格納す
る制約条件入力手段と、最適化の対象になる多段論理回
路の因子候補を列挙する因子候補列挙手段と、上記制約
条件入力手段に格納された制約条件に基づき上記因子候
補列挙手段で列挙された因子候補の面積コストおよび遅
延コストを計算するコスト計算手段と、上記因子候補列
挙手段で列挙された因子候補の内でトータルコストが最
適な因子を決定する因子決定手段と、この因子決定手段
で決定された因子が所定の閾値を超えるときにこの因子
を採用する終了判定手段と、この終了判定手段で採用さ
れた因子を上記多段論理回路へ適用して回路構成を変更
する因子代入手段とを備えた論理最適化装置において、 上記因子候補列挙手段で列挙された因子候補のファンア
ウト数に基づき配線に関する面積コストおよびまたは遅
延コストを計算し、この計算結果の和である配線コスト
に上記コスト計算手段で求まるコストを加算した結果を
トータルコストとして生成する配線コスト計算手段を備
えたことを特徴とする多段論理最適化装置。
1. A constraint condition input means for storing constraint conditions including a signal arrival time at a given input terminal and a signal request time at an output terminal, and factor candidates of a multi-stage logic circuit to be optimized. Factor candidate enumeration means, cost calculation means for calculating the area cost and delay cost of the factor candidates enumerated by the factor candidate enumeration means based on the constraint conditions stored in the constraint condition input means, and the factor candidate enumeration means Among the factor candidates listed in, the factor determining means for determining the optimal factor for total cost, and the termination determining means for adopting this factor when the factor determined by this factor determining means exceeds a predetermined threshold value, In the logic optimizing device provided with a factor substituting unit for changing the circuit configuration by applying the factor adopted by the end judging unit to the multi-stage logic circuit, The area cost and / or delay cost related to the wiring is calculated based on the fan-out numbers of the factor candidates listed in the column, and the result obtained by adding the cost calculated by the above cost calculation means to the wiring cost which is the sum of this calculation is taken as the total cost. A multi-stage logic optimizing device comprising a wiring cost calculating means for generating.
JP4153742A 1992-06-12 1992-06-12 Multi-stage logic optimizer Expired - Lifetime JP2970227B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP4153742A JP2970227B2 (en) 1992-06-12 1992-06-12 Multi-stage logic optimizer

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP4153742A JP2970227B2 (en) 1992-06-12 1992-06-12 Multi-stage logic optimizer

Publications (2)

Publication Number Publication Date
JPH05342302A true JPH05342302A (en) 1993-12-24
JP2970227B2 JP2970227B2 (en) 1999-11-02

Family

ID=15569121

Family Applications (1)

Application Number Title Priority Date Filing Date
JP4153742A Expired - Lifetime JP2970227B2 (en) 1992-06-12 1992-06-12 Multi-stage logic optimizer

Country Status (1)

Country Link
JP (1) JP2970227B2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6629295B1 (en) 1998-06-24 2003-09-30 Nec Corporation Design automation method and device

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6629295B1 (en) 1998-06-24 2003-09-30 Nec Corporation Design automation method and device

Also Published As

Publication number Publication date
JP2970227B2 (en) 1999-11-02

Similar Documents

Publication Publication Date Title
EP0568374B1 (en) Parallelized magnitude comparator for comparing a binary number to a fixed value
US6090150A (en) Method of designing clock wiring and apparatus for implementing the same
US6460166B1 (en) System and method for restructuring of logic circuitry
US5819026A (en) System and method for arbitrating accelerator requests
US7016932B2 (en) Adders and adder bit blocks having an internal propagation characteristic independent of a carry input to the bit block and methods for using the same
JPH05342302A (en) Multilevel logic optimizing device
JPH08212246A (en) Logic generation method
US6012077A (en) Method and apparatus for indicating overflow status of bit-variable data employing pipelining adder
EP0568373B1 (en) Apparatus and method for parallelized magnitude comparison of digital data
US6282695B1 (en) System and method for restructuring of logic circuitry
JPH06195201A (en) High-speed adder using varied carry scheme and method related to it
US5481728A (en) Data processor having circuitry for high speed clearing of an interrupt vector register corresponding to a selected interrupt request
US20070118580A1 (en) Apparatus and method to find the maximum or minimum of a set of numbers
JP2985833B2 (en) Clock distribution system and method
JP2737490B2 (en) Logic circuit optimization processing method
JP2924464B2 (en) Logic synthesis method
JP3102408B2 (en) Method and apparatus for reducing signal delay
US5856746A (en) Logic speed-up by selecting true/false combinations with the slowest logic signal
US6631393B1 (en) Method and apparatus for speculative addition using a limited carry
JPH04251961A (en) Placement design system for circuit block by cad
JP3092181B2 (en) High-speed arbitration circuit
JPH06266795A (en) Delay time improving system
JP2970623B2 (en) Machine readable recording medium recording hierarchical circuit optimization method and program
JP3132655B2 (en) Clock net layout method and layout device in semiconductor integrated circuit
JPH05216956A (en) Optimizing approach for multistage logic circuit