CN108073966A - A kind of conversion method of Quick Response Code and hole horizontal and vertical parity check code - Google Patents
A kind of conversion method of Quick Response Code and hole horizontal and vertical parity check code Download PDFInfo
- Publication number
- CN108073966A CN108073966A CN201711328465.XA CN201711328465A CN108073966A CN 108073966 A CN108073966 A CN 108073966A CN 201711328465 A CN201711328465 A CN 201711328465A CN 108073966 A CN108073966 A CN 108073966A
- Authority
- CN
- China
- Prior art keywords
- parity check
- vertical parity
- check code
- hole horizontal
- quick response
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
- G06K19/06009—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking
- G06K19/06037—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking multi-dimensional coding
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
- G06K19/06009—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking
- G06K19/06046—Constructional details
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
- Image Processing (AREA)
Abstract
The present invention relates to production technical field, the conversion method of a kind of Quick Response Code and hole horizontal and vertical parity check code is disclosed.When m × m specifications are more than predetermined threshold value, conversion method is：First by the binary system form of Quick Response Code conversion m × m specifications of m × m specifications, again by it by being integrally divided at least two binary system table sections, then each part is respectively converted into corresponding hole horizontal and vertical parity check code Local map, all well horizontal and vertical parity check code Local map is finally merged into complete hole horizontal and vertical parity check code figure, forms hole horizontal and vertical parity check code accordingly.When m × m specifications are not more than predetermined threshold value, conversion method is：The Quick Response Code of m × m specifications is first converted to the binary system form of m × m specifications, then is converted into the decimal system form of the specification of m × 1, then the decimal system form of the specification of m × 1 is converted to the hole horizontal and vertical parity check code figure of the specification of m × 1, form hole horizontal and vertical parity check code accordingly.Quick Response Code can be converted to the hole horizontal and vertical parity check code with less hole count by the embodiment of the present invention, greatly reduce labor content, reduce processing cost, improve work efficiency.
Description
Technical field
The present invention relates to production technical field more particularly to the conversion methods of a kind of Quick Response Code and hole horizontal and vertical parity check code.
Background technology
The retrospect of the reason for product problem is the severe challenge that the manufacturer of each industry all suffers from, from automobile making row
Industry is to aerospace industry, from medical treatment to food service industry, invariably so.In the epoch of a globalization, relation management is pursued by enterprise,
To realize the maximization of CSAT.Consumption and environmental legislation it is more and more stringenter, therefore trackability just become more it is necessary to.
Manufacturer all pursues production capacity maximization than ever, and it is desirable that reduces cost.In order to realize this
Target, it is necessary to monitor each process in entire manufacturing process, and preserve complete historical record.Quickly it must identify and entangle
The problem of active influence product quality, prevents defective product from continuing along production line flow down, and final goal is to try to reality
Existing zero product return of goods rate.In electronics industry, the production of PCB also needs to meet requirement of the client to retrospective, is finding to ask
During topic, client wishes can be with quick positioning question reason and impacted product scope.
At present, in the production process of various products (such as multi-layer PCB, FPC), factory generally directly by the use of Quick Response Code as letter
Breath carrier is being sprayed at plate face, reads 2 D code information by scanner in each process and is added into the Quick Response Code new
Machining information.But it is this identified using Quick Response Code as retrospect in a manner of there is easily affected by various factors cause not
Quick Response Code can be converted to hole horizontal and vertical parity check code and be used as retrospect mark to overcome this defect by the defects of easy to identify therefore, however hole horizontal and vertical parity check code
Comprising hole count largely affect labor content and processing efficiency, thus how Quick Response Code is converted to less
The hole horizontal and vertical parity check code of hole count is current urgent problem to be solved.
The content of the invention
It is an object of the invention to provide the conversion method of a kind of Quick Response Code and hole horizontal and vertical parity check code, by Quick Response Code be converted to compared with
The hole horizontal and vertical parity check code of less porous number reduces labor content, improves work efficiency.
For this purpose, the present invention uses following technical scheme：
The conversion method of a kind of Quick Response Code and hole horizontal and vertical parity check code, the specification of the Quick Response Code is m × m, big in m × m specifications
When predetermined threshold value, the conversion method is：
The Quick Response Code of m × m specifications is converted to the point horizontal and vertical parity check code of m × m specifications, be reconverted into the two of m × m specifications into
Tabulation lattice；
By the binary system form of m × m specifications by being integrally divided at least two binary system table sections；
Each binary system table section is respectively converted into corresponding hole horizontal and vertical parity check code Local map；
Obtained all well horizontal and vertical parity check code Local map is merged into complete hole horizontal and vertical parity check code figure；
Hole horizontal and vertical parity check code is formed on product according to the hole horizontal and vertical parity check code figure.
Optionally, the binary system form by m × m specifications is by being integrally divided at least two binary system table sections
Method includes：
Obtain board drilling precisionSpecification m × m of hole horizontal and vertical parity check code area size L1 × L2 and the Quick Response Code；It is described
L1 is length, L2 is width；
According to formulaCombination columns n is calculated；
According to formula x=[m/n], isodisperse x is obtained；
It is x parts that the binary system form of m × m specifications is combined the model split that columns is n according to every part.
Optionally, the binary system form by m × m specifications is by being integrally divided at least two binary system table sections
Method includes：
Obtain board drilling precisionSpecification m × m of hole horizontal and vertical parity check code area size L1 × L2 and the Quick Response Code；It is described
L1 is length, L2 is width；
According to formulaThe maximum n of combination columns n is calculatedmax；
According to formula xmin=[m/nmax], obtain the minimum value x of isodisperse xmin；
It is n that the binary system form of m × m specifications is combined columns according to every partmaxModel split be xminPart.
Optionally, the binary system form by m × m specifications is by being integrally divided at least two binary system table sections
Method further includes：It is n the binary system form of m × m specifications is combined columns according to every partmaxModel split be xminPart
When so that decile value backward summation is minimum.
Optionally, it is x parts the binary system form of m × m specifications is combined the model split that columns is n according to every part
Afterwards, if decile value has 1, given birth to when corresponding binary system form is partially converted to hole horizontal and vertical parity check code Local map using the alignment of corresponding side
Pore-forming.
Optionally, during the m × m=18 × 18, by the binary system form of m × m specifications by being integrally divided into five
Binary system table section, the specification of each several part are respectively：18 × 4,18 × 4,18 × 4,18 × 4 and 18 × 2.
Optionally, the method bag that each binary system table section is respectively converted into corresponding hole horizontal and vertical parity check code Local map
It includes：
By the data conversion in each binary system table section into decimal data and divided by 2nSo that in form
1 is respectively less than per number, obtains the hole horizontal and vertical parity check code form of the specification of m × 1；
Hole horizontal and vertical parity check code figure is drawn according to the hole horizontal and vertical parity check code form of the specification of the m × 1.
Optionally, when m × m specifications are not more than predetermined threshold value, the conversion method is：
The Quick Response Code of m × m specifications is first converted to the point horizontal and vertical parity check code of m × m specifications, is reconverted into the two of m × m specifications
System form, m × m therein are less than preset value.
The binary system form of m × m specifications is converted to the decimal system form of the specification of m × 1.
The decimal system form of the specification of the m × 1 is converted to the hole horizontal and vertical parity check code figure of the specification of m × 1, horizontal and vertical parity check code figure in hole exists accordingly afterwards
Hole horizontal and vertical parity check code is formed on product.
Optionally, the decimal system form by the specification of m × 1 is converted to the method for the hole horizontal and vertical parity check code figure of the specification of m × 1 and includes：
By each data divided by 2 in the decimal system form of the specification of the m × 1mSo that every number in form is respectively less than
1, obtain the hole horizontal and vertical parity check code form of the specification of m × 1；
Hole horizontal and vertical parity check code figure is drawn according to the hole horizontal and vertical parity check code form of the specification of the m × 1.
Optionally, the Quick Response Code includes row row's formula Quick Response Code and matrix two-dimensional code.
Compared with prior art, the embodiment of the present invention has the advantages that：The embodiment of the present invention can turn Quick Response Code
The hole horizontal and vertical parity check code with less hole count is changed to, greatly reduces labor content, reduces processing cost, improves work efficiency.
Description of the drawings
It in order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is attached drawing needed in technology description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention, for those of ordinary skill in the art, without creative efforts, can be with
Other attached drawings are obtained according to these attached drawings.
Fig. 1 is QR Quick Response Codes illustration of the prior art；
Fig. 2 is DM Quick Response Codes illustration of the prior art；
Fig. 3 is the point horizontal and vertical parity check code that QR Quick Response Codes are converted to as shown in Figure 1；
Fig. 4 is the point horizontal and vertical parity check code that DM Quick Response Codes are converted to as shown in Figure 2；
Fig. 5 is 3 × 3 dot charts that 3 × 3 binary system forms are converted to as shown in Table 1；
Fig. 6 is 4 × 4 dot charts that 4 × 4 binary system forms are converted to as shown in Table 2；
Fig. 7 is that specification provided in an embodiment of the present invention is not more than the Quick Response Code of predetermined threshold value to the conversion method stream of hole horizontal and vertical parity check code
Cheng Tu；
Fig. 8 is the hole horizontal and vertical parity check code figure that 4 × 1 hole horizontal and vertical parity check code forms are drawn as shown in Table 4；
Fig. 9 is that specification provided in an embodiment of the present invention is more than the Quick Response Code of predetermined threshold value to the conversion method flow of hole horizontal and vertical parity check code
Figure；
Figure 10 is 18 × 18 Quick Response Code array of figure；
Figure 11 is the hole horizontal and vertical parity check code figure that 18 × 18 Quick Response Codes are converted to as shown in Figure 10；
Figure 12 is the hole horizontal and vertical parity check code obtained according to Figure 11 shown pores horizontal and vertical parity check code figures；
Figure 13 is 21 × 21 dot charts that the binary system form according to table 5 generates；
Figure 14 is the hole horizontal and vertical parity check code figure being converted to according to table 6；
Figure 15 is the hole horizontal and vertical parity check code obtained according to Figure 14 shown pores horizontal and vertical parity check code figures.
Specific embodiment
Goal of the invention, feature, advantage to enable the present invention is more apparent and understandable, below in conjunction with the present invention
Attached drawing in embodiment is clearly and completely described the technical solution in the embodiment of the present invention, it is clear that disclosed below
Embodiment be only part of the embodiment of the present invention, and not all embodiment.Based on the embodiments of the present invention, this field
All other embodiment that those of ordinary skill is obtained without making creative work, belongs to protection of the present invention
Scope.
Technical solution to further illustrate the present invention below with reference to the accompanying drawings and specific embodiments.
(1) planar bar code technology brief introduction
Quick Response Code is combined with computer, the information discriminating technology that three kinds of technologies of communication and photoelectric sensing grow up.It
It is by certain regularly arranged black and white geometric figure, black and white position in the graphic is corresponding " 1 " and " 0 " respectively, so as to form one
A binary-coded character sequence, the binary-coded character can represent the information such as number, character.It is different according to coding principle, Quick Response Code point
Row row's formula Quick Response Code and matrix two-dimensional code two types.
Row row's formula Quick Response Code, is combined into multirow by certain rule by one-dimension code and is formed.Due to row row's formula Quick Response Code with it is one-dimensional
The relation of code so that the two has points of resemblance on coding principle, but row row's formula Quick Response Code coding rule is different from one-dimension code, institute
It is also different with decoding algorithm.
Matrix two-dimensional barcode is to realize coding by distribution of the dark and light two kinds of colored pixels in a matrix
Effect, binary " 1 " is represented with dark pixels in coding, and binary " 0 " is represented with light pixel, final all pixels
A rectangular graph is formed, the position distribution of pixel illustrates the content that matrix two-dimensional code includes.Matrix two-dimensional code is commonly used
Code system has QR Code, Maxi Code, Data Matrix etc..In PCB industries, Quick Response Code is also used widely, wherein main
It will be using Data Matrix code systems.
(2) hole horizontal and vertical parity check code brief introduction
Different from matrix two-dimensional code by the way of two dark-and-light colour block composite marking information, hole horizontal and vertical parity check code is more by combining
Location information of a aperture in one piece of specified regional extent is come information that needs is marked to record.
(3) Quick Response Code storage information mechanism
Matrix two-dimensional code is a kind of graphical symbol automatic identification processing code system, usually with error correction.Wherein have
Representative matrix two-dimensional code is by QR codes, DM codes etc..
As shown in Figure 1, QR Code Quick Response Codes are square, black-and-white two color is generally.It is by coding region and functional graphic
Two parts are formed, and coding region is responsible for storing data encoding information, and functional graphic is solid for defining version information, format information etc.
The information for the formula that fixes, all functional graphic regions all surround to distinguish with coding region by white space.QR Code Quick Response Codes
Model 1 is the QRCode Quick Response Codes made earliest, and highest version is 14 (73X73 symbols), can at most handle 1167 digits
Word.QR Code Quick Response Codes model 2 is the improvement version of model 1, and highest version is 40 (177X177 symbols), can at most be handled
7089 bit digitals.It also can smoothly read data in the case where Quick Response Code deforms.When Quick Response Code be printed on curved surface or by
In reading angular when reasons cause Quick Response Code to deform, still can effectively it be read by being arranged on the alignment pattern inside Quick Response Code
It takes.
QR Code code signs have 1~40 version, represent 40 kinds of specifications respectively.Each version symbol is than previous version
Increase by 4 modules per side, i.e. the specification of version 1 is the module of 21 modules × 21, and version 2 is the module ... ... of 25 modules × 25, version
40 specifications are the module of 177 modules × 177.
As shown in Fig. 2, Data Matrix codes (abbreviation DM codes) are one of earliest Quick Response Codes, it is in current all bar codes
Smallest size of, the mark not suitable for small part is directly printed on product entity and is read out, and is widely used in industry string number
Management and product finally wait fields.
DM codes are two-dimensional matrix images, square data block (nominally square modules), search pattern side
(finder pattern L boundary) and switch mode side (alternating pattern module) is formed, with QR
Code is different, and DM codes do not possess 7*7 module positions detection figure and 3*3 modules correction pattern, smaller with respect to QR codes, easily mark
On small part.
Capacity：
(1) numerical data：3,116 characters；
(2) alphabet data:235 characters；
(3) octet data:1,556 characters；
(4) character data：It does not support.
DM codes have very strong error-correcting performance, only need the data for reading 20% that can be carried out to data in the case of end correct
Identification.It should be noted that when module number is more than 255, DM codes will be split, and code is split with switch mode side, high
Discrimination.
No matter Quick Response Code is encoded using which kind of code system, really it is desirable that the information that its inside is stored.Fig. 1 and figure
Although 2 appearance is different, the information finally read from this two Quick Response Codes is all same four words.For Fig. 1 and
Quick Response Code shown in Fig. 2 can convert thereof into a form Quick Response Code, respectively as shown in Figure 3 and Figure 4.
Compared with the Quick Response Code that original square is marked on product (such as pcb board, FPC plates), marked on product dotted
Code will be more efficiently and reliable.But the points of above-mentioned horizontal and vertical parity check code are still more, and this horizontal and vertical parity check code of processing is not optimal selection, is
This, the present embodiment will propose that a kind of form of hole horizontal and vertical parity check code is used for substituting the horizontal and vertical parity check code.
First, it is understood that point horizontal and vertical parity check code is how to store information, and point horizontal and vertical parity check code is encoded using binary number, is finally turned
Quick Response Code is melted into, principle is as described below.In general, the specification of Quick Response Code is all bigger, such as 16 × 16,18 × 18 these rule
Lattice are all common, but in order to illustrate principle, might as well be illustrated using 3 × 3,4 × 4 specification.
Can so it understand for the point horizontal and vertical parity check code of 3 × 3 specifications：As shown in table 1 below, table 1 is the table of 3 × 3 specifications
Lattice wherein storing some binary messages, can be handled its image conversion for these binary messages, wherein for " 1 ",
Dark dot may be employed to represent, for " 0 ", blank expression may be employed, thus, it is possible to table 1 is changed into a dot chart,
Its shape is as shown in Figure 5.
| 0 | 0 | 1 |
| 1 | 1 | 0 |
| 1 | 0 | 1 |
Table 1
As seen from Figure 6, the part that data are 1 in table 1, is represented using black dot, and data are 0 part, are used
Soft dot represents that the information of such table 1 has been converted to the image of Fig. 5, from number to image, although appearance is different,
The information that they are stored is the same.
Can so it understand for the point horizontal and vertical parity check code of 4 × 4 specifications：First, the binary system form of 4 × 4 specifications is taken at random,
It is as shown in table 2 below；For table 2, it can be still dark dot by " 1 ", be converted in the way of " 0 " is blank, can be obtained
To Fig. 6.
| 1 | 0 | 1 | 0 |
| 0 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | 0 | 0 |
Table 2
From above analysis, it can be seen that storing the form of binary message for each, a dot chart can be found
It corresponds to therewith.In addition, being known that binary system form specification is bigger according to the knowledge of combination, the information that it can be stored also is got over
It is more, but the points of corresponding dot chart are more.For QR Quick Response Codes, 21 × 21 specification is minimum gauge, it means that every
It is 177 × 177 that the dot chart of one minimum gauge, which has the Quick Response Code specification of 441 points and now edition 40, it means that one
Opening 177 × 177 Quick Response Code needs 31329 points, this is very inconvenient for commercial Application, therefore the present embodiment proposition is a set of
A horizontal and vertical parity check code is changed into hole horizontal and vertical parity check code, to greatly reduce hole count by coding rule.
(4) Quick Response Code turn hole horizontal and vertical parity check code coding rule
The present embodiment proposes the conversion method of a kind of Quick Response Code and hole horizontal and vertical parity check code, including：It is not more than default threshold for specification
The conversion method of the Quick Response Code of value and for specification be more than predetermined threshold value Quick Response Code conversion method.
(I) it is not more than the Quick Response Code of predetermined threshold value for specification, the conversion method with hole horizontal and vertical parity check code is as shown in Fig. 7, bag
It includes：
Step 101, the point horizontal and vertical parity check code that the Quick Response Code of m × m specifications is first converted to m × m specifications, are reconverted into m × m specifications
Binary system form, m × m therein are less than preset value.
Step 102, the decimal system form that the binary system form of m × m specifications is converted to the specification of m × 1.
Step 103, to each data divided by 2 in the decimal system form of the specification of m × 1mSo that every number in form is equal
Less than 1, the hole horizontal and vertical parity check code form of the specification of m × 1 is obtained.
Step 104 draws hole horizontal and vertical parity check code figure according to the hole horizontal and vertical parity check code form of the specification of m × 1.
Step 105 forms hole horizontal and vertical parity check code according to hole horizontal and vertical parity check code figure on product.
Specific conversion method will be illustrated by taking the Quick Response Code of 4 × 4 specifications as an example below：
For 4 × 4 Quick Response Codes, still by taking Fig. 6 as an example.For Fig. 6, can first be converted into shown in table 24 × 4 two into
Tabulation lattice, are reconverted into 4 × 1 decimal system form shown in table 3：
| 10 |
| 5 |
| 9 |
| 12 |
Table 3
In this way, 4 × 4 Quick Response Code is just converted to 4 × 1 decimal system form, in order to convert that information into needs
Achievable hole horizontal and vertical parity check code, continue to do following conversion：Each data divided by 2 in 4 × 1 forms4, thus obtain table 4, table 4
In every number be respectively less than 1.
Table 4
For this table 4, hole horizontal and vertical parity check code figure as shown in Figure 8 can be converted thereof into：By each data conversion into a position
In the ratio of a line, 4 row can be just converted into row point storage information, if columns increases, just can largely be promoted
Portray the efficiency of Quick Response Code.
(II) be more than the Quick Response Code of predetermined threshold value for specification, with the conversion method of hole horizontal and vertical parity check code as shown in figure 9, including：
Step 201, the point horizontal and vertical parity check code that the Quick Response Code of m × m specifications is converted to m × m specifications, are reconverted into m × m specifications
Binary system form.
Step 202, by the binary system form of m × m specifications by being integrally divided at least two binary system table sections, each
The specification of binary system table section is less than m × m specifications；
Each binary system table section is respectively converted into corresponding hole horizontal and vertical parity check code Local map by step 203, obtains at least two
Hole horizontal and vertical parity check code Local map.
Obtained all well horizontal and vertical parity check code Local map is merged into complete hole horizontal and vertical parity check code figure by step 204.
Step 205 forms hole horizontal and vertical parity check code according to hole horizontal and vertical parity check code figure on product.
In order to reduce the hole count of finally formed hole horizontal and vertical parity check code to the greatest extent, the binary system form of m × m specifications draws in step 202
Point method includes：
First, board drilling precision is obtainedHole horizontal and vertical parity check code area size L1 × L2 (L1 is length, and L2 is width) and
Quick Response Code specification m × m；Wherein, horizontal and vertical parity check code area size in hole is generally 5mm × 5mm or 4mm × 4mm；
Then, according to formulaBe calculated combination columns n can value；
Finally, according to formula x=[m/n], the isodisperse x of the binary system form division of m × m specifications is obtained.
In above-mentioned division methods, n might have multiple values so that isodisperse x may also have multiple values, that is, exist more
Kind division methods.However isodisperse x it is bigger, it is necessary to processing hole count it is more, thus, optimal isodisperse x=[m/nmax]。
In step 203, the method that each binary system table section is respectively converted into corresponding hole horizontal and vertical parity check code Local map is：
First by the data conversion in each binary system table section into decimal data and divided by 2nSo that it is every in form
Number is respectively less than 1, obtains the hole horizontal and vertical parity check code form of the specification of m × 1；
Hole horizontal and vertical parity check code figure is drawn further according to the hole horizontal and vertical parity check code form of the specification of m × 1.
It is illustrated exemplified by the Quick Response Code that common 18 × 18 specification of PCB industries and 21 × 21 specifications will be used below.
1. the Quick Response Code turn hole horizontal and vertical parity check code of 18 × 18 specifications
By taking 18 × 18 Quick Response Code array of figure shown in Fig. 10 as an example, before conversion it is clear that, 18 × 18 will turn
It is very high into 18 × 1 hole system of battle formations requirements.If the hole horizontal and vertical parity check code of 18 × 1 specifications is changed into, it is necessary to the machining accuracy of board device to hole
It should be less than or equal to, that is, 238nm, this level that can be reached considerably beyond current board actual processing.For this purpose, this
Embodiment will convert it, it may be considered that be divided into fraction as 18 × 4 or 18 × 5 by 18 × 18, then again will
Such fraction converts pore-forming horizontal and vertical parity check code Local map respectively.So the present embodiment uses following computational methods：
First, following parameter is obtained：
A, board drilling precision
B, hole horizontal and vertical parity check code area size L1 × L2；
C, Quick Response Code specification m × m is 18 × 18.
For drilling precision, computational methods can be：A column data, minimum measurement unit are converted into for n column datas
e*It is：
So the drilling precision of board should meet：
In this way, when given board drilling precision, according to two-dimension code area width L2, can n be obtained by formula 2max, last root
According to nmaxObtain preferred plan.Calculating process is as follows：
Assuming that given board precisionL1 × L2=4mm × 4mm.Since n is integer, anti-solution is more difficult,
N can be from small to large updated to formula 2, the maximum of the condition of satisfaction is taken, n can be obtainedmax=4, it then can be by Quick Response Code
Data are divided into x=[18/4]=5 equal portions.And isodisperse x is bigger, it is necessary to which the hole count of processing will accordingly increase, for example if divide
Into 6 parts, then need to increase by 18 holes, therefore, meeting the constraints that required precision is as small as possible, hole count is as few as possible
Under, preferred plan can be obtained, i.e., is 18 × 4,18 × 4,18 × 4,18 × 4,18 × 2 by 18 × 18 points.
So, it is converted to handle and the hole horizontal and vertical parity check code figure shown in Figure 11 is obtained after merging, remove the line in the horizontal and vertical parity check code figure of hole
Item modification can obtain hole horizontal and vertical parity check code to the end, and as shown in figure 12, which amounts to 93 holes, including 90 digit punch, 3 positioning
Hole；And former two-dimensional code data amounts to 414 holes, it is evident that this will greatly reduce processing capacity.
2. the Quick Response Code turn hole horizontal and vertical parity check code of 21 × 21 specifications
First, a Quick Response Code is randomly generated, the binary form of corresponding 21 × 21 specification is as shown in table 5 below.
| 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 1 |
| 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 |
| 0 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 |
| 1 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 |
| 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 |
| 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
| 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 |
| 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 |
| 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
Table 5
Then the dot chart of 21 × 21 specifications as shown in fig. 13 that is generated by the table 5, if for the specification dot chart
The hole horizontal and vertical parity check code figure for converting thereof into 21 × 1 specifications is unpractical, therefore this example is also according to the calculating side of 18 × 18 specifications
Method is calculated, and process is as follows：
Assuming that board drilling precisionThat is 15.625um, L2=5mm, then formula 2 can be substituted into step by step
N is calculatedmax=5.Therefore, the Quick Response Code to 21 × 21 is at least needed 21 column datas being divided into [21/5]=5 part, then may be used
The Quick Response Code of 21 × 21 specifications is divided into following sections：
(1) 21 × 5,21 × 5,21 × 5,21 × 5,21 × 1；
Alternatively, (2) 21 × 5,21 × 4,21 × 4,21 × 4,21 × 4；
Alternatively, (3) 21 × 5,21 × 5,21 × 4,21 × 4,21 × 3；
Etc..
It is obvious that 21 × 5,21 × 4 and 21 × 3 processing request precision is successively decreased successively.In practical operation, need to protect first
Card is reduced as far as the number in processing hole on the premise of board drilling precision is met, and secondly need to as far as possible reduce with high-precision
The hole count of requirement is spent, can wherein preferred plan be determined according to the judgment principle of decile value backward summation minimum at this time.It is above-mentioned
In three kinds of splitting schemes, permutation number may be employed in the hole count distribution situation of wherein required precision, and (every two number compares in sequence, two numbers
1) etc. sequence numbers, which do not add, is assessed, the sequences backward such as above scheme (5,5,5,5,1), (5,4,4,4,4), (5,5,4,4,3)
Number is respectively 4,4,8, but 21 × 5 numbers are more than (2) scheme, thus the scheme in above-mentioned three kinds of splitting schemes in (1) scheme
(2) it is preferred plan.
For the data of 21 × 1 this one row of conversion, it can erect to arrange using left side and make a call to 5 holes and represent the data.According to
The two-dimensional code data of 21 × 21 specifications can be converted into the following table 6 by above-mentioned rule：
| 0 | 6 | 13 | 23 | 11 |
| 21 | 1 | 11 | 31 | |
| 11 | 1 | 16 | 20 | |
| 1 | 6 | 23 | 1 | |
| 10 | 10 | 4 | 24 | 23 |
| 1 | 15 | 13 | 1 | |
| 29 | 15 | 31 | 24 | |
| 14 | 6 | 30 | 25 | |
| 12 | 18 | 6 | 29 | |
| 11 | 2 | 24 | 4 | |
| 1 | 9 | 22 | 12 | 19 |
| 14 | 16 | 27 | 24 | |
| 10 | 12 | 20 | 18 | |
| 18 | 25 | 2 | 5 | 11 |
| 0 | 0 | 19 | 29 | |
| 2 | 8 | 9 | 17 | |
| 31 | 0 | 3 | 26 | |
| 21 | 4 | 17 | 20 | |
| 19 | 7 | 3 | 14 | 8 |
| 26 | 3 | 13 | 14 | |
| 18 | 15 | 4 | 6 |
Table 6
According to 6 data of table divided by 25, hole horizontal and vertical parity check code figure as shown in figure 14 can be finally converted thereof into.It, can after removing lines
To obtain final hole horizontal and vertical parity check code, as shown in figure 15.
Compared with 441 holes of 21 × 21 specification X-Y schemes, which only needs 113 holes, wherein 110 digit punch,
3 location holes, substantially increase production efficiency.
To sum up, it is necessary to following information before conversion：Board drilling precision(L1 is hole horizontal and vertical parity check code area size L1 × L2
Length, L2 are width) and Quick Response Code specification m × m；
Then combination columns n is calculated according to formula 2, calculates isodisperse x using columns n is combined, finally obtain satisfaction
The multiple combinations of conditions above；Wherein optimal case should be such：To ensure that processing hole count is minimum, this requires isodisperses
X is equal to [m/nmx]；On the basis of processing hole count is minimum, to ensure that the hole count of high-precision requirement is as few as possible, this requires that
Decile value (such as 5,5,1,1) backward summation is minimum.In addition, if decile value has 1, punched using left side alignment, can so subtracted
Few row hole.
The above, the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although with reference to before
Embodiment is stated the present invention is described in detail, it will be understood by those of ordinary skill in the art that：It still can be to preceding
The technical solution recorded in each embodiment is stated to modify or carry out equivalent substitution to which part technical characteristic；And these
Modification is replaced, and the essence of appropriate technical solution is not made to depart from the spirit and scope of various embodiments of the present invention technical solution.
Claims (10)
1. the conversion method of a kind of Quick Response Code and hole horizontal and vertical parity check code, the specification of the Quick Response Code is m × m, which is characterized in that in the m
When × m specifications are more than predetermined threshold value, the conversion method is：
The Quick Response Code of m × m specifications is converted to the point horizontal and vertical parity check code of m × m specifications, is reconverted into the binary form of m × m specifications
Lattice；
By the binary system form of m × m specifications by being integrally divided at least two binary system table sections；
Each binary system table section is respectively converted into corresponding hole horizontal and vertical parity check code Local map；
Obtained all well horizontal and vertical parity check code Local map is merged into complete hole horizontal and vertical parity check code figure；
Hole horizontal and vertical parity check code is formed on product according to the hole horizontal and vertical parity check code figure.
2. the conversion method of Quick Response Code according to claim 1 and hole horizontal and vertical parity check code, which is characterized in that described by m × m specifications
Binary system form is included by the method for being integrally divided at least two binary system table sections：
Obtain board drilling precisionSpecification m × m of hole horizontal and vertical parity check code area size L1 × L2 and the Quick Response Code；The L1 is
Length, L2 are width；
According to formulaCombination columns n is calculated；
According to formula x=[m/n], isodisperse x is obtained；
It is x parts that the binary system form of m × m specifications is combined the model split that columns is n according to every part.
3. the conversion method of Quick Response Code according to claim 1 and hole horizontal and vertical parity check code, which is characterized in that described by m × m specifications
Binary system form is included by the method for being integrally divided at least two binary system table sections：
Obtain board drilling precisionSpecification m × m of hole horizontal and vertical parity check code area size L1 × L2 and the Quick Response Code；The L1 is
Length, L2 are width；
According to formulaThe maximum n of combination columns n is calculatedmax；
According to formula xmin=[m/nmax], obtain the minimum value x of isodisperse xmin；
It is n that the binary system form of m × m specifications is combined columns according to every partmaxModel split be xminPart.
4. the conversion method of Quick Response Code according to claim 3 and hole horizontal and vertical parity check code, which is characterized in that described by m × m specifications
Binary system form is further included by the method for being integrally divided at least two binary system table sections：By the two of m × m specifications
System form is n according to every part of combination columnsmaxModel split be xminDuring part so that decile value backward summation is minimum.
5. the conversion method of Quick Response Code according to claim 2 and hole horizontal and vertical parity check code, which is characterized in that by m × m specifications
Binary system form be x parts according to the model split that every part of combination columns is n after, if decile value has 1, by corresponding binary system
When table section is converted to hole horizontal and vertical parity check code Local map hole is generated using the alignment of corresponding side.
6. the conversion method of Quick Response Code according to claim 3 and hole horizontal and vertical parity check code, which is characterized in that m × m=18 × 18
When, by the binary system form of m × m specifications by being integrally divided into five binary system table sections, the specification difference of each several part
For：18 × 4,18 × 4,18 × 4,18 × 4 and 18 × 2.
7. the conversion method of Quick Response Code according to claim 2 and hole horizontal and vertical parity check code, which is characterized in that described by each binary system
The method that table section is respectively converted into corresponding hole horizontal and vertical parity check code Local map includes：
By the data conversion in each binary system table section into decimal data and divided by 2nSo that it is each in form
Number is respectively less than 1, obtains the hole horizontal and vertical parity check code form of the specification of m × 1；
Hole horizontal and vertical parity check code figure is drawn according to the hole horizontal and vertical parity check code form of the specification of the m × 1.
8. the conversion method of Quick Response Code according to claim 1 and hole horizontal and vertical parity check code, which is characterized in that in m × m specifications not
During more than predetermined threshold value, the conversion method is：
The Quick Response Code of m × m specifications is first converted to the point horizontal and vertical parity check code of m × m specifications, is reconverted into the binary form of m × m specifications
Lattice, m × m therein are less than preset value；
The binary system form of m × m specifications is converted to the decimal system form of the specification of m × 1；
The decimal system form of the specification of the m × 1 is converted to the hole horizontal and vertical parity check code figure of the specification of m × 1, afterwards accordingly hole horizontal and vertical parity check code figure in product
Upper formation hole horizontal and vertical parity check code.
9. the conversion method of Quick Response Code according to claim 8 and hole horizontal and vertical parity check code, which is characterized in that described by the specification of m × 1
The method that decimal system form is converted to the hole horizontal and vertical parity check code figure of the specification of m × 1 includes：
By each data divided by 2 in the decimal system form of the specification of the m × 1mSo that every number in form is respectively less than 1, obtains
To the hole horizontal and vertical parity check code form of the specification of m × 1；
Hole horizontal and vertical parity check code figure is drawn according to the hole horizontal and vertical parity check code form of the specification of the m × 1.
10. the conversion method of Quick Response Code according to claim 1 and hole horizontal and vertical parity check code, which is characterized in that the Quick Response Code includes
Row row's formula Quick Response Code and matrix two-dimensional code.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711328465.XA CN108073966B (en) | 2017-12-13 | 2017-12-13 | Conversion method of two-dimensional code and hole array code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711328465.XA CN108073966B (en) | 2017-12-13 | 2017-12-13 | Conversion method of two-dimensional code and hole array code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108073966A true CN108073966A (en) | 2018-05-25 |
| CN108073966B CN108073966B (en) | 2020-11-10 |
Family
ID=62158343
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711328465.XA Active CN108073966B (en) | 2017-12-13 | 2017-12-13 | Conversion method of two-dimensional code and hole array code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108073966B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108764407A (en) * | 2018-05-30 | 2018-11-06 | 深圳市恩兴实业有限公司 | Product traceability method, apparatus, system and computer storage media |
| CN109933033A (en) * | 2019-04-23 | 2019-06-25 | 深圳镭霆激光科技有限公司 | The process for pressing section retroactive method of PCB whole process retrospect |
| CN111598199A (en) * | 2020-05-26 | 2020-08-28 | 成都鹏业软件股份有限公司 | Two-dimensional code generation method |
| CN112024178A (en) * | 2020-08-20 | 2020-12-04 | 中国联合工程有限公司 | Workpiece identification system and method for spraying production line based on two-dimensional code |
| CN112454493A (en) * | 2020-10-16 | 2021-03-09 | 广州裕申电子科技有限公司 | Circuit board identification system, method and storage medium |
| CN113370669A (en) * | 2021-05-08 | 2021-09-10 | 广州裕申电子科技有限公司 | Circuit board tracing method and system |
| CN115392277A (en) * | 2022-08-30 | 2022-11-25 | 武汉至简天成科技有限公司 | Coding information reading method and visual code reading equipment |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020137059A1 (en) * | 2001-01-26 | 2002-09-26 | Lei Wu | Microdevice containing photorecognizable coding patterns and methods of using and producing the same thereof |
| JP2003346105A (en) * | 2002-04-29 | 2003-12-05 | Shenzhen Syscan Technology Co Ltd | Two-dimensional bar code and method for recording the same |
| CN103020689A (en) * | 2013-01-16 | 2013-04-03 | 重庆大学 | Method for recognizing hole-shaped codes of articles on basis of geometric figures |
| CN103413160A (en) * | 2013-08-30 | 2013-11-27 | 北京慧眼智行科技有限公司 | Method, device and system for encoding and decoding |
| CN104636784A (en) * | 2015-02-28 | 2015-05-20 | 立德高科(北京)数码科技有限责任公司 | Two-dimensional code, and generation method and identification method thereof |
| CN105279539A (en) * | 2014-06-07 | 2016-01-27 | 王树敏 | Dot-matrix two-dimensional code coding and decoding |
| CN105894067A (en) * | 2016-02-06 | 2016-08-24 | 深圳市天朗时代科技有限公司 | Dot matrix two-dimensional code coding and reading method |
| CN106022425A (en) * | 2016-05-15 | 2016-10-12 | 上海思岭信息科技有限公司 | Layered-structure 2D code encoding and decoding method |
| CN106851990A (en) * | 2017-03-27 | 2017-06-13 | 雪龙数控设备(深圳)有限公司 | For the drilling control method and drilling control system of wiring board |
-
2017
- 2017-12-13 CN CN201711328465.XA patent/CN108073966B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020137059A1 (en) * | 2001-01-26 | 2002-09-26 | Lei Wu | Microdevice containing photorecognizable coding patterns and methods of using and producing the same thereof |
| JP2003346105A (en) * | 2002-04-29 | 2003-12-05 | Shenzhen Syscan Technology Co Ltd | Two-dimensional bar code and method for recording the same |
| CN103020689A (en) * | 2013-01-16 | 2013-04-03 | 重庆大学 | Method for recognizing hole-shaped codes of articles on basis of geometric figures |
| CN103413160A (en) * | 2013-08-30 | 2013-11-27 | 北京慧眼智行科技有限公司 | Method, device and system for encoding and decoding |
| CN105279539A (en) * | 2014-06-07 | 2016-01-27 | 王树敏 | Dot-matrix two-dimensional code coding and decoding |
| CN104636784A (en) * | 2015-02-28 | 2015-05-20 | 立德高科(北京)数码科技有限责任公司 | Two-dimensional code, and generation method and identification method thereof |
| CN105894067A (en) * | 2016-02-06 | 2016-08-24 | 深圳市天朗时代科技有限公司 | Dot matrix two-dimensional code coding and reading method |
| CN106022425A (en) * | 2016-05-15 | 2016-10-12 | 上海思岭信息科技有限公司 | Layered-structure 2D code encoding and decoding method |
| CN106851990A (en) * | 2017-03-27 | 2017-06-13 | 雪龙数控设备(深圳)有限公司 | For the drilling control method and drilling control system of wiring board |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108764407A (en) * | 2018-05-30 | 2018-11-06 | 深圳市恩兴实业有限公司 | Product traceability method, apparatus, system and computer storage media |
| CN109933033A (en) * | 2019-04-23 | 2019-06-25 | 深圳镭霆激光科技有限公司 | The process for pressing section retroactive method of PCB whole process retrospect |
| CN109933033B (en) * | 2019-04-23 | 2022-04-19 | 深圳镭霆激光科技有限公司 | PCB whole-process tracing laminating process segment tracing method |
| CN111598199A (en) * | 2020-05-26 | 2020-08-28 | 成都鹏业软件股份有限公司 | Two-dimensional code generation method |
| CN112024178A (en) * | 2020-08-20 | 2020-12-04 | 中国联合工程有限公司 | Workpiece identification system and method for spraying production line based on two-dimensional code |
| CN112454493A (en) * | 2020-10-16 | 2021-03-09 | 广州裕申电子科技有限公司 | Circuit board identification system, method and storage medium |
| CN112454493B (en) * | 2020-10-16 | 2022-06-03 | 广州裕申电子科技有限公司 | Circuit board identification system, method and storage medium |
| CN113370669A (en) * | 2021-05-08 | 2021-09-10 | 广州裕申电子科技有限公司 | Circuit board tracing method and system |
| CN115392277A (en) * | 2022-08-30 | 2022-11-25 | 武汉至简天成科技有限公司 | Coding information reading method and visual code reading equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108073966B (en) | 2020-11-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108073966A (en) | A kind of conversion method of Quick Response Code and hole horizontal and vertical parity check code | |
| CN109059922B (en) | Mobile robot positioning method, device and system | |
| EP2393035B1 (en) | QR barcode decoding chip and decoding method thereof | |
| KR100414524B1 (en) | Two-dimensional Code having superior decoding property which is possible to control the level of error correcting codes, and method for encoding and decoding the same | |
| CN100369059C (en) | Matrix type two-dimensional bar code and its encoding and decoding method | |
| EP2393037B1 (en) | Data matrix decoding chip and decoding method thereof | |
| EP2921998B1 (en) | Two-dimensional code, system for creation of two-dimensional code, and analysis program | |
| EP2849115B1 (en) | Method for decoding matrix-type two-dimensional code | |
| CN107992917A (en) | A kind of quality retroactive method of efficient multi-layer PCB | |
| EP2393038A1 (en) | Matrix-type two-dimensional barcode decoding chip and decoding method thereof | |
| CN1953362A (en) | A method and installation to embed pattern in two-dimensional bar code | |
| KR101821087B1 (en) | Two-dimensional code, and two-dimensional-code analysis system | |
| CN107247985B (en) | Coding, positioning and identifying method of two-dimensional code | |
| IL150832A (en) | Method for data matrix print quality verification | |
| CN111046996B (en) | Color QR code generation and identification method | |
| CN104346640A (en) | Two dimensional code and method of creating same | |
| EP3561729B1 (en) | Method for detecting and recognising long-range high-density visual markers | |
| JP6006315B2 (en) | Machine reading of printed data | |
| US20120024967A1 (en) | Qr code and manufacturing method thereof | |
| CN105279539A (en) | Dot-matrix two-dimensional code coding and decoding | |
| CN107992918A (en) | A kind of efficient product whole process quality retroactive method | |
| CN111241860A (en) | Positioning and decoding method for arbitrary material annular code | |
| CN100356399C (en) | Two-dimensional barcode card and its decoding method | |
| JP4460903B2 (en) | ID mark recognition method for semiconductor wafer | |
| CN114021596A (en) | Bar code identification method and device based on deep learning |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |