Data communication method, data communication apparatus, electronic device, and storage medium
By selecting a specific data packet set from active and inactive packets in batch sparse network encoding, and using different batch generation matrices for encoding, the problem of BP decoding failure when the number of batches is small, and the network is improved Communication efficiency.
Patent Information
- Application Number
- PCT/CN2023/126501
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-05-12
- Filing Date
- 2023-10-25
- Publication Date
- 2024-11-21
AI Technical Summary
When the number of batches is small, the pseudo-random encoding method in traditional batch sparse network encoding can easily lead to premature failure of BP decoding, increasing the complexity of decoding, and reducing network communication efficiency.
By selecting a specific data packet set from active and inactive packets in the source node and using different batch generation matrices for batch encoding, the randomness of active packet selection is reduced, the premature failure of BP decoding is avoided, and the decoding success rate is improved .
It improves encoding performance, reduces decoding complexity, and improves network communication efficiency, especially when the number of batches is small.
Smart Images

Figure CN2023126501_21112024_PF_FP_ABST
Abstract
Description
Data communication method, data communication device, electronic device and storage medium Technical Field
[0001] The present application relates to the field of communication technology, and in particular to a data communication method, a data communication device, an electronic device, and a storage medium. Background Art
[0002] In related technologies, batch sparse network coding uses a pseudo-random encoding method to select data packets for each batch. This method uses the degree of each active packet in the batch to uniformly and randomly select a number of data packets with the same degree. When the number of batches is small, this random encoding method can easily cause belief propagation (BP) decoding to fail prematurely, increasing decoding complexity and reducing network communication efficiency.
[0003] Summary of the Invention
[0004] The main purpose of the embodiments of the present application is to propose a data communication method, a data communication device, an electronic device and a storage medium, aiming to improve encoding performance, reduce decoding complexity, and thus improve the efficiency of network communication.
[0005] To achieve the above objectives, a first aspect of an embodiment of the present application provides a data communication method, which is applied to a communication network, the communication network including a source node, an intermediate node, and a destination node. The method includes:
[0006] The source node obtains an original message packet set and precodes the original message packet set to obtain a plurality of precoded packets; the plurality of precoded packets include a plurality of active packets and a plurality of inactive packets;
[0007] The source node selects active packets from the multiple active packets as a first data packet set, selects active packets from the multiple active packets as a second data packet set, and selects inactive packets from the multiple inactive packets as a third data packet set;
[0008] The source node determines a first batch generation matrix, a second batch generation matrix, and a third batch generation matrix, and batch encodes the first data packet set according to the first batch generation matrix to obtain a first coded packet set, batch encodes the second data packet set according to the second batch generation matrix to obtain a second coded packet set, batch encodes the third data packet set according to the third batch generation matrix to obtain a third coded packet set, and fuses the first coded packet set, the second coded packet set, and the third coded packet set to generate a first batch; the first batch includes a plurality of coded packets;
[0009] The source node re-encodes the coded packets belonging to the same first batch to obtain a second batch;
[0010] The intermediate node receives the second batch from the source node and re-encodes the second batch to obtain a target batch;
[0011] The destination node receives the target batch, decodes the target batch, and obtains the original message packet set.
[0012] In some embodiments, precoding the original message packet set to obtain a plurality of precoded packets includes:
[0013] Encoding the original message packet set by a low-density parity check code to obtain a first check packet; the original message packet set includes multiple original message packets, and the multiple original message packets include a first original message packet and a second original message packet;
[0014] Encoding the original message packet set by a high-density parity-check code to obtain a second check packet;
[0015] Multiple precoded packets are obtained based on the original message packet, the first verification packet and the second verification packet; the first original message packet and the first verification packet are both the active packets; the second original message packet and the second verification packet are both the inactive packets.
[0016] In some embodiments, the source node selects an active packet from a plurality of active packets as the first data packet set, including:
[0017] The source node determines the batch size according to a ratio of a first preset number to a preset batch number; the first preset number is the number of the original message packets in the original message packet set;
[0018] Determining a first selection range according to the batch size;
[0019] Active packets within the first selection range are selected from multiple active packets as the first data packet set.
[0020] In some embodiments, selecting an active packet from a plurality of active packets as the second data packet set includes:
[0021] Determine a second selection range according to the batch size, the first preset number, the second preset number, and the preset deactivation number; the second preset number is the number of active packages;
[0022] Active packets within the second selection range are selected from multiple active packets as the second data packet set.
[0023] In some embodiments, selecting an inactive packet from the plurality of inactive packets as the third data packet set includes:
[0024] Sampling the preset degree distribution to obtain the degree;
[0025] An inactive packet having a number equal to the degree is selected from a plurality of inactive packets as the third data packet set.
[0026] In some embodiments, the source node determines the first batch generation matrix, the second batch generation matrix, and the third batch generation matrix, including:
[0027] The source node selects elements from a preset base domain to obtain a plurality of first elements, a plurality of second elements, and a plurality of third elements;
[0028] Performing matrix construction according to a preset unit matrix and a plurality of the first elements to obtain the first batch-generated matrix;
[0029] constructing a matrix according to the plurality of second elements to obtain the second batch-generated matrix;
[0030] A matrix is constructed according to the plurality of third elements to obtain the third batch-generated matrix.
[0031] In some embodiments, decoding the target in batches to obtain the original message packet set includes:
[0032] Performing a first decoding on the target in batches by using a belief propagation method to obtain the original message packet set;
[0033] If the target batch of coded packets has not been decoded and the first decoding stops, performing a second decoding on the undecoded coded packets using Gaussian elimination to obtain the original message packet set;
[0034] or,
[0035] If the target batch of coded packets has not been decoded and the first decoding stops, the undecoded coded packets are subjected to a third decoding using a deactivation decoding method to obtain the original message packet set.
[0036] To achieve the above-mentioned objectives, a second aspect of an embodiment of the present application provides a data communication device, which is applied to a communication network, wherein the communication network includes a source node, an intermediate node, and a destination node, and the device includes:
[0037] an acquisition module, configured for the source node to acquire an original message packet set and precode the original message packet set to obtain a plurality of precoded packets; the plurality of precoded packets include a plurality of active packets and a plurality of inactive packets;
[0038] a selection module, configured for the source node to select an active packet from a plurality of active packets as a first data packet set, select an active packet from a plurality of active packets as a second data packet set, and select an inactive packet from a plurality of inactive packets as a third data packet set;
[0039] A batch generation module is configured to determine, by the source node, a first batch generation matrix, a second batch generation matrix, and a third batch generation matrix, and batch encode the first data packet set according to the first batch generation matrix to obtain a first coded packet set, batch encode the second data packet set according to the second batch generation matrix to obtain a second coded packet set, batch encode the third data packet set according to the third batch generation matrix to obtain a third coded packet set, and fuse the first coded packet set, the second coded packet set, and the third coded packet set to generate a first batch; the first batch includes a plurality of coded packets;
[0040] a first re-encoding module, configured for the source node to re-encode the coded packets belonging to the same first batch to obtain a second batch;
[0041] a second re-encoding module, configured for the intermediate node to receive the second batch from the source node and re-encode the second batch to obtain a target batch;
[0042] A decoding module is used for the destination node to receive the target batch and decode the target batch to obtain the original message packet set.
[0043] To achieve the above-mentioned purpose, the third aspect of an embodiment of the present application proposes an electronic device, which includes a memory and a processor, the memory stores a computer program, and the processor implements the data communication method described in the first aspect when executing the computer program.
[0044] To achieve the above-mentioned purpose, the fourth aspect of an embodiment of the present application proposes a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, it implements the data communication method described in the first aspect above.
[0045] The data communication method, data communication device, electronic device, and storage medium proposed in this application select active packets from multiple active packets as a first data packet set, select active packets from multiple active packets as a second data packet set, and select inactive packets from multiple inactive packets as a third data packet set. By determining the selection of active packets, the randomness of active packet selection is reduced, and coding performance is improved. At the same time, by introducing inactive packets, premature failure of BP decoding can be avoided, thereby improving the decoding success rate. The first data packet set is batch-encoded according to a first batch generation matrix to obtain a first coded packet set, the second data packet set is batch-encoded according to a second batch generation matrix to obtain a second coded packet set, and the third data packet set is batch-encoded according to a third batch generation matrix to obtain a third coded packet set. The first coded packet set, the second coded packet set, and the third coded packet set are merged to generate a first batch. Batches are generated by encoding different data packet sets separately using different batch generation matrices. Compared with the method of using a single batch generation matrix to encode a data packet set consisting entirely of active packets to generate batches, coding performance is improved, thereby reducing decoding complexity and improving network communication efficiency. BRIEF DESCRIPTION OF THE DRAWINGS
[0046] FIG1 is a flow chart of a data communication method provided in an embodiment of the present application;
[0047] FIG2 is a flow chart of step S110 in FIG1 ;
[0048] FIG3 is a flow chart of step S120 in FIG1 ;
[0049] FIG4 is another flow chart of step S120 in FIG1 ;
[0050] FIG5 is another flow chart of step S120 in FIG1 ;
[0051] FIG6 is a flow chart of step S130 in FIG1 ;
[0052] FIG7 is a flow chart of step S160 in FIG1 ;
[0053] FIG8 is a schematic structural diagram of a data communication device provided in an embodiment of the present application;
[0054] FIG9 is a schematic diagram of the hardware structure of the electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0055] In order to make the purpose, technical solutions and advantages of this application more clear, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not intended to limit this application.
[0056] It should be noted that although the device schematics illustrate functional module divisions and the flowcharts illustrate logical sequences, in certain circumstances, the steps shown or described may be performed in a sequence that differs from the module divisions in the device or the sequence in the flowcharts. The terms "first," "second," and so on, in the specification, claims, and drawings, are used to distinguish similar items and are not necessarily used to describe a specific sequence or precedence.
[0057] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the art to which this application pertains. The terms used herein are for the purpose of describing the embodiments of this application only and are not intended to limit this application.
[0058] In traditional network communication technology, intermediate nodes merely forward data packets. The emergence of network coding technology has revolutionized this approach. Compared to traditional network communication technology, network coding allows intermediate nodes to re-encode data packets, resulting in significant performance gains in multicast, multi-source, and multi-path communications. Random Linear Network Coding (RLNC) provides a distributed implementation of network coding. RLNC can achieve communication rates that match the network channel capacity, enabling multicast communication with packet loss. Channel capacity is a concept in information theory that represents the maximum information rate that can be transmitted over a channel under specific channel conditions. Because RLNC uses random coding coefficients, and the destination node cannot decode without knowing these coefficients, a coefficient vector must be embedded in the data packets generated by network coding to record these coefficients. In traditional RLNC schemes, the length of the coefficient vector in a data packet is the same as the number of packets encoded at a time. If RLNC encodes a large number of packets simultaneously, the excessively long coefficient vector results in low coding efficiency. Furthermore, traditional RLNC schemes have high computational and storage complexity, making them incapable of processing large numbers of data packets simultaneously.
[0059] Batch network coding is a highly efficient RLNC scheme. A batch network coding scheme consists of an outer code and an inner code. The outer code encodes data into multiple batches, each consisting of several packets. The inner code employs random linear coding similar to RLNC. Traditional RLNC can be seen as a special type of batch network coding, namely, batch network coding with only one batch, or batch network coding in which each batch uses non-overlapping packets. In wireless or wired communications, batch network coding can achieve communication rates close to the channel capacity using smaller batches. Since both computational complexity and coefficient vector length are related to the batch size, using smaller batches reduces computational complexity and also reduces the proportion of coefficient vectors in the data packet. Furthermore, batch network coding allows for joint decoding of multiple batches, eliminating the need for the coefficient matrix of each batch to have a rank equal to the batch size.
[0060] Traditional batch sparse network coding uses a pseudo-random encoding method to select message packets for each batch. Each batch has a parameter called degree, which determines the number of message packets used in that batch. Based on the degree of the active packets in each batch, a uniform number of data packets with the same degree are selected from all active packets. If the number of batches is relatively large, progressive performance analysis and coding experiments have confirmed that such random coding performance is close to optimal, ensuring that BP decoding succeeds with a high probability. However, when the number of batches is small, the random coding performance has a large uncertainty, which can easily cause large deviations and reduce coding performance. This can cause BP decoding to fail prematurely, thereby increasing decoding complexity and reducing network communication efficiency.
[0061] Based on this, the embodiments of the present application provide a data communication method, a data communication device, an electronic device, and a computer-readable storage medium, aiming to improve encoding performance and thus improve the efficiency of network communications.
[0062] The data communication method, data communication device, electronic device and computer-readable storage medium provided in the embodiments of the present application are specifically illustrated through the following embodiments. First, the data communication method in the embodiments of the present application is described.
[0063] The data communication method provided in the embodiment of the present application relates to the field of communication technology. The data communication method provided in the embodiment of the present application can be applied to a terminal, can be applied to a server side, or can be software running in a terminal or a server side. In some embodiments, the terminal can be a smart phone, a tablet computer, a laptop computer, a desktop computer, etc.; the server side can be configured as an independent physical server, or can be configured as a server cluster or a distributed system composed of multiple physical servers, or can be configured as a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms; the software can be an application that implements the data communication method, etc., but is not limited to the above forms.
[0064] The present application can be used in many general or special computer system environments or configurations. For example: personal computers, server computers, handheld or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments including any of the above systems or devices, and the like. The present application can be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, and the like that perform specific tasks or implement specific abstract data types. The present application can also be practiced in distributed computing environments in which tasks are performed by remote processing devices connected via a communication network. In a distributed computing environment, program modules can be located in local and remote computer storage media, including storage devices.
[0065] FIG1 is an optional flowchart of a data communication method provided in an embodiment of the present application, which is applied to a communication network including a source node, an intermediate node, and a destination node. The method in FIG1 may include but is not limited to steps S110 to S160.
[0066] Step S110: The source node obtains an original message packet set and precodes the original message packet set to obtain a plurality of precoded packets; the plurality of precoded packets include a plurality of active packets and a plurality of inactive packets;
[0067] Step S120: The source node selects active packets from the multiple active packets as a first data packet set, selects active packets from the multiple active packets as a second data packet set, and selects inactive packets from the multiple inactive packets as a third data packet set;
[0068] Step S130: The source node determines a first batch generation matrix, a second batch generation matrix, and a third batch generation matrix, and batch encodes the first data packet set according to the first batch generation matrix to obtain a first coded packet set, batch encodes the second data packet set according to the second batch generation matrix to obtain a second coded packet set, and batch encodes the third data packet set according to the third batch generation matrix to obtain a third coded packet set. The first coded packet set, the second coded packet set, and the third coded packet set are merged to generate a first batch; the first batch includes multiple coded packets.
[0069] Step S140: The source node re-encodes the coded packets belonging to the same first batch to obtain a second batch;
[0070] Step S150: The intermediate node receives the second batch from the source node and re-encodes the second batch to obtain a target batch.
[0071] Step S160: The destination node receives the target batch, decodes the target batch, and obtains the original message packet set.
[0072] In steps S110 to S160 shown in the embodiment of the present application, by deterministically selecting active packets to construct a data packet set, rather than uniformly randomly selecting, the randomness of active packet selection is reduced, thereby improving encoding performance. At the same time, by introducing inactive packets, premature failure of BP decoding can be avoided when the number of batches is small, thereby improving the decoding success rate. Batches are generated by encoding different data packet sets separately using different batch generation matrices. Compared with the method of using a batch generation matrix to encode a data packet set composed entirely of active packets to generate batches, the encoding performance is improved, thereby reducing decoding complexity and improving the efficiency of network communication.
[0073] Please refer to FIG. 2 . In some embodiments, step S110 may include but is not limited to steps S210 to S230 :
[0074] Step S210: Encode the original message packet set using a low-density parity-check code to obtain a first check packet; the original message packet set includes multiple original message packets, and the multiple original message packets include a first original message packet and a second original message packet;
[0075] Step S220, encoding the original message packet set using a high-density parity-check code to obtain a second check packet;
[0076] Step S230: obtaining a plurality of precoded packets according to the original message packet, the first verification packet, and the second verification packet; the first original message packet and the first verification packet are both active packets; the second original message packet and the second verification packet are both inactive packets.
[0077] In step S210 of some embodiments, the data communication method of the embodiment of the present application is designed based on batched sparse code (BATS) in batch network coding, and can be applied to a linear network communication model, and can also be applied to a general network structure with a multi-hop path. The data communication method of the embodiment of the present application is introduced below using a linear network communication model as an example. A linear network communication model of length L includes a series of network nodes, and these network nodes are labeled in sequence from front to back, and the labels of the network nodes are 0, 1, ..., L, respectively, where the first network node, i.e., the network node with label 0, is the source node, the last network node, i.e., the network node with label L, is the destination node, and the remaining nodes are intermediate nodes. A network link only exists between two consecutive network nodes, and a data packet transmitted on the network link is correctly received by the network node or erased.
[0078] A fixed-size finite field is identified as the base field, typically 256 in size. The base field is a set. When the base field size is 256, it can be considered a set of numbers from 0 to 255. A packet of length T can be considered a column vector consisting of T symbols in the base field. Arranging a group of packets of the same length in parallel forms a matrix on the base field. In other words, a matrix on the base field is equivalent to a collection of packets of the same length, with each packet corresponding to a column of the matrix. For example, if there are K packets, each of length T, then these K packets in parallel form a T×K matrix on the base field.
[0079] The source node obtains K original message packets from the data source and arranges them in parallel to form a T×K matrix B, which is used as the original message packet set. To transmit the K original message packets from the source node to the destination node, the source node first encodes the message packets. This encoding is divided into two steps.
[0080] The first step is to precode the original message packet set to obtain multiple precoded packets. Precoding is done by adding check packets to the original message packets to obtain K' precoded packets. The K' precoded packets include K original message packets and K'-K check packets. The check packet is a linear combination of the message packets, and K' is greater than K. A check packet can be generated by a low-density parity-check (LDPC) code or a high-density parity-check (HDPC) code. The original message packet set is encoded using an LDPC code to obtain multiple first check packets.
[0081] In step S220 of some embodiments, the original message packet set is encoded using an HDPC code to obtain a plurality of second verification packets.
[0082] In step S230 of some embodiments, the precoded packets are divided into two categories, namely active packets and inactive packets. A portion of the original message packets and all the first verification packets are active and can be used as active packets. The remaining original message packets and all the second verification packets are inactive and can be used as inactive packets. The number of active packets is defined as A, and the number of inactive packets is defined as K'-A, where A is a positive integer greater than or equal to K. Subtract the number of active packets from the number of first verification packets to obtain the first number of original message packets that are active packets. A first number of original message packets are selected from the original message packet set as the first original message packets, and the remaining original message packets are selected as the second original message packets. Then, the first original message packet and all the first verification packets are active packets, and the second original message packet and all the second verification packets are inactive packets.
[0083] Through the above steps S210 to S230, active packets and inactive packets can be obtained. By using inactive packets in the encoding stage, premature failure of BP decoding can be avoided, further improving the decoding success rate.
[0084] Please refer to FIG. 3 . In some embodiments, step S120 may include but is not limited to steps S310 to S330 :
[0085] Step S310: The source node determines the batch size based on a ratio of a first preset number to a preset batch number; the first preset number is the number of original message packets in the original message packet set;
[0086] Step S320, determining a first selection range according to the batch size;
[0087] Step S330: Select active packets in a first selection range from the multiple active packets as a first data packet set.
[0088] In step S310 of some embodiments, multiple batches of batch size M are generated. The BATS code consists of an outer code and an inner code. The outer code is a rateless code that only requires repeating the encoding process, and the number of batches it can generate is unlimited. In the related art, the source node performs random batch encoding through the outer code to generate multiple batches. Since the batch almost does not contain the original message packet, the outer code is not a systematic code. Random encoding uses a coding method that uniformly randomly selects data packets, while the systematic outer code is deterministic. The uncertainty of random selection will require the design of the systematic outer code to undergo multiple experiments, which will affect the design of the systematic outer code. In the related art, a non-systematic batch sparse coding and decoding scheme is used to construct a systematic outer code, that is, a pair of special batch sparse coding encoders and decoders are used to construct a consistent codec to generate a systematic outer code. Determine the parameters ns, M1, M2, ..., M ns , M i Not greater than M, and M1+M2+…+M ns =K. K is the number of original message packets, M is the batch size, if M can divide K, the optimal ns is K / M. A consistent codec pair needs to be deterministic and meet the following conditions: the encoder needs to generate ns batches, where the i-th batch includes M i data packets; the decoder can recover all message packets from the data packets generated by the encoder. Designing a consistent codec requires as little overhead as possible, and ns×MK is defined as the overhead of designing a consistent codec. Designing a consistent codec uses a scheme of random encoding using multiple experiments. This method has a relatively complete design for fountain codes (M=1) and can achieve an overhead of 0. However, for general cases, whether it is easy to find a consistent codec with an overhead of 0 is still unknown, and it cannot be proved that there must be a consistent codec with an overhead of 0. The system outer code designed in this way does not have the best coding performance.
[0089] The embodiment of the present application adopts a new batch sparse coding outer code encoding method to solve the problems of traditional random encoding. The outer code encoding method has certain rules when selecting active packets in each batch, that is, the source node selects active packets from multiple active packets as the first data packet set, selects active packets from multiple active packets as the second data packet set, and selects inactive packets from multiple inactive packets as the third data packet set, rather than being completely random, so as to improve the certainty of active packet selection, thereby improving coding performance. Since the rule is expressed in a matrix similar to a triangle, the outer code encoding method is called triangle embedding coding. The deterministic outer code generated by triangle embedding can greatly reduce the number of inactivation decodings required and reduce the decoding complexity. At the same time, under the same number of inactivation decoding restrictions, the outer code generated by triangle embedding has a higher probability of obtaining a consistent codec with zero additional overhead.
[0090] The first preset number is the number K of original message packets in the original message packet set. If the preset batch number ns can divide the first preset number K, the batch size of each batch is the ratio of the first preset number K to the preset batch number ns, that is, M i =K / ns, M i Indicates that the i-th batch has M i If the preset batch number ns cannot divide the first preset number K, the batch size M can be determined by rounding up the ratio of the first preset number K to the preset batch number ns, and the batch size M of each batch is i Not greater than M, and M1+M2+…+M ns =K.
[0091] The preset batch size ns can be obtained by the following steps: Determine that there is a rank distribution h=(h1,h2,…,h M ), the rank distribution can be obtained by model analysis or by statistical analysis of the ranks of the batches at the destination node. Rank distribution refers to the distribution of the ranks of the batch transfer matrix. Model analysis is to model the network links, and the rank distribution is obtained by analyzing the specific model. The destination node statistics is to obtain the batch transfer matrix through the coefficient vector at the destination node, and to obtain the rank distribution by statistical analysis of the ranks of the batch transfer matrix. The preset batch number ns is obtained according to the rank distribution and the batch size, that is, ns is at least K / (h1+2h2+…+Mh M ).
[0092] In step S320 of some embodiments, the batch sizes of all batches before the current batch i are added together to obtain a first parameter m i , that is, m i =M1+M2+…+M i-1 (m1=0), according to the first parameter m i and the batch size M of the current batch i Determine the first selection range [m i +1,m i +M i ].
[0093] In step S330 of some embodiments, the active package in the first selection range is selected from all active packages, that is, the mth active package is selected. i +1 to the mth i +M i Active packets are used as the first data packet set B in the current batch i1 .
[0094] Through the above steps S310 to S330, the certainty of the selected active package can be increased to improve the encoding performance.
[0095] Referring to FIG. 4 , in some embodiments, step S120 may further include, but is not limited to, steps S410 to S420:
[0096] Step S410: determining a second selection range based on the batch size, the first preset number, the second preset number, and the preset deactivation number; the second preset number is the number of active packages;
[0097] Step S420: Select active packets in a second selection range from the multiple active packets as a second data packet set.
[0098] In step S410 of some embodiments, the batch sizes of all batches before the current batch i are added together to obtain a first parameter m i , subtract the second preset number A from the first preset number K to obtain the second parameter AK, select the second parameter and the preset deactivation number N inac The smaller parameter is used as the third parameter, and the second selection range is determined to be [1,m i ] and the last min(AK, N inac ) active packets. In order to limit the complexity of the decoding process, the preset number of inactivation N inac is the maximum number of dynamic deactivations in deactivation decoding, and N inac Set to
[0099] In step S420 of some embodiments, a first degree distribution Ψ is obtained A =(Ψ1 A ,Ψ2 A ,…,Ψ DA A ), the first degree distribution is used to determine the number of active packages used in a batch, which is determined by the batch's rank distribution, which can be obtained by solving an optimization problem that includes rank distribution information. DA is the maximum degree of the distribution, which is generally a constant multiple of the batch size M and does not exceed A. Ψ i A Represents the probability of degree i. Sampling the first degree distribution, we get the degree d of the i-th batch i First, select the active package in the second selection range from all active packages, and then select d from the active packages in the second selection range. i -M i active packets, as the second data packet set B used in the i-th batch i2 The active packets in the second data packet set may or may not overlap with the active packets in the first data packet set.
[0100] It should be noted that the degrees of the batches can be arranged from small to large, that is, the degree d1 of the first batch is the smallest degree, and the degree d nsIf the degrees of the batches are arranged from small to large, the order of transmission of these ns batches during data transmission can be changed, and does not have to be in the order of degree, but can be random.
[0101] Through the above steps S410 to S420, the certainty of active packet selection can be increased, the encoding performance can be improved, and the decoding complexity can be reduced.
[0102] Please refer to FIG. 5 . In some embodiments, step S120 may further include but is not limited to steps S510 to S520:
[0103] Step S510, sampling the preset degree distribution to obtain the degree;
[0104] Step S520 : selecting inactive packets of a number equal to the degree from the plurality of inactive packets as a third data packet set.
[0105] In step S510 of some embodiments, a second degree distribution Ψ is obtained F =(Ψ1 F ,Ψ2 F ,…,Ψ DF F ), DF is the maximum degree of the distribution, which is determined by the batch size M and the number of inactive packets F. Sampling the second degree distribution, we get the degree d of the i-th batch iB ,degree is the number of inactive packages used in batches.
[0106] In step S520 of some embodiments, d is selected from all inactive packets. iB The inactive packets are used as the third data packet set B in the i-th batch. i3 .
[0107] It should be noted that due to the degree distribution of batch sparse coding, generally d i The value is less than A-K+m i +M i Yes, so B i2 It can get enough packages from its limited selection range. i2 If you cannot get enough packets from the limited selection range, you can resample all degree values according to the degree distribution, or slightly reduce d. i value.
[0108] In the above steps S510 to S520, by introducing an inactive packet in the encoding phase, the inactive packet is considered inactive at the beginning of the decoding phase, thereby avoiding premature failure of BP decoding and improving the decoding success rate.
[0109] Please refer to FIG. 6 . In some embodiments, step S130 may include but is not limited to steps S610 to S640 .
[0110] Step S610: The source node selects elements from a preset base domain to obtain a plurality of first elements, a plurality of second elements, and a plurality of third elements;
[0111] Step S620, constructing a matrix according to a preset identity matrix and a plurality of first elements to obtain a first batch-generated matrix;
[0112] Step S630, constructing a matrix according to the plurality of second elements to obtain a second batch-generated matrix;
[0113] Step S640 , constructing a matrix according to the plurality of third elements to obtain a third batch-generated matrix.
[0114] In step S610 of some embodiments, the source node randomly selects an element in the base domain to obtain multiple first elements, the source node randomly selects an element in the base domain to obtain multiple second elements, and the source node randomly selects an element in the base domain to obtain multiple third elements.
[0115] In step S620 of some embodiments, the first data packet set includes M i packets, based on the batch size M and the number of packets in the first packet set M i Get the first batch generation matrix G i1 The size is M i ×M. The first batch generates the matrix G i1 It is an M i A matrix of M rows and M columns, where the first M i The columns form an identity matrix, and then MM i The elements in the column are multiple first elements randomly selected from the base domain.
[0116] In step S630 of some embodiments, the second data packet set includes d i -M i packets, based on the batch size M and the number of packets in the second packet set d i -M i Get the second batch generation matrix G i2 The size of (d i -M i )×M. The second batch generates the matrix G i2 It is a d i -M i A matrix with M rows and M columns, where all elements in the matrix are second elements randomly selected from the basis domain.
[0117] In step S640 of some embodiments, the third data packet set includes diB packets, according to the batch size M and the number of packets in the third packet set d iB Get the third batch generation matrix G i3 The size is d iB ×M. The third batch generates the matrix G i3 It is a d iB A matrix with M rows and M columns, where all elements in the matrix are third elements randomly selected from the basis domain.
[0118] In the related art, the random encoding scheme of batches is as follows: the sampling degree distribution Ψ A and Ψ F Get two integers d A and d F , uniformly randomly select d from the active package A packages, select d from the inactive packages F package, and put this A Packages and d F The packages are merged into a matrix B, and finally a batch X = BG is generated. G is a (d A +d F ) rows and M columns of uniform random matrix, called batch generation matrix, d A is the degree of active packets, d F is the degree of inactive packets, d A +d F It is done in batches.
[0119] In order to solve the problem of low encoding performance of random encoding, the embodiment of the present application converts the first data packet set B i1 With the first batch generation matrix G i1 Multiply to get the first data packet set B i1 Perform batch encoding to obtain the first encoding package set B i1 G i1 . The second data packet set B i2 And the second batch generates matrix G i2 Multiply to get the second data packet set B i2 Perform batch encoding to obtain the second encoding package set B i2 G i2 . The third data packet set B i3 And the third batch generates the matrix G i3 Multiply to get the third data packet set B i3 Perform batch encoding to obtain the third encoding package set B i3 G i3 The first coding package set, the second coding package set and the third coding package set are added together to generate the first batch B i1 G i1 +B i2 G i2+B i3 G i3 , the first batch includes multiple encoding packets.
[0120] Through the above steps S610 to S640, three different batch generation matrices can be obtained, and batches are generated according to the batch generation matrices and their corresponding data packet sets to improve encoding performance.
[0121] In step S140 of some embodiments, the source node re-encodes the M coded packets of the first batch generated by the outer code using an inner code to obtain a second batch. The inner code is a code formed by nesting the re-encoding operations performed on each batch at the source node and all intermediate nodes. The re-encoding is a linear combination of the coded packets in the batch.
[0122] In step S150 of some embodiments, a coefficient vector is embedded in each coded packet generated by the outer code, and the coefficient vector includes the values of M symbols. For a batch, the matrix formed by its coefficient vectors is the identity matrix, and subsequent linear operations (re-encoding) performed on this batch also perform the coefficient vectors simultaneously. A batch transfer matrix is obtained based on the coefficient vectors of the coded packets received in a batch. It can be understood that the batch transfer matrix H is not explicitly present in inner code encoding, but is used to describe the linear relationship between a batch and its initial form after multiple rounds of re-encoding. This linear relationship is equivalent to multiplying H. The initial coefficient vectors of a batch form the identity matrix, so after the same linear combination, it is equivalent to multiplying the identity matrix by H, that is, H. In this way, as long as the transformed coefficient vectors are obtained, it is equivalent to explicitly obtaining H. If the coefficient vectors of a group of data packets belonging to the same batch are linearly independent, the group of data packets are linearly independent. If the coefficient vectors of a group of data packets belonging to the same batch are linearly dependent, the group of data packets are linearly dependent.
[0123] The intermediate node v receives the second batch of the source node and obtains a new second batch of XH v , X is the second batch obtained after the source node is re-encoded, H v is the batch transfer matrix of the intermediate node v, and the new second batch of coded packets belonging to the same batch is re-encoded by the inner code to obtain the target batch. v ) is the rank of the batch at the intermediate node v, and the ranks of different batches may be different.
[0124] Referring to FIG. 7 , in some embodiments, step S160 may include but is not limited to step S710 or step S720 .
[0125] Step S710, performing a first decoding on the target in batches by using a belief propagation method to obtain an original message packet set;
[0126] Step S720: If the target batch of coded packets has not been decoded and the first decoding stops, the undecoded coded packets are subjected to a second decoding by using the Gaussian elimination method to obtain the original message packet set; or, if the target batch of coded packets has not been decoded and the first decoding stops, the undecoded coded packets are subjected to a third decoding by using the deactivation decoding method to obtain the original message packet set.
[0127] In step S710 of some embodiments, the source node generates ns batches, with the i-th batch being X i =B i G i , where B i It is made by i A Active packages, d i F Inactive packages, G i is the batch generation matrix of the i-th batch. The destination node can use the same pseudo-random number generator as the source node to obtain the random values used in the encoding process, including the degree of each batch, the selection of pre-coded packets, and the batch generation matrix, etc. This information can be used for decoding at the destination node. For the i-th target batch, the target batch received by the destination node is Y i =X i H i =B i G i H i , decode the received target batches, recover K original message packets from the target batches, and obtain the original message packet set. Decoding is to decipher the nested encoding of the outer code and the inner code, H i The number of rows in Y is M, and the number of columns is the number of packets received by the destination node for that batch. The number of packets received in different batches may vary, but it is always finite. If no packets are received for a batch, Y and H are empty matrices with zero columns.
[0128] The received targets are divided into batches and ranked by the target node rank (H i ) as the rank distribution h=(h0,h1,…,h M ). It can be understood that the size of the batch transfer matrix is M×the number of received coding packets. When the number of received coding packets is sufficient, the rank of the batch transfer matrix may be a number between 0 and M. M Refers to the empirical frequency of rank M.
[0129] When the encoding phase does not use inactive packages, for the i-th batch Y i =B i G i H i , when the matrix G i H i The rank is equal to di A , then B can be decoded i . After a batch is decoded, the decoded message packet is brought into the undecoded batch, and this process is repeated to perform BP decoding on the batch. When the number of original message packets K is large, BP decoding can recover at least K precoded packets with a high probability, and then use the precoded packets for decoding to recover all the original message packets. If LDPC is used for precoding, the corresponding LDPC constraint can show that a special batch also participates in BP decoding. Such a decoding method can improve the success rate. When K is relatively small, there are fewer message packets involved in encoding, which makes the random characteristics after BATS encoding worse. BP decoding often stops before most precoded packets are decoded, resulting in poor performance of BP decoding. When BP decoding stops, decoding can be continued through Gaussian elimination, but the computational complexity is high. In order to eliminate the complexity of Gaussian elimination, when BP decoding stops, the BP decoding program is restored by using the deactivation decoding method, an undecoded message packet is marked as an inactive packet, and the inactive packet is replaced as a decoded packet in the corresponding batch to restore the BP decoding program. However, premature failure of BP decoding will generate more inactive packets, increasing the decoding complexity.
[0130] Deactivation decoding allows the use of inactive packets during the encoding phase, further improving decoding success rates. By using inactive packets during the encoding phase, these packets are considered inactive at the outset of the decoding phase, improving decoding success rates. BP decoding is performed on the target batches using the belief propagation method, and the original message packets are recovered from the target batches to obtain the original message packet set.
[0131] In some embodiments, in step S720, if the target batch of coded packets has not been decoded and BP decoding is stopped, a second decoding is performed on the undecoded coded packets using Gaussian elimination to obtain the original message packet set. Alternatively, a third decoding is performed on the undecoded coded packets using deactivation decoding to resume BP decoding and obtain the original message packet set.
[0132] In steps S710 to S720, a conventional BATS code decoder with BP decoding and deactivation decoding algorithms can recover all K message packets with a high probability for the ns batches of data packets. An encoder and a corresponding decoder using triangular embedded coding can easily form a consistent codec pair, which can be used to design system external codes.
[0133] Referring to FIG. 8 , an embodiment of the present application further provides a data communication device, which is applied to a communication network including a source node, an intermediate node, and a destination node, and can implement the above-mentioned data communication method. The device includes:
[0134] An acquisition module 810 is configured to acquire an original message packet set at a source node and precode the original message packet set to obtain a plurality of precoded packets; the plurality of precoded packets include a plurality of active packets and a plurality of inactive packets;
[0135] A selection module 820, configured for the source node to select active packets from the plurality of active packets as a first data packet set, select active packets from the plurality of active packets as a second data packet set, and select inactive packets from the plurality of inactive packets as a third data packet set;
[0136] Batch generation module 830, configured to determine, at a source node, a first batch generation matrix, a second batch generation matrix, and a third batch generation matrix, batch-encode a first data packet set according to the first batch generation matrix to obtain a first coded packet set, batch-encode a second data packet set according to the second batch generation matrix to obtain a second coded packet set, batch-encode a third data packet set according to the third batch generation matrix to obtain a third coded packet set, and fuse the first coded packet set, the second coded packet set, and the third coded packet set to generate a first batch; the first batch includes multiple coded packets;
[0137] A first re-encoding module 840 is configured to re-encode the coded packets belonging to the same first batch at the source node to obtain a second batch;
[0138] A second re-encoding module 850 is configured to receive the second batch from the source node at the intermediate node and re-encode the second batch to obtain a target batch;
[0139] The decoding module 860 is used for the destination node to receive the target batch and decode the target batch to obtain the original message packet set.
[0140] The specific implementation of the data communication device is basically the same as the specific embodiment of the above-mentioned data communication method, and will not be repeated here.
[0141] The present application also provides an electronic device comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the above-mentioned data communication method when executing the computer program. The electronic device can be any smart terminal including a tablet computer, an in-vehicle computer, or the like.
[0142] Please refer to FIG9 , which illustrates a hardware structure of an electronic device according to another embodiment. The electronic device includes:
[0143] The processor 910 can be implemented using a general-purpose CPU (Central Processing Unit), a microprocessor, a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present application.
[0144] The memory 920 can be implemented in the form of a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 920 can store an operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 920 and is called by the processor 910 to execute the data communication method of the embodiments of this application.
[0145] Input / output interface 930, used to implement information input and output;
[0146] Communication interface 940, used to implement communication interaction between this device and other devices, which can be achieved through wired means (such as USB, network cable, etc.) or wireless means (such as mobile network, WiFi, Bluetooth, etc.);
[0147] bus 950 , which transmits information between various components of the device (e.g., processor 910 , memory 920 , input / output interface 930 , and communication interface 940 );
[0148] The processor 910 , the memory 920 , the input / output interface 930 , and the communication interface 940 are connected to each other in communication within the device via a bus 950 .
[0149] An embodiment of the present application further provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the above-mentioned data communication method is implemented.
[0150] The memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer executable programs. In addition, the memory may include a high-speed random access memory and may also include a non-transitory memory, such as at least one disk storage device, a flash memory device, or other non-transitory solid-state storage device. In some embodiments, the memory may optionally include a memory remotely located relative to the processor, and these remote memories may be connected to the processor via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
[0151] The data communication method, data communication device, electronic device, and computer-readable storage medium provided by the embodiments of the present application construct a data packet set by deterministically selecting active packets rather than uniformly randomly selecting, thereby reducing the randomness of active packet selection and improving coding performance. At the same time, by introducing inactive packets, premature failure of BP decoding can be avoided when the number of batches is small, thereby improving the decoding success rate. Batches are generated by encoding different data packet sets separately using different batch generation matrices. Compared with the method of using a batch generation matrix to encode a data packet set composed entirely of active packets to generate batches, the coding performance is improved, thereby reducing decoding complexity and improving the efficiency of network communication.
[0152] The embodiments described in the embodiments of this application are intended to more clearly illustrate the technical solutions of the embodiments of this application and do not constitute a limitation on the technical solutions provided by the embodiments of this application. Those skilled in the art will appreciate that with the evolution of technology and the emergence of new application scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.
[0153] Those skilled in the art will understand that the technical solutions shown in the figures do not constitute a limitation on the embodiments of the present application, and may include more or fewer steps than shown in the figures, or a combination of certain steps, or different steps.
[0154] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, i.e., they may be located in one place or distributed across multiple network units. Some or all of the modules may be selected based on actual needs to achieve the objectives of this embodiment.
[0155] Those skilled in the art will appreciate that all or some of the steps in the methods, systems, and functional modules / units in the devices disclosed above may be implemented as software, firmware, hardware, or appropriate combinations thereof.
[0156] The terms "first", "second", "third", "fourth", etc. (if any) in the specification of the present application and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequential order. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.
[0157] It should be understood that in this application, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.
[0158] In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the above-mentioned units is only a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.
[0159] The units described above as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0160] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.
[0161] 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 computer-readable storage medium. Based on this understanding, the technical solution of the present application, 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, which is stored in a storage medium and includes multiple instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of various embodiments of the present application. The aforementioned storage medium includes: various media that can store programs, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.
[0162] The preferred embodiments of the present invention are described above with reference to the accompanying drawings, but are not intended to limit the scope of the present invention. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and essence of the present invention should be within the scope of the present invention.
Claims
1. A data communication method, characterized in that: Applied to a communication network, the communication network includes a source node, an intermediate node and a destination node, the method includes: The source node obtains an original message packet set, and precodes the original message packet set to obtain a plurality of precoded packets; the plurality of precoded packets include a plurality of active packets and a plurality of inactive packets; The source node selects an active packet from the multiple active packets as a first data packet set, selects an active packet from the multiple active packets as a second data packet set, and selects an inactive packet from the multiple inactive packets as a third data packet set; The source node determines a first batch generation matrix, a second batch generation matrix, and a third batch generation matrix, and batch encodes the first data packet set according to the first batch generation matrix to obtain a first coded packet set, batch encodes the second data packet set according to the second batch generation matrix to obtain a second coded packet set, batch encodes the third data packet set according to the third batch generation matrix to obtain a third coded packet set, and merges the first coded packet set, the second coded packet set, and the third coded packet set to generate a first batch; the first batch includes a plurality of coded packets; The source node re-encodes the coded packets belonging to the same first batch to obtain a second batch; The intermediate node receives the second batch from the source node, and re-encodes the second batch to obtain a target batch; The destination node receives the target batch, decodes the target batch, and obtains the original message packet set.
2. The data communication method according to claim 1, characterized in that: The precoding of the original message packet set to obtain a plurality of precoded packets includes: The original message packet set is encoded by a low-density parity check code to obtain a first check packet; the original message packet set includes multiple original message packets, and the multiple original message packets include a first original message packet and a second original message packet; Encoding the original message packet set by a high-density parity check code to obtain a second check packet; A plurality of precoded packets are obtained according to the original message packet, the first verification packet and the second verification packet; the first original message packet and the first verification packet are both the active packets; the second original message packet and the second verification packet are both the inactive packets.
3. The data communication method according to claim 2, characterized in that: The source node selects an active packet from a plurality of active packets as a first data packet set, including: The source node determines the batch size according to a ratio of a first preset number to a preset batch number; the first preset number is the number of the original message packets in the original message packet set; Determine a first selection range according to the batch size; Active packets within the first selection range are selected from multiple active packets as the first data packet set.
4. The data communication method according to claim 3, characterized in that: The step of selecting an active packet from a plurality of active packets as a second data packet set includes: Determine a second selection range according to the batch size, the first preset number, the second preset number, and the preset deactivation number; the second preset number is the number of active packages; Active packets within the second selection range are selected from multiple active packets as the second data packet set.
5. The data communication method according to claim 1, characterized in that: The selecting an inactive packet from the plurality of inactive packets as the third data packet set comprises: Sampling a preset degree distribution to obtain a degree; Inactive packets having a number equal to the degree are selected from a plurality of inactive packets as the third data packet set.
6. The data communication method according to any one of claims 1 to 5, characterized in that: The source node determines a first batch generation matrix, a second batch generation matrix, and a third batch generation matrix, including: The source node selects elements from a preset base domain to obtain a plurality of first elements, a plurality of second elements and a plurality of third elements; Performing matrix construction according to a preset unit matrix and a plurality of the first elements to obtain the first batch-generated matrix; Performing matrix construction according to the plurality of the second elements to obtain the second batch-generated matrix; A matrix is constructed according to the plurality of third elements to obtain the third batch-generated matrix.
7. The data communication method according to any one of claims 1 to 5, characterized in that: Decoding the target in batches to obtain the original message packet set includes: Performing a first decoding on the target in batches by using a belief propagation method to obtain the original message packet set; If the target batch of coded packets has not been decoded and the first decoding stops, performing a second decoding on the undecoded coded packets by using Gaussian elimination method to obtain the original message packet set; or, If the coded packets of the target batch have not been decoded and the first decoding stops, the undecoded coded packets are subjected to a third decoding by using a deactivation decoding method to obtain the original message packet set.
8. A data communication device, characterized in that Applied to a communication network, the communication network includes a source node, an intermediate node and a destination node, and the device includes: An acquisition module, used for the source node to acquire an original message packet set, and precode the original message packet set to obtain a plurality of precoded packets; the plurality of precoded packets include a plurality of active packets and a plurality of inactive packets; A selection module, used for the source node to select an active packet from multiple active packets as a first data packet set, select an active packet from multiple active packets as a second data packet set, and select an inactive packet from multiple inactive packets as a third data packet set; A batch generation module is used for the source node to determine a first batch generation matrix, a second batch generation matrix and a third batch generation matrix, and batch encode the first data packet set according to the first batch generation matrix to obtain a first coded packet set, batch encode the second data packet set according to the second batch generation matrix to obtain a second coded packet set, batch encode the third data packet set according to the third batch generation matrix to obtain a third coded packet set, and merge the first coded packet set, the second coded packet set and the third coded packet set to generate a first batch; the first batch includes a plurality of coded packets; A first re-encoding module, configured for the source node to re-encode the coded packets belonging to the same first batch to obtain a second batch; A second re-encoding module, configured for the intermediate node to receive the second batch of the source node and re-encode the second batch to obtain a target batch; A decoding module is used for the destination node to receive the target batch, decode the target batch, and obtain the The original message package set.
9. An electronic device, characterized in that The electronic device includes a memory and a processor, the memory stores a computer program, and the processor implements the data communication method according to any one of claims 1 to 7 when executing the computer program.
10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the data communication method according to any one of claims 1 to 7 is implemented.
Citation Information
Patent Citations
Multihop network communication method and system based on batch sparse codes
CN109347604A
Efficient coding design method based on BATS code in multi-hop transmission system
CN111917512A
Network communication method, network communication device, electronic equipment and storage medium
CN115811381A
Data communication method, data communication device, electronic equipment and storage medium
CN116614203A
LDPC decoder for decoding a low-density parity check (LDPC) codewords
US20050283707A1
Cited By
Data transmission method and device, electronic equipment and storage medium
CN121664366A
