CN106682716A - Two-dimensional code coding method adopting layered structure and decoding method thereof - Google Patents
Two-dimensional code coding method adopting layered structure and decoding method thereof Download PDFInfo
- Publication number
- CN106682716A CN106682716A CN201611092884.3A CN201611092884A CN106682716A CN 106682716 A CN106682716 A CN 106682716A CN 201611092884 A CN201611092884 A CN 201611092884A CN 106682716 A CN106682716 A CN 106682716A
- Authority
- CN
- China
- Prior art keywords
- code
- stream
- binary
- information
- code word
- 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
- G06K19/06131—Constructional details the marking comprising a target pattern, e.g. for indicating the center of the bar code or for helping a bar code reader to properly orient the scanner or to retrieve the bar code inside of an image
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention discloses a decoding method of a novel layered-structure two-dimensional code. For a novel layered two-dimensional code picture, a soft decoding method is used to preferentially decode primary information and then decode secondary information. The method possesses an advantage that reduction accuracy is high and is adapt to a current rapid development demand. In the invention, through scanning the layered two-dimensional code picture, gray-scale quantification image processing is used to carry out standardization on the two-dimensional code picture which may generate distortion so as to acquire a standard two-dimensional code matrix; soft-decision demodulation is performed on the generated standard two-dimensional code matrix so as to acquire a soft information bit stream; and the soft information bit stream is input into a matrix de-interleaver decoder and a Turbo code decoder to carry out error correcting, decoding and reduction so as to acquire a source data information flow, and decoding is completed and reduction accuracy of decoding is increased.
Description
Technical field
The present invention relates to position Quick Response Code field, specifically, a kind of Quick Response Code of employing hierarchy is related specifically to
Coded method and interpretation method.
Background technology
Two-dimensional bar code/Quick Response Code (2-dimensional bar code) is specifically put in order according to certain with certain
Rule longitudinal direction horizontal in the plane on arrange chequered with black and white graphic recording data symbol information.Using computer-internal logic
" 0 ", " 1 " the bit stream concept on basis, dark images correspondence " 1 " bit, light pattern correspondence " 0 " bit.With respect to bar code,
Quick Response Code can not only simultaneously also can be not single in longitudinal expressing information, and with certain verifying function in horizontal expressing information
Single simply article being identified and can be that article is described, and without needing to rely on as bar code majority occasion
Data base, can individually be applied.Read-Solomon (Reed-Solomon) algorithm that existing two-dimensional bar code is used, Reed-
Solomon algorithms are to obtain picket code and correction because Quick Response Code is stained generation based on system of linear equations is solved in galois field
Mistake, computational complexity is high.
Two-dimensional bar code is applied in a large number industrial part aspect, and often an industrial part needs long-time to use,
Therefore when the two-dimensional bar code when laser discharge printing on parts leads to not identification because of contamination wear, can be because cannot in time more
Change part and cause economic loss.Therefore designing the higher Quick Response Code of a kind of easily identification, fouling resistance ability is used for industry
It is trend of the times on parts.
The content of the invention
Present invention aims to deficiency of the prior art, there is provided a kind of Quick Response Code coding of employing hierarchy
Method, it to have carry out SDI stream needs the main information of priority encoding and insignificant secondary unpack to compile
Code forms two-dimension code image, and the Quick Response Code None- identified being stained on a large scale can be avoided to go out the situation of main information, improves two
The reliability of dimension code picture.
Technical problem solved by the invention can employ the following technical solutions to realize：
A kind of two-dimentional code encoding method of employing hierarchy, comprises the steps：
S1, primary and secondary is carried out to SDI stream and wants information classification, obtains new SDI stream, and to sorted new
SDI stream selects corresponding coding rule；
S2, source data code word is obtained by new SDI stream according to coding rule, and to source data code word binary system is carried out
Source data binary bit stream is converted to, source data binary bit stream is encoded by Turbo encoder, obtains numeric data code
Word；
S3, the code word data in above-mentioned steps S2 is input in matrix interleaver and is interleaved, and by the number after intertexture
Read according to code word, obtain final code word；
S4, final code word is grouped, and according to encoding of graphs rule Quick Response Code is changed into.
Carrying out primary and secondary to SDI stream in step S1 wants the method for information classification as follows：
Main, secondary information is carried out to the information entrained by SDI stream to classify, and preecedence requirement is compiled out
Flow of information as main information, using other information as secondary information, and according to main information is pressed front, secondary information is rear
Put in order and obtain new SDI stream.
Step S1 also needs whether the length for judging main SDI stream meets 3 multiple input, its concrete side
Method is as follows：
The main SDI stream length that classification is obtained is judged, if the main SDI stream of input is
Character string ABC, then need not be in character string ABC NUL added behind；If the main SDI stream of input is character A,
Two NUL NUL added behind in character A is then needed, new main SDI stream ANULNUL is obtained；If the master of input
Want SDI stream to be character AB, then need NUL NUL added behind in character AB, obtain new main source data
Flow of information ABNUL；
The new SDI stream is as follows according to the method that coding rule obtains source data code word：
New SDI stream is converted into into binary code by ASCII character table, binary code passes through encoder for convolution codes
The number of binary code is calculated, two that the number of binary code is accommodated with preset data region in ECC200 forms rule enter
Code number processed compares.
The concrete grammar of step S2 is as follows：
1) the new SDI stream in step S2 is generated by inquiry ASCII character table (0,255) in the range of
Binary code word, generates new source data binary stream X of the length for KK；
2) with residual matrix (13,15) Turbo encoder binary code word is encoded, (13,15)
Turbo encoder is calculated the source data binary code word being input into, and formula is as follows：
g1(D)=1+D+D3
g0(D)=1+D2+D3
3 tails can be added below according to feedback arrangement in sub-encoders containing recursive systematic convolutional code (RSC) encoder
Than special envoy coder state zero.
By the source data binary stream X that length is KKIt is directly entered encoder 1 to be encoded, is fed back by shift register
Obtain tail bit and perform depositor clearing, tail bit is filled after the coding of source data binary stream, finally obtained by encoder 1
The verification stream Z for obtainingK, verification stream ZKIt is as follows：
{Z0,Z1,...,ZK-1,XK,ZK,XK+1,ZK+1,XK+2,ZK+2}
By the source data binary stream X that length is KKThe binary stream X' that length is K is obtained after internal intertextureK.Will
Binary stream X'KInto encoder 2 and fill obtain after tail bit verification stream Z'K, verification stream Z'KIt is as follows：
{Z'0,Z′1...,Z'K-1,X'K,Z'K,X'K+1,Z'K+1,X'K+2,Z'K+2}
By two groups of verifications stream Z obtained aboveK Z'KBe input to residual matrix check bit is carried out it is punctured, after punctured
Two groups of check bit streams and source data binary stream XKWith reference to obtaining code word data.
Final code word is grouped in step S4, and the concrete grammar for changing into Quick Response Code according to encoding of graphs rule is such as
Under：
Figure conversion is first carried out by the main information final code word that obtains of coding, in converted good figure from a left side to
The final code word of secondary information is carried out figure conversion by right, order from top to bottom, obtains Quick Response Code, and its concrete grammar is as follows：
By the final code word being converted to by main SDI stream putting in order per three packets according to output,
First carry out figure conversion；The final code word being converted to by secondary source data message stream according to output each two one that puts in order
Packet, double " L " type identification regions of addition obtain full two-dimensional code picture.
A kind of interpretation method of employing hierarchy Quick Response Code, comprises the steps：
A1. obtained with the scanning device scanning Quick Response Code for being capable of identify that Quick Response Code and generate standard two-dimensional code matrix；
A2. Quick Response Code matrix will be generated SDI stream is obtained by decoder for decoding.
The concrete grammar of step a1 is as follows：
Quick Response Code is scanned using high-precision scanning device, image in 2 D code is gathered by specific image procossing and is obtained
Obtain standard two-dimensional code matrix.
The concrete grammar of step a2 is as follows：
A, the standard two-dimensional code matrix to generating obtain binary system Soft Inform ation bit stream by demodulator demodulation；
B, the binary system Soft Inform ation bit stream for obtaining demodulation are deinterleaved into matrix deinterleaving decoder and obtain one
The new binary system Soft Inform ation bit stream of group；
C, new binary system Soft Inform ation bit is flowed into into Turbo decoders, enter row decoding through Turbo decoders and entangle
Mistake, obtains source data binary bit stream；
D, source data binary bit stream is parsed into SDI stream using decoding rule.
Compared with prior art, beneficial effects of the present invention are as follows：
The present invention due to two-dimension code image be the two-dimension code image that formed by main information be main body, and it is carried out point
Layer, the two-dimension code image that secondary information is formed is added in order in the body, two-dimensional code picture after layering.In Quick Response Code
After generation, even if in the case of there occurs and being stained on a large scale, scanning device is still capable of identify that and reads and obtains main information
SDI stream.Improve the recognizability of two-dimension code image.
Description of the drawings
Fig. 1 is the coded method schematic flow sheet of employing hierarchy Quick Response Code of the present invention.
Fig. 2 is the interpretation method schematic flow sheet of employing hierarchy Quick Response Code of the present invention.
Fig. 3 is the structural representation of encoder of the present invention.
Fig. 4 is the schematic diagram of binary image of the present invention.
Fig. 5 is the schematic diagram of binary image matrix of the present invention.
Specific embodiment
Technological means, creation characteristic, reached purpose and effect to make present invention realization is easy to understand, with reference to
Specific embodiment, is expanded on further the present invention.
Referring to Fig. 1 and Fig. 2, a kind of coded method of Novel layered structure Quick Response Code of the present invention, including following step
Suddenly：
S1, carries out primary and secondary and wants information classification to SDI stream.Judge whether main SDI stream length meets 3
Multiple input；
Judge whether main SDI stream length meets 3 multiple input and be specially：The main source that classification is obtained
Data message stream length is judged that the main SDI stream of such as input is character string ABC, then need not be in character string
ABC NULs added behind, need to carry out following step S2；The main SDI stream of input is character A, then need in word
Symbol A two NULs NUL added behind, obtain new main SDI stream ANULNUL, need to carry out following step S2；
The main SDI stream of input is character AB, then need NUL NUL added behind in character AB, obtains new master
SDI stream ABNUL is wanted, needs to carry out following step S2；
S2, selects corresponding ECC200 forms and judges that secondary source data message stream is according to main SDI stream
It is no completely to fill；
Select correspondence ECC200 forms rule and judge whether secondary source data message stream can completely fill specially：First
Binary code is changed to sorted main SDI circulation into, calculating binary code obtains two and enters by encoder for convolution codes
The number of code processed, according to main SDI stream corresponding ECC200 specifications size is selected；Again to sorted secondary source
Data message stream is converted into binary system, calculates the number that binary code obtains binary code by encoder for convolution codes, calculating side
With main SDI stream, (13,15) Turbo encoder contains 6 depositors to method, therefore needs to compile after end-of-encode
Code device state is clear " 0 ", can obtain one group of 12 binary code word stream, this group of binary code is classified as into secondary source data message stream and is obtained
The binary code word stream for arriving.When selecting correspondence ECC200 specification sizes, secondary source data message stream cannot fill full graphics
When, it is without the need for supplementing binary stream that filling graph is complete；Secondary source data message stream is because length is long, figure is too little cannot be complete
During receiving, the binary stream of redundancy is removed；
For example using residual matrix, code rate be 1/2 (13,15) Turbo encoder, be input into two main source numbers
According to seven secondary source data message streams of flow of information, first two main SDI streams are added and is newly led after a NUL
SDI stream is wanted, new main SDI circulation changes eight-digit binary number code into, obtains 24 binary code word streams,
Each binary code by code rate be 1/2 (13,15) Turbo encoder obtain the number of binary code, i.e., each two
Ary codes export two binary codes by encoder for convolution codes, 24 × 2=48 binary code are always obtained, according to selection
ECC200 data areas are 8 × 8 form, according to the square that the encoding of graphs method each row and column of table two are 2 × 2, therefore are somebody's turn to do
Form can accommodate main SDI stream for 4 × 4 × 3=48 binary code, i.e., main SDI stream satisfaction
ECC200 forms rule；Seven secondary source data message streams are carried out to be calculated 112 binary codes, because code rate is
1/2 (13, by 15) Turbo encoder only needs to 6 binary codes of addition " 0 " clear to Turbo encoder, therefore obtain institute
118 binary codes for needing, according to table four, each main SDI stream possesses four color lumps, and each color lump can carry 2
Individual secondary SDI binary code, therefore 8 binary codes can be accommodated, need data area to be 8 according to being calculated
× 8 form could accommodate all secondary source data message streams, i.e. secondary source data message stream and meet ECC200 forms rule nothing
Unnecessary binary code word stream need to be deleted, needs to carry out following step S3；
S3, it is source data two that source data code word is obtained and carry out Binary Conversion SDI stream according to coding rule
System bit stream, by (13,15) Turbo encoder encoded, obtain code word data；
The SDI stream obtains source data code word and is specially according to coding rule：Source data letter after will be sorted
Breath stream generate through inquiry ASCII character table (0,255) in the range of source data code word, have different for different data types
Coding mode, in order to the efficiency for improving specific type of data can mix other coding modes such as C40 patterns, Text patterns, X12
Pattern, EDIFACT patterns, Base256 patterns are compressed code length, are entered according to requirement and the ASCII character of different coding mode
Row switching character；
The source data code word carry out Binary Conversion be specially obtain one group of binary stream for there was only 0 and 1 generation it is long
Spend the source data binary bit stream for K；
It is described (13,15) Turbo encoder encoded specially：(13,15) source data of the Turbo encoder to input
Binary code word is calculated, and formula is as follows：
g1(D)=1+D+D3
g0(D)=1+D2+D3
Can be added after input streams of code words according to feedback arrangement in sub-encoders containing recursive systematic convolutional code (RSC) encoder
Plus 3 tails are zeroed than special envoy coder state.Coder structure is as shown in Figure 3.
By the source data binary stream X that length is KKIt is directly entered encoder 1 to be encoded, is fed back by shift register
Obtain tail bit and perform depositor clearing, tail bit is filled after the coding of source data binary stream, finally obtained by encoder 1
The verification stream Z for obtainingK, verification stream ZKIt is as follows：
{Z0,Z1,...,ZK-1,XK,ZK,XK+1,ZK+1,XK+2,ZK+2}
By the source data binary stream X that length is KKThe binary stream X' that length is K is obtained after internal intertextureK.By two
System stream X'KInto encoder 2 and fill obtain after tail bit verification stream Z'K, verification stream Z'KIt is as follows：
{Z'0,Z′1...,Z'K-1,X'K,Z'K,X'K+1,Z'K+1,X'K+2,Z'K+2}
By two groups of verifications stream Z obtained aboveK Z'KBe input to residual matrix check bit is carried out it is punctured, after punctured
Two groups of check bit streams and source data binary stream XKWith reference to obtaining code word data.
S3, the code word data in above-mentioned S2 is input in matrix interleaver and is interleaved, and by the numeric data code after intertexture
Word reads, and obtains final code word, and its matrix interleaver carries out block interleaved to code word data first, columns C is preset as into 30, so
The code word number of code word data is set afterwards as U, smallest positive integral R for meeting inequality U≤RC is found out, line number R is obtained, and determines line number R
Afterwards, matrix A is obtained, next line by line code word data is write in matrix A, if code word data cannot enter R row writes completely, used
By R rows, other vacant locations are filled up for 0 or the 1 of data binary bit stream, matrix A is carried out into matrixing and obtains new matrix B,
As matrix A enters line translation according to table one, most at last new matrix B reads by column data, and will not exist before in code word data
The 0 of data binary bit stream or 1 removes, and obtains final code word；
S4, by the final code word being converted to by main SDI stream putting in order per three point according to output
Group, first carries out figure conversion；Final code word the putting in order per two according to output being converted to by secondary source data message stream
An individual packet, double " L " type identification regions of addition obtain full two-dimensional code picture.
As shown in Fig. 2, Fig. 3, Fig. 4, Fig. 5, Tables 1 and 2, a kind of interpretation method of Novel layered structure Quick Response Code, including
Following steps：
S1, is scanned with the scanning device for being capable of identify that New Two Dimensional code to Quick Response Code, obtains the two-dimension code image for gathering；
The scanning device of the New Two Dimensional code is a kind of higher scanning device of accuracy of identification, and secondary information can be obtained
Layering two-dimension code image is identified；When scanner recognition precision is not high, still main information can be identified, will not
Quick Response Code is caused to fail because None- identified goes out secondary information；
S2, the two-dimension code image to gathering carries out gray processing, and to the image of gray processing binaryzation is carried out；
The two-dimension code image of described pair of collection carries out gray processing and uses weighted mean method, by spirit of the human eye to different colours
Sensitivity is weighted to RGB three-components and averagely obtain more rational gray level image；The image to gray processing carries out binaryzation,
Realize that image binaryzation soft bit is exported；
S3, is positioned, correction process obtains standardization Quick Response Code matrix to the image of binaryzation；
The image to binaryzation is positioned, correction process is that the Quick Response Code in image is accurately positioned, and is sought
Look for " L " shape to position figure, obtain the apex coordinate of " L " type and the length on both sides, and figure is rotated and cutting, to obtaining
Two-dimension code image be mapped to standardization Quick Response Code matrix；
S4, the standardization Quick Response Code matrix to obtaining obtains Soft Inform ation ratio by demodulator with soft decision method demodulation
Spy's stream；
S5, the Soft Inform ation Soft Inform ation bit stream that demodulation is obtained being input in matrix deinterleaver, after being deinterleaved
Bit stream；
The Soft Inform ation bit stream that demodulation is obtained is input in matrix deinterleaver, the Soft Inform ation bit after being deinterleaved
Stream is specially：The Soft Inform ation bit stream of acquisition is deinterleaved into deinterleaving decoder and obtains one group of streams of code words, its solution is handed over
It is to construct an interleaving matrix to knit decoder specific algorithm, wherein regulation interleaving matrix columns C is 30, according to receiving
Code word, if code word number be U', find out smallest positive integral R' met in inequality U'≤CR', obtain line number R', determine line number
After R', matrix D is obtained, the code word for receiving is written column-wise as in matrix D, if input code word cannot be complete by the write of line number R',
Then with 0 or the 1 of data binary bit stream, by line number R', other vacant locations are filled up, then by matrix D through matrixing, such as
Matrix D enters line translation according to table three, so as to obtain new matrix E, next line by line reads matrix E, and will there is no number before
Remove according to the data binary bit stream 0 or 1 in code word, Soft Inform ation bit stream after being deinterleaved；
S6, is input in Turbo decoders to the Soft Inform ation bit stream after deinterleaving and enters row decoding, obtains SDI
Stream；
Soft Inform ation bit stream after described pair of intertexture is input in Turbo decoders and enters row decoding, obtains SDI
Stream is specially：Soft Inform ation bit stream after deinterleaving is input to the serially concatenated being made up of two soft-output codings (SISO)
Turbo code decoder DEC1 and DEC2, decoder DEC1 carries out optimal decoding to component code RSC1, and generation is entered with regard to source data two
System stream XKIn each bit likelihood ratio information, and give DEC2, decoder through intertexture by " external information " therein
This information as prior information, optimal decoding is carried out to component code RSC2, after generation intertexture in source data binary stream by DEC2
The likelihood ratio information of each bit, then gives DEC1 by " external information " therein after deinterleaving, is solved next time
Code.After successive ignition, the external information of DEC1 or DEC2 tends towards stability, and likelihood ratio asymptotic value is approached to whole code
Maximal possibility estimation is decoded, and carries out hard decision to this likelihood ratio and optimum evaluation sequence is obtained.
| Sort between intertexture prostatitis | {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29} |
| Sort between intertexture rank rear | {0,20,10,5,15,25,3,13,23,8,18,28,1,11,21,6,16,26,4,14,24,19,9,29,12,2,7,22,27,17} |
Table 1
| Deinterleave and sorted between prostatitis | {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29} |
| Deinterleave and sorted between rank rear | {0,12,25,6,18,3,15,26,9,22,2,13,24,7,19,4,16,29,10,21,1,14,27,8,20,5,17,28,11,23} |
Table 2
The ultimate principle and principal character and advantages of the present invention of the present invention has been shown and described above.The technology of the industry
Personnel it should be appreciated that the present invention is not restricted to the described embodiments, the simply explanation described in above-described embodiment and description this
The principle of invention, without departing from the spirit and scope of the present invention, the present invention also has various changes and modifications, these changes
Change and improvement is both fallen within scope of the claimed invention.The claimed scope of the invention by appending claims and its
Equivalent thereof.
Claims (10)
1. a kind of two-dimentional code encoding method of employing hierarchy, it is characterised in that comprise the steps：
S1, primary and secondary is carried out to SDI stream and wants information classification, obtains new SDI stream, and to sorted new source number
Corresponding coding rule is selected according to flow of information；
S2, source data code word is obtained by new SDI stream according to coding rule, and to source data code word Binary Conversion is carried out
For source data binary bit stream, source data binary bit stream is encoded by Turbo encoder, obtains code word data；
S3, the code word data in above-mentioned steps S2 is input in matrix interleaver and is interleaved, and by the numeric data code after intertexture
Word reads, and obtains final code word；
S4, final code word is grouped, and according to encoding of graphs rule Quick Response Code is changed into.
2. the two-dimentional code encoding method of employing hierarchy according to claim 1, it is characterised in that in step S1
Primary and secondary is carried out to SDI stream wants the method for information classification as follows：
Carry out main, secondary information to the information entrained by SDI stream to classify, the letter that preecedence requirement is compiled out
Breath stream as main information, using other information as secondary information, and according to pressing main information front, the posterior row of secondary information
Row order obtains new SDI stream.
3. the two-dimentional code encoding method of employing hierarchy according to claim 2, it is characterised in that step S1 is also
Whether the length that main SDI stream need to be judged meets 3 multiple input, and its concrete grammar is as follows：
The main SDI stream length that classification is obtained is judged, if the main SDI stream of input is character string
ABC, then need not be in character string ABC NUL added behind；If the main SDI stream of input is character A, need
In character A two NULs NUL added behind, new main SDI stream ANULNUL is obtained；If the main source number of input
It is character AB according to flow of information, then needs NUL NUL added behind in character AB, obtains new main SDI
Stream ABNUL.
4. the two-dimentional code encoding method of employing hierarchy according to claim 1, it is characterised in that the new source data
Flow of information is as follows according to the method that coding rule obtains source data code word：
New SDI stream is converted into into binary code by ASCII character table, binary code by (13,15) Turbo codings
Device is calculated the number of binary code, preset data region is accommodated in the number and ECC200 forms rule of binary code two
Ary codes number compares.
5. the two-dimentional code encoding method of employing hierarchy according to claim 1, it is characterised in that step S2
Concrete grammar is as follows：
1) the new SDI stream in step S2 is generated by inquiry ASCII character table (0,255) in the range of two enter
Code word processed；
2) with residual matrix (13,15) Turbo encoder binary code word is encoded, obtain code word data.
6. the two-dimentional code encoding method of employing hierarchy according to claim 1, it is characterised in that in step S4
Final code word is grouped, and the concrete grammar for changing into Quick Response Code according to encoding of graphs rule is as follows：
Figure conversion is first carried out by the main information final code word that obtains of coding, in converted good figure from left to right,
The final code word of secondary information is carried out figure conversion by order from top to bottom, obtains Quick Response Code.
7. the two-dimentional code encoding method of employing hierarchy according to claim 6, it is characterised in that its concrete grammar is such as
Under：
The final code word being converted to by main SDI stream is put in order per three packets according to what is exported, it is advanced
Row figure is changed；The final code word being converted to by secondary source data message stream according to output one point of each two that puts in order
Group, double " L " type identification regions of addition obtain full two-dimensional code picture.
8. a kind of interpretation method of employing hierarchy Quick Response Code, it is characterised in that comprise the steps：
A1. obtained with the scanning device scanning Quick Response Code for being capable of identify that Quick Response Code and generate standard two-dimensional code matrix；
A2. Quick Response Code matrix will be generated SDI stream is obtained by decoder for decoding.
9. the interpretation method of employing hierarchy Quick Response Code according to claim 8, it is characterised in that step a1
Concrete grammar is as follows：
Quick Response Code is scanned using high-precision scanning device, image in 2 D code is gathered by specific image procossing and is marked
Quasi- Quick Response Code matrix.
10. the interpretation method of employing hierarchy Quick Response Code according to claim 8, it is characterised in that step a2
Concrete grammar it is as follows：
A, the standard two-dimensional code matrix to generating obtain binary system Soft Inform ation bit stream by demodulator demodulation；
B, by the binary system Soft Inform ation bit stream that obtains of demodulation into matrix deinterleave decoder be deinterleaved obtain one group it is new
Binary system Soft Inform ation bit stream；
C, new binary system Soft Inform ation bit is flowed into into Turbo decoders, through Turbo decoders row decoding error correction is entered, obtained
Obtain source data binary bit stream；
D, source data binary bit stream is parsed into SDI stream using decoding rule.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611092884.3A CN106682716B (en) | 2016-12-02 | 2016-12-02 | Two-dimensional code encoding method and decoding method adopting hierarchical structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611092884.3A CN106682716B (en) | 2016-12-02 | 2016-12-02 | Two-dimensional code encoding method and decoding method adopting hierarchical structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106682716A true CN106682716A (en) | 2017-05-17 |
| CN106682716B CN106682716B (en) | 2020-04-24 |
Family
ID=58867465
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611092884.3A Active CN106682716B (en) | 2016-12-02 | 2016-12-02 | Two-dimensional code encoding method and decoding method adopting hierarchical structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106682716B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107424199A (en) * | 2017-08-07 | 2017-12-01 | 联通***集成有限公司河南省分公司 | It is a kind of to figure encryption correcting data error and detection method |
| CN115622661A (en) * | 2021-07-14 | 2023-01-17 | 大唐移动通信设备有限公司 | Signal transmission method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1845124A (en) * | 2006-05-16 | 2006-10-11 | 北京紫光捷通科技有限公司 | Color information superposition of QR code |
| CN1920858A (en) * | 2005-08-26 | 2007-02-28 | 毛山 | Two-dimensional bar code based information transfer method and encoding/decoding device |
| JP2008126607A (en) * | 2006-11-24 | 2008-06-05 | Taito Corp | Card having scratch layer printed with code data |
| CN103279731A (en) * | 2013-06-06 | 2013-09-04 | 格科微电子（上海）有限公司 | Two-dimension code anti-fake method and anti-fake verification method thereof |
| CN104281866A (en) * | 2013-07-09 | 2015-01-14 | 航天信息股份有限公司 | Two-dimensional code application method and device |
| CN106022425A (en) * | 2016-05-15 | 2016-10-12 | 上海思岭信息科技有限公司 | Layered-structure 2D code encoding and decoding method |
-
2016
- 2016-12-02 CN CN201611092884.3A patent/CN106682716B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1920858A (en) * | 2005-08-26 | 2007-02-28 | 毛山 | Two-dimensional bar code based information transfer method and encoding/decoding device |
| CN1845124A (en) * | 2006-05-16 | 2006-10-11 | 北京紫光捷通科技有限公司 | Color information superposition of QR code |
| JP2008126607A (en) * | 2006-11-24 | 2008-06-05 | Taito Corp | Card having scratch layer printed with code data |
| CN103279731A (en) * | 2013-06-06 | 2013-09-04 | 格科微电子（上海）有限公司 | Two-dimension code anti-fake method and anti-fake verification method thereof |
| CN104281866A (en) * | 2013-07-09 | 2015-01-14 | 航天信息股份有限公司 | Two-dimensional code application method and device |
| CN106022425A (en) * | 2016-05-15 | 2016-10-12 | 上海思岭信息科技有限公司 | Layered-structure 2D code encoding and decoding method |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107424199A (en) * | 2017-08-07 | 2017-12-01 | 联通***集成有限公司河南省分公司 | It is a kind of to figure encryption correcting data error and detection method |
| CN107424199B (en) * | 2017-08-07 | 2020-11-13 | 联通***集成有限公司河南省分公司 | Method for correcting and detecting graphic encrypted data |
| CN115622661A (en) * | 2021-07-14 | 2023-01-17 | 大唐移动通信设备有限公司 | Signal transmission method and device |
| WO2023284754A1 (en) * | 2021-07-14 | 2023-01-19 | 大唐移动通信设备有限公司 | Signal transmission method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106682716B (en) | 2020-04-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100362091B1 (en) | How to Convolutionally Encode Digital Data with Convolutional Codes and Their Convolutional Encoders | |
| CN104143109B (en) | A kind of coding and decoding methods and its printed article of Quick Response Code | |
| US6950977B2 (en) | Mechanism for turbo decoding when CRC for partial blocks is provided | |
| CN106685431B (en) | LDPC based on Nand Flash obtains Soft Inform ation interpretation method and coder | |
| KR100739910B1 (en) | Encoding device and decoding device | |
| CN106022425B (en) | A kind of coding and interpretation method of layered structure two dimensional code | |
| CN1761160A (en) | Decoding method and device | |
| CN1770639A (en) | Concatenated iterative and algebraic coding | |
| CN111046996B (en) | Color QR code generation and identification method | |
| CN1316829A (en) | Error correction coding type digital transmission method | |
| US7611067B2 (en) | Printed material with identification function, image generating apparatus, image processing apparatus, image generating method, image processing method, and program product therefor | |
| KR20050050048A (en) | Encoding device, encoding method, encoding method program, decoding device, decoding method, decoding method program | |
| CN106682716A (en) | Two-dimensional code coding method adopting layered structure and decoding method thereof | |
| CN100512020C (en) | Decoding method and decoding device | |
| CN106845593A (en) | A kind of rectangle fixes dot matrix information encoding-decoding method | |
| CN109525253B (en) | Convolutional code decoding method based on deep learning and integration method | |
| CN101371448B (en) | Fast encoding and decoding methods and related devices | |
| CN114861847B (en) | Dot matrix code construction method, dot matrix code generating and reading method, terminal and dot matrix code system | |
| JP2004511179A (en) | Piecewise deinterleaving | |
| CN112332869A (en) | Improved TPC iteration method and apparatus | |
| CN1183687C (en) | Hybrid interleaver for TURBO codes | |
| CN109450460A (en) | A kind of parameter identification method of RS code and the concatenated code of convolutional code | |
| CN115600627A (en) | Color two-dimensional code generation method | |
| CN112418374B (en) | Information code generation method | |
| CN1182657C (en) | Method used to reduce storage content needed and complexity by product code decode |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20191225 Address after: 310013 room 409, floor 4, building 1, No. 252, Wantang Road, Hangzhou City, Zhejiang Province Applicant after: Hangzhou Rong Qi Science and Technology Ltd. Address before: 201203, room 560, 208, midsummer Road, Shanghai, Pudong New Area Applicant before: SHANGHAI SLIONTEK CO., LTD. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |