CN112887056B - Fountain code transmission method based on probability feedback and stage in self-organizing network - Google Patents
Fountain code transmission method based on probability feedback and stage in self-organizing network Download PDFInfo
- Publication number
- CN112887056B CN112887056B CN202110032903.8A CN202110032903A CN112887056B CN 112887056 B CN112887056 B CN 112887056B CN 202110032903 A CN202110032903 A CN 202110032903A CN 112887056 B CN112887056 B CN 112887056B
- Authority
- CN
- China
- Prior art keywords
- packet
- fountain code
- sending
- probability
- self
- 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
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0041—Arrangements at the transmitter end
- H04L1/0043—Realisations of complexity reduction techniques, e.g. use of look-up tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0052—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
Abstract
The invention discloses a fountain code transmission method based on probability feedback and stages in a self-organizing network, which mainly solves the technical problems of low fountain code transmission efficiency, high coding and decoding complexity and uncontrollable feedback quantity when the channel condition is better in the conventional fountain code transmission method. The method comprises the following implementation steps: 1. a sending stage; 2. a robust soliton wave distribution transmitting stage; 3. feeding back a part-ack information packet by probability; 4. adjusting a coding strategy; 5. completing the transmission of the set of fountain code packets. The invention divides the sending end of the self-organizing network into a degree sending stage and a robust solitary wave distribution sending stage for sending and feeds back the part-ack information packet with probability, thereby improving the transmission efficiency of fountain code grouping and reducing the complexity of coding and decoding.
Description
Technical Field
The invention belongs to the technical field of communication, and further relates to a fountain code transmission method based on probability feedback and stages in a self-organizing network in the technical field of wireless communication. The invention can be used for the transmission of fountain codes in the self-organizing network.
Background
In recent years, fountain code technology has opened up new ways to improve network transmission efficiency and reliability. Fountain codes are a novel channel coding technology which is produced in the early 21 st century, and are essentially rateless codes, and a receiving end of wireless communication can realize correct decoding as long as receiving enough code packets. Fountain codes have wide application prospect and are adopted by international standards such as 3GPPTS 26.346 and the like at present. However, due to the defects of poor wireless network stability, high packet loss rate and the like, how to realize the efficient transmission of the fountain codes becomes a great difficulty.
Li yanxia discloses a feedback-based adaptive sliding window fountain code transmission method in a paper published by it, namely "fountain code technology research in wireless communication" (dis, university of electronic technology, university of studios, paper 2019), aiming at improving system reliability and avoiding resource waste caused by repeated information transmission. The method comprises the following steps: and recording the packet numbers with smaller number according to the packet number of successful decoding or unsuccessful decoding after the decoding of each window is finished by utilizing a feedback channel inherent in duplex communication. If the number of successfully decoded packets is large, the packet number of the failed decoding is fed back, and if the number of the unsuccessfully decoded packets is large, the packet number of the successful decoding is fed back, so that the number of the fed back packet numbers is less than or equal to half of the window size. The method has the disadvantages of low fountain code transmission efficiency and high coding and decoding complexity when the channel condition is good.
In the patent document "a digital fountain code transmission method based on selective repeat ARQ" applied by Nanjing aerospace university (application No. 2016103445608 application publication No. CN 106100804A), a digital fountain code transmission method based on selective repeat ARQ is disclosed, and the selective repeat ARQ suitable for fixed code rate codes is extended to system LT codes without code rate. The method comprises the following steps: (1) combining an original symbol block and a coding symbol block needing to be transmitted continuously into a special data frame according to a certain rule, and transmitting the special data frame by taking the special data frame as a data transmission unit; (2) if the receiving end successfully decodes, the receiving end sends ACK confirmation information to the sending end through a feedback channel; (3) if the receiving node still does not receive the ACK acknowledgement after a certain time greater than the channel round-trip delay τ, the receiving end places the encoded data block generated by the original data block in a data frame for transmission, and the transmitting end repeats the step until receiving the ACK acknowledgement information. The method has the disadvantages that the sending end cannot be fully adapted to the decoding state of the receiving end after receiving the feedback in the fountain code transmission process, and the feedback quantity is uncontrollable.
Disclosure of Invention
The invention aims to provide a fountain code transmission method based on probability feedback and stages aiming at the defects of the prior art, and aims to solve the technical problems of low fountain code transmission efficiency, high coding and decoding complexity and uncontrollable feedback quantity when the channel condition is better in the conventional fountain code transmission method.
The idea of the invention for realizing the above purpose is as follows: the sending end of the ad hoc network sends the fountain code packet only in the initial fountain code sending stage without coding and decoding, the fountain code transmission efficiency can be improved and the coding and decoding complexity can be reduced when the channel condition is good, and the receiving end probability of the ad hoc network feeds back the part-ack data packet, so that the feedback quantity can be adjusted according to the probability, and the feedback quantity can be controlled.
The technical scheme of the invention comprises the following steps:
(1) a sending stage:
(1a) when the number of the original fountain code packets in the queue to be sent reaches a preset number, a sending end of the self-organizing network enters a sending stage, and all the original fountain code packets in the queue to be sent are numbered in sequence;
(1b) setting the decoding probability of each original fountain code packet in a queue to be sent to be 0, and sequentially sending the original fountain code packets in the queue to be sent;
(2) robust soliton distribution transmission phase:
(2a) after the original fountain code packets in a queue to be sent by a sending end are sent, the sending end enters a robust solitary wave distribution sending stage, randomly selects a value d from the group of values each time according to a group of values generated by robust solitary wave distribution, randomly selects m original fountain code packets from the queue to be sent for exclusive-or coding, and sequentially sends the code packets obtained each time, wherein the value of m is equal to the value of d;
(2b) the receiving end carries out belief propagation decoding on the code packet received each time;
(3) probability feedback part-ack packet:
judging whether a decoder decodes all original fountain code packets from the first original fountain code packet to the end of the decoding, if so, feeding back an all-ack data packet including all the decoded original fountain code packets to a sending end of the network by a receiving end of the self-organizing network, otherwise, feeding back a part-ack data packet including decoded packet number information to the sending end by the receiving end according to probability p, wherein p is more than or equal to 0 and less than or equal to 1;
(4) adjusting an encoding strategy:
(4a) setting the translation probability of an original fountain code packet corresponding to a translated packet number in a data packet to be 1 every time a sending end receives a part-ack data packet;
(4b) the packet gain of each original fountain code packet is calculated according to the following packet gain formula:
wherein s isiIndicates the packet gain of the ith original fountain code packet, N indicates the total number of code packets transmitted by the transmitting end of the self-organized network, j indicates the serial number of the code packet transmitted by the transmitting end of the self-organized network, piThe decoding probability of the ith original fountain code packet after updating is shown, l represents the link packet loss rate from the sending end to the receiving end of the self-organizing network, vijIndicating a decision function, v if the ith original fountain code packet participates in the coding of the jth code packetijGet 1, and vice versa vijTaking 0;
(4c) randomly selecting a value d from a group of values generated by robust soliton distribution each time;
(4d) selecting m original fountain code packets from high to low for XOR coding according to the gain of each packet, and sequentially sending the code packets obtained each time, wherein the value of m is equal to d;
(5) and the sending end completes the transmission of the fountain code packet after receiving the all-ack data packet.
Compared with the prior art, the invention has the following advantages:
first, the invention divides the sending process of the sending end of the self-organizing network into a sending stage and a robust solitary wave distribution sending stage, solves the problems of low transmission efficiency and complex coding and decoding when the channel state is good in the prior art, and has the advantages of high transmission efficiency and simple coding and decoding when the channel condition is good.
Secondly, the invention feeds back a part-ack information packet through the probability of the receiving end of the self-organizing network, after the sending end receives the part-ack data packet, the coding strategy is adjusted according to the packet number information decoded from the data packet, the fountain code packet is selected according to the adjusted coding strategy to carry out XOR coding, and the obtained coding packet is sent, thereby solving the problems that the feedback quantity in the prior art is uncontrollable, and the sending end cannot be fully adapted to the decoding state of the receiving end after receiving the feedback, so that the invention has the advantages of controllable feedback quantity and capability of fully adapting to the decoding state of the receiving end, and simultaneously improves the coding and decoding efficiency.
Drawings
FIG. 1 is a flow chart of the present invention;
fig. 2 is a timing diagram for data transmission according to the present invention.
Detailed Description
The invention is further described below with reference to the figures and examples.
The specific steps of the present invention will be further described with reference to fig. 1.
Step 1, a sending stage is carried out.
And when the number of the original fountain code packets in the queue to be sent reaches a preset number, the sending end of the self-organizing network enters a sending stage, and all the original fountain code packets in the queue to be sent are numbered in sequence.
The preset number is the number set by the user, but is limited by the size of the system memory.
Setting the decoding probability of each original fountain code packet in the queue to be sent to be 0, and sequentially sending the original fountain code packets in the queue to be sent.
And 2, a robust soliton wave distribution sending stage.
After the sending end finishes sending the original fountain code packets in the queue to be sent, the sending end enters a robust solitary wave distribution sending stage, randomly selects a value d from the group of values each time according to a group of values generated by robust solitary wave distribution, randomly selects m original fountain code packets from the queue to be sent for exclusive OR coding, and sends the code packets obtained each time in sequence, wherein the value of m is equal to the value of d.
The group of values generated by the robust soliton distribution refers to a group formed by generating M values obeying the following robust soliton distribution according to the following formula, wherein M is equal to the number of original fountain code packets in a queue to be sent:
where μ (-) denotes a robust soliton distribution function, xiRepresenting the ith value of M robust-compliant soliton distribution values, ρ (-) representing an ideal soliton distribution function, τ (-) representing a probability distribution function of enhancement degree nodes, k representing the total number of primitive fountain code packets, s-tableThe decoding preprocessing coefficient is shown, ln represents logarithmic operation taking a natural constant e as a base number, c represents a constant less than or equal to 1, delta represents the probability of decoding failure allowed when a receiving end receives n code packets, and n represents the total number of code packets required to be received when decoding is successful at least at the probability of 1-delta.
And the receiving end carries out belief propagation decoding on the code packet received each time.
And 3, feeding back the part-ack data packet with probability.
Judging whether the decoder decodes all original fountain code packets from the first original fountain code packet decoded by the decoder to the end of the decoding, if so, feeding back an all-ack data packet including all the decoded original fountain code packets to a sending end of the network by a receiving end of the self-organizing network, otherwise, feeding back a part-ack data packet including decoded packet number information to the sending end by a probability p by the receiving end, wherein p is more than or equal to 0 and less than or equal to 1.
The probability p is obtained according to the following method: when a receiving end receives a code packet for the first time, p is 1; otherwise, p is a real number randomly selected from the interval of [0,1 ].
And 4, adjusting the encoding strategy.
And setting the translation probability of the original fountain code packet corresponding to the translated packet number in the data packet to be 1 every time the sending end receives a part-ack data packet.
The packet gain of each original fountain code packet is calculated according to the following packet gain formula:
wherein s isiIndicates the packet gain of the ith original fountain code packet, N indicates the total number of code packets transmitted by the transmitting end of the self-organized network, j indicates the serial number of the code packet transmitted by the transmitting end of the self-organized network, piThe decoding probability of the ith original fountain code packet after updating is shown, l represents the link packet loss rate from the sending end to the receiving end of the self-organizing network, vijIndicating the decision function if the ith sourceThe fountain code packet participates in the coding of the jth code packet, then vijGet 1, and vice versa vijTake 0.
One value d is randomly selected at a time from a set of values generated from the robust soliton distribution.
And selecting m original fountain code packets from high to low for XOR coding according to the gain of each packet, and sequentially sending the code packets obtained each time, wherein the value of m is equal to d.
And 5. step 5.
And the sending end completes the transmission of the fountain code packet after receiving the all-ack data packet.
An embodiment of the invention will be further described with reference to fig. 2.
At time 0, the sending end of the ad hoc network enters a first sending stage. This time also means the beginning of fountain code packet transmission, and the receiving end of the ad hoc network performs belief propagation decoding after receiving the first code packet at time 1. And after the decoding is finished, feeding back a part-ack data packet to the sending end.
And at the moment 2, the sending end receives the fed back part-ack data packet, adjusts the coding strategy according to the packet number information decoded from the data packet, selects the fountain code packet according to the adjusted coding strategy to carry out XOR coding, and sends the obtained coding packet. And the receiving end receives the new coding packet at the moment 3, feeds back a part-ack data packet to the sending end in a probability manner after decoding, and the sending end receives the data packet at the moment 4. And adjusting the coding strategy again, selecting the fountain code packet to carry out XOR coding, and sending the obtained code packet. And at the moment 5, the receiving end successfully decodes all the original fountain code packets and feeds an all-ack data packet back to the transmitting end. And at the moment 6, the sending end receives the feedback all-ack data packet, and the fountain code packet group transmission is completed.
Claims (3)
1. A fountain code transmission method based on probability feedback and stage type in a self-organizing network is characterized in that a sending end of the self-organizing network carries out sending in a first sending stage and a robust solitary wave distribution sending stage in a indexing mode, a receiving end of the self-organizing network carries out probability feedback on a part-ack data packet, and the sending end changes a coding strategy after receiving the data packet and then carries out coding sending; the method comprises the following specific steps:
(1) a sending stage:
(1a) when the number of the original fountain code packets in the queue to be sent reaches a preset number, a sending end of the self-organizing network enters a sending stage, and all the original fountain code packets in the queue to be sent are numbered in sequence;
(1b) setting the decoding probability of each original fountain code packet in a queue to be sent to be 0, and sequentially sending the original fountain code packets in the queue to be sent;
(2) robust soliton distribution transmission phase:
(2a) after the original fountain code packets in a queue to be sent by a sending end are sent, the sending end enters a robust solitary wave distribution sending stage, randomly selects a value d from the group of values each time according to a group of values generated by robust solitary wave distribution, randomly selects m original fountain code packets from the queue to be sent for exclusive-or coding, and sequentially sends the code packets obtained each time, wherein the value of m is equal to the value of d;
(2b) the receiving end carries out belief propagation decoding on the code packet received each time;
(3) probability feedback part-ack packet:
judging whether a decoder decodes all original fountain code packets from the first original fountain code packet to the end of the decoding, if so, feeding back an all-ack data packet including all the decoded original fountain code packets to a sending end of the network by a receiving end of the self-organizing network, otherwise, feeding back a part-ack data packet including decoded packet number information to the sending end by the receiving end according to probability p, wherein p is more than or equal to 0 and less than or equal to 1;
(4) adjusting an encoding strategy:
(4a) setting the translation probability of an original fountain code packet corresponding to a translated packet number in a data packet to be 1 every time a sending end receives a part-ack data packet;
(4b) the packet gain of each original fountain code packet is calculated according to the following packet gain formula:
wherein s isiIndicates the packet gain of the ith original fountain code packet, N indicates the total number of code packets transmitted by the transmitting end of the self-organized network, j indicates the serial number of the code packet transmitted by the transmitting end of the self-organized network, piThe decoding probability of the ith original fountain code packet after updating is shown, l represents the link packet loss rate from the sending end to the receiving end of the self-organizing network, vijIndicating a decision function, v if the ith original fountain code packet participates in the coding of the jth code packetijGet 1, and vice versa vijTaking 0;
(4c) randomly selecting a value d from a group of values generated by robust soliton distribution each time;
(4d) selecting m original fountain code packets from high to low for XOR coding according to the gain of each packet, and sequentially sending the code packets obtained each time, wherein the value of m is equal to d;
(5) and the sending end completes the transmission of the fountain code packet after receiving the all-ack data packet.
2. The method for transmitting fountain codes based on probability feedback and stage in self-organizing network as claimed in claim 1, wherein the set of values generated by the robust soliton distribution in step (2a) is a set of values generated by M robust soliton distributions according to the following formula, where M is equal to the number of original fountain code packets in the queue to be transmitted:
where μ (-) denotes a robust soliton distribution function, xiThe method comprises the steps of representing the ith value of M robust soliton distribution-obeying values, rho (·) representing an ideal soliton distribution function, tau (·) representing a probability distribution function of an enhancement degree node, k representing the total number of original fountain code packets, s representing a decoding preprocessing coefficient, ln representing logarithm operation taking a natural constant e as a base number, c representing a constant less than or equal to 1, delta representing the probability of decoding failure allowed when a receiving end receives n coded packets, and n representing the total number of the coded packets required to be received when decoding is successful at least in the probability of 1-delta.
3. The fountain code transmission method based on probability feedback and stage in the ad hoc network according to claim 1, wherein the probability p in step (3) is obtained according to the following method: when a receiving end receives a code packet for the first time, p is 1; otherwise, p is a real number randomly selected from the interval of [0,1 ].
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110032903.8A CN112887056B (en) | 2021-01-12 | 2021-01-12 | Fountain code transmission method based on probability feedback and stage in self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110032903.8A CN112887056B (en) | 2021-01-12 | 2021-01-12 | Fountain code transmission method based on probability feedback and stage in self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112887056A CN112887056A (en) | 2021-06-01 |
| CN112887056B true CN112887056B (en) | 2021-11-23 |
Family
ID=76044423
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110032903.8A Active CN112887056B (en) | 2021-01-12 | 2021-01-12 | Fountain code transmission method based on probability feedback and stage in self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112887056B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115102667B (en) * | 2022-06-17 | 2023-09-12 | 西安交通大学 | Method for optimizing degree distribution of short code long fountain codes of high-speed wireless end-to-end transmission |
| CN115333673A (en) * | 2022-07-29 | 2022-11-11 | 南京信息工程大学 | Block coding transmission method based on ILT in block chain network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102882642A (en) * | 2012-09-20 | 2013-01-16 | 北京理工大学 | Vehicle ad hoc network real-time multicast method based on distributed fountain code |
| CN106533614A (en) * | 2016-06-28 | 2017-03-22 | 东南大学 | Partial information feedback based distributed luby transform coding method |
| CN107249203A (en) * | 2017-05-22 | 2017-10-13 | 厦门大学 | A kind of car networking remote data communication relay Proxy Method based on fountain codes |
| CN107248900A (en) * | 2017-06-30 | 2017-10-13 | 同济大学 | A kind of double relaying distribution LT code coding/decodings and transmission method |
| CN110290558A (en) * | 2019-06-24 | 2019-09-27 | 西安交通大学 | It is a kind of to cache the safe transmission method based on time delay in the more relay transmission systems assisted |
-
2021
- 2021-01-12 CN CN202110032903.8A patent/CN112887056B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102882642A (en) * | 2012-09-20 | 2013-01-16 | 北京理工大学 | Vehicle ad hoc network real-time multicast method based on distributed fountain code |
| CN106533614A (en) * | 2016-06-28 | 2017-03-22 | 东南大学 | Partial information feedback based distributed luby transform coding method |
| CN107249203A (en) * | 2017-05-22 | 2017-10-13 | 厦门大学 | A kind of car networking remote data communication relay Proxy Method based on fountain codes |
| CN107248900A (en) * | 2017-06-30 | 2017-10-13 | 同济大学 | A kind of double relaying distribution LT code coding/decodings and transmission method |
| CN110290558A (en) * | 2019-06-24 | 2019-09-27 | 西安交通大学 | It is a kind of to cache the safe transmission method based on time delay in the more relay transmission systems assisted |
Non-Patent Citations (4)
| Title |
|---|
| "Improved Optimization Design of Degree Distributions in Fountain Codes";Shengkai Xu，Dazhuan Xu等;《2020 IEEE International Conference on Artificial Intelligence and Information Systems (ICAIIS)》;20200911;全文 * |
| "LT码的度分布设计及译码算法研究";王新泽;《中国优秀博硕士学位论文全文数据库(硕士) 信息科技辑》;20141115;全文 * |
| "Optimal Design of Degree Distribution in LT Codes Based on Evolution Strategy";Zaihui Deng，Sha Ding等;《2018 26th International Conference on Systems Engineering (ICSEng)》;20181220;全文 * |
| "一种基于LT码的度分布优化算法";魏德宾，***，潘成胜;《计算机工程》;20180915;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112887056A (en) | 2021-06-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112887056B (en) | Fountain code transmission method based on probability feedback and stage in self-organizing network | |
| US6977888B1 (en) | Hybrid ARQ for packet data transmission | |
| CN102037671A (en) | Selection of retransmission settings for HARQ in WCDMA and LTE networks | |
| CN101237310B (en) | A method for enhanced self-adapted data retransfer | |
| CN109510687A (en) | A kind of fountain code encoding method based on satellite communication | |
| CN101667904A (en) | All-in-one feedback retransmission method based on fountain codes | |
| CN102833051B (en) | Fountain coding broadcast method based on feedback | |
| WO2012122758A1 (en) | Data transmission method and system, and control station | |
| CN112600647B (en) | Multi-hop wireless network transmission method based on network coding endurance | |
| CN101938334A (en) | Adaptive error control method combining random network coding and automatic repeat request | |
| CN103152359A (en) | Method for improving end-to-end wireless transmission control protocol (TCP) linear network coding | |
| CN104852788A (en) | Data broadcast ARQ method based on maximum-minimum network encoding | |
| CN103200088A (en) | Improved type MMRS fixed relay node selection signal transmission method based on fountain encoding | |
| CN103944676B (en) | A kind of LT code coding/decoding methods based on deep space communication environment | |
| JP2022516802A (en) | Data retransmission over wireless network | |
| Li et al. | N-in-1 retransmission with network coding | |
| CN101330368B (en) | Self-adaption multicast transmission method | |
| CN113746766B (en) | Channel self-adaptive noise aggregation wireless secure transmission method | |
| CN109088701A (en) | A kind of LDPC code serial transmission method based on online fountain codes | |
| CN111064551A (en) | Improved continuous cooperative retransmission algorithm based on network coding | |
| CN107222294A (en) | A kind of improved fountain codes degree Distribution Algorithm | |
| CN113438055B (en) | Convolutional network coding transmission method based on unequal redundancy insertion | |
| CN111601342B (en) | Bit error-based low-speed wireless personal area network error data packet recovery method | |
| CN104993905B (en) | The degree distribution optimization method and coding and decoding method of system LT code under erasure channel | |
| CN107483154A (en) | A kind of degree distribution function design method of Internet fountain codes and channel combined coding |
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 |