CN101645761A - Method for sending and receiving redundancy version parameters of hybrid automatic retransmission - Google Patents
Method for sending and receiving redundancy version parameters of hybrid automatic retransmission Download PDFInfo
- Publication number
- CN101645761A CN101645761A CN200810144482A CN200810144482A CN101645761A CN 101645761 A CN101645761 A CN 101645761A CN 200810144482 A CN200810144482 A CN 200810144482A CN 200810144482 A CN200810144482 A CN 200810144482A CN 101645761 A CN101645761 A CN 101645761A
- Authority
- CN
- China
- Prior art keywords
- data
- packet
- value
- retransmission
- original contents
- 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.)
- Pending
Links
Images
Landscapes
- Detection And Prevention Of Errors In Transmission (AREA)
- Communication Control (AREA)
Abstract
The invention relates to a method for sending redundancy version parameters of hybrid automatic retransmission. A sending end sets a redundancy version RV parameter value of first transmission data as0 and sets an RV value of retransmission data as a non-zero value in an available RV set; and a receiving end takes a data packet in which the RV value is 0 as a first transmission data packet for processing, and takes the data packet in which the RV value is the non-zero value in the available RV set as a retransmission data packet for processing. The method distinguishes the first transmissiondata and the retransmission data by RV parameters, and does not use NDI so as to save the transmission of the bit of the NDI at an air interface and reduce the bandwidth overhead and transmission power overhead of the air interface.
Description
Technical field
The present invention relates to the communications field, relate in particular to a kind of redundancy version parameters sending, receiving method that mixes automatic re-transmission.
Background technology
HARQ (Hybrid Automatic Repeat reQuest, mix automatically and retransmit) be a kind of link adaptation techniques, receiving terminal data block of request transmitting terminal retransmits erroneous fast when exceeding self error correcting capability, therefore the variation of adaptive channel condition automatically, and insensitive to measure error and time delay.Existing HARQ technology has increased redundancy scheme: the data that receiving terminal will repeatedly transmit are decoded after merging.Comprise redundancy and systematic bits in the data retransmission simultaneously, can self-demarking code.
The HARQ function is made up of two-stage rate-matched submodule and a buffer.The first rate matched sub-block makes input bit and the soft buffer capacity of terminal be complementary the punch operation of mating.The second rate-matched submodule is complementary Bit data in the high speed descending sharing channel Transmission Time Interval of first rate matched sub-block output and the bit number in the high-speed downstream Physical Shared Channel frame by punching or repetitive operation.According to the importance of different transmitting channel informations,, guaranteed that the higher information of priority effectively transmits by the parameter on upper strata control decision punching or the quantity that repeats.In addition, existing HARQ technology is by being provided with RV (the Redundancy Version in the rate-matched, redundancy versions) parameter is selected the HARQ mechanism type, this error correcting capability with system is directly related, and can obtain time gain and coding gain by position and the rule that changes above-mentioned repetition or punching.
The HARQ information of eating dishes without rice or wine to transmit just is used to control the specifying information of HARQ process, comprising: redundancy versions of HARQ process number, incremental redundancy (RV) and NDI (New data indicator, new data indication); Above-mentioned information is used for transmitting terminal and receives data by HARQ process transmission data and receiving terminal by the HARQ process.Wherein, information related to the present invention has 2: RV and NDI.
When using RV, available RV has a set, and for example { 0,1,2,3} usually represents different redundancy versions by using the unit in the set successively.For a certain bag data, send for the first time, we are called " the first data that pass ", and " the first data that pass " use the redundancy versions of RV=0.If these bag data are received to rectify really do not receive, need to retransmit, we are called " data retransmission ".When retransmitting for the first time, increase the redundant information value, the redundancy versions value RV=1 that " data retransmission " uses; If also be not received upright really reception, need to retransmit, when retransmitting for the second time, continue increase redundant information value, the redundancy versions value RV=2 that " data retransmission " uses so; Equally, if also need to retransmit, when retransmitting for the third time, continue to increase the redundant information value, the redundancy versions value RV=2 that " data retransmission " uses; After this, in the time of the 4th time and more times re-transmission, the redundancy versions value RV=3 that " data retransmission " uses.But when re-transmission reaches certain number of times, transmitting terminal will stop corresponding HARQ process, and enable new HARQ process and resend this bag data, and new HARQ process is brought into use the redundancy versions value from RV=0.In addition, same HARQ process also may repeatedly be used RV=0 for the data of identical content in the prior art.In short, pass to each time re-transmission from head, the use order of RV can be: 0,1,2,3,0,1,2,3 ....
NDI is used to distinguish new data and data retransmission (being used for distinguishing different new datas in other words).When transmitting new data, the NDI value is added 1, constant during data retransmission.NDI has only 1 bit, so have only 2 values: 0 and 1.When transmitting the first bag new data, NDI is 0; When transmitting the second bag new data, NDI is 1; When transmitting the three guarantees new data, NDI is 0; So come to use successively NDI.And NDI is constant during data retransmission, and just: when the first bag new data (i.e. data retransmission of the first bag new data) when retransmitting, no matter be to retransmit for the first time or follow-up re-transmission, NDI is constant, and with first to wrap new data the same, value is 0; When retransmitting the second bag new data (i.e. the data retransmission of the second bag new data), no matter be to retransmit for the first time or follow-up re-transmission, NDI is constant, and is the same with the second bag new data, and value is 1; When retransmitting the three guarantees new data (i.e. the data retransmission of three guarantees new data), no matter be to retransmit for the first time or follow-up re-transmission re-transmission, NDI is constant, and is the same with the three guarantees new data, and value is 0.Be that the NDI that the head of same bag data passes data and data retransmission remains unchanged.
Before carrying out follow-up description, explanation new data and the first difference that passes data, data retransmission require emphasis:
Fig. 1 is the using method schematic diagram of NDI parameter in the prior art.The service regeulations of NDI are in the prior art: when passing new data, NDI added 1 (mould 2 adds, i.e. 0+1=1, and 1+1=0), NDI is constant during data retransmission.Fig. 1 is introduced the using method of NDI in the prior art to send 10 bag data instances, specifically describes as follows:
The 1st, 2,3 bag data, the original contents of transmission is all the same, is designated as original contents A.The 1st bag is that the head of original contents A passes data, and the 2nd, 3 bag is the data retransmission of original contents A.So the condition of the 1st bag data fit " biography new data " transmits original contents A, NDI adds 1 and equals 0 (supposing that initial NDI is 1).The 2nd, 3 bag data are data retransmissions of original contents A, and NDI is constant, is 0.
The 4th bag data, the original contents of transmission is designated as original contents B, and A is different with original contents, meets the condition of " biography new data ", equals 1 so the NDI of the 4th bag data adds 1; Original contents B does not have data retransmission.
The 5th bag data, the original contents of transmission is designated as original contents C, and B is different with original contents, meets the condition of " biography new data ", equals 0 so the NDI of the 5th bag data adds 1; 6th, 7,8,9 bag data are data retransmissions of original contents C, and NDI is constant, is 0.
The 10th bag data, the original contents of transmission is designated as original contents D, and C is different with original contents, meets the condition of " biography new data ", equals 1 so the NDI of the 10th bag data adds 1; Original contents D does not have data retransmission.
As seen, the effect of NDI is as follows:
Because RV and NDI information are most important HARQ control informations, send eating dishes without rice or wine with high frequency; Therefore need the transmission efficiency of RV and NDI information that bandwidth and transmitting power are had bigger influence.For example: RV takies 2 bits, and NDI takies 1 bit, and RV and NDI information are being eated dishes without rice or wine transmission once every 1 millisecond; Then RV and NDI information per second take the bandwidth of three kilobits, and have consumed the transmitting power of corresponding bit.
Summary of the invention
Technical problem to be solved by this invention is, overcomes the deficiencies in the prior art, and a kind of RV parameter sending, receiving method that reduces the HARQ that bandwidth occupancy and transmitting power consume is provided.
In order to address the above problem, the invention provides a kind of redundancy version parameters sending method of mixing automatic re-transmission, the redundancy versions that transmitting terminal head passes data is that the RV parameter value is set to 0, and the RV value of data retransmission is set to non-0 value in the available RV set.
In addition, described available RV set is: { R
0, R
1..., R
n; Wherein, R
0=0, and 0＜R
1＜...＜R
nN＞1.
In addition, when transmitting terminal retransmitted in the original contents that same first biography data are comprised, the RV value that this head passes i retransmission data packet may of data correspondence was set to R
i1≤i＜n;
Pass the later retransmission packet of data correspondence for this head, its RV value is set to R
n
In addition, transmitting terminal is to same first when passing original contents that data comprise and retransmitting, and for k * n retransmission data packet may of (k-1) * n+1 to the, uses described available RV each non-0 value in gathering in regular turn according to ascending order;
Wherein, k is the integer greater than 0.
The present invention also provides a kind of redundancy version parameters method of reseptance that mixes automatic re-transmission, receiving terminal is that 0 packet passes packet as head and handles with the RV value that receives, and the RV value is handled as retransmission data packet may for the packet of non-0 value in the available RV set.
In addition, described available RV set is: { R
0, R
1..., R
n; R
0=0, and 0＜R
1＜...＜R
nN＞1;
When receiving terminal receives the retransmission data packet may of following after head passes packet, the RV value is equaled R
iPacket handle as described first i the retransmission data packet may that passes the packet correspondence; The RV value is equaled R
nPacket handle as described first n+j the retransmission data packet may that passes the packet correspondence according to the reception order;
Wherein, 1≤i＜n; J 〉=0.
In addition, described available RV set is: { R
0, R
1..., R
n; R
0=0, and 0＜R
1＜...＜R
nN＞1;
When receiving terminal receives k * n the retransmission data packet may of (k-1) * n+1 to the of following after head passes packet, if its RV value is R
i, then with its (k-1) * n+R as described first biography packet correspondence
iIndividual retransmission data packet may is handled;
Wherein, 1≤i≤n.
In sum, the present invention utilizes the RV parameter to distinguish first data and the data retransmission of passing, and does not re-use NDI, thereby in the transmission of eating dishes without rice or wine to save this bit of NDI, the transmitting power expense that has reduced the bandwidth cost of eating dishes without rice or wine and eated dishes without rice or wine.
Description of drawings
Fig. 1 is a NDI parameter using method schematic diagram in the prior art;
Fig. 2 is the using method schematic diagram of embodiment of the invention RV parameter;
Fig. 3 is the sending method flow chart of embodiment of the invention RV parameter;
Fig. 4 is the method for reseptance flow chart of embodiment of the invention RV parameter.
Embodiment
Eat dishes without rice or wine in the design, the use of each bit all needs special consideration, to reduce unnecessary bandwidth cost and unnecessary transmitting power expense.
Core concept of the present invention is, in the mixed automatic repeat request process, use redundancy versions (RV) to substitute new data indication (NDI), (RV) distinguishes new data and data retransmission by redundancy versions, do not re-use new data indication (NDI), thereby in the transmission of eating dishes without rice or wine to save this bit of NDI, bandwidth cost of eating dishes without rice or wine with reduction and the transmitting power expense of eating dishes without rice or wine.
Describe the present invention below in conjunction with drawings and Examples.
Fig. 2 is the using method schematic diagram of embodiment of the invention RV parameter.In the present embodiment, suppose available RV set for 0,1,2,3}; Non-0 element is 1 or 2 or 3.Fig. 2 is introduced the using method of RV of the present invention to send 10 bag data instances, specifically describes as follows:
The RV service regeulations of present embodiment are: the RV that head passes data is set to 0; The RV of data retransmission is set to non-0.When head passes new data, RV is reset to 0.
The 1st, 2,3 bag data, the original contents of transmission is all the same, is designated as original contents A.The 1st bag is that the head of original contents A passes data, and the 2nd, 3 bag is the data retransmission of original contents A.So the 1st bag data fit " the first data that pass " condition is that the head of original contents A passes data, RV is set to 0; The 2nd, 3 bag is the data retransmission of original contents A, and RV is set to non-0.Transmit leg selects suitable redundancy versions that the RV value is set from non-0 element 1 or 2 or 3; For example, the RV of the 2nd bag data is set to 1, the 3 RV that wraps data and is set to 2.
The 4th bag data, the original contents of transmission is designated as original contents B, and A is different with original contents, meets the condition of " the first new data that passes ", so the RV of the 4th bag data is reset to 0; Original contents B does not have data retransmission.
The 5th bag data, the original contents of transmission is designated as original contents C, and B is different with original contents, meets the condition of " the first new data that passes ", so the RV of the 5th bag data is reset to 0; 6th, 7,8,9 bags are data retransmissions of original contents C, and RV is set to non-0; Transmit leg selects suitable redundancy versions that the RV value is set from non-0 element 1 or 2 or 3, for example, the 6th the bag data RV be set to 1, the 7 the bag data RV be set to 2, the 8 the bag data RV be set to 3, the 9 the bag data RV be set to 3.
The 10th bag data, the original contents of transmission is designated as original contents D, and C is different with original contents, meets the condition of " the first new data that passes ", so the RV of the 10th bag data is reset to 0; Original contents D does not have data retransmission.
As seen, adopt the using method of above-mentioned RV parameter of the present invention, can replace the NDI parameter, play following effect:
NDI among Fig. 1 jumps to 1 from 0, perhaps jumps to 0 from 1, illustrates and new legacy data takes place alternately.For example, among Fig. 1, NDI jumps to 1 from 0, new legacy data takes place alternately, the original contents C of the original contents A of the original contents B replace old data of new data and the original contents D replace old data of new data;
RV among Fig. 2 is provided with or resets to 0, illustrates new legacy data to take place alternately.For example, among Fig. 2, RV is provided with or resets to 0, the original contents C of the original contents B of the original contents A of the original contents B replace old data of new data and the original contents C replace old data of new data and the original contents D replace old data of new data.
NDI keeps 0 among Fig. 1, perhaps keeps 1, has identified between the initial sum terminator of this piece new data.For example, among Fig. 1, NDI keeps 0 for the first time, and the starting point that has identified this piece new data is the 1st bag data, and terminating point is the 3rd bag data; The 1st, 2,3 bag data during this time, the original contents of transmission is all the same, is A;
From " RV be provided with or reset to 0 " to " RV resets to 0 previous non-0 RV next time ", identified the starting point and the terminating point in this piece new data interval among Fig. 2.For example, among Fig. 2, between " RV is set to 0 " to " RV resets to 0 previous non-0 RV next time ", the starting point that has identified this piece new data is the 1st bag data, and terminating point is the 3rd bag data; The 1st, 2,3 bag data during this time, the original contents of transmission is all the same, is A.
Be described respectively below in conjunction with the sending method and the method for reseptance of accompanying drawing embodiment of the invention RV parameter.
Fig. 3 is the sending method flow chart of embodiment of the invention RV parameter, specifically may further comprise the steps:
Step 310: after the RV that the head of transmitting terminal first bag new data passes data is set to 0, send eating dishes without rice or wine.
Step 320: after the RV of transmitting terminal data retransmission is set to non-0 value, in the transmission of eating dishes without rice or wine; Follow-up have a then repeated execution of steps 320 of data retransmission; No data retransmission then changes step 330 over to;
Non-0 RV is a certain non-0 element in the available RV set, and transmitting terminal is selected one and retransmitted.When transmitting terminal retransmits, when just sending data retransmission, be merely able to use the element of non-0 in the available RV set.
If available RV set is { R
0, R
1, R
2..., R
N-1, R
n, wherein, R
0=0, R
1, R
2..., R
nAll greater than 0, and R
1＜R
2＜...,＜R
N-1＜R
nWhen same first biography data were retransmitted, the use order of non-0 element in the RV set can be: R
1, R
2..., R
N-1, R
n, R
n, R
n....
Step 330: after when transmitting terminal sends follow-up head and passes new data, its RV value being reset to 0, in the transmission of eating dishes without rice or wine; The follow-up step 320 that changes over to when carrying out the re-transmission of data; The head that carries out data passes then execution in step 330.
Fig. 4 is the method for reseptance flow chart of embodiment of the invention RV parameter, specifically may further comprise the steps:
Step 401: receiving terminal obtains RV information from eating dishes without rice or wine, the RV value is judged: if RV is 0, then execution in step 402; If RV is non-0, then execution in step 403;
402: head passed jump to step 401 after data are handled;
403: jump to step 401 after data retransmission handled;
If available RV set is { R
0, R
1, R
2..., R
N-1, R
n, wherein, R
0=0, R
1, R
2..., R
nAll greater than 0, and R
1＜R
2＜...,＜R
N-1＜R
nReceiving terminal receives the RV value and is R
1～R
N-1Packet after, identifying it is the 1st～n-1 retransmission data packet may, the RV value that continued access is then received is R
nPacket then handle i 〉=0 respectively as n+i retransmission data packet may according to the reception order.
Receiving terminal receive x first when passing first k * n the retransmission data packet may of (k-1) * n+1 to that passes between the packet of packet and x+1, be R as if its RV value
i, then with its (k-1) * n+R as described x first biography packet correspondence
iIndividual retransmission data packet may is handled; 1≤i＜n.
Based on basic principle of the present invention, the foregoing description can also have multiple expansion and variation pattern, for example:
When comprising a plurality of non-0 value in the available RV set, pass a plurality of data retransmissions of data for identical head, transmitting terminal can be reused available RV each non-0 value in gathering in regular turn as its RV value; Correspondingly, receiving terminal can retransmit according to the identical first not homogeneous that passes data of the variation identification of non-0 RV value.
For example, available RV set is: { 0,1,2,3} retransmits use RV=1 for the first time, retransmits the second time and uses RV=2, retransmits use RV=3 for the third time, and RV=1 is used in the 4th re-transmission, analogizes in proper order.Certainly, also can be: retransmit for the first time and use RV=3, the second time, RV=2 be used in re-transmission, retransmitted for the third time and used RV=1, and the 4th re-transmission use RV=3 analogizes in proper order.
Receiving terminal identifies corresponding retransmission data packet may for retransmitting for the first time according to the RV value (=1) of following after 0; (follow after the retransmission data packet may of RV=3) when RV=1 occurring once more, identifying corresponding retransmission data packet may is the 4th re-transmission, and the rest may be inferred.
Claims (7)
1, a kind of redundancy version parameters sending method of mixing automatic re-transmission is characterized in that,
The redundancy versions that transmitting terminal head passes data is that the RV parameter value is set to 0, and the RV value of data retransmission is set to non-0 value in the available RV set.
2, the method for claim 1 is characterized in that,
Described available RV set is: { R
0, R
1..., R
n; Wherein, R
0=0, and 0＜R
1＜...＜R
nN＞1.
3, method as claimed in claim 2 is characterized in that,
When transmitting terminal retransmitted in the original contents that same first biography data are comprised, the RV value that this head passes i retransmission data packet may of data correspondence was set to R
i1≤i＜n;
Pass the later retransmission packet of data correspondence for this head, its RV value is set to R
n
4, method as claimed in claim 2 is characterized in that,
Transmitting terminal is to same first when passing original contents that data comprise and retransmitting, and for k * n retransmission data packet may of (k-1) * n+1 to the, uses described available RV each non-0 value in gathering in regular turn according to ascending order;
Wherein, k is the integer greater than 0.
5, a kind of redundancy version parameters method of reseptance that mixes automatic re-transmission is characterized in that,
Receiving terminal is that 0 packet passes packet as head and handles with the RV value that receives, and the RV value is handled as retransmission data packet may for the packet of non-0 value in the available RV set.
6, method as claimed in claim 5 is characterized in that,
Described available RV set is: { R
0, R
1..., R
n; R
0=0, and 0＜R
1＜...＜R
nN＞1;
When receiving terminal receives the retransmission data packet may of following after head passes packet, the RV value is equaled R
iPacket handle as described first i the retransmission data packet may that passes the packet correspondence; The RV value is equaled R
nPacket handle as described first n+j the retransmission data packet may that passes the packet correspondence according to the reception order;
Wherein, 1≤i＜n; J 〉=0.
7, method as claimed in claim 5 is characterized in that,
Described available RV set is: { R
0, R
1..., R
n; R
0=0, and 0＜R
1＜...＜R
nN＞1;
When receiving terminal receives k * n the retransmission data packet may of (k-1) * n+1 to the of following after head passes packet, if its RV value is R
i, then with its (k-1) * n+R as described first biography packet correspondence
iIndividual retransmission data packet may is handled;
Wherein, 1≤i≤n.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810144482A CN101645761A (en) | 2008-08-05 | 2008-08-05 | Method for sending and receiving redundancy version parameters of hybrid automatic retransmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810144482A CN101645761A (en) | 2008-08-05 | 2008-08-05 | Method for sending and receiving redundancy version parameters of hybrid automatic retransmission |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101645761A true CN101645761A (en) | 2010-02-10 |
Family
ID=41657489
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200810144482A Pending CN101645761A (en) | 2008-08-05 | 2008-08-05 | Method for sending and receiving redundancy version parameters of hybrid automatic retransmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101645761A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102255710A (en) * | 2011-04-15 | 2011-11-23 | 电信科学技术研究院 | Method and device for storing encoding block |
| CN103312473A (en) * | 2012-03-06 | 2013-09-18 | 中兴通讯股份有限公司 | Method and device for reducing HARQ (Hybrid Automatic Repeat Request) combination failures |
| WO2016106648A1 (en) * | 2014-12-31 | 2016-07-07 | Qualcomm Incorporated | Systems and methods for information recovery from redundancy version packets |
| CN110431779A (en) * | 2017-03-24 | 2019-11-08 | 瑞典爱立信有限公司 | For detecting network node, UE and the method therein of the transmission for the data damaged since data are punched |
-
2008
- 2008-08-05 CN CN200810144482A patent/CN101645761A/en active Pending
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102255710A (en) * | 2011-04-15 | 2011-11-23 | 电信科学技术研究院 | Method and device for storing encoding block |
| CN102255710B (en) * | 2011-04-15 | 2014-01-29 | 电信科学技术研究院 | Method and device for storing encoding block |
| CN103312473A (en) * | 2012-03-06 | 2013-09-18 | 中兴通讯股份有限公司 | Method and device for reducing HARQ (Hybrid Automatic Repeat Request) combination failures |
| CN103312473B (en) * | 2012-03-06 | 2017-09-29 | 中兴通讯股份有限公司 | Reduce the method and apparatus that HARQ merges failure |
| WO2016106648A1 (en) * | 2014-12-31 | 2016-07-07 | Qualcomm Incorporated | Systems and methods for information recovery from redundancy version packets |
| US10530535B2 (en) | 2014-12-31 | 2020-01-07 | Qualcomm Incorporated | Systems and methods for information recovery from redundancy version packets |
| CN110431779A (en) * | 2017-03-24 | 2019-11-08 | 瑞典爱立信有限公司 | For detecting network node, UE and the method therein of the transmission for the data damaged since data are punched |
| CN110431779B (en) * | 2017-03-24 | 2022-05-27 | 瑞典爱立信有限公司 | Node, UE and method for detecting data transmission due to data puncturing damage |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4198910B2 (en) | Method for transmitting and receiving subpackets in a parallel channel encoder packet transmission system | |
| CN115118396B (en) | Method, system and wireless receiver for retransmitting data in wireless network | |
| US8650449B2 (en) | Encoder, decoder, encoding method, and decoding method | |
| CN100375538C (en) | Method for multimedia communication over packet channels | |
| US6697987B2 (en) | Method of packet data transfer with hybrid ARQ | |
| CN101562781B (en) | Self-adapting fountain code multicast transmission system based on modulation | |
| CN101667904B (en) | All-in-one feedback retransmission method based on fountain codes | |
| EP2093921A1 (en) | Method and system for memory management in a harq communication system | |
| US20090031185A1 (en) | Hybrid arq systems and methods for packet-based networks | |
| CN101217352B (en) | A buffering setting method of phase rate matching | |
| CN101529785A (en) | HARQ in spatial multiplexing MIMO system | |
| CN102340375A (en) | Data transmission management system and related data transmission management method thereof | |
| CN113132063B (en) | Physical layer retransmission control method | |
| CN1509027A (en) | Multimedium communication method and apparatus on grouped channels | |
| CN103312478A (en) | Method and system for data transmission in a data network | |
| CN102694636A (en) | Transmitting and receiving methods and systems of HARQ (hybrid automatic repeat request) technology adopting fountain codes | |
| EP1776797B1 (en) | Packet-based data processing technique, transmission and reception | |
| CN102957511A (en) | Adaptive deceleration method of data transmission | |
| US7746953B1 (en) | Method and apparatus for asynchronous incremental redundancy transmission in a communication system | |
| CN103414543B (en) | A kind of method adjusting HARQ buffer memory and terminal | |
| CN101645761A (en) | Method for sending and receiving redundancy version parameters of hybrid automatic retransmission | |
| CN101964703A (en) | Data retransmission method and system | |
| CN100591000C (en) | Classification and Combination Transmission Method of Multi-user Feedback Information in Base Station | |
| US20130070581A1 (en) | Controlling Data Transmission | |
| CN101785233A (en) | Methods and apparatuses for transmitting non-decodable packets |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20100210 |