US5499192A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for generating logic modules from a high level block diagram
Assignee: Xilinx Inc
•
Filing: 1994-06-30
•
Granted: 1996-03-12
•
Expires: 2014-06-30
Abstract
Abstract A set of module generators produce optimized implementations of particular circuit logic arithmetic functions for Field Programmable Gate Arrays (FPGAs) or other digital circuits. The module generators allow a circuit designer to spend more time actually designing and less time determining device-specific implementation details. The module generators accept a high level block diagram schematic of the circuit and automatically perform the detailed circuit design, including propagation of data types (precision and type) through the circuit, and low level circuit design optimization using a library of arithmetic and logic functions. The module generators are particularly useful for designs using field programmable gate arrays because of their unique architectures and ability to implement complex functions.
Inventors
- 👤 Steven K. Knapp
- 👤 Jorge P. Seidel
- 👤 Steven H. Kelem
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 09:59
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/34
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
113 words
A method of designing a digital circuit comprising the steps of: capturing a digital circuit design as a plurality of high level arithmetic and logical functions; providing a library of arithmetic and logical components corresponding to the plurality of high level arithmetic and logical functions, wherein the arithmetic and logical components are adaptable to a plurality of data types and precisions, wherein said data types include encoding information; assigning a component from the library to each function; inputting a user-selected data type and precision in the digital circuit; propagating the selected data type and precision through the digital circuit; and adapting at least one component as a result of the step of propagating.
Claim 2
Independent Claim
113 words
A method of designing a digital circuit comprising the steps of: capturing a digital circuit design as a plurality of high level arithmetic and logical functions; providing a library of arithmetic and logical components corresponding to the plurality of high level arithmetic and logical functions, wherein the arithmetic and logical components are adaptable to a plurality of data types and precisions, wherein said data types include encoding information; assigning a component from the library to each function; inputting a user-selected data type and precision in the digital circuit; propagating the selected data type and precision through the digital circuit; and adapting at least one component as a result of the step of propagating.
Claim 3
Dependent Claim
21 words
The method of claim 1, further comprising a step of including components that are not altered in the step of adapting.
Claim 4
Dependent Claim
22 words
The method of claim 1, further comprising step, before the step of propagating, of converting the captured design to a net list.
Claim 5
Dependent Claim
17 words
The method of claim 1, further including a step of: optimizing a digital design for an architecture.
Claim 6
Dependent Claim
26 words
The method of claim 4, wherein the step of optimizing includes assigning a portion of the digital design to a section of afield programmable gate array.
Claim 7
Dependent Claim
24 words
The method of claim 4, further including a step of expanding the plurality of high level arithmetic and logical functions to their full width.
Claim 8
Dependent Claim
14 words
The method of claim 6, wherein the step of expanding uses a hard macro
Claim 9
Dependent Claim
17 words
The method of claim 4, wherein the step of optimizing includes allocating clock signals to primary buffers.
Claim 10
Dependent Claim
14 words
The method of claim 4, wherein the step of optimizing includes allocating set/reset signals.
Claim 11
Dependent Claim
13 words
The method of claim 4, wherein the step of optimizing includes allocating registers.
Claim 12
Dependent Claim
44 words
The method of claim 1, wherein the step of adapting comprises the steps of: expressing a plurality of input buffer and output buffer pairs with one symbol; and expanding the one symbol into at least one or more input buffer and output buffer pairs.
Claim 13
Dependent Claim
44 words
The method of claim 1, wherein the step of adapting includes the steps of: providing a circuit module which is a tree comparator; and selecting internal elements for the tree comparator which makes at least two bit comparisons simultaneously and which is organized hierarchically.
Claim 14
Dependent Claim
44 words
The method of claim 1, wherein the step of adapting includes the steps of: providing a circuit module which is a wired-and comparator; and selecting internal elements for the wired-and comparator in which a plurality of compare elements are logically connected by AND functions.
Claim 15
Dependent Claim
25 words
The method of claim 1, wherein the step of adapting includes the step of specifying all input lines to the digital circuit with one symbol.
Claim 16
Dependent Claim
30 words
The method of claim 1, wherein the step of adapting includes the step of specifying a group of output buffers and output pads from the digital circuit with one symbol.
Claim 17
Dependent Claim
41 words
The method of claim 1, wherein the step of adapting includes the steps of: expressing a plurality of bidirectional buffers and input/output pads with one symbol; and expanding the one symbol to one or more single bidirectional buffers and input/output pads.
References Cited (Backward Citations)
US4150331A
Cited
US4989256A
Cited
US4488354A
Cited
US4527249A
Cited
US4694411A
Cited
US4725970A
Cited
US5050091A
Cited
US4942536A
Cited
US4739505A
Cited
US4831543A
Cited
US5267175A
Cited
US4964056A
Cited
US4816999A
Cited
US4872126A
Cited
US5031111A
Cited
US5031111C1
Cited
US5111413A
Cited
US5210701A
Cited
US5084824A
Cited
US5272651A
Cited
US5297066A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-03-12 | 1999-09-11 | 2000-03-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-03-12 | 2003-09-11 | 2004-03-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-03-12 | 2007-09-11 | 2008-03-12 | $7700.00 | Window Closed / Lapsed |