CN102013966B - Data packet retransmission method based on network coding - Google Patents
Data packet retransmission method based on network coding Download PDFInfo
- Publication number
- CN102013966B CN102013966B CN 201010574058 CN201010574058A CN102013966B CN 102013966 B CN102013966 B CN 102013966B CN 201010574058 CN201010574058 CN 201010574058 CN 201010574058 A CN201010574058 A CN 201010574058A CN 102013966 B CN102013966 B CN 102013966B
- Authority
- CN
- China
- Prior art keywords
- packet
- user
- matrix
- retransmission
- packets
- 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
Abstract
The invention discloses a data packet retransmission method based on network coding, which comprises the following steps: S1, on the assumption that the set of data packets which need recovering by all users is A, a message source forms a lost packet table in the raw data packet transmission stage, and selects the data packets, which need recovering by each user in this round of retransmission, according to the current lost packet table; S2, the data packet bi which needs to be merged by each user is determined; S3, a set B of {bi} is obtained according to bi of all the users, and bitwise nonequivalence operation is carried out on all the elements in the set B; and S4, the message source broadcasts a retransmission packet b, each user decodes the retransmission packet b, recovers the error packets included in the set A and transmits feedback information to the message source, and the message source updates the lost packet table according to the feedback information, and enters the next round of the raw data packet transmission stage if no error packets exist, or else, returns to step S1. The data packet retransmission method disclosed by the invention can be used for recovering more error packets in one round of retransmission as compared with the traditional NC-HARQ (network coding-hybrid automatic retransmission reQuest) method, thereby reducing the number of times of retransmission and enhancing the spectrum efficiency.
Description
Technical field
The present invention relates to wireless communication technology field, relate in particular to a kind of coded data bag repeating method Network Based.
Background technology
In wireless broadcast system, a sending node (being referred to as information source) and M receiving node (being referred to as the user) are arranged, information source is broadcasted identical information to all users.For in the wireless digital broadcasting system, guaranteeing reliability transmission, need to adopt error-control technique.ARQ(Automatic Retransmission-reQuest, HARQ) technology and FEC(Forward Error Correction, forward error correction) technology is two classes error-control techniques commonly used.ARQ and FEC can be combined with, and this technology is called HARQ(Hybird Automatic Retransmission-reQuest, hybrid ARQ).In ARQ and HARQ technology, after receiver receives a packet, recover original transmitted information through detecting decode procedure, if the information that recovers is compared the maximum that the quantity (hereinafter to be referred as the error rate) that makes a mistake has surpassed system requirements with original transmitted information, receiver will pass through feedback channel, require transmitter to resend once, otherwise with information output.The signal that utilization resends carries out the detection of raw information again, if the error rate has still surpassed the maximum of system requirements, receiver will require retransmission data packet may to transmitter again, still do not recover desirable information until the signal quality that receiver recovers reaches after system requirements or system reach maximum number of retransmissions, then this data transfer writes off.Fig. 1 is a simple ARQ/HARQ system schematic.
NC(Network Coding, network code) be a kind of new technology that can improve the transmission capacity of network, can be combined with ARQ.The mode that traditional communication network transmits data is storage forwarding, namely only is responsible for route except sending node and the node the receiving node of data, and the data content is not done any processing, and intermediate node is being played the part of the role of transponder.And in network code, allow intermediate node that the packet from various information source is made up again and transmit.In the problems such as multicast and broadcasting, use rightly the maximum transfer capacity of network code on can realization theory.
In the wireless digital broadcasting system, for each user can both obtain enough high-quality broadcast messages, ARQ/HARQ is used to carry out error control.In radio broadcasting, adopt conventional ARQ/HARQ, each user independently deciphers after receiving a broadcast data packet (packet), if make mistakes (being that the error rate can not reach pre-provisioning request) after certain user's decoding, then feed back a NAK(Negative AcKnowledge) signal.If a broadcast packet is not successfully received by all users, then information source is broadcasted again to this broadcast packet, does not have the user who successfully receives to continue to receive this bag, until all carry out the broadcasting of next packet again with successfully obtaining per family this bag.
Because at any time, there have the user not obtain the probability of desired data bag in the broadcast system to be larger, and therefore conventional ARQ/HARQ needs higher retransmission cost.In order to improve the performance of ARQ/HARQ in broadcast system, NC-HARQ a kind of ARQ/HARQ in conjunction with network code appearred, i.e..NC-HARQ forms retransmission packet by introducing network code, each user merges retransmission packet and some the correct bag that oneself receives, obtain oneself and need the bag of re-transmission, each user can recover different data in once retransmitting like this, thereby significantly reduces the number of retransmissions under the broadcasted application.Its concrete operations are as follows: in NC-HARQ, if receiving terminal does not correctly receive some packets, then send a NAK signal to transmitting terminal immediately.Transmitting terminal is the bag of retransmits lost immediately after receiving the NAK signal not, but the bag that will lose and corresponding receiving terminal thereof are saved in the tabulation.Tabulation has certain length restriction, is made as N, retransmits to begin behind N time slot.In phase of retransmission, transmitting terminal is respectively got a packet from obliterated data the package list of each receiving terminal, carry out the step-by-step XOR, and the bag that then computing is obtained retransmits to all receiving terminals.In retransmission processes, the packet of combination still may be lost, if lose, then need again to retransmit the data splitting bag, but the data splitting bag can dynamically be adjusted according to the reception condition of each receiving terminal.Retransmit by each like this, each (is the missing data bag, is also referred to as packet loss: lost packet) with an erroneous packets may recovering per family it.The below illustrates the step of traditional NC-HARQ method take Fig. 2 as example.
X among Fig. 2 among R1 and the R2 represents respectively the lost data packets of receiving terminal 1 and receiving terminal 2, and numeral is the label of packet.Transmitting terminal at first send 1 ⊕ 3(symbolic representation " with ", the meaning of " merging "), if receiving terminal 1 has correctly received 1 ⊕ 3, then can calculate 1 by known 3; If receiving terminal 2 does not correctly receive 1 ⊕ 3, then transmitting terminal will retransmit the data splitting bag.Because receiving terminal 1 has obtained 1, so the data splitting bag is adjusted into 3 ⊕ 4, sends to all receiving terminals again.Repeat this process, until no longer include the missing data bag among R1 and the R2.Among Fig. 2 each encloses the circle that comes with " X " and represents that this time needs the packet that recovers in retransmitting.
This shows that traditional NC-HARQ method is introduced network code between the different erroneous packets of different user, can be so that different user recovers different packet loss by once retransmitting.But it does not introduce network code between same user's erroneous packets, once retransmits for a user and can only recover at most an erroneous packets.
Summary of the invention
The technical problem that (one) will solve
The technical problem to be solved in the present invention is: how to recover more erroneous packets in once retransmitting, thereby reduce number of retransmissions, improve spectrum efficiency.
(2) technical scheme
For solving the problems of the technologies described above, the invention provides a kind of coded data bag repeating method Network Based, may further comprise the steps:
S1, information source forms a packet loss table in the raw data packets transmission phase, and information source is chosen in the packet that each user i needs of this wheel load crossing recover according to current packet loss table, wherein, supposes that the packet set that all users need to recover is A;
S2 determines the required packet b that merges of each user
i
S3 is by all users' b
iObtain { a b
iSet B, all elements in the set B is carried out the step-by-step XOR obtains retransmission packet b;
S4, information source is broadcasted this retransmission packet b, then each user deciphers, oneself the erroneous packets of recovering to comprise in the set A, and to described information source transmission feedback information, described information source if there is not erroneous packets, then enters the transmission phase of the raw data packets of next round according to described feedback information updating packet loss table; Otherwise return step S1.
Wherein, in step S1, information source selects the principle of the packet that each user need to recover to be: make set A as far as possible large, guarantee simultaneously to only have at most two from same user's erroneous packets in the set A.
Wherein, the matrix H of described packet loss table with a M * N represented each the element h in the matrix
IjBe 0 or 1, h wherein
Ij=0 expression user i has successfully received packet j, h
Ij=1 expression user i lost data packets j, then packet j becomes erroneous packets; At this moment, described step S1 specifically comprises step:
S101 goes exchange to packet loss table matrix H, form new packet loss table matrix H ', so that new packet loss table matrix H i capable in 1 quantity capable more than or equal to i+1 in 1 quantity;
S102 sets up selection matrix G, initialization G=H ';
S103, G proceeds as follows for selection matrix: selection the first two matrix element is 1 position from the first row, the packet of this position representative is put into A, is matrix element zero setting in row corresponding to 1 position to all the other elements of matrix G the first row, the selection matrix G that obtains upgrading; Then carry out line by line the operation identical with above-mentioned steps S103, until the operation of all row is all finished, thereby obtain the selection matrix G of this wheel load crossing, all contain the set that the bag of the row correspondence of element 1 forms and are A among the selection matrix G, and the packet that this wheel load crossing user i need to recover is shown in the tabulation of element 1 correspondence of i in capable among the A.
Wherein, in step S2, specified data bag b
iPrinciple as follows:
For user i, if should the wheel re-transmission need to recover an one erroneous packets a
I1, b then
i=a
I1
For user i, if should the wheel re-transmission need to recover two erroneous packets a
I1And a
I2, then:
Wherein, q represents that this is a
I1And a
I2Q wheel retransmit, l is non-zero positive integer, or represents to choose arbitrarily a
I1And a
I2In one transmit.
Wherein, the user utilizes associated detecting method to decipher among the step S4.Described associated detecting method is preferably maximum likelihood associated detecting method or bit level merging associated detecting method.
(3) beneficial effect
The present invention carries out network code to the bag that retransmits and forms new retransmission packet, because the process of network code is not only carried out between the erroneous packets between different user, also between the different erroneous packets between same user, carry out simultaneously, again in conjunction with joint-detection and inclusion and the method for physical layer, so that can recover than the more erroneous packets of traditional NC-HARQ method by once retransmitting.The present invention also designs the strategy of concrete network code, so that should the re-transmission mode can reduce number of retransmissions in the diversity order that obtains with the same optimum of traditional NC-HARQ method, improves spectrum efficiency.
Description of drawings
Fig. 1 is the ARQ system block diagram;
Fig. 2 shows time-based retransmission algorithm in the prior art;
Fig. 3 is the method flow diagram of the embodiment of the invention;
Fig. 4 be the present invention compared with prior art, the correlation curve figure of the average repeat time of each erroneous packets;
Fig. 5 be the present invention compared with prior art, the correlation curve figure of average each transmission success ratio;
Fig. 6 shows the repeating method of the embodiment of the invention.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention will be further described.
In the present invention, ARQ/HARQ is divided into two stages: raw data packets transmission phase (Initial Transmission Phase) and raw data packets retransmit the stage (Retransmission Phase).
In the raw data packets transmission phase, information source sends N raw data packets successively.Whether each user judge receiving the laggard row decoding of each packet and successfully receive, if successfully receive then to information source feeding back ACK (ACKnowledge) signal, if unsuccessful reception then to information source feedback NAK signal.Information source does not retransmit in the raw data packets transmission phase, only records each and wraps in which user and lose, and forms a packet loss table.This packet loss table can represent that with the matrix H of a M * N each element in the matrix is 0 or 1, wherein the element h in the matrix H
Ij=0 expression user i has successfully received bag j, h
Ij=1 expression user i lost package j.After N raw data packets is sent, if H=0 then skips the re-transmission stage, enter the transmission phase of the raw data packets of next round; Otherwise enter the re-transmission stage of raw data packets.
Retransmit the stage in raw data packets, information source is carried out data re-transmission according to current packet loss table, and purpose is to allow all users successfully obtain all packets.As shown in Figure 3, its concrete steps are as follows:
S1, information source is chosen in the packet that each user's needs of this wheel load crossing recover according to current packet loss table; The packet set that all users are to be recovered is made as A.In the process of selecting, guarantee that the A set is as far as possible large, to guarantee simultaneously to only have at most two from same user's erroneous packets in the A set.Wherein a kind of system of selection of realizing of being easy to programme is as follows:
S101. packet loss table matrix H is gone exchange, form new packet loss matrix H ', so that new packet loss table matrix H i capable in 1 quantity capable more than or equal to i+1 in 1 quantity.
S102. set up selection matrix G.Initialization G=H '.
S103. proceed as follows for G: selecting the first two matrix element from the first row is 1 position, and the packet loss of its representative is put into A, is matrix element zero setting in row corresponding to 1 position to all the other elements of G matrix the first row, the G that obtains upgrading.
Next carry out line by line the operation identical with above-mentioned steps S103, when the operation of all row is all finished, obtain final selection matrix G in this time re-transmission.
All contain the set that the bag of the row correspondence of element 1 forms and are A among the G.Among the G tabulation of element 1 correspondence of i in capable show this time retransmit in user i prepare the bag that recovers.
S2 according to the resulting G of above-mentioned steps S1, determines the bag b that each user is required to carry out (utilizing the method for network code) merging
iConcrete grammar is as follows:
For user i, if should the wheel re-transmission only need to recover an one packet loss a
I1B then
i=a
I1
For user i, if should the wheel re-transmission need to recover two packet loss a
I1And a
I2, then:
Wherein, q represents that this is a
I1And a
I2Q wheel retransmit, l is non-zero positive integer, or represents to choose arbitrarily a
I1And a
I2In one transmit.
S3 is by all users' b
iObtain { a b
iSet B.The b that repeats
iIn set B, only comprise once.All elements in the set B is carried out the step-by-step XOR namely obtain retransmission packet b.
S4, information source is broadcasted this retransmission packet b.Each user utilizes all relevant reception sample of signal to carry out joint decoding, oneself the erroneous packets of attempting to recover to comprise among the A.If be successfully recovered then feedback ACK, otherwise feedback NAK.Information source is according to feedback information updating packet loss table matrix H, if H=0 then enters the transmission phase of the raw data packets of next round; Otherwise return step S1.Wherein, described relevant reception sample of signal refers in the signal sample (but not the symbol judgement result after demodulation) that each user receives, all packets relevant with the retransmission packet that forms behind the network code.
In order to show superiority of the present invention, the Performance Ratio by simulation analysis and the theoretical method that drawn the method and prior art of deriving.Fig. 4 and Fig. 5 have compared respectively average repeat time and the average at every turn ratio (this ratio is measured with the transmission bandwidth utilance) of transmission success of each erroneous packets of the two.From these two comparing results, institute of the present invention extracting method has significantly reduced number of retransmissions, has improved the availability of frequency spectrum, and performance all is better than the NC-HARQ method.Wherein, the SNR among Fig. 4,5 represents signal to noise ratio.
Below illustrate method of the present invention.
The concrete operations of explanation institute extracting method as an example of 8 raw data packets of two users example in the present embodiment.Through after the initial raw data packets transmission phase, two user's packet drops are as follows:
Fig. 6 is two receiving terminal R
1, R
2The packet example of receiving, wherein X represents lost data packets.Such R
11st, 3,7 data-bag losts, R
22nd, 3,6,8 data-bag losts.Packet loss table matrix is:
According to step S1,
G＝H′。
At first, R
2Middle selection 2,3 packets,
R
1Select 1,3 packets.
Secondly, b
1=a
1⊕ a
3, b
2=a
2⊕ a
3
Again, the packet of transmitting terminal is b
1⊕ b
2=a
1⊕ a
2⊕ a
3
Receiving terminal (i.e. " user " above-mentioned) uses associated detecting method to detect the packet that receives.Wherein, described associated detecting method can be ML(Maximum Likelihood, maximum likelihood) associated detecting method, BLC(Bit Level Combining, bit level merging) associated detecting method etc.If R
2Correctly obtained a
2And a
3, but R
1Correctly do not obtain a
1And a
3So need the re-transmission of next round.
The second wheel load spreads when beginning, and the H after the renewal becomes:
According to step S1,
G＝H′。
In this wheel load crossing, at first, R
1Middle selection 1,3 packets,
R
2Select 6,8 packets.
According to step S2, this is R
1In second time of 1,3 packets retransmit b
1=a
3, be R
2In first time of 6,8 packets retransmit b
2=a
6⊕ a
8
According to step S3, the packet of transmitting terminal is b
1⊕ b
2=a
3⊕ a
6⊕ a
8
This wheel load crossing hypothesis R
1Correctly obtained a
1And a
3, but R
2Correctly do not obtain a
6And a
8So need to carry out next round retransmits.
Again carrying out third round according to above-mentioned rule retransmits.During third round retransmitted, the packet that transmitting terminal is new was a
6⊕ a
7Suppose at this wheel load crossing R
1Correctly obtained a
7, R
2Correctly obtained a
6And a
8Therefore, so far whole retransmission processes finishes.Among Fig. 6 each encloses the frame table that comes with " X " and shows that this time needs the packet that recovers in retransmitting.
Can find out that in the above-described embodiments, method of the present invention has only been carried out 3 times and retransmitted.Traditional NC-HARQ method then needs 4 re-transmissions at least.
Therefore, as can be seen from the above embodiments, method of the present invention is carried out network code to the bag that retransmits and is formed new retransmission packet, the process of network code is not only carried out between the erroneous packets between different user, also between the different erroneous packets between same user, carry out simultaneously, in conjunction with joint-detection and inclusion and the method for physical layer, so that can recover the more erroneous packets than traditional NC-HARQ by once retransmitting.The present invention designs the strategy of concrete network code, so that should the re-transmission mode can reduce number of retransmissions in the diversity order that obtains with the same optimum of traditional NC-HARQ, improves spectrum efficiency.Method of the present invention can be applied in the wireless broadcast system, especially in radio broadcasting ARQ/HARQ system.
Above execution mode only is used for explanation the present invention; and be not limitation of the present invention; the those of ordinary skill in relevant technologies field; in the situation that does not break away from the spirit and scope of the present invention; can also make a variety of changes and modification; therefore all technical schemes that are equal to also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.
Claims (5)
1. a coded data bag repeating method Network Based is characterized in that, may further comprise the steps:
S1, information source forms a packet loss table in the raw data packets transmission phase, and information source is chosen in the packet that each user i needs of this wheel load crossing recover according to current packet loss table, wherein, supposes that the packet set that all users need to recover is A;
S2 determines the required packet b that merges of each user
i
S3 is by all users' b
iObtain { a b
iSet B, all elements in the set B is carried out the step-by-step XOR obtains retransmission packet b;
S4, information source is broadcasted this retransmission packet b, then each user deciphers, oneself the erroneous packets of recovering to comprise in the set A, and to described information source transmission feedback information, described information source if there is not erroneous packets, then enters the transmission phase of the raw data packets of next round according to described feedback information updating packet loss table; Otherwise return step S1;
The matrix H of described packet loss table with a M * N represented each the element h in the matrix
IjBe 0 or 1, h wherein
Ij=0 expression user i has successfully received packet j, h
Ij=1 expression user i lost data packets j, then packet j becomes erroneous packets; At this moment, described step S1 specifically comprises step:
S101 goes exchange to packet loss table matrix H, form new packet loss table matrix H ', so that new packet loss table during matrix H ' i is capable 1 quantity capable more than or equal to i+1 in 1 quantity;
S102 sets up selection matrix G, initialization G=H ';
S103, G proceeds as follows for selection matrix: selection the first two matrix element is 1 position from the first row, the packet of this position representative is put into set A, be matrix element zero setting in row corresponding to 1 position to all the other elements of matrix G the first row, the selection matrix G that obtains upgrading; Then carry out line by line the operation identical with above-mentioned steps S103, until the operation of all row all finishes, thereby obtain the selection matrix G of this wheel load crossing, all contain the set that the bag of the row correspondence of element 1 forms and are A among the selection matrix G.
2. coded data bag repeating method Network Based as claimed in claim 1, it is characterized in that, in step S1, information source selects the principle of the packet that each user need to recover to be: make set A as far as possible large, guarantee simultaneously to only have at most two from same user's erroneous packets in the set A.
3. coded data bag repeating method Network Based as claimed in claim 1 or 2 is characterized in that, in step S2, and specified data bag b
iPrinciple as follows:
For user i, if should the wheel re-transmission need to recover an one erroneous packets a
I1, b then
i=a
I1
For user i, if should the wheel re-transmission need to recover two erroneous packets a
I1And a
I2, then:
Wherein, q represents that this is a
I1And a
I2Q wheel retransmit, l is non-zero positive integer, or represents to choose arbitrarily a
I1And a
I2In one transmit.
4. coded data bag repeating method Network Based as claimed in claim 1 or 2 is characterized in that the user utilizes associated detecting method to decipher among the step S4.
5. coded data bag repeating method Network Based as claimed in claim 4 is characterized in that, described associated detecting method is maximum likelihood associated detecting method or bit level merging associated detecting method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010574058 CN102013966B (en) | 2010-11-30 | 2010-11-30 | Data packet retransmission method based on network coding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010574058 CN102013966B (en) | 2010-11-30 | 2010-11-30 | Data packet retransmission method based on network coding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102013966A CN102013966A (en) | 2011-04-13 |
| CN102013966B true CN102013966B (en) | 2013-03-27 |
Family
ID=43843997
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010574058 Active CN102013966B (en) | 2010-11-30 | 2010-11-30 | Data packet retransmission method based on network coding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102013966B (en) |
Families Citing this family (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102497253B (en) * | 2011-12-16 | 2014-06-11 | 哈尔滨工业大学 | Method based on network coding for transmitting data in cognitive subnetwork |
| CN102638331B (en) * | 2012-03-16 | 2014-07-09 | 北京邮电大学 | Wireless reliable broadcasting method based on random linear network code |
| CN102594529A (en) * | 2012-03-16 | 2012-07-18 | 哈尔滨工业大学深圳研究生院 | Transmitting terminal radio retransmission method and system based on network code |
| CN103107875B (en) * | 2013-01-31 | 2015-07-15 | 西安电子科技大学 | Broadcast retransmission system based on network coding and method thereof |
| WO2014205724A1 (en) * | 2013-06-27 | 2014-12-31 | 华为技术有限公司 | Automatic retransmission processing method, transmitting end device and receiving end device |
| CN103546245B (en) * | 2013-11-05 | 2016-06-15 | 重庆邮电大学 | A kind of data package retransmission method of coding Network Based |
| CN104539546A (en) * | 2015-01-19 | 2015-04-22 | 中国人民解放军国防科学技术大学 | GEO satellite network BGP routing multicast transmission method based on network encoding |
| CN105162558B (en) * | 2015-04-10 | 2018-12-07 | 中国人民解放军理工大学 | The data broadcasting method of joint maximal degree chance transmission and network code ARQ |
| CN104852788B (en) * | 2015-05-20 | 2018-03-13 | 中国人民解放军理工大学 | Data broadcasting ARQ methods based on minimax network code |
| CN105099955B (en) * | 2015-06-03 | 2020-03-17 | 香港中文大学深圳研究院 | Algebraic exchange system with network coding function and coding algorithm thereof |
| CN106027208A (en) * | 2016-04-29 | 2016-10-12 | 中国科学院信息工程研究所 | Feedback-based network code TCP (Transmission Control Protocol) decoding method and device |
| CN106254044B (en) * | 2016-09-14 | 2020-02-07 | 西北工业大学 | Dynamic linear combination retransmission method based on multicast network coding |
| CN106888073A (en) * | 2017-01-06 | 2017-06-23 | 国网新疆电力公司电力科学研究院 | Transmission line of electricity wireless network instructs transmission method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101394299A (en) * | 2008-10-13 | 2009-03-25 | 北京邮电大学 | Application of network encoding and constellation overlapped encoding combination in mobile communication |
| CN101714915A (en) * | 2009-11-02 | 2010-05-26 | 清华大学 | Data retransmission method and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8279781B2 (en) * | 2008-08-28 | 2012-10-02 | Massachusetts Institute Of Technology | Random linear network coding for time division duplexing |
-
2010
- 2010-11-30 CN CN 201010574058 patent/CN102013966B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101394299A (en) * | 2008-10-13 | 2009-03-25 | 北京邮电大学 | Application of network encoding and constellation overlapped encoding combination in mobile communication |
| CN101714915A (en) * | 2009-11-02 | 2010-05-26 | 清华大学 | Data retransmission method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102013966A (en) | 2011-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102013966B (en) | Data packet retransmission method based on network coding | |
| US6697987B2 (en) | Method of packet data transfer with hybrid ARQ | |
| CN102638331B (en) | Wireless reliable broadcasting method based on random linear network code | |
| KR100656982B1 (en) | Apparatus and method for decoding of portable internet mobile system | |
| EP1298829A1 (en) | HARQ techniques for multiple antenna systems | |
| US7650560B2 (en) | Packet transmission apparatus and method using optimized punctured convolution codes | |
| US8060802B2 (en) | Automatic repeat request (ARQ) apparatus and method of multiple input multiple output (MIMO) system | |
| US11252603B2 (en) | Retransmission schemes based on LLR combining in WLAN | |
| US20090031185A1 (en) | Hybrid arq systems and methods for packet-based networks | |
| US20020150040A1 (en) | Partial puncture retransmission | |
| WO2010046956A1 (en) | Transmitting device, receiving device, communication system, and communication method using adaptive hybrid-automatic retransmission request method | |
| US7889696B2 (en) | Retransmission method and apparatus using multiple mother codes in a system using HARQ | |
| CN102497248B (en) | Data retransmission method based on network coding | |
| CN101809920A (en) | Rate matching for a wireless communications system | |
| CN101286825A (en) | Hybrid automatic retransmitting method based on reliability, transmitting terminal and system thereof | |
| CN101136722A (en) | Data transmitting method and transmitting equipment suitable for high speed mobile terminal | |
| CN102340375A (en) | Data transmission management system and relative data transmission management method | |
| CN104486052A (en) | Multicast retransmission method and device based on D2D cluster under high packet loss probability | |
| CN107409023A (en) | A kind of data merged in layer domain and the method and apparatus for retransmitting data | |
| CN101394299B (en) | Method of network encoding and constellation overlapped encoding combination in mobile communication | |
| WO2009020336A1 (en) | Method and system for retransmitting data in a communication system | |
| EP2210360B1 (en) | Apparatus and method for decoding in mobile communication system | |
| CN104852788A (en) | Data broadcast ARQ method based on maximum-minimum network encoding | |
| CN102223216A (en) | Network coding hybrid automatic repeat request (HARQ) method in multicast transmission | |
| CN102208962B (en) | Wireless data transmission method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent for invention or patent application | ||
| CB02 | Change of applicant information |
Address after: 100102 Beijing city Chaoyang District Wangjing Lize two Road No. 2 Wangjing science and Technology Park A block three layer Applicant after: BEIJING STARPOINT TECHNOLOGY CO., LTD. Address before: 100102 Beijing city Chaoyang District Wangjing Lize two Road No. 2 Wangjing science and Technology Park A block three layer Applicant before: Xingheliangdian Communication Software Co., Ltd., Beijing |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: APPLICANT; FROM: XINGHELIANGDIAN COMMUNICATION SOFTWARE CO LTD, BEIJING TO: BEIJING STARPOINT COMM. LTD. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |