CN101609481B - Rapid circuit partitioning method based on direct current channel module and strongly connected components - Google Patents
Rapid circuit partitioning method based on direct current channel module and strongly connected components Download PDFInfo
- Publication number
- CN101609481B CN101609481B CN2009100889965A CN200910088996A CN101609481B CN 101609481 B CN101609481 B CN 101609481B CN 2009100889965 A CN2009100889965 A CN 2009100889965A CN 200910088996 A CN200910088996 A CN 200910088996A CN 101609481 B CN101609481 B CN 101609481B
- Authority
- CN
- China
- Prior art keywords
- node
- scc
- dccb
- circuit
- direct current
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
The invention provides a rapid partitioning method of a very large-scale integrated circuit, which belongs to the field of development of automation software. The method is characterized in that, proceeding from the physical structure and the circuit functions of the circuit, in the method a direct current channel module DCCB which is the concept based on the physical structure and the circuit functions for circuit identification and rapid partitioning is firstly used, thereby not only reducing the scale of the partitioning problem, but also containing very strong circuit information and further achieving double improvements of increasing the circuit portioning speed and improving the optimum solution quality. The method is not only rapid, simple, stable and good in scalability, but also contains very strong circuit information and completely preserves the circuit structure and functional units.
Description
Technical field
The present invention relates to a kind of quick partitioning algorithm of VLSI (very large scale integrated circuit), belong to the automated software development field.
Background technology
Along with developing rapidly of integrated circuit, the VLSI scale is increasing, 26S Proteasome Structure and Function becomes increasingly complex, and automatic electronic design EDA (Electronic Design Automation) instrument more and more becomes the requisite aid of VLSI (very large scale integrated circuit) designs and checking work.Along with the continuous development of lsi technology and design level, eda tool has run into many new problems.One of them is exactly its emulation cycle along with the scale of problem circuit presents ultra linear growth; Along with circuit metal-oxide-semiconductor number is increasing, structure is increasingly sophisticated, and the EDA emulation tool also will face more and more acid test, shortens the emulation cycle, improves the urgent task that therefore simulation efficiency also becomes the eda tool exploitation.
In recent years, the appearance of multi-core CPU and developing rapidly, the further investigation of coenocytism and moulding have gradually caused academia and the great interest of industry member in relative a lot of research directions and research field.The multi-core parallel concurrent circuit simulation has been opened up a new way that very is worth research to be explored for the efficiency that solution EDA emulation tool is faced.Utilize the computation capability of multi-core CPU to carry out parallel artificial, may improve computing velocity largely, shorten the emulation cycle.Therefore, the multi-core parallel concurrent circuit simulation also becomes the focus of attention and research.
The prerequisite that adopts the emulation of multi-core CPU parallel circuit is that the multi-section circuit is divided.Because circuit is the unified integral body that is coupled to form by various components and parts, and communication and exchanges data are closely arranged between the each several part.To must carry out the division of certain form to entire circuit earlier to the simulation problems parallel processing of entire circuit.A plurality of nodes that electronic circuit after the division just can be assigned to parallel computer calculate respectively.Circuit Partitioning Problem be the history in CAD field for a long time, very ripe problem.Traditional, classical Circuit Partitioning Problem pin can be described like this:
A) given circuit structure and division portion number sought the optimal dividing strategy
B) partition strategy satisfies the prerequisite of certain constraint condition: the load balance of different piecemeals
C) partition strategy minimizes objective function: the traffic is minimum
Nearly decades, the research of Circuit Partitioning Problem is being deepened continuously always and developing, the theory of various division methods and use also reaches its maturity, and Circuit Partitioning Problem is in placement-and-routing, and circuit design links such as layout design and logic level emulation-comprehensive all are widely used.In the reality there be the main method that adopts at present, propose in document A linear time heuristic for improving network partition by C.Fiduccia and R.Mattheyses, and the heuristic direct F-M algorithm of in document Multiple-way network partitioning, being promoted by L.Sanchis; With Dalibor Kolar, Julijana Divkovic PukSec and Ivan Branica propose algorithm etc. and are the direct modeling annealing/genetic algorithm of representative in document VLSI Circuit Partition Using Simulated Annealing Algorithm; Proposing algorithm with L.Hagen and A.B.Kahng in document Fast spectral methods for ratio cut partitioning and clustering is the long partitioning algorithm successively of clustering of representative, and being used in combination of above-mentioned several method.
Though it is more extensive and ripe that the circuit division methods is used, concerning parallel this follow-up work of SPICE emulation of multi-core CPU, existing various partitioning algorithms all are faced with some problems and difficulty like this:
1) for the corresponding multi-section division methods that requires of multi-core CPU parallel artificial, the actual effect of present various partitioning algorithms (minimum traffic) is all not really desirable, because the algorithm traffic density of parallel SPICE emulation is very high, the too high traffic becomes the bottleneck that the constraint parallel computation obtains satisfied emulation speed-up ratio probably.
2) for direct partitioning algorithm, the complexity of algorithm and machine time increase with the problem scale ultralinear.Along with the scale of artificial circuit increases day by day, the elapsed time of partitioning algorithm own will increase rapidly, influence the efficient that whole parallel computation is finished.
For partitioning algorithm successively, its layering strategy is mainly by the mathematical algorithm decision of correspondence.For complex structure, the IC design that differs greatly, very big fluctuation may appear in the quality that layering is divided.
Summary of the invention
The objective of the invention is to design a kind of fast method,, improve the speed of dividing, guarantee the quality of separating of dividing for the multi-section Circuit Partitioning Problem in the practical applications such as parallel artificial at VLSI (very large scale integrated circuit) multi-section partition problem.
To achieve these goals, the present invention adopts following technical scheme:
A kind of quick VLSI (very large scale integrated circuit) division methods based on direct current channel module DCCB and the strong component SCC of UNICOM, it is characterized in that, described method is a kind of method of decisive, the linear session complexity based on circuit physical arrangement and functional character, realizes that under vc++6.0 Software Development Platform on the PC its step is as follows:
For original graph G
OIn any path without input node or power supply node, if:
The original graph G of this path process
OIn the pairing circuit node of all nodes all be a kind of of following two kinds of situations:
The source S node of a, a certain MOS transistor or drain D node
One leaf of b, a certain passive device
Then: original graph G
OIn the circuit node of all node correspondences on this path and the circuit elements device of all limit correspondences, belong to a direct current channel module DCCB;
All direct current channel module DCCB constitute the figure G that derives
DCCBNode set, all original graph G
OLimit between the middle direct current channel module DCCB constitutes the figure G that derives
DCCBLimit set,
Step 3 is to the figure G that derives
DCCB, the identification strong component SCC of UNICOM set wherein, and storage corresponding informance, generate with the strong component SCC of UNICOM be elementary cell simplify figure G
SCC:
For the figure G that derives
DCCBAny two node A, B,
If: all there be directed path to Node B with by Node B to node A by node A,
Then: this two node A, B belong to the same strong component SCC of UNICOM;
All the strong component SCC of UNICOM formations are simplified figure G
SCCNode set, all figure G that derive
DCCBIn limit between the strong component SCC of UNICOM constitute and simplify figure G
SCCLimit set,
Step 4 is the load balance that guarantees that multi-section is divided, and figure G is simplified in identification
SCCIn " excessive ring ":
Setting the decision threshold constant is the average computation charge capacity, promptly total components and parts number/block count, and allow 50%～150% reach the standard grade unsteadyly, this domain of walker is an empirical value, allows artificial the adjustment to change;
For simplifying figure G
SCCIn any one SCC node, if:
This SCC node corresponding circuits module comprises the components and parts more than the judgement thresholding of setting,
Then: this SCC node is identified as " excessive ring ", to the outside DCCB unit of exporting arbitrary internal DC CB unit in the SCC node is so far arranged, at the figure G that derives
DCCBIn, define its input and output class value according to its distance apart from the input signal end, near more apart from the input signal end, input and output class value definition is low more; Choose the corresponding internal DC CB unit that minimum or the highest outside DCCB unit of input and output class value outputs to, select in the above-mentioned SCC node any limit of pointing to it for specifying the limit; After disconnecting the appointment limit, the strong component SCC of UNICOM is discerned in the inside direct current channel module DCCB set of above-mentioned SCC node again, and refresh and simplify figure G
SCC
Step 5 is to simplifying figure G
SCCAdopt traditional F-M multi-section partitioning algorithm, draw circuit and divide the result.
Wherein, in step 3, if direct current channel module DCCB node does not belong to any strong component node SCC of UNICOM, then its independent formation is simplified figure G
SCCIn a SCC node.
Wherein, in step 4, if still there was excessive ring in inside after excessive ring disconnect to be specified the limit, the identifying of repeating step (4) then.
The quick VLSI (very large scale integrated circuit) division methods based on direct current channel module DCCB and the strong component SCC of UNICOM of utilizing the present invention to propose has following beneficial effect:
1, largely dwindle the problem scale that circuit is divided, divide for the multi-section of ultra-large circuit, it is obvious that the algorithm speed-up ratio is conciliate quality optimization;
2, the process of identification direct current channel module DCCB and strong UNICOM component is simple, and time complexity linearity, and be conclusive process is subjected to that circuit scale, circuit structure, parameter are provided with etc. and influences very little, and stability and extensibility are good.
Description of drawings
Fig. 1 .1,1.2 illustrates for the present invention discerns direct current channel module DCCB to the example ifq circuit.
Fig. 2 .1,2.2,2.3 for the present invention to the example figure G that derives
DCCBDiscern the strong component SCC of UNICOM signal.
Fig. 3 .1,3.2 discerns inner SCC signal after the present invention disconnects the excessive ring of example again.
Fig. 4 is implementing procedure figure of the present invention.
Embodiment
The quick VLSI (very large scale integrated circuit) division methods based on direct current channel module DCCB and the strong component SCC of UNICOM that the present invention proposes, accompanying drawings is as follows.
The method that the present invention proposes is divided circuit in advance from the physical arrangement and the circuit function of circuit.The scale that pre-division result had both dwindled partition problem comprises very forceful electric power road information again, improves the dual improvement that circuit is divided speed and optimization solution quality thereby reach.Especially, we are used for circuit identification to this notion based on physical arrangement and circuit function of direct current channel module DCCB first and divide fast.
Basic thought based on direct current channel module DCCB and the division methods of the strong component SCC of UNICOM is:
1) for MOS transistor that links to each other by source S, drain D and passive device set, from circuit structure, its intraconnection is tight, and coupling is strong; Between different sets a little less than simple, the coupling of interconnection.Be fit to very much it is identified as direct current channel module DCCB in advance, reach and dwindle the partition problem scale and reduce the purpose of dividing the traffic.
2) module collection of bi-directional path is all arranged for any two direct current channel module DCCB, consider if its division must be brought two traffics more than the unit, so its merging is identified as the strong component SCC of UNICOM, further dwindle problem scale, reduce the traffic.
Fig. 1, Fig. 2 and Fig. 3 have provided identification DCCB module, identification SCC module respectively and have disconnected excessive ring and discerned the example of SCC again (here only with a simple digital circuitry signal identification DCCB, with a simple digraph signal identification SCC, with an excessive ring processing procedure of simple SCC structural representation, be not limitation of the present invention, can be applicable to the circuit of arbitrary structures based on the partitioning algorithm of DCCB and SCC).
Fig. 1 .1 is a simple cmos digital circuit.Its logic function is after Va and the Vb process NOT-AND operation, to use the D-latches.The name of the no underscore mark of m beginning is called each metal-oxide-semiconductor name among the figure, and the n beginning has each nodename that is of underscore mark.This circuit has comprised 11 nodes and 12 metal-oxide-semiconductors, no passive device.Node n0 represents ground node GND, and node n1 represents power supply node VDD.Fig. 4-the 3rd, the split graph of node is represented and imported to the non-directed graph of circuit among Fig. 4-2.The result of Fig. 1 .2 displayed map 1.1 identification DCCB:
DCCB1＝{m11，m12，m13，m15，m16，m21，m22，m23，m25，m26}；
DCCB2＝{m14，m24}。
Fig. 2 .1 is the digraph signal of deriving behind the circuit network piecemeal, and it comprises 9 summits and 10 arcs.Root node Root is the artificial node that adds among the figure.Fig. 2 .2 discerns the strong component SCC of UNICOM module result to it, and Fig. 2 .3 is the digraph of simplifying behind the identification SCC.
Fig. 3 .1 is the SCC and the signal of associated external node module thereof that are identified as excessive ring, and it comprises 23 DCCB nodes, V
O1, V
O2, V
O3, V
O4Be respectively 4 external nodes that it had output relation, V
I1, V
I2, V
I3, V
I4Be respectively corresponding 4 internal nodes that link to each other.Fig. 3 .2 is for disconnecting V
I1And V
I4Between arc after its inside is discerned the result of the strong component SCC of UNICOM again.
Shown in process flow diagram,, mainly implement by following three steps based on the quick VLSI (very large scale integrated circuit) partitioning algorithm of direct current channel module DCCB and the strong component SCC of UNICOM:
1, for circuit identification direct current channel module DCCB to be divided;
2, for the figure G that derives that with the DCCB module is the unit
DCCB, discern SCC and carry out excessive ring processing;
3, for the SCC module be the unit simplify figure G
SCC, adopt a certain traditional partitioning algorithm to divide circuit.
Below specify:
The 1st step, for the set of the MOS transistor of ifq circuit, investigate each MOS transistor successively, unidentified if it is masked as, be a direct current channel module DCCB of its new distribution unit just, this MOS transistor belongs to this DCCB unit, and is labeled as and discerns; , to therewith source S and drain D adjacent all crystals pipe (must be contiguous to source S or drain D) and the passive device of MOS transistor, if it be unidentified, then all discern belong to this DCCB, and be labeled as and discern thereafter; Depth-first repeats this search identifying, and is Unidentified in abutting connection with components and parts until not having.
The 2nd goes on foot, and defines the root node Root of the DCCB module of input that a sensing has or not; From root node Root, carry out the Tarjan_DFS algorithm search SCC of depth-first: visit each DCCB module node by the search order of depth-first, be its mark depths preferred value and the low point value of depth-first; The depth-first value is labeled as constantly and increases progressively; The low point value of depth-first just is made as identical with the depth-first value, if the low point value of the depth-first of child node is littler than the low point value of the depth-first of father node, then the low point value of father node depth-first is made as the low point value of child node depth-first; After depth-first traversal was finished, all DCCB module nodes that have the preferentially low point value of same depth promptly were identified as a strong component SCC of UNICOM.
The 3rd the step, with a kind of traditional multi-section partitioning algorithm to simplifying figure G
SCCCarry out circuit and divide, all circuit elements device place modules that certain SCC place module promptly comprises among the SCC for this reason.
In in the said process the 1st step, this thought of direct current channel module DCCB is referred from " optimisation strategy of Fastsim fast circuit emulation " literary composition of Jia Yaowei and Yang Huazhong in the identification circuit, is that we propose first and use it for the circuit division.The big characteristics of another of this invention are, the algorithm that we propose not only fast, simple, stable, favorable expandability, and comprised very strong circuit information is preserved very complete to circuit structure and functional unit.Some empirical laws of parallel circuit emulation show that circuit is divided and got over according to circuit structure and circuit function unit, and convergence that it is parallel and speed of convergence are just good more.Put from this, the algorithm that we propose also can be helpful to the parallel circuit simulation performance.
Tentatively (circuit 1 is 2 digit counters in the digital circuit, problem scale N=35 to the fast circuit partitioning algorithm that following table has shown us at two typical test circuits; Charge pump in 2 radio-frequency front-end phaselocked loops of circuit, problem scale is N=96) go up and classic method performance result relatively.As can be seen from the results, for these two test circuits, this method has been dwindled about 3～7 times with problem scale, has on average reached about 1.8 times speed-up ratio, and the traffic that multi-section is divided on average descends about 26%～29%.
The The tested results of table 1. the present invention on two typical circuits
Annotate: test environment is a VC++6.0 Software Development Platform on the Intel 2.66GHz dominant frequency PC.Test process is for just separating test 10 times for algorithm assigns at random; 2 ones/4 ones/8 division tasks of " 2 ones/4 ones/8 ones " difference corresponding circuits in the form.
Claims (2)
1. quick VLSI (very large scale integrated circuit) division methods based on direct current channel module DCCB and the strong component SCC of UNICOM, it is characterized in that, described method is a kind of method of decisive, the linear session complexity based on circuit physical arrangement and functional character, realizes that under vc++6.0 Software Development Platform on the PC its step is as follows:
Step (1) is read in circuit information to be divided, sets up the corresponding storage organization of Various types of data, generative circuit original graph G
0: node set memory circuit node information, limit set memory circuit components and parts information;
Step (2) is for original graph G
O, identification generates direct current channel module DCCB set, and the storage corresponding informance, and generating with direct current channel module DCCB is the figure G that derives of elementary cell
DCCB:
For original graph G
OIn any path without input node or power supply node, if:
The original graph G of this path process
OIn the pairing circuit node of all nodes all be a kind of of following two kinds of situations:
A) the source S node of a certain MOS transistor or drain D node,
B) leaf of a certain passive device,
Then: original graph G
OIn the circuit node of all node correspondences on this path and the circuit elements device of all limit correspondences, belong to a direct current channel module DCCB;
All direct current channel module DCCB constitute the figure G that derives
DCCBNode set, all original graph G
OLimit between the middle direct current channel module DCCB constitutes the figure G that derives
DCCBLimit set,
Step (3) is to the figure G that derives
DCCB, the identification strong component SCC of UNICOM set wherein, and storage corresponding informance, generate with the strong component SCC of UNICOM be elementary cell simplify figure G
SCC:
For the figure G that derives
DCCBAny two node A, B,
If: all there be directed path to Node B with by Node B to node A by node A,
Then: this two node A, B belong to the same strong component SCC of UNICOM;
All the strong component SCC of UNICOM formations are simplified figure G
SCCNode set, all figure G that derive
DCCBIn limit between the strong component SCC of UNICOM constitute and simplify figure G
SCCLimit set,
Step (4) is the load balance that guarantees that multi-section is divided, and figure G is simplified in identification
SCCIn " excessive ring ":
Setting the decision threshold constant is the average computation charge capacity, promptly total components and parts number/block count, and allow 50%～150% reach the standard grade unsteadyly, this domain of walker is an empirical value, allows artificial the adjustment to change;
For simplifying figure G
SCCIn any one SCC node, if:
This SCC node corresponding circuits module comprises the components and parts more than the judgement thresholding of setting,
Then: this SCC node is identified as " excessive ring ", to the outside DCCB unit of exporting arbitrary internal DC CB unit in the SCC node is so far arranged, at the figure G that derives
DCCBIn, define its input and output class value according to its distance apart from the input signal end, near more apart from the input signal end, input and output class value definition is low more; Choose the corresponding internal DC CB unit that minimum or the highest outside DCCB unit of input and output class value outputs to, the limit of selecting any this internal DC of sensing CB unit in the above-mentioned SCC node is for specifying the limit; After disconnecting the appointment limit, the strong component SCC of UNICOM is discerned in the inside direct current channel module DCCB set of above-mentioned SCC node again, and refresh and simplify figure G
SCC
Step (5) is to simplifying figure G
SCCAdopt traditional F-M multi-section partitioning algorithm, draw circuit and divide the result.
2. as claims 1 described quick VLSI (very large scale integrated circuit) division methods based on direct current channel module DCCB and the strong component SCC of UNICOM, it is characterized in that, in step (4), if still there was excessive ring in inside after excessive ring disconnect to be specified the limit, the identifying of repeating step (4) then.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100889965A CN101609481B (en) | 2009-07-17 | 2009-07-17 | Rapid circuit partitioning method based on direct current channel module and strongly connected components |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100889965A CN101609481B (en) | 2009-07-17 | 2009-07-17 | Rapid circuit partitioning method based on direct current channel module and strongly connected components |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101609481A CN101609481A (en) | 2009-12-23 |
| CN101609481B true CN101609481B (en) | 2011-03-30 |
Family
ID=41483235
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100889965A Expired - Fee Related CN101609481B (en) | 2009-07-17 | 2009-07-17 | Rapid circuit partitioning method based on direct current channel module and strongly connected components |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101609481B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103178979B (en) * | 2011-12-23 | 2017-12-19 | 北京亿阳信通科技有限公司 | The recognition methods of transmission network anomaly sxtructure |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1529353A (en) * | 2003-09-29 | 2004-09-15 | 复旦大学 | Equivalent verifying method of combining circuit in super large-scale integrated circuit |
| CN1545049A (en) * | 2003-11-14 | 2004-11-10 | 清华大学 | Large-scale hybrid mode layout method based on virtual module |
| US7149674B1 (en) * | 2000-05-30 | 2006-12-12 | Freescale Semiconductor, Inc. | Methods for analyzing integrated circuits and apparatus therefor |
-
2009
- 2009-07-17 CN CN2009100889965A patent/CN101609481B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7149674B1 (en) * | 2000-05-30 | 2006-12-12 | Freescale Semiconductor, Inc. | Methods for analyzing integrated circuits and apparatus therefor |
| CN1529353A (en) * | 2003-09-29 | 2004-09-15 | 复旦大学 | Equivalent verifying method of combining circuit in super large-scale integrated circuit |
| CN1545049A (en) * | 2003-11-14 | 2004-11-10 | 清华大学 | Large-scale hybrid mode layout method based on virtual module |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101609481A (en) | 2009-12-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yang et al. | Balanced partitioning | |
| CN108509425A (en) | A kind of Chinese new word discovery method based on novel degree | |
| Fellows et al. | The complexity ecology of parameters: An illustration using bounded max leaf number | |
| CN107784598A (en) | A kind of network community discovery method | |
| CN114742001B (en) | System static time sequence analysis method based on multiple FPGA | |
| CN106294715A (en) | A kind of association rule mining method based on attribute reduction and device | |
| CN107102861B (en) | A kind of method and system obtaining the vector of function in Open Source Code library | |
| CN100592332C (en) | Device and method for cases illation based on cases tree | |
| CN102722530B (en) | Community detection method in complex network | |
| CN110232213A (en) | High speed modular cell library layout design method based on FinFET structure | |
| CN116151324A (en) | RC interconnection delay prediction method based on graph neural network | |
| CN101814106A (en) | Layered circuit extraction method | |
| CN101609481B (en) | Rapid circuit partitioning method based on direct current channel module and strongly connected components | |
| CN104992032B (en) | The modification method of retention time in a kind of multiple voltage domain design | |
| US20050156626A1 (en) | Optimal mapping of LUT based FPGA | |
| US8504953B2 (en) | Schematic generation visualization aid for netlists comprising analog circuits | |
| CN1510733A (en) | Transistor integrated circuit optimization method for process transplantation | |
| CN110019252A (en) | The method, apparatus and electronic equipment of information processing | |
| CN109542936A (en) | A kind of recursion causal inference method based on cause and effect segmentation | |
| Panella et al. | A design workflow for dynamically reconfigurable multi-FPGA systems | |
| CN103440339B (en) | Method, device and system for searching application system change association objects | |
| Lu et al. | Automatic Op-Amp Generation From Specification to Layout | |
| CN109558656B (en) | Quantum reversible circuit synthesis method based on Boolean expression diagram | |
| CN102486807A (en) | Sub circuit signature method on basis of subgraph isomorphism | |
| CN103092994A (en) | Support vector machine (SVM) text automatic sorting method and system based on information concept lattice correction |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110330 Termination date: 20180717 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |