Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Two-dimensional code parallel generation method based on chaotic mapping

A technology of chaotic mapping and two-dimensional code, which is applied in parallel chaotic mapping and two-dimensional code generation. The parallel generation of two-dimensional code based on chaotic mapping can solve problems such as customers not being able to log in in time.

Active Publication Date: 2019-06-07
HARBIN UNIV OF SCI & TECH
View PDF6 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The server uses a single processor and single thread to generate the QR code. During the generation of the QR code, the login verification time limited by the platform has expired, and a new login is required, resulting in the customer being unable to log in to the platform in time.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Two-dimensional code parallel generation method based on chaotic mapping
  • Two-dimensional code parallel generation method based on chaotic mapping

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0069] Example 1: The server generates chaotic random bit sequences in parallel.

[0070] S1. The server main process generates a complete data codeword bit sequence Str_0 including the information source according to the selected version and error correction level of the QR two-dimensional code, and the length of the bit sequence is length:

[0071] Set the complete data codeword as Str_0="0011 0001 0011 0001 0011 0001 0011 1001 00110010", and the length is length=40;

[0072] S2. The main process of the server divides the bit sequence Str_0 into two bit sequences Str_1 and Str_2, and the length of each bit sequence is length / 2:

[0073] Str_1 = "0011 0001 0011 0001 0011";

[0074] Str_2 = "0001 0011 1001 0011 0010";

[0075] S3. The server main process assigns two threads thread_1 and thread_2 to generate chaotic random bit sequences in parallel:

[0076] S3.1. The thread thread_1 uses the Logistic chaotic map to interfere with the bit sequence Str_1, thereby generating a...

example 2

[0085] Example 2: The server fills the QR code two-dimensional matrix in parallel.

[0086] Set the selected QR code version and error correction level to 7-Q.

[0087] S1. The main process of the server constructs a square matrix A of order n according to the version and error correction level of the QR code, and its initial value is set to 0. For the QR code of the 7-Q version, A is a square matrix of order 45;

[0088] S2. The server main process allocates 7 threads to execute the following tasks in parallel, such as figure 2 Shown:

[0089] Thread thread_1 fills the position detection area, that is, the position detection graphic area of ​​matrix A is set to 1 according to the QR code format:

[0090] A[0][0...6]=A[2][2...4, 6]= A[3][3, 4, 6]=A[4][4, 6]=1;

[0091] A[0][n-7 ... n-1]= A[1][n-7, n-1]=A[2][n-7, n-5 ... n-3, n-1]= A[3][n-7, n-5 ... n-3, n-1] = A[4][n-7, n-5 ... n-3, n-1] = A[5][n -7...n-1]=A[6][n-7...n-1]=1;

[0092] The operation only fills the upper r...

example 3

[0107] Example 3: The client interacts with the server through the MPI function, and the server saves the generated QR code in the QR code dynamic buffer.

[0108] Let the ID of the main process of the server be 0, the ID of the client process be 1, the information source of the client be "10243798374135624", and the allocation amount of the server QR code buffer be N.

[0109] The client gets the QR code from the server:

[0110] S1. The client uses the MPI_send (0, 1) function to send a request to obtain the QR code to the server;

[0111] S2. The client uses the MPI_send(0, "10243798374135624") function to send the information source to the server;

[0112] S3. The client uses MPI_Recv (0, 1, qr_buffer, & status) to obtain the two-dimensional code sent by the server. The operation is a blocking operation. If the server has no available two-dimensional code, the client will always wait;

[0113] S4. The client end acquires the QR code of the server.

[0114] The server ge...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a two-dimensional code parallel generation method based on chaotic mapping. A client and a server interact through an MPI (Message Transfer Interface) function. The method comprises: the client sending a QR code request to the server through the MPI function and transmits the information source to the server through the MPI function; the server accepting a client request andreceives the information source; data code words containing information sources are interfered through two threads of a processor core and Logistic chaotic mapping and piecewise linear chaotic mapping, so that chaotic random bit sequences are generated in parallel; obtaining a QR code, then filling different regions of the QR code in parallel through a plurality of threads of a processor core, dividing the regions into a left region and a right region when filling a data and error correction code region, filling the left region and the right region in parallel, finally storing the assembled QR code in a dynamic buffer region, and sending the QR code to a client through an MPI function.

Description

technical field [0001] The invention relates to a parallel chaotic map and a two-dimensional code generation method, in particular to a chaotic map-based two-dimensional code parallel generation method, which belongs to the field of parallel computing. Background technique [0002] A two-dimensional code, also known as a two-dimensional barcode, uses a black and white pattern distributed on a two-dimensional plane according to certain rules to record data symbol information. In terms of coding, the two-dimensional code uses the "0" and "1" bits inside the computer, and uses several geometric figures corresponding to binary to represent the text and numerical information, which is automatically read by image input equipment or photoelectric scanning equipment to achieve Automatic Processing of Information. Two-dimensional code symbols can be represented by various code systems, and QR (Quick Response) code is a common two-dimensional code representation method and is widely ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06K19/06G06N7/08
Inventor 刘嘉辉朱宝森宋大华罗智勇
Owner HARBIN UNIV OF SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com