Patent US4584642A successfully refreshed from Google Patents.
US4584642A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Logic simulation apparatus
Assignee: Toshiba Corp
•
Filing: 1983-10-19
•
Granted: 1986-04-22
•
Expires: 2003-10-19
Abstract
Abstract A logic simulation apparatus has a data memory for storing node level data of a logic circuit, a command memory for storing interconnection data which comprises an input data address, an output data address, a fan-out address and a function of module, and a data processing circuit for simulating the operation for each module in accordance with the commands read out from the command memory. The read address of the command memory is accessed by an address counter which is incremented by one for every read operation. The fan-out address read out from the command memory is written in an address queue, and when a simulation of one module is completed, the fan-out address is read out from the address queue and set in the address counter in order to start a simulation of a next module.
Inventors
- 👤 Nobuo Fudanuki
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 16:06
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/32; G06F30/33
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
110 words
A logic simulation apparatus comprising: data memory means for storing node level data of a logic circuit to be simulated; command memory means for storing as a command an interconnection state of modules of said logic circuit; address counter means for supplying a read address to said command memory means; data processing means for processing data read out from said data memory means in accordance with the command read out from an address of said command memory means which is accessed by said address counter means; and an address queue for setting data in said address counter means in accordance with a data processing result of said data processing means.
Claim 2
Dependent Claim
110 words
A logic simulation apparatus comprising: data memory means for storing node level data of a logic circuit to be simulated; command memory means for storing as a command an interconnection state of modules of said logic circuit; address counter means for supplying a read address to said command memory means; data processing means for processing data read out from said data memory means in accordance with the command read out from an address of said command memory means which is accessed by said address counter means; and an address queue for setting data in said address counter means in accordance with a data processing result of said data processing means.
Claim 3
Dependent Claim
85 words
An apparatus according to claim 1, in which said command memory means stores commands having operands which comprise an input data address, an output data address, a function of module and a fan-out address, and said data processing means logically operates data read out from said input data address of said data memory means in accordance with the function of module, thereby writing the logical operation result at the output data address of said data memory means and the fan-out address in said address queue.
Claim 4
Dependent Claim
66 words
An apparatus according to claim 2, in which said address counter means is incremented by one when one command is read out from said command memory means, and a first written fan-out address in said address queue is read out from said address queue and is set in said address counter means when all commands of one module are read out from said command memory means.
Claim 5
Dependent Claim
67 words
An apparatus according to claim 3, in which said data processing means compares output data obtained as the logical operation result with output data prior to logical operation, writes the fan-out address in said address queue when a noncoincidence is established, and immediately reads out the fan-out address from said address queue to set the fan-out address in said address counter means when a coincidence is established.
Claim 6
Dependent Claim
124 words
An apparatus according to claim 1, in which there is further provided a current time register for controlling time; said command memory means stores commands having operands which comprise an input data address, an output data address, a function of module, a delay time and a fan-out address; said data processing means logically operates data read out from the input data address of said data memory means in accordance with the function of module, thereby writing the logical operation result at the output data address of said data memory means at a time delayed by the delay time; and said address queue is divided into pages respectively corresponding to given times, the fan-out address being written in a page corresponding to the delay time.
Claim 7
Dependent Claim
73 words
An apparatus according to claim 5, in which said address counter means is incremented by one when one command is read out from said command memory means, and the fan-out address is read out from a page of said address queue which is designated by said current time register and the fan-out address is set in said address counter when all commands of one module are read out from said command memory means.
Claim 8
Dependent Claim
67 words
An apparatus according to claim 6, in which said data processing means compares output data obtained as the logical operation result with output data prior to logical operation, writes the fan-out address in said address queue when a noncoincidence is established, and immediately reads out the fan-out address from said address queue to set the fan-out address in said address counter means when a coincidence is established.
Claim 9
Dependent Claim
33 words
An apparatus according to claim 6, in which said current time register is incremented by one when the page of said address queue which is designated by said current time register becomes empty.
Claim 10
Dependent Claim
86 words
An apparatus according to claim 5, in which there is further provided an event queue which is divided into pages respectively corresponding to given times, the logical operation result of said data processing means is written in a page of said event quene which is a sum of the delay time and a current time, and data in the page of said event queue are written in said data memory means when a value of said current time register indicates a value corresponding to the page.
References Cited (Backward Citations)
US4306286A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-04-21 | 1989-10-21 | 1990-04-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-04-21 | 1993-10-21 | 1994-04-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-04-21 | 1997-10-21 | 1998-04-22 | $7700.00 | Window Closed / Lapsed |