JPH0212469A - Logic circuit converting system - Google Patents

Logic circuit converting system

Info

Publication number
JPH0212469A
JPH0212469A JP63160873A JP16087388A JPH0212469A JP H0212469 A JPH0212469 A JP H0212469A JP 63160873 A JP63160873 A JP 63160873A JP 16087388 A JP16087388 A JP 16087388A JP H0212469 A JPH0212469 A JP H0212469A
Authority
JP
Japan
Prior art keywords
circuit
functional module
module
logic
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.)
Granted
Application number
JP63160873A
Other languages
Japanese (ja)
Other versions
JP2848609B2 (en
Inventor
Yuichi Kurosawa
雄一 黒澤
Seiichi Nishio
誠一 西尾
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.)
Toshiba Corp
Original Assignee
Toshiba 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 Toshiba Corp filed Critical Toshiba Corp
Priority to JP63160873A priority Critical patent/JP2848609B2/en
Publication of JPH0212469A publication Critical patent/JPH0212469A/en
Application granted granted Critical
Publication of JP2848609B2 publication Critical patent/JP2848609B2/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Abstract

PURPOSE:To produce an efficient circuit having less redundancy by performing the materializing process of a functional module in a logic composing process by taking the connecting relation of the module into account. CONSTITUTION:A circuit realizing system selecting means 13 checks the connecting destination of the input signal of a functional module in a logic circuit and selects appropriate one out of such materializing systems of the functional module that 'the corresponding functional element in a cell library is assigned', 'a gate cell is assigned after the functional module is expanded in an AND/OR gate and optimized', and so forth. A circuit conversion executing means 14 converts a circuit in accordance with the materializing system selected by the means 13. Thus the materialization of a functional module is performed by paying attention not only to the function held by the module, but also to the connecting relation of the module. Therefore, an efficient circuit having less redundancy can be produced.

Description

【発明の詳細な説明】 〔発明の目的〕 (産業上の利用分野) 本発明は、論理回路の自動合成システムにおいて、計算
機のメモリ上に構成された論理回路データ中の機能モジ
ュールを具体化する論理回路変換方式に関する。
[Detailed Description of the Invention] [Objective of the Invention] (Industrial Application Field) The present invention embodies functional modules in logic circuit data configured on a computer memory in an automatic logic circuit synthesis system. Concerning logic circuit conversion methods.

(従来の技術) デジタルシステムの大規模化に伴って、設計効率の向上
を意図した各種の自動論理合成システムが開発されてい
る。これらはハードウェア記述言語による設計対象の論
理回路の動作記述や機能図と呼ばれるセレクタ、デコー
ダ、 7111算等の関数ブロックを用いて構成された
論理回路の機能を表す図面を入力として論理回路を自動
合成するものであ)、その合成過程はハードウェア記述
や機能図から、機能モジュールを含んだ初期回路を生成
する過程と、この過程で生成された初期回路に対し論理
の簡単化、実在する論理素子(スタンダードセル等のラ
イブラリとして用意された素子)の割り当て等の変換を
施して、実際の物理的な回路を生成する過程とに大別さ
れる。
(Prior Art) As the scale of digital systems increases, various automatic logic synthesis systems have been developed with the aim of improving design efficiency. These methods automatically create a logic circuit by inputting a behavioral description of the logic circuit to be designed in a hardware description language and a drawing representing the functions of the logic circuit constructed using function blocks such as selectors, decoders, and 7111 arithmetic called functional diagrams. The synthesis process consists of generating an initial circuit including functional modules from hardware descriptions and functional diagrams, and simplifying the logic and applying existing logic to the initial circuit generated in this process. It is broadly divided into the process of generating an actual physical circuit by performing conversions such as assignment of elements (elements prepared as a library of standard cells, etc.).

ここで、後者の過程においては、通常セレクタ。Here, in the latter process, there is usually a selector.

デコーダ、加算器等の機能モジュールに対応する論理素
子をセルライブラリ中から捜し、それを割り当てるとい
う方法がとられている。しかし、上記論理合成システム
の入力であるノ・−ドウエアの動作記述や機能図におい
て、上記機能モジュールに対応するオペレータや関数(
例えば、ハードウェア記述の=(代入)+(加算))の
オペランドとして、定数値を記述することにより、ある
いは論理合成の簡単化処理によって、上記機能モジール
の入力が0.1の定数値となる場合があシ、セルライブ
ラリ中の対応する素子を割シ当てると「セレクタセルの
1つのデータ入力が0固定である」のような冗長性のあ
る回路が生成されるという問題点があった。
The method used is to search a cell library for a logic element corresponding to a functional module such as a decoder or adder, and allocate it. However, in the behavioral description and functional diagram of the software that is input to the logic synthesis system, operators and functions (
For example, by writing a constant value as an operand of = (assignment) + (addition)) in the hardware description, or by simplifying logic synthesis, the input of the above function module becomes a constant value of 0.1. In some cases, when a corresponding element in the cell library is allocated, a redundant circuit such as "one data input of a selector cell is fixed to 0" is generated, which is a problem.

(発明が解決しようとする課題) この様に従来の方式では、論理合成における機能モジュ
ールを具体化する際に、冗長性のある回路が生成される
という欠点が有った。
(Problems to be Solved by the Invention) As described above, the conventional method has the drawback that redundant circuits are generated when implementing functional modules in logic synthesis.

本発明は、このような問題点に鑑みなされたものであり
、論理合成における機能モジュールの具体化処理を効率
よく行ない、冗長性の少ない論理回路を生成する方式を
提供することを目的とする。
The present invention has been made in view of these problems, and it is an object of the present invention to provide a method for efficiently implementing functional modules in logic synthesis and generating logic circuits with less redundancy.

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

(課題を解決するための手段) 本発明は、論理回路中の機能モジュールの入力信号の接
続先を調べ、その結果によυ該機能モジュールの適切な
具体化方式を選択された具体化方式に従って、上記機能
モジュールの変換を行なう回路変換実行手段をもつ。
(Means for Solving the Problems) The present invention examines the connection destination of an input signal of a functional module in a logic circuit, and based on the result, determines an appropriate implementation method for the functional module according to the selected implementation method. , has circuit conversion execution means for converting the functional module.

(作用) 本発明によれば、回路実現方式選択手段が、論理回路中
の機能モジュールの入力信号の接続先を調べ、その結果
にもとづいて「セルライブラリ中の対応する機能素子を
割シ当てるJl 「機能モジュールをAND10Rゲー
トに展開して最適化を行なって、ゲートセルを割シ当て
るJ等の拶能モジュールの具体化方式の中から適切なも
のを選択し、回路変換実行手段が上記回路具体化方式選
択手段によって選択された具体化方式に従って回路の変
換を行なう。つまり、本発明では機能モジュールの具体
化を機能モジュールのもつ機能だけでなく、該機能モジ
ュールの接続関係にも着目して行なうことによって、冗
長性の少ない効率的な回路を生成することが可能となる
(Function) According to the present invention, the circuit realization method selection means checks the connection destination of the input signal of the functional module in the logic circuit, and based on the result, selects a "Jl for allocating the corresponding functional element in the cell library.""Deploy the functional module to the AND10R gate, perform optimization, select an appropriate one from among the implementation methods of the communication function module such as J, which allocates the gate cell, and the circuit conversion execution means implements the circuit implementation described above. The circuit is converted according to the embodiment method selected by the method selection means.In other words, in the present invention, the embodiment of a functional module is performed by focusing not only on the functions of the functional module, but also on the connection relationships between the functional modules. This makes it possible to generate efficient circuits with less redundancy.

(実施例) 以下、本発明の一実施例を図面に基づいて説明する。(Example) Hereinafter, one embodiment of the present invention will be described based on the drawings.

第1図は本発明の一実施例の構成国である。ハードウェ
ア記述言語や機能図をもとに生成された論理回路は、論
理回路データ記憶部11に格納されている。論理回路変
換規則記憶部12は、機能モジュールの具体化方式に関
する回路変換規則を格納する。−理回路具体化方式選択
部13は、論理回路データ中の各機能モジュールの入力
信号の接続先を調べた結果にもとづいて、論理回路変換
規則記憶部12に格納された規則から適切なものを選択
する。回路変換実行部14は、論理回路具体化方式・選
択部13によって選択された規則を実行し、回路の変換
を行なう。
FIG. 1 shows the constituent countries of one embodiment of the present invention. Logic circuits generated based on the hardware description language and functional diagrams are stored in the logic circuit data storage section 11. The logic circuit conversion rule storage unit 12 stores circuit conversion rules regarding the implementation method of the functional module. - The logic circuit embodiment method selection unit 13 selects an appropriate rule from among the rules stored in the logic circuit conversion rule storage unit 12 based on the result of checking the connection destination of the input signal of each functional module in the logic circuit data. select. The circuit conversion execution unit 14 executes the rule selected by the logic circuit implementation method/selection unit 13 and converts the circuit.

いま、第2図に示すセレクタ回路を具体化する場合を例
にとって本発明の説明を行なうo@2図中21〜23は
それぞれA、 B、 Cという名前のレジスタ、24は
NOTゲート、25.26はセレクタ、27゜28はそ
れぞれOf、 02という名前の外部出力端子とする。
The present invention will now be explained by taking as an example the case where the selector circuit shown in FIG. 26 is a selector, and 27 and 28 are external output terminals named Of and 02, respectively.

ここで、25.26はデータ入力(Di〜D4)と制御
入力(C1〜C4)をもち、C1〜C4またはC3の1
となっている制御入力と対応するD1〜D4またはD3
のデータ入力を選択する機能モジュールである。ここで
、25のD1人力とD3人力は定数値1.0であるとす
る。また、上記セレクタの具体化方式として、第3図に
示す2つの規則が論理回路変換規則記憶部に含まれてい
るとする。
Here, 25.26 has data inputs (Di to D4) and control inputs (C1 to C4), and one of C1 to C4 or C3
D1 to D4 or D3 corresponding to the control input that is
This is a functional module that selects data input. Here, it is assumed that D1 human power and D3 human power of 25 have a constant value of 1.0. Further, it is assumed that the two rules shown in FIG. 3 are included in the logic circuit conversion rule storage unit as a method of implementing the above-mentioned selector.

規則31は、セレクタセルをライブラリ中から探してそ
れを割当てる具体化方式、規則32はセレクタをAND
、ORゲートで実現する方式を表す。
Rule 31 is a materialization method that searches for a selector cell in a library and assigns it, and rule 32 is a method that ANDs selectors.
, represents a method implemented using an OR gate.

第4図にライブラリに登録されているセルの機能と面積
(大小関係を示すために整数化したもの)の例を示す。
FIG. 4 shows an example of the functions and areas (expressed as integers to show size relationships) of cells registered in the library.

論理回路実現方式選択部13は、セレクタの具体化方式
に関する規則31.32から、第5図に示すアルゴリズ
ムに従って一方を選択する。
The logic circuit implementation method selection unit 13 selects one of the rules 31 and 32 regarding the selector implementation method according to the algorithm shown in FIG.

すなわち、セレクタのデータ入力ビンの接続先を調べ、
定数値となっているものの数が全データ入力の発よシ大
きいときには、セレクタセルは使用せず、AND10R
ゲートで実現する方式(規則32)を採用する。回路変
換実行部14は、回路中の機能モジュール(ここではセ
レクタ)を1つずつ取り出し、論理回路具体化方式選択
部13によって選択された回路変換規則を実行する。第
2図の回路の場合、まずセレクタ25に対しては、定数
値入力がDl、 D3の2本あるので、第5図のM=2
゜され、セルSE3が割り幽てられる。これらの回路変
換規則の実行の結果生成される回路を第6図に示す。こ
こで、61〜65がセレクタ25をにΦ10Rゲートで
実現した結果できたゲートである。
In other words, check the connection destination of the selector's data input bin,
When the number of constant values is larger than the total data input, do not use the selector cell and use AND10R.
The method of realizing this using a gate (Rule 32) is adopted. The circuit conversion execution unit 14 extracts the functional modules (selectors in this case) in the circuit one by one and executes the circuit conversion rule selected by the logic circuit implementation method selection unit 13. In the case of the circuit shown in Figure 2, there are two constant value inputs Dl and D3 for the selector 25, so M = 2 in Figure 5.
゜ and cell SE3 is allocated. A circuit generated as a result of executing these circuit conversion rules is shown in FIG. Here, 61 to 65 are gates formed as a result of realizing the selector 25 with Φ10R gates.

61.63のANDゲートは定数値入力のために削除で
き、この後セル割υ付けを行なうと最終的には、第7図
の回路が生成される0第7図71〜73が第2図25の
セレクタと対応する部分である。
61. The AND gate of 63 can be deleted for inputting a constant value, and when cell allocation is performed after this, the circuit shown in Fig. 7 is finally generated. This is the part corresponding to the selector No. 25.

この部分の面積を81とすると第4図から5i=3+3
+4=10となる。一方、本方式によらず第2図25の
セレクタに対して、単にセルSE4を割シ付けた場合(
すなわち、すべてのセレクタに対し規則32を適用する
従来方式)を面積を82とすると第4図よ!5 52=
12>Slである。従って、本方式のように、機能モジ
ュール(ここではセレクタ)の入力を考慮して、機能モ
ジュール具体化方式を選択することによって、面積の小
さい効率的な回路を生成することが可能となる。
If the area of this part is 81, then from Figure 4, 5i = 3 + 3
+4=10. On the other hand, if cell SE4 is simply assigned to the selector in FIG. 25 without using this method (
In other words, if the area of the conventional method (applying rule 32 to all selectors) is 82, then Figure 4! 5 52=
12>Sl. Therefore, by selecting the functional module implementation method in consideration of the input of the functional module (selector in this case) as in the present method, it is possible to generate an efficient circuit with a small area.

なお、本発明は上述の実施例に限定されるものでない。Note that the present invention is not limited to the above-described embodiments.

上記実施例では、論理回路具体化方式選択の基準として
機能上ジーールの定数値入力に着目していたが、機能モ
ジュールの同一人力に着目した基準や機能モジュールの
制御入力に着目した基準を採用する場合も考えられる。
In the above embodiment, the focus was on the constant value input of the functional zeal as a criterion for selecting the logic circuit embodiment method, but a criterion that focuses on the same human power of the functional module or a criterion that focuses on the control input of the functional module is adopted. There may also be cases.

例えば、レジスタ転送条件が1 (レジスタ直前のセレ
クタの制御入力の論理和が1)でないときは、フィード
バックルーズを含んだフリップフロップを使用すること
によって、セレクタセルと7リツプフロツプを用いてフ
ィードバックループを作るよシも効率的な回路が生成で
きる。
For example, when the register transfer condition is not 1 (the logical sum of the control inputs of the selector immediately before the register is 1), a feedback loop is created using a selector cell and 7 flip-flops by using a flip-flop that includes feedback looseness. Efficient circuits can also be generated.

また、上記実施例ではセレクタの実現方式の例をとシ上
げたが、デコーダ、マルチプレクサ、加算器等地の機能
モジュールに対しても適用できることは言うまでもない
Furthermore, although the above embodiments have been given as examples of implementation methods for selectors, it goes without saying that the present invention can also be applied to functional modules such as decoders, multiplexers, adders, etc.

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

以上述べたように本発明によれば、論理合成過程におけ
る機能モジュールの具体化処理を機能モジュールの接続
関係も考慮して行なうこと釦よって、冗長性の少ない効
率的な回路を生成することが可能となる。
As described above, according to the present invention, it is possible to generate efficient circuits with less redundancy by performing the process of embodying functional modules in the logic synthesis process while also taking into account the connection relationships of functional modules. becomes.

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

第1図は本発明の一実施例の構成図、第2図は論理回路
の例を示す図、第3図はセレクタの具体化規則を示す図
、第4図はライブラリに登鎌されたセルの例を示す図、
第5図は論理回路具体化方式選択部13が第3図のセレ
クタ具体化規則を選択するアルゴリズムを示す図、第6
図は第2図の回路のセレクタの具体化処理を第5図のア
ルゴリズムに従って行なった結果の回路を示す図、第7
図は第2図の回路から論理合成結果として最終的に得ら
れる回路を示す図である。 11・・・論理回路データ記憶部、12・・・論理回路
変換規則記憶部、13・・・論理回路具体化方式選択部
、14・・・回路変換実行部。 第1函 第 2 図 筑 5 図 へ厚 図 第 図
Fig. 1 is a block diagram of an embodiment of the present invention, Fig. 2 is a diagram showing an example of a logic circuit, Fig. 3 is a diagram showing specific rules for a selector, and Fig. 4 is a diagram showing cells registered in a library. A diagram showing an example of
5 is a diagram showing an algorithm by which the logic circuit embodiment method selection unit 13 selects the selector embodiment rule of FIG. 3;
The figure shows a circuit resulting from implementing the selector of the circuit in Figure 2 in accordance with the algorithm in Figure 5;
This figure shows a circuit finally obtained as a result of logic synthesis from the circuit of FIG. 2. 11...Logic circuit data storage section, 12...Logic circuit conversion rule storage section, 13...Logic circuit embodiment method selection section, 14...Circuit conversion execution section. 1st box 2nd drawing 5th drawing Atsushi drawing 5th drawing

Claims (1)

【特許請求の範囲】[Claims] 計算機のメモリ上に構成された論理回路に対し回路変換
を行なう方式において、回路中の機能モジュールの入力
信号の接続先を調べ前記機能モジュールの回路具体化方
式を選択する回路具体化方式選択手段と、この回路具体
化方式選択手段によって選択された回路具体化方式にも
とづいて前記機能モジュールの変換を行なう回路変換実
行手段とを具備したことを特徴とする論理回路変換方式
In a method for performing circuit conversion on a logic circuit configured on a memory of a computer, a circuit implementation method selection means for checking a connection destination of an input signal of a functional module in the circuit and selecting a circuit implementation method for the functional module; , a circuit conversion execution means for converting the functional module based on the circuit implementation method selected by the circuit implementation method selection means.
JP63160873A 1988-06-30 1988-06-30 Logic circuit conversion method and device Expired - Lifetime JP2848609B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP63160873A JP2848609B2 (en) 1988-06-30 1988-06-30 Logic circuit conversion method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP63160873A JP2848609B2 (en) 1988-06-30 1988-06-30 Logic circuit conversion method and device

Publications (2)

Publication Number Publication Date
JPH0212469A true JPH0212469A (en) 1990-01-17
JP2848609B2 JP2848609B2 (en) 1999-01-20

Family

ID=15724216

Family Applications (1)

Application Number Title Priority Date Filing Date
JP63160873A Expired - Lifetime JP2848609B2 (en) 1988-06-30 1988-06-30 Logic circuit conversion method and device

Country Status (1)

Country Link
JP (1) JP2848609B2 (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6385976A (en) * 1986-09-30 1988-04-16 Toshiba Corp Logic circuit converter

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6385976A (en) * 1986-09-30 1988-04-16 Toshiba Corp Logic circuit converter

Also Published As

Publication number Publication date
JP2848609B2 (en) 1999-01-20

Similar Documents

Publication Publication Date Title
US5349659A (en) Hierarchical ordering of logical elements in the canonical mapping of net lists
Brunvand et al. Translating concurrent programs into delay-insensitive circuits.
US5787010A (en) Enhanced dynamic programming method for technology mapping of combinational logic circuits
Besslich Heuristic minimization of MVL functions: a direct cover approach
JPH0668197A (en) Automatic logic generation method
JPH04127275A (en) Technology mapping system for combinational circuit in automatic synthesis of lsi logic circuit
Kim et al. A new techology mapping for CPLD under the time constraint
JPH0212469A (en) Logic circuit converting system
JP2000057176A (en) Technology mapping method and storage medium
Enns et al. Automatic FPGA Placement Configuration for Customer Designs
Nascimento An automated tool for analysis and design of MVL digital circuits
US5745373A (en) Logic circuit generating method and apparatus
Contessa et al. MaRS, a combinator graph reduction multiprocessor
Matsunaga A new algorithm for Boolean matching utilizing structural information
JPH04153780A (en) Logical circuit composing method
Kim et al. An efficient CPLD technology mapping under the time constraint
JPH0991321A (en) Automatic designing method for logic circuit
López et al. Use of Data Flow Diagrams for Building Process with Message Passing: A Parallel Design Proposal.
JP2925160B2 (en) Logic synthesis method
JP2705549B2 (en) Integrated circuit design data conversion apparatus and hierarchical data expansion method
JP2835082B2 (en) Logic circuit synthesizer
JPH0457169A (en) Logic circuit converter
JP2724242B2 (en) Automatic program generator with macro block diagram processing function
Thakur Logic module design and technology mapping for field-programmable gate arrays
Quayle et al. Complex operator synthesis

Legal Events

Date Code Title Description
FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20071106

Year of fee payment: 9

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20081106

Year of fee payment: 10

EXPY Cancellation because of completion of term
FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20081106

Year of fee payment: 10