The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Aug. 23, 2005
Filed:
Jun. 28, 2002
Philip E. May, Palatine, IL (US);
Kent Donald Moat, Winfield, IL (US);
Raymond B. Essick, Iv, Glen Ellyn, IL (US);
Silviu Chiricescu, Chicago, IL (US);
Brian Geoffrey Lucas, Barrington, IL (US);
James M. Norris, Naperville, IL (US);
Michael Allen Schuette, Wilmette, IL (US);
Ali Saidi, Cambridge, MA (US);
Philip E. May, Palatine, IL (US);
Kent Donald Moat, Winfield, IL (US);
Raymond B. Essick, IV, Glen Ellyn, IL (US);
Silviu Chiricescu, Chicago, IL (US);
Brian Geoffrey Lucas, Barrington, IL (US);
James M. Norris, Naperville, IL (US);
Michael Allen Schuette, Wilmette, IL (US);
Ali Saidi, Cambridge, MA (US);
Motorola, Inc., Schaumburg, IL (US);
Abstract
A method for producing a formatted description of a computation representable by a data-flow graph and computer for performing a computation so described. A source instruction is generated for each input of the data-flow graph, a computational instruction is generated for each node of the data-flow graph, and a sink instruction is generated for each output of the data-flow graph. The computational instruction for a node includes a descriptor of an operation performed at the node and a descriptor of each instruction that produces an input to the node. The formatted description is a sequential instruction list comprising source instructions, computational instructions and sink instructions. Each instruction has an instruction identifier and the descriptor of each instruction that produces an input to the node is the instruction identifier. The computer is directed by a program of instructions to implement a computation representable by a data-flow graph.