JPH0331232B2 - - Google Patents

Info

Publication number
JPH0331232B2
JPH0331232B2 JP58028939A JP2893983A JPH0331232B2 JP H0331232 B2 JPH0331232 B2 JP H0331232B2 JP 58028939 A JP58028939 A JP 58028939A JP 2893983 A JP2893983 A JP 2893983A JP H0331232 B2 JPH0331232 B2 JP H0331232B2
Authority
JP
Japan
Prior art keywords
signal
time
recorded
changes
signals
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 - Lifetime
Application number
JP58028939A
Other languages
Japanese (ja)
Other versions
JPS59154374A (en
Inventor
Nobuyuki Sato
Yasukazu Ito
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.)
Fujitsu Ltd
Original Assignee
Fujitsu 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 Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP58028939A priority Critical patent/JPS59154374A/en
Publication of JPS59154374A publication Critical patent/JPS59154374A/en
Publication of JPH0331232B2 publication Critical patent/JPH0331232B2/ja
Granted legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/30Circuit design
    • G06F30/32Circuit design at the digital level
    • G06F30/33Design verification, e.g. functional simulation or model checking

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Evolutionary Computation (AREA)
  • Geometry (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Tests Of Electronic Circuits (AREA)

Description

【発明の詳細な説明】 発明の技術分野 本発明は、論理回路の動作をシミユレーシヨン
した結果を記録する方式に関する。
DETAILED DESCRIPTION OF THE INVENTION Technical Field of the Invention The present invention relates to a method for recording the results of simulating the operation of a logic circuit.

従来技術と問題点 各種論理回路の製作に当つて、設計した当該論
理回路が予定通り動作するか否か予め確認する必
要があり、これには当該論理回路をソフトウエア
で組んでそれを実行させ、結果をみるというシミ
ユレーシヨンテストが行なわれる。シミユレーシ
ヨン結果の採取には従来は所定のサンプリング周
期で回路各部の信号値を観測し、それを全て記録
するという方法をとつている。しかしこの方法で
は試験結果のデータ量が膨大になり、それを格納
する記憶領域(フアイル)が広大になり、解析に
も手間がかゝる。ところで解析に必要なのは信号
変化点の情報であるから、従来方式のように信号
変化のない期間を何ポイントも記録するのは無益
であり、フアイル量を無駄に増加させるだけであ
る。フアイル量を減少させるにはフアイルへのデ
ータ記録間隔を大にすることが考えられるが、こ
の方式では失なわれるデータの量が増加して、シ
ミユレーシヨン結果の忠実な採取が不可能にな
る。
Prior Art and Problems When manufacturing various logic circuits, it is necessary to check in advance whether the designed logic circuit will operate as planned, and this requires building the logic circuit with software and making it run. A simulation test will be conducted to see the results. The conventional method for collecting simulation results is to observe the signal values of each part of the circuit at a predetermined sampling period and record them all. However, with this method, the amount of test result data is enormous, the storage area (file) to store it is vast, and analysis is time-consuming. By the way, since what is needed for analysis is information on signal change points, it is useless to record many points during periods in which there is no signal change, as in the conventional method, and only increases the file size unnecessarily. One way to reduce the amount of files is to increase the interval at which data is recorded in the file, but this method increases the amount of data that is lost, making it impossible to faithfully collect simulation results.

発明の目的 本発明は、変化のあつた信号だけに着目しその
信号値に信号識別子と変化時刻を付して記録する
ことにより、記録精度を低下させずにフアイル量
を減少させようとするものである。
Purpose of the Invention The present invention aims to reduce the file size without reducing recording accuracy by focusing only on signals that have changed and recording the signal values with signal identifiers and change times. It is.

発明の構成 本発明は、論理回路の動作をシミユレーシヨン
してその結果をフアイルに記録する論理シミユレ
ーシヨンの結果記録方式において、該論理回路の
各部信号の最新値を記憶するテーブルから該フア
イルへ記録する内容を、変化のあつた信号の値と
その時刻および該信号の識別子だけにすることを
特徴とするが、以下図示の実施例を参照しながら
これを詳細に説明する。
Composition of the Invention The present invention provides a method for recording the results of logic simulation in which the operation of a logic circuit is simulated and the results are recorded in a file. is characterized in that only the value of the signal that has changed, its time, and the identifier of the signal are included, and this will be explained in detail below with reference to the illustrated embodiment.

発明の実施例 第1図は本発明の一実施例を説明するタイムチ
ヤートで、aのA,B,Cはシミユレーシヨンの
結果得られる回路各部の信号(入力信号を含む)
である。これらの信号はデジタル信号であるか
ら、その信号値は1または0である。tは時刻を
示す。bは対比するために示した従来の記録方式
で、各時刻tでサンプリングした信号値1または
0を各信号A,B,C毎に全て記録している。こ
れに対しcは本発明による方式を示し、記録する
ポイントは信号変化のあつたものに限られる。こ
のとき、どの信号で変化があつたかを示す信号識
別子A,B,Cを変化後の信号値に付し、併せて
変化時刻を記録する。例えばイの4、A1は時刻
t=4で信号Aが0から1に反転したことを示し
ている。同様にロの13、B1、C0は時刻t=13で
信号Bが0から1に、また信号Cが1から0に反
転したことを示している。このときの信号Aの値
は、Aについての記録がないので前回(t=12)
の記録と同じであり、前回記録は(A1)である
からAは0から1に変つたままであることが判
る。このようにすれば、ハに示すように全信号の
初期値0、A0、B0、C1を記録しておけば、あと
は変化のあつた信号に関する情報を記録するだけ
でaに記す信号A〜Cの変化を全て記録でき、従
つて記録精度の低下はなくしかもフアイル量を減
らすことができる。
Embodiment of the Invention Figure 1 is a time chart explaining an embodiment of the present invention, where A, B, and C of a are signals (including input signals) of each part of the circuit obtained as a result of simulation.
It is. Since these signals are digital signals, their signal values are 1 or 0. t indicates time. b is a conventional recording method shown for comparison, in which all signal values 1 or 0 sampled at each time t are recorded for each signal A, B, and C. On the other hand, c indicates the method according to the present invention, and the points to be recorded are limited to those where the signal changes. At this time, signal identifiers A, B, and C indicating in which signal the change occurred are attached to the signal values after the change, and the change time is also recorded. For example, 4, A1 in A indicates that the signal A was inverted from 0 to 1 at time t=4. Similarly, 13, B1, and C0 in B indicate that the signal B was inverted from 0 to 1 and the signal C was inverted from 1 to 0 at time t=13. The value of signal A at this time is from the previous time (t=12) since there is no record of A.
This is the same as the previous record, and since the previous record was (A1), it can be seen that A remains changed from 0 to 1. In this way, if you record the initial values 0, A0, B0, and C1 of all the signals as shown in c, all you need to do is record the information about the signals that have changed, and the signals A to A shown in a All changes in C can be recorded, so there is no drop in recording accuracy and the amount of files can be reduced.

第1図bに示す従来方式でも記録採取周期を拡
大すればフアイル量を減少することができる。第
2図はその説明図で、bが拡大された周期本例で
は第1図の各時点毎の周期の3倍または4倍の周
期による記録内容である。ところがこのように信
号変化と無関係に単純に周期拡大すると再生され
る波形はcのようになり、正確な入出力信号の変
化の記録は期待できない。
Even with the conventional method shown in FIG. 1B, the amount of files can be reduced by expanding the recording sampling period. FIG. 2 is an explanatory diagram of the same, and in this example, b is an enlarged period. In this example, the recorded contents are recorded at a period three or four times as long as the period at each time point in FIG. However, if the period is simply expanded in this way regardless of signal changes, the reproduced waveform will become like c, and accurate recording of input/output signal changes cannot be expected.

第3図は本発明の適用例で、aはシミユレーシ
ヨン対象となる論理回路である。G1〜G3は例え
ば2入力のナンドゲートである。回路への入力は
同図bに示す外部入力テーブルTBL1で与えら
れる。この外部入力テーブルの□1欄は時刻、□2欄
は信号識別子、□3欄は信号値を示す。これは回路
に与えられる外部入力を定義するもので、本例で
はt=0で信号Aが0に変る、またt=0で信号
Bが0に変る、t=100では信号Cが1に変る、
t=200では信号Dが0に変る、を示している。
同図cはイベントテーブルTBL2を示す。左端
の0、1、…t…は時刻を示し、中央及び右端の
ブロツクはイベント(イベントテーブルの中味)
を示しその左端のEは信号識別子、右端の0は信
号値である。このテーブルは各時刻に変化する信
号と変化後の信号値を記憶する。本例ではt=t
で信号Eが0に、また信号Fが0に変ることを表
わす。同図dはネツトテーブルTBL3を示し、
左欄□1は信号識別子、右欄□2は信号値を示す。こ
のネツトテーブルは回路各部の全信号の最新値を
記憶する。同図eは後述の処理後のネツトテー
ブルTBL3、同図fは後述の処理後のイベン
トテーブルTBL2を示す。動作を説明するに、
シミユレーシヨンは、 t=tにおける外部入力をイベントテーブル
に登録する。
FIG. 3 shows an application example of the present invention, where a represents a logic circuit to be simulated. G1 to G3 are, for example, two-input NAND gates. Input to the circuit is given by an external input table TBL1 shown in FIG. In this external input table, the □1 column shows the time, the □2 column shows the signal identifier, and the □3 column shows the signal value. This defines the external input given to the circuit. In this example, signal A changes to 0 at t = 0, signal B changes to 0 at t = 0, and signal C changes to 1 at t = 100. ,
It shows that the signal D changes to 0 at t=200.
Figure c shows the event table TBL2. The 0, 1,...t... on the left side indicate the time, and the blocks on the center and right side are events (contents of the event table).
E on the left end is a signal identifier, and 0 on the right end is a signal value. This table stores the signal that changes at each time and the signal value after the change. In this example, t=t
This indicates that the signal E changes to 0 and the signal F changes to 0. Figure d shows the net table TBL3.
The left column □1 indicates a signal identifier, and the right column □2 indicates a signal value. This net table stores the latest values of all signals in each part of the circuit. Figure e shows the net table TBL3 after processing to be described later, and figure f shows the event table TBL2 after processing to be described later. To explain how it works,
The simulation registers the external input at t=t in the event table.

イベントテーブルに従つてネツトテーブルを
書きかえる。
Rewrite the net table according to the event table.

各素子出力の評価を行い、出力信号が変化す
ればそれをイベントテーブルに登録する。
The output of each element is evaluated, and if the output signal changes, it is registered in the event table.

という処理をtを+1しながら繰返すことで行
う。図示の例で説明すると、 t=tにおける外部入力はないのでへ進
む。
This process is repeated while increasing t by 1. To explain using the illustrated example, there is no external input at t=t, so proceed to step.

t=tのイベントに従つてネツトテーブルの
信号Eの値を0に、信号Fの値を0に書きかえ
る(図e)。
In accordance with the event t=t, the value of signal E in the net table is rewritten to 0, and the value of signal F is rewritten to 0 (Fig. e).

ゲートG3を評価すると(入力はE、Fで値
は0、0)出力Hは1となる。現在の信号Hの
値(ネツトテーブルに書かれている値)は0で
あるから時刻t+Δt(ΔtはゲートG3の遅延時
間)で信号Hは0から1に変化する。従つてイ
ベントテーブルのt=t+Δtにイベントを登
録する(図f)。
When gate G3 is evaluated (inputs are E and F and values are 0 and 0), output H becomes 1. Since the current value of signal H (value written in the net table) is 0, signal H changes from 0 to 1 at time t+Δt (Δt is the delay time of gate G3 ). Therefore, the event is registered at t=t+Δt in the event table (Fig. f).

従来方式の結果の出力は、の処理終了後にネ
ツトテーブルの全信号値をフアイルに記録してい
た。この状態を第4図aに示す。右図の斜線部分
がその記録である。本方式では、の処理終了後
にそのときの時刻とイベントテーブルのイベント
を記録する。第4図bがこれを示し、斜線部がそ
の記録部である。なおこのb図は第3図cと同じ
である。なお、ここでは信号値は0および1の2
値として述べたが、不定状態X、高インピーダン
ス状態Z、あるいはある状態から別の状態へ移る
途中の過度状態などが含まれるシミユレーシヨン
においても同様に本方式が適用できる。
In the conventional method, all signal values of the net table were recorded in a file after the processing was completed. This state is shown in FIG. 4a. The shaded area in the figure on the right is the record. In this method, after the process is completed, the time and event in the event table are recorded. FIG. 4b shows this, and the shaded area is the recording part. Note that this figure b is the same as figure 3c. Note that here, the signal values are 2 of 0 and 1.
Although described as values, the present method can be similarly applied to simulations that include an undefined state X, a high impedance state Z, or a transient state on the way from one state to another.

発明の効果 以上述べたように本発明によれば、論理シミユ
レーシヨンの結果を、記録精度を低下させること
なく、少ないフアイル量で記録できる利点があ
る。
Effects of the Invention As described above, according to the present invention, there is an advantage that the results of logical simulation can be recorded in a small amount of files without reducing the recording accuracy.

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

第1図は本発明の一実施例を示すタイムチヤー
ト、第2図は従来の記録方式を示すタイムチヤー
ト、第3図は本発明の具体例を示す説明図、第4
図は本発明と従来法との対比説明図である。 図中、G1〜G2は論理回路、TBL1は外部入力
テーブル、TBL2はイベントテーブル、TBL3
はネツトテーブルである。
FIG. 1 is a time chart showing an embodiment of the present invention, FIG. 2 is a time chart showing a conventional recording method, FIG. 3 is an explanatory diagram showing a specific example of the present invention, and FIG.
The figure is a diagram illustrating a comparison between the present invention and a conventional method. In the figure, G1 to G2 are logic circuits, TBL1 is an external input table, TBL2 is an event table, and TBL3
is a net table.

Claims (1)

【特許請求の範囲】[Claims] 1 論理回路の動作をシミユレーシヨンしてその
結果をフアイルに記録する論理シミユレーシヨン
の結果記録方式において、該論理回路の各部信号
の最新値を記憶するテーブルから該フアイルへ記
録する内容を、変化のあつた信号の値とその時刻
および該信号の識別子だけにすることを特徴とす
る論理シミユレーシヨンの結果記録方式。
1. In a logic simulation result recording method in which the operation of a logic circuit is simulated and the results are recorded in a file, the contents to be recorded in the file from a table that stores the latest values of signals of each part of the logic circuit are A logical simulation result recording method characterized in that only the value of a signal, its time, and an identifier of the signal are recorded.
JP58028939A 1983-02-23 1983-02-23 Recording system of result of logic simulation Granted JPS59154374A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP58028939A JPS59154374A (en) 1983-02-23 1983-02-23 Recording system of result of logic simulation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP58028939A JPS59154374A (en) 1983-02-23 1983-02-23 Recording system of result of logic simulation

Publications (2)

Publication Number Publication Date
JPS59154374A JPS59154374A (en) 1984-09-03
JPH0331232B2 true JPH0331232B2 (en) 1991-05-02

Family

ID=12262372

Family Applications (1)

Application Number Title Priority Date Filing Date
JP58028939A Granted JPS59154374A (en) 1983-02-23 1983-02-23 Recording system of result of logic simulation

Country Status (1)

Country Link
JP (1) JPS59154374A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AT514997A1 (en) * 2013-10-21 2015-05-15 Gerhard Dr Kunze Modular absorption chiller in slab construction

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE3376592D1 (en) * 1982-07-13 1988-06-16 Nec Corp Logic simulator operable on level basis and on logic block basis on each level
JPH087240B2 (en) * 1989-03-08 1996-01-29 富士通株式会社 Waveform display method
JPH04120632A (en) * 1990-09-11 1992-04-21 Nec Gumma Ltd Logic analyzer
EP4396638A1 (en) * 2021-09-01 2024-07-10 Siemens Industry Software Ltd. A method and a system for enabling a user to review simulation data of an industrial environment

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AT514997A1 (en) * 2013-10-21 2015-05-15 Gerhard Dr Kunze Modular absorption chiller in slab construction
AT514997B1 (en) * 2013-10-21 2015-11-15 Gerhard Dr Kunze Modular absorption chiller in slab construction

Also Published As

Publication number Publication date
JPS59154374A (en) 1984-09-03

Similar Documents

Publication Publication Date Title
US4635218A (en) Method for simulating system operation of static and dynamic circuit devices
US6173241B1 (en) Logic simulator which can maintain, store, and use historical event records
JPS63145549A (en) Logic circuit simulation method
JPH0331232B2 (en)
JP3297213B2 (en) Integrated circuit simulator and integrated circuit simulation method
US6725187B1 (en) Latch inference using dataflow analysis
JPH02279015A (en) Delay circuit
Gu et al. High performance tracking control system under measurement constraints by multi-rate control
US20030018462A1 (en) Multi-clock system simulation
JPS59148971A (en) Logic circuit simulation method
JP2001202391A (en) Logic circuit simulation method
JP2589860B2 (en) Simulation equipment
JP3003645B2 (en) Logic simulation method and recording medium on which control program is recorded
JPS61204745A (en) Tracing circuit
JPH02242440A (en) Instruction trace circuit
JPH03276374A (en) Logical simulation result tracking device
JPS6017131B2 (en) memory control circuit
EP0397532A2 (en) Simulation system
SU1471223A1 (en) Digital delay unit
SU1008726A1 (en) Computer interface device
JP2972499B2 (en) Logic circuit delay simulator
JPH03250260A (en) Method for outputting result of logic simulation
CN117370168A (en) Method for setting simulation restoration point of logic system design and related equipment
JP2924222B2 (en) Logic simulator
JPH06259495A (en) Logic simulation method