CN1760879A - Programmable method for automatic generating kernel domain - Google Patents
Programmable method for automatic generating kernel domain Download PDFInfo
- Publication number
- CN1760879A CN1760879A CN 200510110262 CN200510110262A CN1760879A CN 1760879 A CN1760879 A CN 1760879A CN 200510110262 CN200510110262 CN 200510110262 CN 200510110262 A CN200510110262 A CN 200510110262A CN 1760879 A CN1760879 A CN 1760879A
- Authority
- CN
- China
- Prior art keywords
- mux
- programme
- nuclear
- repetitive
- select
- 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.)
- Granted
Links
Images
Abstract
The method includes following procedures: through structural description with programmable kernel and basic element base, generated four-inputted LUT, input junction box, output junction box, and switch box so as to obtain table of circuit nets and to output the table in format of Verilog file. Laying drawing based on repeated elements using O-Tree algorithm according to sequence from lower to upper, and from left to right. Next, the programming point is connected to nearest SRAM. Result is output in format of DEF file; and the file is introduced to wiring tool to carry out arrangement of wires. Further, layout with programmable kernel is obtained. The invention shortens time for developing system, and lowering cost for developing system.
Description
Technical field
The invention belongs to the automatic generation technique of domain field, be specifically related to a kind of programmable method for automatic generating kernel domain that shortens system development cycle, reduces system development costs.
Technical background
Towards the integrated circuit (IC) design (ASIC) of specific application area, have performance height, advantage low in energy consumption, but designed circuit do not have reconfigurable property.In case customer requirements changes, circuit will redesign, and must change because be used to produce a whole set of mask plate of integrated circuit.Therefore, the system development time is long, input human cost, system testing cost height.
Field programmable gate array (FPGA) is compared with ASIC, and performance is low, power consumption is big, but circuit has reconfigurable property.When the desired logic function of user changed, the hardware configuration of circuit did not need redesign.The user only need redesign circuit in the software systems of FPGA, by download cable configuration information is write SRAM (StaticRamdon Access Memory) then, can make circuit have different logic functions.Producing a whole set of mask plate of FPGA circuits needed can't change because of the variation of circuit logic function.Therefore use the FPGA development system to shorten the development time, reduce the system testing cost.
Reconfigurable function is incorporated in the ASIC circuit, when requiring circuit function to change, and should change in designed application scope the time, can be by circuit be reconfigured, thus make circuit have desired function.The range of application of reconfigurable ASIC circuit is wider than ASIC circuit, and performance and power consumption all are better than FPGA.Owing to be towards specific application area, the nuclear able to programme in the reconfigurable ASIC circuit must have specific requirement.If fully by artificial generation nuclear domain able to programme, the construction cycle of system must be very long so.
Summary of the invention
The objective of the invention is to propose a kind of method for automatic generating kernel domain edited that can shorten system development cycle, reduce system development costs.
The programmable method for automatic generating kernel domain that the present invention proposes is according to the nuclear structure description able to programme of user's input, area-constrained and elementary cell storehouse, generates nuclear domain able to programme automatically.(accompanying drawing 1) its basic step is: by the structrual description and the elementary cell storehouse of nuclear able to programme, generate four input LUT, input connecting box, output connecting box and switch enclosure, obtain circuit meshwork list and export with the Verilog document form.Then according to from the bottom up, order from left to right, adopt the O-Tree algorithm to carry out Butut based on repetitive.When carrying out Butut, utilize to download the equivalence of programming SRAM, do not consider being connected between SRAM and the programmed point.After Butut is finished, programmed point is connected to nearest SRAM.The Butut result is with the output of DEF document form, and this document can import in the wiring tool and connect up, and then obtains the domain of nuclear able to programme.In the whole process, the user only needs input structure description document and area-constrained file, and nuclear domain able to programme just can obtain by computer run, and therefore the exploitation of nuclear able to programme will be more faster than artificial exploitation.
Description of drawings
Fig. 1 is a FB(flow block) of the present invention.
Fig. 2 is four input LUT structural drawing.
Fig. 31 selects 2 MUX structural drawing.
Fig. 41 selects 4 MUX structural drawing.
Fig. 5 is two components of one 4 * 8 matrix switch box correspondence.
Fig. 6 is 4 * 8 matrix switch box diagram.
Fig. 7 is the annexation diagram of each element in the circuit.
Fig. 8 is a lower left corner repetitive layout diagram.
Fig. 9 is a lower right corner repetitive layout diagram.
Figure 10 is a upper left corner repetitive layout diagram.
Figure 11 is a upper right corner repetitive layout diagram.
Figure 12 is for generating domain.
Embodiment
The programmable method for automatic generating kernel domain that the present invention proposes, concrete implementation step is as follows:
Step 1: file input
A) nuclear structure able to programme is described:
1. the line number of repetitive array and columns,
2. each is gone, the wiring channel width of each row,
3. be used for the address wire of SRAM of program downloads and the width of data line,
4. the position of nuclear address wire able to programme and data line input port; ,
B) elementary cell storehouse:
1.2 select 1 MUX,
2.4 select 1 MUX,
3. rejection gate,
4. not gate,
5. triple gate,
6.2 * 2 universal switch enclosure,
7.4 the SRAM storer of unit;
C) area-constrained:
1. nuclear chip area able to programme,
2. chip area length breadth ratio,
Step 2: circuit generates in the unit
A) four input LUT
Select for 441 MUX to constitute the first order side by side, 14 is selected 1 MUX to constitute the second level, and four input ends of LUT are divided into two groups, are connected with partial selection control end with the first order respectively;
(accompanying drawing 2)
B) input connecting box
Select 1 MUX and 4 to select 1 MUX to constitute 2L with 2 and select 1 input MUX (wherein L is a positive integer), and the data input pin of MUX is connected to wiring channel, select control end to be connected to the SRAM that downloads programming, output terminal is connected to the input end of LUT, thereby realizes the full-mesh of wiring channel to the LUT input;
Wherein, input MUX structure can adopt following structure rule:
M
4, 4 select 1 MUX,
M
2, 2 select 1 MUX,
S, the programming multichannel is selected, from SRAM,
S|
i j, i element among the S be to j the vector that element constituted,
I, from the input of wiring channel,
I|
i j, i element among the I be to j the vector that element constituted,
N, the wiring line segment number in the wiring channel,
C) output connecting box
Select 2 MUX (accompanying drawing 3) and 1 to select 4 MUX (accompanying drawing 4) to constitute 1 with 1 and select 2L output MUX (wherein L is a positive integer), and the data input pin of MUX is connected to the LUT output terminal, select control end to be connected to the SRAM that downloads programming, output terminal is connected to wiring channel, thereby realizes that LUT outputs to the full-mesh of wiring channel;
Wherein, the output MUX can adopt following structure rule:
D
4, 1 selects 4 MUX,
D
2, 1 selects 2 MUX,
S, the programming multichannel is selected, from SRAM,
S|
i j, i element among the S be to j the vector that element constituted,
O, to the output of wiring channel,
O|
i j, i element among the O be to j the vector that element constituted,
N, the wiring line segment number in the wiring channel;
D) switch enclosure
Universal switch enclosure with 2 * 2 is constructed needed switch enclosure.Suppose that the horizontal wiring width of channel is 2m, the vertical routing channel width is 2n.The switch enclosure that then on its point of crossing, needs a 2m * 2n.At first introduce one two component (E), wherein a pair of wiring line segment in level and the vertical routing channel is represented on each summit among vertex set H and the V respectively for H, V, so have | H|=m and | V|=n.E is the set on limit, and (the wiring line segment that h and v representative then are described is to carrying out gating by one 2 * 2 switch enclosure for h, v) ∈ E if for two summit h ∈ H and v ∈ V, exist.The problem that generates switch box structure can be expressed as: given H and V, determine E, make for v ∈ H ∪ V, all have d (v)＞0, and max (d (v)) |
V ∈ H ∪ VThe value minimum, wherein d (v) is the degree of vertex v.Adopt following step to determine that two components obtain the structure of rectangle SB:
1. two initial components be (H, V, φ)
2. select two summit h ∈ H and v ∈ V, satisfy
D (h)=min (d (h ')) |
H ' ∈ HAnd d (v)=min (d (v ')) |
V ' ∈ V
3. make E=E ∪ (h, v)
4. if satisfy v ∈ H ∪ V, d (v)＞0 end, otherwise repeating step 2
One 4 * 8 matrix switch box and two corresponding components thereof are seen accompanying drawing 5.In two components, 4 summits of last row and down 2 summits of row are corresponding with 8 wiring line segments and 4 wiring line segments in the horizontal wiring passages in the vertical routing channel respectively.For example, summit " v1﹠amp; V2 " represent and be numbered 1 and 2 a pair of wiring line segment in the vertical routing channel, and summit " h1﹠amp; H2 " then represent and be numbered 1 and 2 a pair of wiring line segment in the horizontal wiring passage.When having the limit to connect between these two summits, then being illustrated on the point of crossing of two teams' wiring line segment has one 2 * 2 switch enclosure to carry out gating (accompanying drawing 6).
e)SRAM
Call 4 cell S RAM storeies in the storehouse.
Step 3: generate the net table
Set up the annexation between each circuit component in the nuclear able to programme, each circuit component all comes from the elementary cell storehouse.Described circuit connects and comprises two parts content:
A) circuit in the repetitive connects
Each repetitive all is formed by connecting by the element in the elementary cell storehouse, describes the annexation between the element of storehouse in the repetitive.
B) circuit of nuclear domain able to programme connects
Whole nuclear domain able to programme is formed by connecting by the element in the elementary cell storehouse.With the circuit connecting relation of the whole nuclear domain able to programme of formal description of Verilog net table, and export with document form.
Step 4: based on the layout of repetitive
In nuclear able to programme, each element annexation is tight in the repetitive, and the annexation between each repetitive is more open, and therefore the layout based on repetitive can adopt O-Tree algorithm [3].Rule is as follows:
A), determine the height and the width of nuclear domain able to programme according to area-constrained
B) nuclear chip area able to programme is carried out horizontal division
N, the line number of repetitive array,
M, the columns of repetitive array,
i＝1，2，...n，
j＝1，2，...m，
A
Ij, i is capable, all storehouse element chip area sums in the multiple unit of j column weight,
A
Total, all storehouse element chip area sums in the nuclear able to programme,
H, the height of nuclear domain able to programme,
H
i, the capable horizontal zone height of the i that is divided,
C) according to from the bottom up, order from left to right, adopt O-Tree algorithm to carry out layout to each repetitive one by one.When current repetitive was carried out layout, lower boundary was the coboundary of previous row repetitive layout result, and left margin is the right margin of last repetitive layout result.Adopt cost function:
C
ij＝max(h
ij，H
i)w
ij
C
Ij, i is capable, the expense when the j column weight is answered cell placement,
h
Ij, i is capable, the height of the multiple cell layout of j column weight,
w
Ij, i is capable, the width of the multiple cell layout of j column weight,
H
i, the height of the capable horizontal zone of i,
D) distribute programmed point
After the repetitive layout was finished, the SRAM that each programmed point and being used to is downloaded programming had had concrete physical location.Distributing programmed point is exactly that the pin of programmed point and SRAM are coupled together, and requires line short as far as possible.Concrete steps are:
1. look for a programmed point arbitrarily,
2. this programmed point and nearest SRAM are linked up,
3. then get back to 1 if also have programmed point not connect SRAM, otherwise finish;
The output of step 5:DEF file
The DEF file is a text of describing the integrated circuit back-end layout design.Layout result just can import in the wiring tool, and then obtain the domain of nuclear able to programme with the output of DEF document form.
Step 6: the Verilog net table and the DEF file that generate are imported commercial eda tool, generate nuclear domain able to programme and carry out layout verification.
Under the suitable prerequisite of transistor size, adopt this method to generate resulting chip area automatically and be about 3 times of artificial design layout area, and adopt fully the eda tool comprehensive income to chip area be about 7 times of artificial chip area.
With scale is that 2 * 2 nuclear able to programme is developed as example, further specifies whole process of the present invention.
1) scale of definition nuclear able to programme is 2 * 2 in structure description file, and left vertical wiring channel width is 8, and right side wiring channel width is 4, and upside wiring channel width is 8, and downside wiring channel width is 4.
2) generate four input LUT, input connecting box, output connecting box and switch enclosure, the net table of each repetitive, the net table of nuclear able to programme.Wherein the net table of nuclear able to programme is exported with the Verilog document form.Like this, just set up the annexation of each element in the circuit with the form of net table.(accompanying drawing 7)
3) from the bottom up, from left to right, adopt the O-Tree algorithm to carry out layout to each repetitive.The scale of nuclear able to programme is 2 * 2, therefore has 4 repetitives, need carry out layout in order to these 4 repetitives.
A) lower left corner repetitive layout.
From the storehouse, call element, determine the position of each element, thereby obtain lower left corner repetitive layout by the O-Tree algorithm.(accompanying drawing 8)
B) lower right corner repetitive layout.
According to arrangement results, determine the border (the grey frame table among the figure shows left margin) of current layout.Then, from the storehouse, call element, determine the position of each element by the O-Tree algorithm.(accompanying drawing 9)
C) upper left corner repetitive layout.
According to arrangement results, determine the border (the grey frame table among the figure shows lower boundary) of current layout.Then, from the storehouse, call element, determine each position of components by the O-Tree algorithm.(accompanying drawing 10)
D) upper right corner repetitive layout.
According to arrangement results, determine the border (the grey frame table among the figure shows left margin and lower boundary) of current layout.Then, from the storehouse, call element, determine each position of components by the O-Tree algorithm.(accompanying drawing 11)
Through after 4 O-Tree layouts, just obtained the layout of nuclear able to programme.
4) layout result imports in the wiring tool and connects up with the output of DEF document form, generates domain.(accompanying drawing 12)
5) Verilog of nuclear able to programme net table and domain are imported in the layout verification tool, carry out layout verification.
List of references:
1)Xilinx，Inc.Xilinx?4000series?product?specification.1999
2)Actel?Inc.proASIC-plus?Flash?Family?FPGAs?Data?Sheets，2002
3)Guo?P?N，Cheng?C?K，Yoshimura?T.an?o-tree?representation?of?non-slicing?floorplan?andits?applications.Proceedings?of?the?36
th?design?automation?conference?1999?268-273
Claims (5)
1, a kind of programmable method for automatic generating kernel domain, it is characterized in that basic step is as follows: by the structrual description and the elementary cell storehouse of nuclear able to programme, generate four input LUT, input connecting box, output connecting box and switch enclosure, obtain circuit meshwork list and export with the Verilog document form; Then according to from the bottom up, order from left to right, adopt the O-Tree algorithm to carry out Butut based on repetitive; Again programmed point is connected to nearest SRAM, the Butut result exports with the DEF document form, this document is imported in the wiring tool connect up, and then obtain the domain of nuclear able to programme.
2,, it is characterized in that concrete steps are as follows according to the described programmable method for automatic generating kernel domain of claim 1:
Step 1: file input
A) nuclear structure able to programme is described:
1. the line number of repetitive array and columns,
2. each is gone, the wiring channel width of each row,
3. be used for the address wire of SRAM of program downloads and the width of data line,
4. the position of nuclear address wire able to programme and data line input port;
B) elementary cell storehouse:
1.2 select 1 MUX,
2.4 select 1 MUX,
3. rejection gate,
4. not gate,
5. triple gate,
6.2 * 2 universal switch enclosure,
7.4 the SRAM storer of unit;
C) area-constrained:
1. nuclear chip area able to programme,
2. chip area length breadth ratio,
Step 2: circuit generates in the unit
A) four input LUT
Select for 441 MUX to constitute the first order side by side, 14 is selected 1 MUX to constitute the second level, and four input ends of LUT are divided into two groups, are connected with partial selection control end with the first order respectively;
B) input connecting box
Select 1 MUX and 4 to select 1 MUX to constitute 2L with 2 and select 1 input MUX, L is a positive integer, and the data input pin of MUX is connected to wiring channel, select control end to be connected to the SRAM that downloads programming, output terminal is connected to the input end of LUT, thereby realizes the full-mesh of wiring channel to the LUT input;
C) output connecting box
Select 2 MUX and 1 to select 4 MUX to constitute 1 with 1 and select 2
LThe output MUX, L is a positive integer, and the data input pin of MUX is connected to the LUT output terminal, selects control end to be connected to the SRAM that downloads programming, output terminal is connected to wiring channel, thereby realizes that LUT outputs to the full-mesh of wiring channel;
D) switch enclosure
Universal switch enclosure with 2 * 2 is constructed needed switch enclosure, at first introduces one two component (H, V, E), wherein a pair of wiring line segment in level and the vertical routing channel is represented on each summit among vertex set H and the V respectively, so have | H|=m reaches | and V|=n, E are the set on limit; The problem that generates switch box structure is expressed as: given H and V, determine E, make for v ∈ H ∪ V, all have d (v)＞0, and max (d (v)) |
V ∈ ∪ VThe value minimum, wherein d (v) be the degree of vertex v, adopt following step to determine that two components obtain the structure of rectangle SB:
1. two initial components be (H, V, φ)
2. select two summit h ∈ H and v ∈ V, satisfy
D (h)=min (d (h ')) |
H ' ∈ HAnd d (v)=min (d (v ')) |
V ' ∈ V
3. make E=E ∪ (h, v)
If satisfy v ∈ H ∪ V, d (v)＞0 end, otherwise repeating step 2;
e)SRAM
Call 4 cell S RAM storeies in the storehouse;
Step 3: generate the net table
Set up the annexation between each circuit component in the nuclear able to programme, each circuit component all comes from the elementary cell storehouse; Described circuit connects and comprises two parts content:
A) circuit in the repetitive connects
Each repetitive all is formed by connecting by the element in the elementary cell storehouse, describes the annexation between the element of storehouse in the repetitive;
B) circuit of nuclear domain able to programme connects
Whole nuclear domain able to programme is formed by connecting by the element in the elementary cell storehouse, with the circuit connecting relation of the whole nuclear domain able to programme of formal description of Verilog net table, and exports with document form;
Step 4: based on the layout of repetitive
The output of step 5:DEF file
The DEF file is a text of describing the integrated circuit back-end layout design, and layout result is exported with the DEF document form, and imports in the wiring tool, and then obtains the domain of nuclear able to programme;
Step 6: the Verilog net table and the DEF file that generate are imported commercial eda tool, generate nuclear domain able to programme and carry out layout verification.
3, state programmable method for automatic generating kernel domain according to claim 2, it is characterized in that described input MUX structure rule is:
M
4, 4 select 1 MUX,
M
2, 2 select 1 MUX,
S, the programming multichannel is selected, from SRAM,
S|
i j, i element among the S be to j the vector that element constituted,
I, from the input of wiring channel,
I|
i j, i element among the I be to j the vector that element constituted,
N, the wiring line segment number in the wiring channel.
4,, it is characterized in that the structure rule of described output MUX is according to the described programmable method for automatic generating kernel domain of claim 2:
D
4, 1 selects 4 MUX,
D
2, 1 selects 2 MUX,
S, the programming multichannel is selected, from SRAM,
S|
i j, i element among the S be to j the vector that element constituted,
O, to the output of wiring channel,
O|
i j, i element among the O be to j the vector that element constituted,
N, the wiring line segment number in the wiring channel.
5,, it is characterized in that the regular as follows of described layout based on repetitive according to the described programmable method for automatic generating kernel domain of claim 2:
A) adopt according to area-constrained, determine the height and the width of nuclear domain able to programme,
B) nuclear chip area able to programme is carried out horizontal division,
N, the line number of repetitive array,
M, the columns of repetitive array,
i＝1，2，...n，
j＝1，2，...m，
A
Ij, i is capable, all storehouse element chip area sums in the multiple unit of j column weight,
A
Total, all storehouse element chip area sums in the nuclear able to programme,
H, the height of nuclear domain able to programme,
H
i, the capable horizontal zone height of the i that is divided,
C) according to from the bottom up, order from left to right, adopt O-Tree algorithm to carry out layout to each repetitive one by one; When current repetitive was carried out layout, lower boundary was the coboundary of previous row repetitive layout result, and left margin is the right margin of last repetitive layout result; Adopt cost function:
C
ij＝max(h
ij，H
i)w
ij
C
Ij, i is capable, the expense when the j column weight is answered cell placement,
h
Ij, i is capable, the height of the multiple cell layout of j column weight,
w
Ij, i is capable, the width of the multiple cell layout of j column weight,
H
i, the height of the capable horizontal zone of i,
C) distribute programmed point
Concrete steps are:
(1) look for a programmed point arbitrarily,
(2) this programmed point and nearest SRAM are linked up,
(3) then get back to 1 if also have programmed point not connect SRAM, otherwise finish.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101102624A CN100395762C (en) | 2005-11-10 | 2005-11-10 | Programmable method for automatic generating kernel domain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101102624A CN100395762C (en) | 2005-11-10 | 2005-11-10 | Programmable method for automatic generating kernel domain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1760879A true CN1760879A (en) | 2006-04-19 |
| CN100395762C CN100395762C (en) | 2008-06-18 |
Family
ID=36706948
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005101102624A Expired - Fee Related CN100395762C (en) | 2005-11-10 | 2005-11-10 | Programmable method for automatic generating kernel domain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100395762C (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102054081A (en) * | 2009-10-30 | 2011-05-11 | 新思科技有限公司 | Method and device for verifying physical design applied to integrated circuit |
| CN102542083A (en) * | 2010-12-23 | 2012-07-04 | 北京晶智意达科技有限公司 | Method for adjusting hierarchical unit ports based on connection relational tree |
| CN103793565A (en) * | 2014-01-26 | 2014-05-14 | 深圳市兴森快捷电路科技股份有限公司 | Method for rapidly generating netlist |
| CN105740492A (en) * | 2014-12-12 | 2016-07-06 | 北京华大九天软件有限公司 | Method for linking when netlist of Memory Compiler is generated |
| CN106469227A (en) * | 2015-08-14 | 2017-03-01 | 北京华大九天软件有限公司 | A kind of method automatically building cascade circuit |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5513118A (en) * | 1993-08-25 | 1996-04-30 | Nec Usa, Inc. | High level synthesis for partial scan testing |
| JPH1196374A (en) * | 1997-07-23 | 1999-04-09 | Sanyo Electric Co Ltd | Three-dimensional modeling device, three-dimensional modeling method and medium recorded with three-dimensional modeling program |
| JP3426919B2 (en) * | 1997-07-28 | 2003-07-14 | シャープ株式会社 | Figure creation device |
-
2005
- 2005-11-10 CN CNB2005101102624A patent/CN100395762C/en not_active Expired - Fee Related
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102054081A (en) * | 2009-10-30 | 2011-05-11 | 新思科技有限公司 | Method and device for verifying physical design applied to integrated circuit |
| US8826219B2 (en) | 2009-10-30 | 2014-09-02 | Synopsys, Inc. | Method and apparatus used for the physical validation of integrated circuits |
| CN102542083A (en) * | 2010-12-23 | 2012-07-04 | 北京晶智意达科技有限公司 | Method for adjusting hierarchical unit ports based on connection relational tree |
| CN102542083B (en) * | 2010-12-23 | 2015-12-02 | 深圳市同创国芯电子有限公司 | Based on the Hierarchical Components port method of adjustment of annexation tree |
| CN103793565A (en) * | 2014-01-26 | 2014-05-14 | 深圳市兴森快捷电路科技股份有限公司 | Method for rapidly generating netlist |
| CN103793565B (en) * | 2014-01-26 | 2017-04-26 | 深圳市兴森快捷电路科技股份有限公司 | Method for rapidly generating netlist |
| CN105740492A (en) * | 2014-12-12 | 2016-07-06 | 北京华大九天软件有限公司 | Method for linking when netlist of Memory Compiler is generated |
| CN106469227A (en) * | 2015-08-14 | 2017-03-01 | 北京华大九天软件有限公司 | A kind of method automatically building cascade circuit |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100395762C (en) | 2008-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20200380192A1 (en) | Automated circuit generation | |
| CN1917371A (en) | Apparatus and methods for optimizing the performance of programmable logic devices | |
| CN1760879A (en) | Programmable method for automatic generating kernel domain | |
| CN1125006A (en) | Field programmable logic device with dynamic interconnections to a dynamic logic core | |
| CN101043213A (en) | Field programmable logical array wiring resource structure and its modeling approach thereof | |
| CN111241768B (en) | Method and system for establishing standard cell library, chip design method and system | |
| CN1779686A (en) | Techniqes for making sure of buffer insertion | |
| CN1716227A (en) | Operating means and operation apparatus control method, program and computer-readable medium | |
| CN1309045C (en) | Semiconductor integrated circuit and method of designing the same | |
| US11238207B2 (en) | Method and system for fabricating integrated circuit with aid of programmable circuit synthesis | |
| US8650514B2 (en) | Rescaling | |
| CN1894692A (en) | Template-based domain-specific reconfigurable logic | |
| CN1501293A (en) | Advertisement effect analyzing method and advertising system | |
| CN1199243A (en) | Apparatus and method for synthesis of module | |
| CN101046798A (en) | Graph wrap method of type-setting domain | |
| CN1916922A (en) | Semiconductor integrated circuit and method for designing same | |
| US7096444B2 (en) | Representing device layout using tree structure | |
| US8788987B2 (en) | Rescaling | |
| dos Santos et al. | A framework for hardware cellular genetic algorithms: An application to spectrum allocation in cognitive radio | |
| CN100347709C (en) | Non-linear planning layout method based minimum degree of freedom priority principle | |
| Kong et al. | Optimal bus sequencing for escape routing in dense PCBs | |
| Parvez et al. | Application-specific fpga using heterogeneous logic blocks | |
| Wang et al. | DUPRFloor: dynamic modeling and floorplanning for partially reconfigurable FPGAs | |
| CN1969458A (en) | Programmable logic circuit control apparatus, programmable logic circuit control method and program | |
| CN1607657A (en) | Method for processing design data of semiconductor integrated circuit |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080618 Termination date: 20131110 |