← Back to Patent Explorer
US4819150A Expired / Lapsed US ⏱️ 0.0 years remaining

Array for simulating computer functions for large computer systems

Assignee: BURROUGH Corp A DE CORP
•
Filing: 1985-04-05
•
Granted: 1989-04-04
•
Expires: 2005-04-05
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An array of various types of processors for the purpose of simulating computer functions for large computer systems. These functions may vary from simple AND, OR and other functions to large arithmetic logic units and even random access memories. The simulation array is a tree-type array where the leaves of the tree are the actual logic simulation processors with the other processors serving as nodes which route change of value notices among the various logic simulation processors.

Inventors

  • 👤 Andrew T. Jennings
  • 👤 Joseph S. Schibinger
  • 👤 Ronald J. Kalemba

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 07:31
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/32; G06F30/33

Claims Analysis

Total Claims: 13
Claim 1
Independent Claim 200 words
An array of logic simulation processors for simulating complex logic functions formed of primitive logic functions, said array comprising: a plurality of logic simulation processors; and node processing means coupled to each of said logic simulation processors for transmitting value change notices therebetween; each of said logic simulation processors including a function unit including circuit means having different logic gates for execution of different ones of said primitive logic functions; each of said logic processors further including value table means for storing present value signals, said value table means being coupled to said function unit to supply individual ones of said present value signals to said function unit; each of said logic simulation processors further including instruction table means for storing a sequence of instructions each of which specifies a particular primitive function to be executed and an address to said value table means to fetch a given one of said present value signals, said instruction table means being coupled to said value table means and said function unit to control the execution of a specified primitive function upon a given present value signal received from said value table means in response to the address contained in a given instruction.
Claim 2
Dependent Claim 200 words
An array of logic simulation processors for simulating complex logic functions formed of primitive logic functions, said array comprising: a plurality of logic simulation processors; and node processing means coupled to each of said logic simulation processors for transmitting value change notices therebetween; each of said logic simulation processors including a function unit including circuit means having different logic gates for execution of different ones of said primitive logic functions; each of said logic processors further including value table means for storing present value signals, said value table means being coupled to said function unit to supply individual ones of said present value signals to said function unit; each of said logic simulation processors further including instruction table means for storing a sequence of instructions each of which specifies a particular primitive function to be executed and an address to said value table means to fetch a given one of said present value signals, said instruction table means being coupled to said value table means and said function unit to control the execution of a specified primitive function upon a given present value signal received from said value table means in response to the address contained in a given instruction.
Claim 3
Dependent Claim 51 words
An array according to claim 1 wherein each of said logic simulation processors includes: sequencing means coupled to its corresponding instruction table means to control a sequence of primitive function executions by said corresponding function unit upon present value signals addressed by each of said instructions in said sequence of instructions.
Claim 4
Dependent Claim 66 words
An array according to claim 2 further including: a plurality of registers arranged as a push-down stack having a top register, the top register of such stack being coupled to said function unit to receive the result signal of a primitive function execution and to transmit the result signal to said function unit as a second input signal to the execution of a second primitive function.
Claim 5
Dependent Claim 95 words
An array according to claim 3 wherein each of said logic simulation processors includes: an internal change flip-flop circuit; said circuit means in said function unit including comparison means to compare a present value signal received from said value table means with a value signal received from said push-down stack, said comparison means being coupled to said internal change flip-flop circuit to set said flip-flop circuit if the two value signals do not compare and to replace said present value signal in said value table means with said value signal received from said push-down stack.
Claim 6
Dependent Claim 54 words
An array according to claim 4 wherein each sequence of instructions includes an end of sequence instruction, each of said logic simulation processors further including: means coupled to said instruction table means to repeat said sequence of instructions when said end of sequence instruction is encountered and said internal change flip-flop has been set.
Claim 7
Dependent Claim 46 words
An array according to claim 5 wherein each of said logic simulation processors further includes: an external change flip-flop circuit; said circuit means including means to set said external change flip-flop circuit and reset said internal change flip-flop circuit when said sequence of instructions is completed.
Claim 8
Dependent Claim 227 words
An array of logic simulation processors for simulating complex logic functions formed of primitive logic functions, said array comprising: a plurality of logic simulation processors; and a plurality of node processing means coupled to each other and neighboring logic simulation processors to form a tree array with one node processing means serving as the root of said tree array and said logic simulation processors serving as the leaves of said tree array; each of said simulation processors including a function unit including circuit means having different logic gates for executing different ones of said primitive logic functions; each of said logic processors further including value table means for storing present value signals, said value table means being coupled to said function unit to supply individual ones of said present value signals to said corresponding function unit; each of said logic simulation processors further including instruction table means for storing a sequence of instructions each of which specifies a particular primitive function for execution and an address to said value table means to fetch a given one of said present value signals, said instruction table means being coupled to said value table means and said function unit to control the execution of a specified primitive function upon a given present value signal received from said value table means in response to the address contained in a given instruction.
Claim 9
Dependent Claim 227 words
An array of logic simulation processors for simulating complex logic functions formed of primitive logic functions, said array comprising: a plurality of logic simulation processors; and a plurality of node processing means coupled to each other and neighboring logic simulation processors to form a tree array with one node processing means serving as the root of said tree array and said logic simulation processors serving as the leaves of said tree array; each of said simulation processors including a function unit including circuit means having different logic gates for executing different ones of said primitive logic functions; each of said logic processors further including value table means for storing present value signals, said value table means being coupled to said function unit to supply individual ones of said present value signals to said corresponding function unit; each of said logic simulation processors further including instruction table means for storing a sequence of instructions each of which specifies a particular primitive function for execution and an address to said value table means to fetch a given one of said present value signals, said instruction table means being coupled to said value table means and said function unit to control the execution of a specified primitive function upon a given present value signal received from said value table means in response to the address contained in a given instruction.
Claim 10
Dependent Claim 66 words
An array according to claim 7 further including: a plurality of registers arranged as a push-down stack having a top register, the top register of such stack being coupled to said function unit to receive the result signal of a primitive function execution and to transmit the result signal to said function unit as a second input signal to the execution of a second primitive function.
Claim 11
Dependent Claim 95 words
An array according to claim 8 wherein each of said logic simulation processors includes: an internal change flip-flop circuit; said circuit means in said function unit including comparison means to compare a present value signal received from said value table means with a value signal received from said push-down stack, said comparison means being coupled to said internal change flip-flop circuit to set said flip-flop circuit if the two value signals do not compare and to replace said present value signal in said value table means with said value signal received from said push-down stack.
Claim 12
Dependent Claim 54 words
An array according to claim 9 wherein each sequence of instructions includes an end of sequence instruction, each of said logic simulation processors further including: means coupled to said instruction table means to repeat said sequence of instructions when said end of sequence instruction is encountered and said internal change flip-flop has been set.
Claim 13
Dependent Claim 46 words
An array according to claim 10 wherein each of said logic simulation processors further includes: an external change flip-flop circuit; said circuit means including means to set said external change flip-flop circuit and reset said internal change flip-flop circuit when said sequence of instructions is completed.

References Cited (Backward Citations)

US4306286A Cited
US4584642A Cited
US4587625A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-04-03 1992-10-03 1993-04-04 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-04-03 1996-10-03 1997-04-04 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-04-03 2000-10-03 2001-04-04 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag