CN109347758B - Method, device, system and medium for message compression - Google Patents
Method, device, system and medium for message compression Download PDFInfo
- Publication number
- CN109347758B CN109347758B CN201811007240.9A CN201811007240A CN109347758B CN 109347758 B CN109347758 B CN 109347758B CN 201811007240 A CN201811007240 A CN 201811007240A CN 109347758 B CN109347758 B CN 109347758B
- Authority
- CN
- China
- Prior art keywords
- compression
- message
- node
- huffman
- binary tree
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/04—Protocols for data compression, e.g. ROHC
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The present disclosure provides a method for message compression, which includes: constructing a balanced binary tree by the compression load of the source node and the compression loads of one or more intermediate nodes, and forwarding the first message of the source node to the destination node through the one or more intermediate nodes; determining a compression node according to the balanced binary tree, wherein the compression node is the node with the minimum compression load in the source node and one or more intermediate nodes; and the compression node compresses the first message, adds a compression mark, generates a second message and forwards the second message.
Description
Technical Field
The present disclosure relates to the field of communications, and in particular, to a method, device, system, and medium for packet compression.
Background
With the rapid development of the internet, the space link resources for transmitting the messages are more and more precious, and for some services, the headers occupy a considerable proportion of the messages, for example, a frame of messages uses the IPv4 protocol, only the headers introduce 40 bytes of overhead, if the IPv6 protocol is used, the overhead of the headers is increased to 60 bytes, and the payload of a frame of messages may only have 1 byte, the headers occupy a large amount of link bandwidth resources, which is very disadvantageous for the high-speed operation of the network. In the prior art, a plurality of algorithms compress headers, but for links with a plurality of nodes, the optimal node is not selected to compress the message, and a larger compression pressure is formed in the link, which is not beneficial to message compression.
Disclosure of Invention
In view of the foregoing problems, the present disclosure provides a method, an apparatus, a system, and a medium for packet compression, which perform load balancing according to compression loads of nodes in a link and mark compression nodes, decompose compression pressure in the link, and implement effective compression monitoring.
One aspect of the present disclosure provides a method for packet compression, including: constructing a balanced binary tree by the compression load of a source node and the compression loads of one or more intermediate nodes, and forwarding a first message of the source node to a destination node through the one or more intermediate nodes; determining a compression node according to the balanced binary tree, wherein the compression node is the node with the minimum compression load in the source node and the one or more intermediate nodes; and the compression node compresses the first message, adds a compression mark, generates a second message and forwards the second message.
Optionally, constructing a balanced binary tree according to the compression load of the source node and the compression loads of the one or more intermediate nodes includes: setting numbers for the compression load of the source node and the compression loads of the one or more intermediate nodes; and constructing the balanced binary tree according to the value of the number.
Optionally, the compression node is a node corresponding to the number with the smallest median in the balanced binary tree, and after the compression node compresses the first packet, the value of the number of the compression node is updated to the largest value in the balanced binary tree.
Optionally, the balanced binary tree is a red-black tree.
Optionally, the compressing the first packet by the compression node further includes: counting the occurrence frequency of each character in the header of the first message; constructing a Huffman tree according to the occurrence frequency of each character; generating the Huffman code of each character according to the Huffman tree, wherein the number of bits of the Huffman code is not more than that of each character.
Optionally, the huffman-coded bits corresponding to the characters with the high occurrence number are not greater than the huffman-coded bits corresponding to the characters with the low occurrence number.
Optionally, forwarding the first packet of the source node to the destination node via the one or more intermediate nodes includes: the intermediate node monitors whether the message has a compression mark after receiving the message, and when the message has the compression mark, the intermediate node directly forwards the message; and when the message has no compression mark, if the intermediate node is the compression node, the intermediate node compresses the message, adds the compression mark and then forwards the message.
Another aspect of the present disclosure further provides an electronic device for message compression, including: a processor; a memory storing a computer executable program which, when executed by the processor, causes the processor to perform the above-described method of message compression.
Another aspect of the present disclosure further provides a message compression system, where the message compression system includes: the load balancing module is used for constructing a balanced binary tree according to the compression load of the source node and the compression loads of one or more intermediate nodes and determining a compression node according to the balanced binary tree; the compression module is used for constructing a Huffman tree for the header of the first message of the source node, generating Huffman codes to represent each character in the header, wherein the number of bits of the Huffman codes is not more than the number of bits of each character, and the header of the first message is represented by the Huffman codes; and the monitoring module is used for monitoring whether the message received by the intermediate node has a compression mark, directly forwarding the message when the message has the compression mark, compressing the message by the intermediate node if the intermediate node is the compression node when the message has no compression mark, forwarding the message after adding the compression mark, and otherwise, directly forwarding the message by the intermediate node.
Another aspect of the present disclosure also provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the above-mentioned method of message compression.
Drawings
Fig. 1 schematically shows a flowchart of a method for message compression according to an embodiment of the present disclosure.
Fig. 2 schematically illustrates a schematic diagram of a balanced binary tree provided by an embodiment of the present disclosure.
Fig. 3 schematically shows a block diagram of an electronic device provided by an embodiment of the disclosure.
Fig. 4 schematically shows a block diagram of a system for message compression according to an embodiment of the present disclosure.
Detailed Description
Other aspects, advantages, and salient features of the disclosure will become apparent to those skilled in the art from the following detailed description, which, taken in conjunction with the annexed drawings, discloses exemplary embodiments of the disclosure.
In the present disclosure, the terms "include" and "comprise," as well as derivatives thereof, mean inclusion without limitation; the term "or" is inclusive, meaning and/or.
In this specification, the various embodiments described below which are used to describe the principles of the present disclosure are by way of illustration only and should not be construed in any way to limit the scope of the disclosure. The following description with reference to the accompanying drawings is provided to assist in a comprehensive understanding of exemplary embodiments of the present disclosure as defined by the claims and their equivalents. The following description includes various specific details to aid understanding, but such details are to be regarded as illustrative only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present disclosure. Moreover, descriptions of well-known functions and constructions are omitted for clarity and conciseness. Moreover, throughout the drawings, the same reference numerals are used for similar functions and operations.
Fig. 1 schematically shows a flowchart of a method for packet compression provided by the embodiment of the present disclosure, and fig. 2 schematically shows a schematic diagram of a balanced binary tree provided by the embodiment of the present disclosure. Referring to fig. 2, the method of fig. 1 is described in detail, and as shown in fig. 1, the method includes the following operations:
and S1, constructing a balanced binary tree by the compression load of the source node and the compression load of the intermediate node.
In operation S1, numbers are first set for compression loads of the source node and each intermediate node, the compression loads representing compression pressures of the nodes, the compression loads of the nodes being smaller as the compression pressures of the nodes are smaller, and the values of the numbers of the nodes being smaller. The present embodiment is described by taking an example in which the source node and the destination node are connected via nine intermediate nodes, and it is assumed that the compression load numbers of the source node and the nine intermediate nodes have values of 25, 31, 49, 98, 19, 7, 2, 34, 65, and 27, respectively.
And then, constructing a self-balancing binary tree, namely a red-black tree according to the serial number value of the node, wherein the red-black tree belongs to the balancing binary tree, and compared with the balancing binary tree, the red-black tree does not pursue complete balance and has higher efficiency. The red-black tree constructed according to the value of the number of the source node and the values of the numbers of the nine intermediate nodes in this embodiment is shown in fig. 2, in the figure, the shaded nodes are black nodes, the unshaded nodes are red nodes, NULL nodes are empty nodes and black nodes, the nodes with smaller value of the number are on the left side of the red-black tree, the nodes with larger value of the number are on the right side of the red-black tree, and the values of the numbers of the nodes on the red-black tree from left to right are 2, 7, 19, 25, 27, 31, 34, 49, 65 and 98 in sequence.
And S2, setting the node with the minimum compression load in the balanced binary tree as a compression node.
In operation S2, the node corresponding to the lowest numbered value in the red-black tree is set as the compression node, i.e., the leftmost node in the red-black tree is taken, and in the present embodiment, the middle node with the number of 2 is taken as the compression node. The time for searching the compression node in the red and black tree is O (log)2n), where n is the number of nodes in the red-black tree, and taking the source node and the nine intermediate nodes in this embodiment as an example, the compressed node can be found only four times, which reduces the time complexity of the operation.
Further, after the compression node compresses the message, the compression node is self-balanced to the rightmost side of the red-black tree, namely, the compression node is the node with the largest serial number value in the red-black tree, and the compression node is set to the node corresponding to the smallest serial number value in the red-black tree continuously during the next compression.
S3, a compression module is arranged for the compression node, and the header is subjected to Huffman coding.
In operation S3, a compression module is set in a compression node, and the compression module counts the occurrence frequency of each character in the header of the received packet, constructs a huffman tree according to the occurrence frequency of each character, generates a huffman code of each character according to the huffman tree, stores characters with high occurrence frequency with fewer bits, stores characters with low occurrence frequency with more bits, where the number of bits of the huffman code is not greater than the number of bits of each character, and the bits of the huffman code corresponding to the characters with high occurrence frequency are not greater than the bits of the huffman code corresponding to the characters with low occurrence frequency. After the decimal number { 529781423311 } of a group of eight bytes is subjected to Huffman coding, the Huffman coding of each character is shown in the following table, the group of data occupies eight bytes before coding, and the group of data only occupies less than four bytes after coding, so that the link resource occupied by the header can be effectively saved.
| Character(s) | Huffman coding | Character(s) | Huffman coding |
| 5 | 0110 | 14 | 110 |
| 29 | 10 | 23 | 00 |
| 7 | 1110 | 3 | 0111 |
| 8 | 1111 | 11 | 010 |
And S4, the compression node compresses the received message, adds a compression mark and forwards the message, and the transmission of the message from the source node to the destination node is completed.
In operation S4, after receiving the packet, the compression node invokes its compression module to compress the header of the packet, that is, the header is represented by huffman codes with fewer bytes, and the compression node adds a compression flag to the compressed packet and forwards the packet with the compression flag added.
Further, the sending of the packet by the source node to the destination node includes the following sub-operations:
in sub-operation S41, the source node determines whether the source node is a compression node, and if the source node is a compression node, the source node invokes its compression module to perform huffman coding on the header of the packet, and forwards the packet to the intermediate nodes connected to the source node after adding a compression flag, each intermediate node in the link monitors the compression flag in the packet after receiving the packet, and each intermediate node in the link directly sends the packet to the next node connected to the intermediate node; if the source node is not a compression node, the source node directly sends the packet to an intermediate node directly connected to the source node, and performs sub-operation S42.
A sub-operation S42, in which each intermediate node in the link receives the message and then monitors whether the message has a compression flag, and if the message has a compression flag, the intermediate node directly sends the message to the next node directly connected to the intermediate node; if there is no compression tag in the message, a sub-operation S43 is performed.
In sub-operation S43, the intermediate node determines whether the intermediate node is a compression node, and if the intermediate node is a compression node, the intermediate node calls its compression module to perform huffman coding on the header of the packet, adds a compression flag, and forwards the packet to the next node connected to the intermediate node; if the intermediate node is not a compression node, the intermediate node directly sends the message to the next node to which it is directly connected.
As shown in fig. 3, electronic device 300 includes a processor 310, a computer-readable storage medium 320. The electronic device 300 may perform the methods described above with reference to fig. 1 and 2 for message processing.
In particular, processor 310 may include, for example, a general purpose microprocessor, an instruction set processor and/or related chip set and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), and/or the like. The processor 310 may also include on-board memory for caching purposes. The processor 310 may be a single processing unit or a plurality of processing units for performing the different actions of the method flows according to embodiments of the present disclosure described with reference to fig. 1 and 2.
Computer-readable storage medium 320 may be, for example, any medium that can contain, store, communicate, propagate, or transport the instructions. For example, a readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium. Specific examples of the readable storage medium include: magnetic storage devices, such as magnetic tape or Hard Disk Drives (HDDs); optical storage devices, such as compact disks (CD-ROMs); a memory, such as a Random Access Memory (RAM) or a flash memory; and/or wired/wireless communication links.
The computer-readable storage medium 320 may include a computer program 321, which computer program 321 may include code/computer-executable instructions that, when executed by the processor 310, cause the processor 310 to perform a method flow such as described above in connection with fig. 1 and 2, and any variations thereof.
The computer program 321 may be configured with, for example, computer program code comprising computer program modules. For example, in an example embodiment, code in computer program 321 may include one or more program modules, including 321A, modules 321B, … …, for example. It should be noted that the division and number of modules are not fixed, and those skilled in the art may use suitable program modules or program module combinations according to actual situations, which when executed by the processor 310, enable the processor 310 to execute the method flows described above in connection with fig. 1 and 2, for example, and any variations thereof.
According to embodiments of the present disclosure, a computer readable medium may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer-readable signal medium may include a propagated data signal with computer-readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wired, optical fiber cable, radio frequency signals, etc., or any suitable combination of the foregoing.
Fig. 4 schematically illustrates a block diagram of a system for controlling resource access provided by an embodiment of the present disclosure.
As shown in FIG. 4, a system 400 for controlling resource access includes a load balancing module 410, a compression module 420, and a monitoring module 430.
Specifically, the load balancing module 410 is configured to set numbers for the source node and the intermediate node according to the compression load of the source node and the compression load of the intermediate node, construct a balanced binary tree according to the values of the numbers, gradually increase the values of the numbers of the nodes on the balanced binary tree from left to right, select the leftmost node as the compression node, that is, select the node with the smallest compression load as the compression node, and compress the packet by the compression node to achieve self balancing to the right side of the balanced binary tree.
The compressing module 420 is configured to count the occurrence frequency of each character in the header of the received packet, construct a huffman tree according to the occurrence frequency of each character, generate a huffman code for each character according to the huffman tree, store characters with high occurrence frequency with fewer bits, store characters with low occurrence frequency with more bits, wherein the number of bits of the huffman code is not greater than the number of bits of each character, and add a compression flag to the compressed packet.
The monitoring module 430 is configured to monitor whether a message received by the intermediate node has a compression flag, directly forward the message when the message has the compression flag, and when the message has no compression flag, if the intermediate node is a compression node, invoke the compression module to compress the message and add the compression flag, forward the message, otherwise, directly forward the message.
It is understood that the load balancing module 410, the compression module 420, and the monitoring module 430 may be combined in one module, or any one of them may be split into multiple modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of the other modules and implemented in one module. According to an embodiment of the invention, at least one of the load balancing module 410, the compression module 420 and the monitoring module 430 may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or in a suitable combination of three implementations of software, hardware and firmware. Alternatively, at least one of the load balancing module 410, the compression module 420 and the monitoring module 430 may be implemented at least partially as a computer program module, which when executed by a computer, may perform the functions of the respective module.
While the disclosure has been shown and described with reference to certain exemplary embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the disclosure as defined by the appended claims and their equivalents. Accordingly, the scope of the present disclosure should not be limited to the above-described embodiments, but should be defined not only by the appended claims, but also by equivalents thereof.
Claims (9)
1. A method for message compression comprises the following steps:
constructing a balanced binary tree by the compression load of a source node and the compression loads of one or more intermediate nodes, and forwarding a first message of the source node to a destination node through the one or more intermediate nodes;
determining a compression node according to the balanced binary tree, wherein the compression node is the node with the minimum compression load in the source node and the one or more intermediate nodes;
the compressing node compresses the first message, adds a compression mark, generates a second message, and forwards the second message, wherein the compressing node compresses the first message, and the method further comprises the following steps:
counting the number of occurrences of each character in the header of the first message,
constructing a Huffman tree according to the occurrence number of each character,
generating the Huffman code of each character according to the Huffman tree, wherein the number of bits of the Huffman code is not more than that of each character.
2. The method of packet compression according to claim 1, wherein constructing a balanced binary tree based on the compression load of the source node and the compression loads of the one or more intermediate nodes comprises:
setting numbers for the compression load of the source node and the compression loads of the one or more intermediate nodes;
and constructing the balanced binary tree according to the value of the number.
3. The message compression method according to claim 2, wherein the compression node is the node corresponding to the number with the smallest median in the balanced binary tree, and after the compression node compresses the first message, the value of the number of the compression node is updated to the largest value in the balanced binary tree.
4. The message compression method according to claim 2, wherein the balanced binary tree is a red-black tree.
5. The message compression method as claimed in claim 1, wherein the huffman coded bits corresponding to the characters with the higher occurrence number are not greater than the huffman coded bits corresponding to the characters with the lower occurrence number.
6. The method of packet compression as claimed in claim 1, wherein forwarding the first packet of the source node to the destination node via the one or more intermediate nodes comprises:
the intermediate node monitors whether the message has a compression mark after receiving the message, and when the message has the compression mark, the intermediate node directly forwards the message;
and when the message has no compression mark, if the intermediate node is the compression node, the intermediate node compresses the message, adds the compression mark and then forwards the message.
7. An electronic device for message compression, comprising:
a processor;
memory storing a computer executable program which, when executed by the processor, causes the processor to perform the method of message compression as claimed in claims 1-6.
8. A system for message compression, the system comprising:
the load balancing module is used for constructing a balanced binary tree according to the compression load of the source node and the compression loads of one or more intermediate nodes and determining a compression node according to the balanced binary tree;
the compression module is used for constructing a Huffman tree for the header of the first message of the source node, generating Huffman codes to represent each character in the header, wherein the number of bits of the Huffman codes is not more than the number of bits of each character, and the header of the first message is represented by the Huffman codes;
and the monitoring module is used for monitoring whether the message received by the intermediate node has a compression mark, directly forwarding the message when the message has the compression mark, compressing the message by the intermediate node if the intermediate node is the compression node when the message has no compression mark, forwarding the message after adding the compression mark, and otherwise, directly forwarding the message by the intermediate node.
9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method of compression of a message as claimed in claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811007240.9A CN109347758B (en) | 2018-08-30 | 2018-08-30 | Method, device, system and medium for message compression |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811007240.9A CN109347758B (en) | 2018-08-30 | 2018-08-30 | Method, device, system and medium for message compression |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109347758A CN109347758A (en) | 2019-02-15 |
| CN109347758B true CN109347758B (en) | 2022-01-04 |
Family
ID=65296857
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811007240.9A Active CN109347758B (en) | 2018-08-30 | 2018-08-30 | Method, device, system and medium for message compression |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109347758B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111341330B (en) * | 2020-02-10 | 2023-07-25 | 科大讯飞股份有限公司 | Audio encoding and decoding method, access method, related equipment and storage device thereof |
| CN113852556B (en) * | 2021-08-31 | 2023-04-14 | 天翼数字生活科技有限公司 | Method and system for compressing and retrieving routing information |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100496004C (en) * | 2006-09-05 | 2009-06-03 | 华为技术有限公司 | Structured peer-to-peer network system and its load query, transfer and resource seeking method |
| US9143440B2 (en) * | 2011-04-02 | 2015-09-22 | Open Invention Network, Llc | System and method for unmarshalled routing |
| US20140281034A1 (en) * | 2013-03-13 | 2014-09-18 | Futurewei Technologies, Inc. | System and Method for Compressing Data Associated with a Buffer |
| WO2017173618A1 (en) * | 2016-04-07 | 2017-10-12 | 华为技术有限公司 | Method, apparatus and device for compressing data |
-
2018
- 2018-08-30 CN CN201811007240.9A patent/CN109347758B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109347758A (en) | 2019-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10817460B2 (en) | RDMA data sending and receiving methods, electronic device, and readable storage medium | |
| CN109347758B (en) | Method, device, system and medium for message compression | |
| US11075653B2 (en) | Polar code encoding and decoding method and apparatus | |
| US11683052B2 (en) | Data processing method and device | |
| US11323727B2 (en) | Alteration of successive cancellation order in decoding of polar codes | |
| US11134129B2 (en) | System for determining whether to forward packet based on bit string within the packet | |
| US11444874B2 (en) | Packet transmission method, and communications apparatus and system | |
| CN112399479B (en) | Method, electronic device and storage medium for data transmission | |
| CN103634203A (en) | Message asynchronous transmission method, device and system | |
| US20230208554A1 (en) | Encoding and Decoding Method and Apparatus | |
| US20230291502A1 (en) | Data Processing Method and Related Apparatus | |
| CN112118073B (en) | Data processing method, optical transmission equipment and digital processing chip | |
| WO2017157023A1 (en) | Method and system for transmitting soap message | |
| CN111277580B (en) | Node data sending method, receiving method and transmission method | |
| CN102130744B (en) | Method and device for computing Cyclic Redundancy Check (CRC) code | |
| WO2023273975A1 (en) | Data transmission method and communication apparatus | |
| US11558148B2 (en) | Use of LDPC base graphs for NR | |
| US20230246730A1 (en) | Data transmission method and apparatus, circuit board, storage medium and electronic apparatus | |
| CN115174699A (en) | Processing method of Ethernet message and related equipment | |
| CN109639713B (en) | IQ data frame and transmission and receiving method | |
| US8331788B2 (en) | Encapsulation scheme for optical over Ethernet | |
| US20190124180A1 (en) | Packet compression and decompression | |
| US20240235732A9 (en) | Polar code construction method and apparatus | |
| WO2024193265A1 (en) | Data transmission method and related apparatus | |
| CN115604364A (en) | Data encapsulation processing method and device, storage medium and electronic device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |