CN116208667A - Variable-length high-compression bit message coding and decoding method - Google Patents
Variable-length high-compression bit message coding and decoding method Download PDFInfo
- Publication number
- CN116208667A CN116208667A CN202310066270.1A CN202310066270A CN116208667A CN 116208667 A CN116208667 A CN 116208667A CN 202310066270 A CN202310066270 A CN 202310066270A CN 116208667 A CN116208667 A CN 116208667A
- Authority
- CN
- China
- Prior art keywords
- data
- data element
- message
- group
- identifier
- 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
- 238000000034 method Methods 0.000 title claims abstract description 65
- 238000007906 compression Methods 0.000 title claims abstract description 58
- 230000006835 compression Effects 0.000 claims abstract description 50
- 238000010276 construction Methods 0.000 claims abstract description 21
- 238000004891 communication Methods 0.000 claims abstract description 12
- 230000005540 biological transmission Effects 0.000 claims abstract description 10
- 238000012545 processing Methods 0.000 claims abstract description 9
- 238000000926 separation method Methods 0.000 claims description 2
- 238000005516 engineering process Methods 0.000 description 9
- 238000004590 computer program Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 230000009194 climbing Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- KLPWJLBORRMFGK-UHFFFAOYSA-N Molindone Chemical compound O=C1C=2C(CC)=C(C)NC=2CCC1CN1CCOCC1 KLPWJLBORRMFGK-UHFFFAOYSA-N 0.000 description 1
- 206010033799 Paralysis Diseases 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 229940028394 moban Drugs 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/2866—Architectures; Arrangements
- H04L67/30—Profiles
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0014—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the source coding
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention provides a bit message coding and decoding method with variable length and high compression, which comprises the following steps: step 1, defining data types by taking bits as basic units of message construction in information of communication transmission; step 2, aiming at the data types in the step 1, formulating a description method of data elements belonging to each data type, and formulating a description method of a message template; step 3, establishing a unified data element dictionary and a message construction model; step 4, using bits as basic compression units, describing a message structure and data elements by using configuration files, and carrying out form assignment of the message structure; and 5, adopting different compression methods for data of different data types, formulating message coding compression rules, and carrying out coding and decoding processing on messages of different data types according to the same coding compression rules to finish variable-length high-compression bit message coding and decoding.
Description
Technical Field
The invention relates to a bit message encoding and decoding method, in particular to a bit message encoding and decoding method with variable length and high compression.
Background
Under severe environments such as mountain areas, jungle, highland and the like depending on radio stations or satellite environments, or under scenes such as Beidou positioning, beidou short messages and the like which need to be continuously used, communication facilities and communication conditions are poor, on the other hand, electromagnetic interference is possibly caused, so that communication bandwidth is limited, intermittent weak connection characteristics are presented, and integral paralysis of a communication link is possibly caused when serious conditions are severe. In order to reduce the cost of network transmission, effectively solve the problem of transmitting key information on a narrow-band and unreliable channel, greatly improve the channel utilization rate and the information exchange efficiency, and need a message coding technology with variable bit length and high compression which is suitable for the narrow-band communication condition.
Most of the existing message coding compression technologies use a character-oriented message construction mode, and data elements occupy excessive information buffer space, so that the length of transmitted message data cannot be shortened to the minimum according to actual needs; when the existing message format exchanges information, all data element values in a message structure are compressed and transmitted, so that only the changed data elements in the message can not be transmitted when the information is exchanged, and the part of the message which is relatively static or unknown in the data element value is not transmitted; most of the existing message compression technologies hard-code the structure and data dictionary information of the messages into software source codes, and perform personalized processing on each message, so that the coding structure of the message is strongly related to the content of the message structure and data elements, and when a new message is required to be added or the message structure and the data elements are changed, the coding structure technology of the message is required to be synchronously changed, and the decoupling of the coding structure of the message and the content of the message structure and the data elements cannot be realized. Therefore, the existing message compression technology cannot meet the requirement of message coding compression under the narrowband communication condition.
Disclosure of Invention
The invention aims to: the invention aims to solve the technical problem of providing a variable-length high-compression bit message coding and decoding method aiming at the defects of the prior art.
In order to solve the technical problems, the invention discloses a variable-length high-compression bit message encoding and decoding method, which comprises the following steps:
step 1, defining data types by taking bits as basic units of message construction in information of communication transmission;
step 2, aiming at the data types in the step 1, formulating a description method of data elements belonging to each data type, and formulating a description method of a message template;
step 3, establishing a unified data element dictionary and a message construction model;
step 4, using bits as basic compression units, describing a message structure and data elements by using configuration files, and carrying out form assignment of the message structure;
and 5, adopting different compression methods for data of different data types, formulating message coding compression rules, and carrying out coding and decoding processing on different messages according to the same coding compression rules to finish variable-length high-compression bit message coding and decoding.
The beneficial effects are that:
(1) The data elements are represented by adopting the technology taking the bits as basic compression units, so that the space of an information buffer area occupied by the data elements is saved, and the network communication cost is effectively reduced;
(2) By making description methods of all data elements belonging to different data types and description methods of message templates, a unified data element dictionary and a message construction model are established, and aiming at a message with variable bit length, all data elements in the message are assembled by adopting a method of adding identifiers before the data elements or before data element groups. When the complex message is assembled, a data element group and data element repeating group technology is adopted, and the data element groups can be parallel and repeated or can be nested, so that the high compressibility of the message is realized;
(3) By making a message coding compression rule, the length of submitted message data is shortened to the minimum by utilizing the high compressibility of the message. Meanwhile, the transmission safety is improved, and the data is prevented from being illegally stolen in the transmission process;
(4) Based on the dynamically configurable data element dictionary and the message structure template, the coding compression and the decoupling of the message structure and the data element content are realized, so that different messages are coded and decoded according to the same coding construction rule, and when the message structure and the data element change, only the content of the configuration file is required to be changed correspondingly, and the coding compression technology of the message is not required to be changed.
Drawings
The foregoing and/or other advantages of the invention will become more apparent from the following detailed description of the invention when taken in conjunction with the accompanying drawings and detailed description.
FIG. 1 is a schematic general flow chart of the present invention.
Fig. 2 is a schematic diagram of assignment activity of a message structure form of the present invention.
FIG. 3 is a diagram illustrating the message encoding activity of the present invention.
Detailed Description
The invention provides a bit message encoding and decoding method with variable length and high compression, which can meet the information transmission requirement under the narrowband communication condition. The specific scheme is as follows: providing a message modeling method which takes bits as compression units and has variable length from the aspect of message format modeling, defining different data types by taking bits as basic units of message construction, formulating description methods of various data elements belonging to different data types and description methods of message templates, and further establishing a unified data element dictionary and a message construction model; the method for coding and decoding the self-adaptive high-compressibility is provided by taking the bit as a basic compression unit from the aspect of coding and compression, uses the bit as the basic compression unit, uses a configuration file to describe a message structure and data elements, adopts different compression methods for different types of data, and formulates a message coding and compressing rule so that different messages are coded and decoded according to the same coding and compressing rule, as shown in figure 1, and comprises the following steps:
step 1, defining data types by taking bits as basic units of message construction in information of communication transmission;
the data types include: digital type, enumeration type, fixed character type, variable character type, formula type, null type, extension field, and binary data; the data elements all belong to the data types described above.
Step 2, aiming at the data types in the step 1, formulating a description method of data elements belonging to each data type, and formulating a description method of a message template;
the description method for formulating the data elements belonging to each data type comprises the following steps:
digitizing and coding the transmitted information and forming data elements; the digitizing and coding means that the information to be transmitted is represented by a number and a code;
describing the data element by using a data element number, a data element name, a data element data type, a data element bit length, a data element subitem name, a data element subitem sequence number, a data element subitem continuous type, a data element subitem coding start value, a data element subitem ending value, a data element subitem increment type, a data element subitem increment value, a data element subitem increment unit and other description information; the data element is uniquely identified by a data domain identifier SJYID and a data use identifier SJSYID; the data field identifier sJYID includes a conceptual definition and is a general representation of the meaning of each data usage identifier sJSYID; the data usage identifier SJSYID is a specific representation of the concept of the data field identifier sJYid, containing the data item SJXID that constitutes the data element.
The description method for making the message template comprises the following steps:
the message template is described by using a message number, a message name, a message purpose, an index number, a data domain identifier sJYID, a data use identifier SJSYID, a data domain identifier SJSYID name, a bit length, a data type, a block code, a repetition code, an interpretation and the like.
Step 3, establishing a unified data element dictionary and a message construction model, wherein the specific method comprises the following steps:
the method of adding appearance identifiers before data elements or data element groups is adopted to realize the construction of messages with variable compression length, wherein the data element groups consist of more than two data elements, repeatedly-appearing groups and repeated groups of data elements; the presence identifier preceding a data element or group of data elements includes: the four identifiers of the data element appearance identifier DEOI, the data element repetition identifier DERI, the data element group appearance identifier DEGOI and the data element group repetition identifier DEGRI are as follows:
when the value of the data element appearance identifier DEOI is 0, the subsequent data elements do not appear; when the data element appearance identifier DEOI is 1, the subsequent data elements appear;
when the DERI value of the data element repetition identifier is 0, the subsequent data elements are not repeated; when the DERI value of the data element repetition identifier is 1, the subsequent data elements are repeated;
when the data element group appearance identifier DEGOI takes on a value of 0, the subsequent data element group does not appear; when the data element group appearance identifier DEGOI value is 1, the subsequent data element group appears;
when the repeated identification DEGRI of the data element group takes on a value of 0, the subsequent data element group is not repeated; when the data element group repetition flag DEGRI is 1, the subsequent data element group is repeated.
Step 4, using bits as basic compression units, describing a message structure and data elements by using configuration files, and carrying out form assignment of the message structure;
the specific method for describing the message structure and the data elements by using the configuration file comprises the following steps:
a method of employing data element groups and data element repeating groups, i.e. placing one or more data elements in a data element group and giving a data element repeating group identification according to whether the element group is repeatable or not, wherein the repeatable data element group gives the data element repeating group identification, i.e. a message containing the data element group and the data element repeating group is identified using the data element group presence identification DEGOI and the data element group repetition identification DEGRI, identifying whether the data element group or the data element repeating group is used or not, leaving no transmission space when the data element group or the data element repeating group is not present.
The data element groups support parallel exist in a message, the data element groups support repetition, and nesting is supported between the data element groups.
The configuration file is a text file in a custom format or a file in an XML format.
The configuration file is used for describing a message structure and data elements, completing the construction of the message and completing the separation of the content of the message structure and the data elements; the configuration file is dynamically configured, and the content of the configuration file is changed when the message structure and the data elements are changed; and assigning the message structure form, namely assigning the data of the message structure by a user by using a structure in a programming language, wherein the message structure is automatically generated according to a configuration file.
And 5, adopting different compression methods for data of different data types, formulating message coding compression rules, and carrying out coding and decoding processing on messages of different data types according to the same coding compression rules to finish variable-length high-compression bit message coding and decoding.
The specific method for formulating the message coding compression rule comprises the following steps:
converting the field values into binary values according to the field sequence defined by the message format, and sequentially filling the binary values from low order to high order; if the field does not appear, the field is marked by a bit with a value of zero; if the repeated data element groups exist, filling the field values of the first group in sequence, and refilling the fields of the second group until the fields in the last group of data elements are completely filled; it is noted that the data elements of each repeated data element group are preceded by a repeated group identification bit of one bit for identifying whether the data element is the last data element of the repeated data element group, 0 indicating yes, 1 indicating no; the bit stream length of the entire information is an integer multiple of 8, and if the length is insufficient, any remaining uncoded bits in the last octet are padded with 0 s.
Examples:
the embodiment of the invention provides a bit message encoding and decoding method with variable length and high compression, which comprises the following steps:
as shown in table 1, for a defined data type list, there are included a digital type, an enumeration type, a fixed character type, a variable character type, a formula type, a null type, an extension field, and binary data, to which each data element is assigned.
List of data types defined in Table 1
| Sequence number | Data type |
| 1 | Digital type |
| 2 | Enumeration type |
| 3 | Fixed character type |
| 4 | Variable character type |
| 5 | Formula type |
| 6 | Null type |
| 7 | Extension field |
| 8 | Binary data |
| 9 | Other types of |
Based on the description method of each data element with different data types, a unified data element dictionary is established, the data element dictionary is divided into two parts for description, the first part is the description of the data element, the second part is the value description of the data element sub-item, and the specific description format is as follows:
1) Data element description format:
data element number # $# data element name # $# data element bit length # $# data element data type # $#
2) Data element subitem description format
Data element number # $# data element subitem sequence number # $# data element subitem name # $# data element subitem continuous type # $# data element subitem start value # $# data element subitem end value # $# data element subitem increment type # $# increment unit # $# data element subitem continuous type # $# data element subitem start value # $# data element subitem end value # $# data element subitem increment value # $# data element increment value # $# data element subitem increment type # $# data element subitem increment unit # data element subitem
Note that: the # $# is a data separator and has no practical meaning.
Examples:
1034005# line width # $ #8# integer # $ #
Meaning description: the number of this data element representing the queue line width is 1034005, the data length is 8 bits, and the data type is integer.
1034005# $#1 to 255 pixels # $# are successively valued #) #1# 255# 1# 1# -integer # $# pixel # $ #)
Meaning description: the data representing the queue line width 1034005 has a range of 1 to 255 in pixels and an increment of 1.
As shown in table 2, the message description template with variable bit length is described by using message number, message name, message purpose, index number, sJYID/SJSYID, SJSYID name, bit length, data type, block code, repetition code, interpretation, etc.
Table 2 message description template table with variable bit length
The specific meaning of the fields in table 2 is explained as follows:
table 3 example variable bit length message template definition table
As shown in table 3, the example of the message definition is given for describing the message templates with variable bit lengths, and the example content is merely for completely and accurately describing the process of message construction, which has no real meaning. For the "mountain climbing code" in which "index number" is listed as 1, the sJYID number "001" and the sJSYID number "011" after the coding of the "mountain climbing code" are defined as 31 bits (see column "bit length") by adopting the method of taking bits as the basic compression unit. For fields with "index numbers" of 10.1, 10.2, they belong to the "G1" group ("group code" columns all have values of "G1"), while 11.1, 11.2 belong to the "G2" group, the "G1" group and the "G2" group being in parallel relationship; the fields of "index number" 13 "to" index number "13.1.3.1" constitute a repetition group "R1" (their "repetition group code" columns are all "R1") which can be repeated 3 times at most, because the "repetition group code" of the field "DEGRI" of "index number" 13.1.1 "is" R1 (3) ", the" 3 "in brackets is the maximum number of repetitions, and the field" SJSYID name "is" DEGRI "is the" repetition group flag ". The "index number" is a field of "9", and the "SJSYID name" is "DEOI", i.e., a field occurrence flag, if the value of this field is "0", then "9.1 people" will not appear in the message bitstream, whereas if the value of "DEOI" is "1", then "people" will appear in the message bitstream and occupy 16 bits. The field "DERI" with an index number of "14" is a "field repetition flag" field, which means that the "14.1 topographic description" will be repeatable and can be repeated up to 5 times (because the group repetition flag of "14DERI" is "R2 (5)").
Table 4 example table of variable bit length message coding constructs
As shown in table 4, this is an example of the construction rule of the message code for illustrating the variable bit length, and the contents of the message filled for the user are shown in the table. The first four columns of the table give descriptions of the individual fields in the example, the field length being expressed in number of bits and the field values being expressed in binary and decimal, respectively. The last four columns give the physical encoding of the message data. In the fifth column, the bits of each field are placed in octets in the field segment. The bits are placed in specific positions such that the Least Significant Bit (LSB) of the field is placed in the unencoded least significant bit in the octet and the next Least Significant Bit (LSB) of the field is placed in the next unencoded least significant bit in the octet, and so on, repeating until all bits in the field are encoded. If all bits in a field have not been fully encoded and one octet (i.e., has been filled), the program will continue to encode the next octet with the remaining bits in the field. The field/octet encoding procedure is performed starting with the first field and octet and repeating the sequence for subsequent fields and individual octets until encoding is complete. When the fields are grouped, the field encoding procedure is performed starting from the first group and repeating the execution of the subsequent groups and the individual octets in sequence until the field encoding is finished. Note that when fields or octets are considered as digital values, their LSBs are defined as having a value of 2 0 Is a bit of (a). X is a bit that is used to distinguish those bits that are not related to the field being encoded. Sixth column, octet value-binary toBinary form assembles bits in consecutive fields into complete octets. Seventh column, octet value—hexadecimal, represents the value of the octet in hexadecimal form. Last column, octet number, numbered octets beginning from 0 and ending.
When all fields have been encoded, any remaining uncoded bits in the last octet are zero-padded (zero-padded). Each message is encoded and zero-padded separately.
Fig. 2 and 3 are diagrams for illustrating the coding structure of a message and the decoupling of the message structure and the content of data elements, i.e. the message coding structure technology is independent of the specific message.
Wherein, the assignment flow chart in the structure form is shown in fig. 2. The assignment of the structural form can facilitate the user to assign the field. The purpose of the structural form assignment is to convert the user data into bit stream data, distribute and store the bit stream data into each node of the message tree so as to construct the next message. The message template is stored in the message configuration file, and the program contains no specific message content except the grammar of the message, so that the independence of the program and the message can be maintained, and the program is not changed by the change of the message structure. The message configuration file at least needs to include the following information: message number, sJYID/SJSYID number, field number, bit length, data type, group code, repeated group code. The message tree is generated according to the message Wen Moban, each node in the tree contains field information such as sequence number, bit length, data type, group code, repeated group code and the like, the node in the tree can find corresponding variable in the structure, and the assignment process of the structural form is actually the synchronous comparison and value-taking process of the structure and the message tree. Different processing is performed according to the special meaning of each field, such as DEOI, DEGOI, DERI, DEGRI, and if the field is a DEOI (DEGOI) field, whether the child node in the tree needs to be traversed is judged according to the value of the DEOI (DEGOI) field being 0 or 1, and if the child node needs to be traversed, the value of the child node is converted into bit stream data. If the field is a DERI (DEGRI), whether there is a next repetition is judged according to the value of the DERI (DEGRI) field being 0 or 1. If it is a normal field, the value is directly converted into bit stream data. And circulating until traversing to the last field, and assembling the message bit streams of all the fields into a bit stream.
Fig. 3 shows the bit stream construction process of the entire message. After the data assignment of fig. 2 is completed, the message tree containing the data in fig. 2 is traversed, and all the data are assembled into a bit stream according to the message template and the coding rule. Starting from the root node, a sufficient amount of memory is allocated for storing each data bit stream in sequence. All nodes in the message tree are traversed in an order of preference, if the node is a DEGOI node (group present flag node), the node value is pressed into the bit stream, if it is 1, its child node is traversed, if it is not 1, its child node is not traversed. If the node is a DEOI node (field present flag node), the node value is pushed into the bit stream, if it is 1, its child node is traversed, if it is not 1, its child node is not traversed. If the node is a field repetition indicator (DERI) field, the node value is first pushed into the bit stream, and then the value of its child node is pushed into the bit stream; and judging whether the value of the node is 0 or 1, traversing the brother node according to the same rule if the value of the node is 1, and returning to the father node if the value of the node is 0. If the node is a group repeat flag (DEGRI) field, the node value is pushed into the bit stream and then the nodes in its repeated group are traversed according to the same rule; and judging whether the value of the node is 0 or 1, traversing the brother node according to the same rule if the value of the node is 1, and returning to the father node if the value of the node is 0. And the method is repeated until all nodes are traversed. The bit stream at this time is the bit stream after the message encoding is completed.
In a specific implementation, the application provides a computer storage medium and a corresponding data processing unit, where the computer storage medium is capable of storing a computer program, and when the computer program is executed by the data processing unit, the computer program can run the summary of the bit message encoding and decoding method with variable length and high compression and some or all steps in each embodiment. The storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM), a random-access memory (random access memory, RAM), or the like.
It will be apparent to those skilled in the art that the technical solutions in the embodiments of the present invention may be implemented by means of a computer program and its corresponding general hardware platform. Based on such understanding, the technical solutions in the embodiments of the present invention may be embodied essentially or in the form of a computer program, i.e. a software product, which may be stored in a storage medium, and include several instructions to cause a device (which may be a personal computer, a server, a single-chip microcomputer, MUU or a network device, etc.) including a data processing unit to perform the methods described in the embodiments or some parts of the embodiments of the present invention.
The invention provides a method for coding and decoding bit message with variable length and high compression, which has a plurality of methods and approaches for realizing the technical scheme, the above description is only a preferred embodiment of the invention, and it should be pointed out that, for those skilled in the art, several improvements and modifications can be made without departing from the principle of the invention, and the improvements and modifications should also be regarded as the protection scope of the invention. The components not explicitly described in this embodiment can be implemented by using the prior art.
Claims (10)
1. The variable length high compression bit message encoding and decoding method is characterized by comprising the following steps:
step 1, defining data types by taking bits as basic units of message construction in information of communication transmission;
step 2, aiming at the data types in the step 1, formulating a description method of data elements belonging to each data type, and formulating a description method of a message template;
step 3, establishing a unified data element dictionary and a message construction model;
step 4, using bits as basic compression units, describing a message structure and data elements by using configuration files, and carrying out form assignment of the message structure;
and 5, adopting different compression methods for data of different data types, formulating message coding compression rules, and carrying out coding and decoding processing on different messages according to the same coding compression rules to finish variable-length high-compression bit message coding and decoding.
2. The method for encoding and decoding a bit message with variable length and high compression according to claim 1, wherein the data type in step 1 comprises: digital type, enumeration type, fixed character type, variable character type, formula type, null type, extension field, and binary data; the data elements all belong to the data types described above.
3. The method for encoding and decoding a bit message with variable length and high compression according to claim 2, wherein the method for formulating the description of the data elements belonging to each data type in step 2 comprises:
digitizing and coding the transmitted information and forming data elements; the digitizing and coding means that the information to be transmitted is represented by a number and a code;
describing the data element by using a data element number, a data element name, a data element data type, a data element bit length, a data element subitem name, a data element subitem sequence number, a data element subitem continuous type, a data element subitem coding start value, a data element subitem ending value, a data element subitem increment type, a data element subitem increment value, a data element subitem increment unit and other description information; the data element is uniquely identified by a data domain identifier SJYID and a data use identifier SJSYID; the data field identifier sJYID includes a conceptual definition and is a general representation of the meaning of each data usage identifier sJSYID; the data usage identifier SJSYID is a specific representation of the concept of the data field identifier sJYid, containing the data item SJXID that constitutes the data element.
4. A method for encoding and decoding a bit message with variable length and high compression according to claim 3, wherein the method for describing the message template in step 2 comprises the following steps:
the message template is described by using a message number, a message name, a message purpose, an index number, a data domain identifier sJYID, a data use identifier SJSYID, a data domain identifier SJSYID name, a bit length, a data type, a block code, a repetition code, an interpretation and the like.
5. The method for encoding and decoding a bit message with variable length and high compression according to claim 4, wherein the establishing a unified data element dictionary and message construction model in step 3 comprises the following steps:
the method of adding appearance identifiers before data elements or data element groups is adopted to realize the construction of messages with variable compression length, wherein the data element groups consist of more than two data elements, repeatedly-appearing groups and repeated groups of data elements; the presence identifier preceding a data element or group of data elements includes: the four identifiers of the data element appearance identifier DEOI, the data element repetition identifier DERI, the data element group appearance identifier DEGOI and the data element group repetition identifier DEGRI are as follows:
when the value of the data element appearance identifier DEOI is 0, the subsequent data elements do not appear; when the data element appearance identifier DEOI is 1, the subsequent data elements appear;
when the DERI value of the data element repetition identifier is 0, the subsequent data elements are not repeated; when the DERI value of the data element repetition identifier is 1, the subsequent data elements are repeated;
when the data element group appearance identifier DEGOI takes on a value of 0, the subsequent data element group does not appear; when the data element group appearance identifier DEGOI value is 1, the subsequent data element group appears;
when the repeated identification DEGRI of the data element group takes on a value of 0, the subsequent data element group is not repeated; when the data element group repetition flag DEGRI is 1, the subsequent data element group is repeated.
6. The method for encoding and decoding a bit message with variable length and high compression according to claim 5, wherein the using configuration file in step 4 describes the message structure and data elements, and the specific method comprises:
a method of employing data element groups and data element repeating groups, i.e. placing one or more data elements in a data element group and giving a data element repeating group identification according to whether the element group is repeatable or not, wherein the repeatable data element group gives the data element repeating group identification, i.e. a message containing the data element group and the data element repeating group is identified using the data element group presence identification DEGOI and the data element group repetition identification DEGRI, identifying whether the data element group or the data element repeating group is used or not, leaving no transmission space when the data element group or the data element repeating group is not present.
7. The method of claim 6, wherein the data element groups in step 4 are supported in parallel in a single message, and the data element groups are supported in repetition, and nesting is supported between the data element groups.
8. The method for encoding and decoding a bit message with variable length and high compression according to claim 7, wherein the message encoding and compression rule is formulated in step 5, and the specific method comprises:
converting the field values into binary values according to the field sequence defined by the message format, and sequentially filling the binary values from low order to high order; if the field does not appear, the field is marked by a bit with a value of zero; if the repeated data element groups exist, filling the field values of the first group in sequence, and refilling the fields of the second group until the fields in the last group of data elements are completely filled; it is noted that the data elements of each repeated data element group are preceded by a repeated group identification bit of one bit for identifying whether the data element is the last data element of the repeated data element group, 0 indicating yes, 1 indicating no; the bit stream length of the entire information is an integer multiple of 8, and if the length is insufficient, any remaining uncoded bits in the last octet are padded with 0 s.
9. The method for encoding and decoding a bit message with variable length and high compression according to claim 8, wherein the configuration file in step 4 is a text file with custom format or a file with XML format.
10. The method for encoding and decoding a bit message with variable length and high compression according to claim 9, wherein in step 4, the configuration file is used to describe the message structure and the data element, so as to complete the construction of the message and complete the separation of the content of the message structure and the data element; the configuration file is dynamically configured, and the content of the configuration file is changed when the message structure and the data elements are changed; and assigning the message structure form, namely assigning the data of the message structure by a user by using a structure in a programming language, wherein the message structure is automatically generated according to a configuration file.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310066270.1A CN116208667B (en) | 2023-01-18 | Variable-length high-compression bit message coding and decoding method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310066270.1A CN116208667B (en) | 2023-01-18 | Variable-length high-compression bit message coding and decoding method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116208667A true CN116208667A (en) | 2023-06-02 |
| CN116208667B CN116208667B (en) | 2024-06-28 |
Family
ID=
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116896769A (en) * | 2023-09-11 | 2023-10-17 | 深圳市久实电子实业有限公司 | Optimized transmission method for motorcycle Bluetooth sound data |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040021593A1 (en) * | 2002-08-03 | 2004-02-05 | Samsung Electronics Co., Ltd. | Apparatus and method for decoding variable length code |
| CN103957083A (en) * | 2014-05-16 | 2014-07-30 | 江苏中兴微通信息科技有限公司 | Method and device for improving robustness of signaling frame transmission |
| CN107911196A (en) * | 2017-10-27 | 2018-04-13 | 中国电子科技集团公司第二十八研究所 | A kind of radar track message transmitting method |
| CN112262535A (en) * | 2018-05-28 | 2021-01-22 | 高通股份有限公司 | Polar code construction for incremental redundancy |
| CN113450421A (en) * | 2021-07-16 | 2021-09-28 | 中国电子科技集团公司第二十八研究所 | Unmanned aerial vehicle reconnaissance image compression and decompression method based on enhanced deep learning |
| CN114189474A (en) * | 2020-09-14 | 2022-03-15 | 华为技术有限公司 | Data transmission method and device |
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040021593A1 (en) * | 2002-08-03 | 2004-02-05 | Samsung Electronics Co., Ltd. | Apparatus and method for decoding variable length code |
| CN103957083A (en) * | 2014-05-16 | 2014-07-30 | 江苏中兴微通信息科技有限公司 | Method and device for improving robustness of signaling frame transmission |
| CN107911196A (en) * | 2017-10-27 | 2018-04-13 | 中国电子科技集团公司第二十八研究所 | A kind of radar track message transmitting method |
| CN112262535A (en) * | 2018-05-28 | 2021-01-22 | 高通股份有限公司 | Polar code construction for incremental redundancy |
| CN114189474A (en) * | 2020-09-14 | 2022-03-15 | 华为技术有限公司 | Data transmission method and device |
| CN113450421A (en) * | 2021-07-16 | 2021-09-28 | 中国电子科技集团公司第二十八研究所 | Unmanned aerial vehicle reconnaissance image compression and decompression method based on enhanced deep learning |
Non-Patent Citations (2)
| Title |
|---|
| S M HARDI, M ZARLIS, D R P LUBIS, P SIHOMBING, M ELVENY: "TEXT FILE COMPRESSION USING HYBRID RUN LENGTH ENCODING (RLE) ALGORITHM WITH EVEN RODEH CODE (ERC) AND VARIABLE LENGTH BINARY ENCODING (VLBE) TO SAVE STORAGE SPACE", ICOCSIM 2019, no. 1830, 25 June 2021 (2021-06-25) * |
| 李永太: "面向窄带信道的无线目录服务系统研究与实现", 全国优秀硕士学位论文全文数据库 信息科技辑, 15 June 2009 (2009-06-15) * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116896769A (en) * | 2023-09-11 | 2023-10-17 | 深圳市久实电子实业有限公司 | Optimized transmission method for motorcycle Bluetooth sound data |
| CN116896769B (en) * | 2023-09-11 | 2023-11-10 | 深圳市久实电子实业有限公司 | Optimized transmission method for motorcycle Bluetooth sound data |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1147612B1 (en) | Code book construction for variable to variable length entropy encoding | |
| EP1122655A2 (en) | Data compression apparatus, database system, data communication system, data compression method, storage medium and program transmission apparatus | |
| CN104579360B (en) | A kind of method and apparatus of data processing | |
| CN108833050A (en) | Coding method, interpretation method, device and equipment | |
| CN113676190A (en) | Polar code encoding method and device | |
| CN107561564B (en) | A kind of compression implementation method of big-dipper satellite information transmission | |
| CN110943797B (en) | Data compression method in SDH network | |
| CN114900193A (en) | Adaptive Huffman coding system and method | |
| JPS6356726B2 (en) | ||
| CN112287642A (en) | Binary coding method for tree structure self-increment data node ID and path chain thereof | |
| CN113965207B (en) | Deflate Huffman coding-based dynamic code table generation device and method | |
| CN101345952B (en) | Data storing and reading method, device and system for client identification card | |
| CN116208667B (en) | Variable-length high-compression bit message coding and decoding method | |
| CN104065460A (en) | Encoding method and device based on binary tree | |
| CN117097441B (en) | Carrier communication system transmission efficiency optimization method based on data analysis | |
| CN116708845B (en) | Gastrointestinal medical image communication transmission method based on 5G technology | |
| CN107437976A (en) | A kind of data processing method and equipment | |
| CN116208667A (en) | Variable-length high-compression bit message coding and decoding method | |
| CN107707329B (en) | Sparse code multiple access system and multi-user detection method thereof | |
| CN107832345A (en) | The method of base station data unique numberization mark | |
| CN114429200A (en) | Standardized Huffman coding and decoding method and neural network computing chip | |
| CN112506919A (en) | Structured ICD generation method | |
| CN110650539B (en) | Wireless communication downlink resource allocation method based on SCMA | |
| CN101505155A (en) | Apparatus and method for implementing prefix code structure | |
| CN116456290B (en) | Beidou position information message compression coding method and system |
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 |