Data transmission encoding method, device, computer equipment and storage medium

Abstract

The embodiment of the present invention discloses a data transmission encoding method, device, computer equipment and storage medium. The method includes: classifying data into types to obtain data of different code length types; encoding and decoding the data of the longest code length type by using an identification code combined with a full code; encoding and decoding the data of the code length type other than the longest code length data by using an identification code combined with encoding and a code table lookup method. By implementing the method of the embodiment of the present invention, it is possible to greatly reduce the table lookup, ensure performance, and decode real-time data.

Description

Technical Field

[0001] The present invention relates to a data processing method, and more specifically to a data transmission encoding method, device, computer equipment and storage medium. Background Art

[0002] With the increase in the speed of ATE (Automatic Test Equipment) test systems, the pressure of inter-chip data transmission is increasing, and a real-time and efficient transmission encoding method is needed.

[0003] The existing data transmission encoding method uses Huffman coding, where data with high probability of occurrence is represented by short codes, and data with low probability of occurrence is represented by long codes. The amount of data after encoding is the smallest and is closest to information entropy. However, this method requires traversing all data in advance to calculate the probability, while in ATE, data is generated in real time; and the generated binary tree is complex and irregular, requiring a large number of table lookups and multiple times during encoding and decoding, resulting in large resource consumption and poor performance.

[0004] Therefore, it is necessary to design a new method to solve the problems existing in the prior art. Summary of the invention

[0005] The purpose of the present invention is to overcome the defects of the prior art and provide a data transmission encoding method, device, computer equipment and storage medium.

[0006] To achieve the above object, the present invention adopts the following technical solution: a data transmission encoding method, comprising:

[0007] Divide the data into different types to obtain data of different code lengths;

[0008] For data with the longest code length, the identification code is combined with the full code for encoding and decoding;

[0009] For data with code length types other than the longest code length data, the identification code is combined with encoding and code table lookup to perform encoding and decoding.

[0010] A further technical solution is: the data is divided into types to obtain data of different code length types, including:

[0011] An identification code is added to the header of the data, and the data is divided into a plurality of code length types to obtain data of different code length types.

[0012] A further technical solution is: adding an identification code to the header of the data and dividing the data into multiple code length types to obtain data of different code length types, including:

[0013] An identification code of more than 1 bit is added to the header of the data, and the data is divided into multiple code length types to obtain data of different code length types.

[0014] A further technical solution is: the data with the longest code length is encoded and decoded by combining the identification code with the full code, including:

[0015] The data with the longest code length is encoded by using the identification code plus the full code, and the full code is filtered out from the data with the longest code length to form a decoding result.

[0016] A further technical solution is: the encoding and decoding of the data with code length types other than the longest code length data is performed by using an identification code combined with encoding and a code table lookup method, including:

[0017] The data whose code length type is other than the longest code length data is encoded by the encoding method, and the data whose code length type is other than the longest code length data is decoded by the code table lookup method.

[0018] Its further technical solution is: the encoding method includes:

[0019] Data with a high probability of occurrence are represented by short codes, and data with a low probability of occurrence are represented by long codes.

[0020] The present invention also provides a data transmission encoding device, comprising:

[0021] A division unit, used for dividing the data into types to obtain data of different code length types;

[0022] A first encoding and decoding unit is used to encode and decode data with a code length type of the longest code length by using an identification code combined with a full code;

[0023] The second encoding and decoding unit is used to encode and decode the data whose code length type is other than the longest code length data by using the identification code combined with encoding and code table lookup.

[0024] A further technical solution is: the division unit is used to add an identification code to the header of the data and divide it into multiple code length types to obtain data of different code length types.

[0025] The present invention further provides a computer device, which includes a memory and a processor. The memory stores a computer program, and the processor implements the above method when executing the computer program.

[0026] The present invention also provides a storage medium, wherein the storage medium stores a computer program, and the computer program implements the above method when executed by a processor.

[0027] The beneficial effects of the present invention compared with the prior art are as follows: the present invention divides data into different code length types first, and the data with the longest code length is encoded and decoded by using an identification code combined with a full code to reduce table lookup, and the data with code length types other than the longest code length data is encoded and decoded by using an identification code combined with encoding and a code table lookup, thereby greatly reducing table lookups, ensuring performance, and being able to decode real-time data.

[0028] The present invention is further described below in conjunction with the accompanying drawings and specific embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without paying any creative work.

[0030] Figure 1 A schematic diagram of a data transmission encoding method according to an embodiment of the present invention;

[0031] Figure 2 A schematic diagram of the encoding result provided in the first embodiment of the present invention;

[0032] Figure 3 A schematic diagram of the encoding result provided in the second embodiment of the present invention;

[0033] Figure 4 A schematic diagram of the encoding result provided in the third embodiment of the present invention;

[0034] Figure 5 A schematic diagram of a code table provided in Embodiment 3 of the present invention;

[0035] Figure 6 A schematic block diagram of a data transmission encoding device provided by an embodiment of the present invention;

[0036] Figure 7 A schematic block diagram of a computer device provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0037] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0038] It should be understood that when used in this specification and the appended claims, the terms "include" and "comprises" indicate the presence of described features, integers, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or combinations thereof.

[0039] It should also be understood that the terms used in this specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. As used in the specification of the present invention and the appended claims, unless the context clearly indicates otherwise, the singular forms "a", "an" and "the" are intended to include plural forms.

[0040] It should be further understood that the term "and / or" used in the present description and the appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes these combinations.

[0041] See also Figure 1 , Figure 1 A schematic flow chart of a data transmission encoding method provided by an embodiment of the present invention. The data transmission encoding method is applied to a server, greatly reducing table lookups, ensuring performance, and being able to decode real-time data.

[0042] Figure 1 FIG. 1 is a flow chart of a data transmission encoding method provided by an embodiment of the present invention. Figure 1 As shown, the method includes the following steps S110 to S130.

[0043] S110, classify the data into types to obtain data of different code length types.

[0044] In this embodiment, data of different code length types refers to data with different coding lengths.

[0045] In this embodiment, an identification code is added to the header of the data, and the data is divided into a plurality of code length types to obtain data of different code length types.

[0046] Specifically, an identification code of more than 1 bit is added to the header of the data, and the data is divided into multiple code length types to obtain data of different code length types.

[0047] S120, encoding and decoding the data whose code length type is the longest code length by using the identification code combined with the full code.

[0048] In this embodiment, the data whose code length type is the longest code length is encoded by using the identification code plus the full code, and the full code is filtered out from the data whose code length type is the longest code length to form a decoding result.

[0049] S130, encoding and decoding the data whose code length type is other than the longest code length data by using the identification code combined with encoding and code table lookup.

[0050] In this embodiment, the data whose code length type is other than the longest code length data is encoded by the encoding method, and the data whose code length type is other than the longest code length data is decoded by the code table lookup method.

[0051] Specifically, data with a high probability of occurrence is represented by a short code, and data with a low probability of occurrence is represented by a long code.

[0052] For encoding, the principle is that numbers with high probability of occurrence are represented by short codes, and numbers with low probability of occurrence are represented by long codes, and a fixed binary tree, that is, a fixed encoding structure, is used. When the code length is the maximum code length, the data is encoded using an identification code + full code method. When decoding, the identification code is directly eliminated, and the remaining is the full code, which greatly reduces the table lookup.

[0053] During the entire data encoding and decoding transmission process, the code is divided into multiple code length types by adding a fixed-length or variable-length identification code of more than 1 bit to the header; each code length segment has more than one encoding space, which is used to place the identification code. The data with the longest code length is encoded and decoded in the method of identification code + full code. The data with other code lengths is encoded and decoded in the method of identification code + code lookup table.

[0054] In this embodiment, the bit width of the encoded data fragment is uncertain, for example, some are 4 bits, some are 10 bits, so how does the receiving end confirm the boundary after receiving it? It is necessary to add an identification header after encoding, which is the identification code. Figure 2 The encoding format pre-sets the numbers with the highest probability to be A0 and A1. These two numbers use the encoding method of the row with serial number 0, and define the encoding of A0 = 00 and the encoding of A1 = 01. The first 0 is the identification code; the four numbers with the second highest probability are (B0, B1, B2, B3), which use the encoding method of the row with serial number 1 and define their own encodings. The first two bits are 10, which is the identification code; the eight numbers with the second highest probability are C0-C7, which use the encoding method of the row with serial number 2 and define their own encodings. The first three bits are 110, which is the identification code; the remaining numbers all use the encoding method of the row with serial number 3. The above numbers with high probability are preset empirical data, not real-time calculations during operation. The above information is known consistently at the encoding and decoding end. The predefined encoding above is the required code table. It can be seen that only 2+4+8=14 elements are needed, which takes up little space and has a fast search speed.

[0055] Coding process: There is a data stream S that needs to be encoded and sent out. Take out 8bit-8bit of the S data stream, and each 8bit is a data. Encode each data. Assuming data = A0, the code table can be immediately obtained as 00; assuming data = B3, the code table can be immediately obtained as 10xx; assuming data = D9, the code table is not found, then use rule 4, directly use the identification code 111 + data as the code; send the code in sequence, which is actually encoding and sending.

[0056] Decoding process: Receive the data stream S'; first take out the first 3 bits, if = 0xx, it means it is the code of rule 1, the code length is 2 bits, which is 0x, go to the code table to query, and find that it is A0, then the decoded data is A0; if it is 10x, it means it is the code of rule 2, the code length is 4, which is 10xx, and the decoded data can be obtained by looking up the table; if it is 111, it means it is rule 4, and directly take out the following 8 bits as data; according to the code length obtained in the previous step, remove the used bits and repeat the previous step; the decoding process can only be serial, because only after solving the previous number can you know the starting position of the next number. The first few bits of each number are the position of the identification code, which can identify which rule is used, and then know the code length and data.

[0057] For example: the original data is a0-a7; the length of the encoded data segment is not necessarily 8 bits. It can be any bit length. The encoded data found in the code table is b0-bn. (n is determined by the encoding space); the encoded data is c0-c7; the part before b0 is the identification code, encoded as Figure 2 As shown. It is divided into 4 code length types, which are identified by identification codes 0, 10, 110, and 111. The code lengths are 2, 4, 6, and 11 respectively; in the type with a code length of 2, the identification code occupies one bit, the code b0 occupies one bit, and the coding space is 2. The two numbers with the highest probability of appearing are encoded in this way. The same applies to other code lengths. The type with a code length of 11 directly carries the original data, so there is no need to construct a code table for this largest coding space.

[0058] See also Figure 3 This example mainly illustrates that the encoding may not exist, such as the type with a code length of 1, in which case the encoding space is 1; if there is only one number in the data feature with a huge probability of appearing, in order to maximize the encoding compression efficiency, its code length can be designed to be 1.

[0059] For example, in an ATE system, the Fail data after channel comparison needs to be transmitted through the inter-chip high-speed interface. A typical feature of Fail data is that it is 0 most of the time, and then there may be clusters of 1s and 0s that change randomly, or there may be long 1s. Its simple and efficient encoding is as follows: Figure 4As shown, the code table of its short code (code length is 2) is as follows Figure 5 shown.

[0060] The segment length of the original data is 16 bits. If it is shorter, the compression efficiency of the code will be reduced, and if it is longer, the probability of compressibility will be reduced and the system delay will be increased.

[0061] When encoding: When the original data is all 0, encode b0 = 0, use the short code (code length 2) = 00. When the original data is all 1, encode b0 = 1, use the short code (code length 2) = 01. When the original data is other values, the short code does not exist in the code table, and the long code is used, which is 1 + the original number.

[0062] When decoding: When the number starts with 0, the code length is 2, 2 bits are taken, the second bit is b0, and the code table is searched to get the original data. When the number starts with 1, the code length is 17, 17 bits are taken, and the last 16 bits are the original data.

[0063] The above-mentioned data transmission encoding method divides the data into different code length types first. The data with the longest code length is encoded and decoded by combining the identification code with the full code to reduce table lookup. The data with code length types other than the longest code length data is encoded and decoded by combining the identification code with the encoding and the code table lookup, which greatly reduces the table lookup, ensures performance, and can decode real-time data.

[0064] Figure 6 is a schematic block diagram of a data transmission encoding device 300 provided in an embodiment of the present invention. Figure 6 As shown, corresponding to the above data transmission encoding method, the present invention also provides a data transmission encoding device 300. The data transmission encoding device 300 includes a unit for executing the above data transmission encoding method, and the device can be configured in a server. Figure 6 The data transmission encoding device 300 includes a dividing unit 301, a first encoding and decoding unit 302 and a second encoding and decoding unit 303.

[0065] The division unit 301 is used to divide the data into types to obtain data of different code length types; the first encoding and decoding unit 302 is used to encode and decode the data with the longest code length type by using the identification code combined with the full code; the second encoding and decoding unit 303 is used to encode and decode the data with the code length type other than the longest code length data by using the identification code combined with the encoding and the code table lookup method.

[0066] In one embodiment, the division unit 301 is used to add an identification code to the header of the data and divide it into multiple code length types to obtain data of different code length types.

[0067] In one embodiment, the division unit 301 is used to add an identification code of more than 1 bit to the header of the data and divide it into multiple code length types to obtain data of different code length types.

[0068] In one embodiment, the first encoding and decoding unit 302 is used to encode the data with the longest code length type by using the identification code plus the full code method, and filter out the full code from the data with the longest code length type to form a decoding result.

[0069] In one embodiment, the second encoding and decoding unit 303 is used to encode data with a code length type other than the longest code length data using an encoding method, and decode data with a code length type other than the longest code length data using a code table lookup method.

[0070] It should be noted that technicians in the relevant field can clearly understand that the specific implementation process of the above-mentioned data transmission encoding device 300 and each unit can refer to the corresponding description in the aforementioned method embodiment, and for the convenience and conciseness of the description, it will not be repeated here.

[0071] The data transmission encoding device 300 can be implemented in the form of a computer program. Figure 7 Runs on the computer device shown.

[0072] See also Figure 7 , Figure 7 5 is a schematic block diagram of a computer device provided in an embodiment of the present application. The computer device 500 may be a server, wherein the server may be an independent server or a server cluster composed of multiple servers.

[0073] See also Figure 7 The computer device 500 includes a processor 502 , a memory and a network interface 505 connected via a system bus 501 , wherein the memory may include a non-volatile storage medium 503 and an internal memory 504 .

[0074] The non-volatile storage medium 503 can store an operating system 5031 and a computer program 5032. The computer program 5032 includes program instructions, and when the program instructions are executed, the processor 502 can execute a data transmission encoding method.

[0075] The processor 502 is used to provide computing and control capabilities to support the operation of the entire computer device 500 .

[0076] The internal memory 504 provides an environment for the operation of the computer program 5032 in the non-volatile storage medium 503. When the computer program 5032 is executed by the processor 502, the processor 502 can execute a data transmission encoding method.

[0077] The network interface 505 is used to communicate with other devices over the network. Figure 7 The structure shown in the figure is merely a block diagram of a portion of the structure related to the solution of the present application, and does not constitute a limitation on the computer device 500 to which the solution of the present application is applied. The specific computer device 500 may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0078] The processor 502 is used to run the computer program 5032 stored in the memory to implement the following steps:

[0079] Data are classified into types to obtain data of different code length types; the data with the longest code length type is encoded and decoded by combining identification code with full code; the data with code length types other than the longest code length data is encoded and decoded by combining identification code with encoding and code table lookup.

[0080] In one embodiment, when the processor 502 implements the step of classifying the data into different types to obtain data of different code length types, the processor 502 specifically implements the following steps:

[0081] An identification code is added to the header of the data, and the data is divided into a plurality of code length types to obtain data of different code length types.

[0082] In one embodiment, when the processor 502 implements the step of adding an identification code to the header of the data and dividing the data into multiple code length types to obtain data of different code length types, the processor 502 specifically implements the following steps:

[0083] An identification code of more than 1 bit is added to the header of the data, and the data is divided into multiple code length types to obtain data of different code length types.

[0084] In one embodiment, when the processor 502 implements the step of encoding and decoding the data with the longest code length using the identification code combined with the full code, the processor 502 specifically implements the following steps:

[0085] The data with the longest code length is encoded by using the identification code plus the full code, and the full code is filtered out from the data with the longest code length to form a decoding result.

[0086] In one embodiment, when the processor 502 implements the step of encoding and decoding the data whose code length type is other than the longest code length data by using the identification code combined with the encoding and the code table lookup method, the processor 502 specifically implements the following steps:

[0087] The data whose code length type is other than the longest code length data is encoded by the encoding method, and the data whose code length type is other than the longest code length data is decoded by the code table lookup method.

[0088] The encoding method includes: using a short code to represent data with a high probability of occurrence, and using a long code to represent data with a low probability of occurrence.

[0089] It should be understood that in the embodiment of the present application, the processor 502 may be a central processing unit (CPU), and the processor 502 may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0090] It can be understood by those skilled in the art that all or part of the processes in the method for implementing the above embodiment can be completed by instructing the relevant hardware through a computer program. The computer program includes program instructions, and the computer program can be stored in a storage medium, which is a computer-readable storage medium. The program instructions are executed by at least one processor in the computer system to implement the process steps of the embodiment of the above method.

[0091] Therefore, the present invention also provides a storage medium. The storage medium may be a computer-readable storage medium. The storage medium stores a computer program, wherein when the computer program is executed by a processor, the processor executes the following steps:

[0092] Data are classified into types to obtain data of different code length types; the data with the longest code length type is encoded and decoded by combining identification code with full code; the data with code length types other than the longest code length data is encoded and decoded by combining identification code with encoding and code table lookup.

[0093] In one embodiment, when the processor executes the computer program to implement the step of classifying the data into types to obtain data of different code length types, the processor specifically implements the following steps:

[0094] An identification code is added to the header of the data, and the data is divided into a plurality of code length types to obtain data of different code length types.

[0095] In one embodiment, when the processor executes the computer program to implement the step of adding an identification code to the header of the data and dividing the data into multiple code length types to obtain data of different code length types, the processor specifically implements the following steps:

[0096] An identification code of more than 1 bit is added to the header of the data, and the data is divided into multiple code length types to obtain data of different code length types.

[0097] In one embodiment, when the processor executes the computer program to implement the step of encoding and decoding the data with the longest code length using the identification code combined with the full code, the processor specifically implements the following steps:

[0098] The data with the longest code length is encoded by using the identification code plus the full code, and the full code is filtered out from the data with the longest code length to form a decoding result.

[0099] In one embodiment, when the processor executes the computer program to implement the step of encoding and decoding the data whose code length type is other than the longest code length data by using the identification code combined with encoding and code table lookup, the processor specifically implements the following steps:

[0100] The data whose code length type is other than the longest code length data is encoded by the encoding method, and the data whose code length type is other than the longest code length data is decoded by the code table lookup method.

[0101] The encoding method includes: using a short code to represent data with a high probability of occurrence, and using a long code to represent data with a low probability of occurrence.

[0102] The storage medium may be a USB flash drive, a mobile hard disk, a read-only memory (ROM), a magnetic disk, or an optical disk, etc., which are computer-readable storage media that can store program codes.

[0103] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in terms of function in the above description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

[0104] In the several embodiments provided by the present invention, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of each unit is only a logical function division, and there may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed.

[0105] The steps in the method of the embodiment of the present invention can be adjusted in order, combined and deleted according to actual needs. The units in the device of the embodiment of the present invention can be combined, divided and deleted according to actual needs. In addition, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0106] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a storage medium. Based on this understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, terminal, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention.

[0107] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed by the present invention, and these modifications or replacements should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be based on the protection scope of the claims.

Claims

1. A data transmission encoding method, characterized in that: include: Divide the data into different types to obtain data of different code lengths; For data with the longest code length, the identification code is combined with the full code for encoding and decoding; For data with code length types other than the longest code length data, the identification code is combined with the encoding and the code table lookup method to encode and decode; The data is divided into types to obtain data of different code length types, including: Adding an identification code to the header of the data and dividing the data into multiple code length types to obtain data of different code length types; Among them, encoding adopts sequential encoding and decoding adopts serial decoding.

2. The data transmission encoding method according to claim 1, characterized in that: The identification code is added to the header of the data and divided into multiple code length types to obtain data of different code length types, including: An identification code of more than 1 bit is added to the header of the data, and the data is divided into multiple code length types to obtain data of different code length types.

3. The data transmission encoding method according to claim 1, characterized in that: The encoding and decoding of the data with the longest code length using the identification code combined with the full code includes: The data with the longest code length is encoded by using the identification code plus the full code, and the full code is filtered out from the data with the longest code length to form a decoding result.

4. The data transmission encoding method according to claim 1, characterized in that: The encoding and decoding of the data with code length types other than the longest code length data by using identification code combined with encoding and code table lookup includes: The data whose code length type is other than the longest code length data is encoded by the encoding method, and the data whose code length type is other than the longest code length data is decoded by the code table lookup method.

5. The data transmission encoding method according to claim 4, characterized in that: The encoding methods include: Data with a high probability of occurrence are represented by short codes, and data with a low probability of occurrence are represented by long codes.

6. A data transmission encoding device, characterized in that: include: A division unit, used for dividing the data into types to obtain data of different code length types; A first encoding and decoding unit is used to encode and decode data with a code length type of the longest code length by using an identification code combined with a full code; The second encoding and decoding unit is used to encode and decode the data with code length types other than the longest code length data by using the identification code combined with encoding and code table lookup; The division unit is used to add an identification code to the header of the data and divide it into multiple code length types to obtain data of different code length types; Among them, encoding adopts sequential encoding and decoding adopts serial decoding.

7. A computer device, characterized in that: The computer device comprises a memory and a processor, the memory stores a computer program, and the processor implements the method according to any one of claims 1 to 5 when executing the computer program.

8. A storage medium, characterized in that: The storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 5 is implemented.

Images