[go: up one dir, main page]

EP1133848A1 - Accuse de reception positif/accuse de reception negatif en bande passante - Google Patents

Accuse de reception positif/accuse de reception negatif en bande passante

Info

Publication number
EP1133848A1
EP1133848A1 EP99963752A EP99963752A EP1133848A1 EP 1133848 A1 EP1133848 A1 EP 1133848A1 EP 99963752 A EP99963752 A EP 99963752A EP 99963752 A EP99963752 A EP 99963752A EP 1133848 A1 EP1133848 A1 EP 1133848A1
Authority
EP
European Patent Office
Prior art keywords
sequence number
data blocks
received data
field
ack
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.)
Withdrawn
Application number
EP99963752A
Other languages
German (de)
English (en)
Inventor
Farooq Khan
Stefan JÄVERBRING
Anders FURUSKÄR
Mattias Wallman
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Priority claimed from US09/345,961 external-priority patent/US6367045B1/en
Application filed by Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of EP1133848A1 publication Critical patent/EP1133848A1/fr
Withdrawn legal-status Critical Current

Links

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/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/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1809—Selective-repeat protocols
    • 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
    • H04L1/1614—Details of the supervisory signal using bitmaps
    • 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
    • H04L1/1621—Group acknowledgement, i.e. the acknowledgement message defining a range of identifiers, e.g. of sequence numbers

Definitions

  • the present invention generally relates to error handling in the field of communication systems and, more particularly, to error handling using both automatic repeat request (ARQ) and variable rate transmission techniques in digital communication systems.
  • Variable rate transmission in a radio communication system can be achieved using several methods.
  • a CDMA Code Division Multiple Access
  • variable rate transmission is generally achieved by using different numbers of time slots.
  • the data transmission rate also varies as a function of the modulation and coding scheme used for mapping data bits to channel bits/symbols.
  • EDGE Enhanced Data Rates for Global Evolution
  • EDGE is an example of a system that uses different modulation and coding schemes, in addition to a variable number of time slots, to achieve different transmission rates of user data.
  • the different modulation and coding schemes used in the EDGE system, MCS-1 through MCS-6 have various pay load sizes, differing for example in increments of 25 octets as shown in FIG. 1.
  • FIG. 2 summarizes the different block sizes, code rates, and payload sizes for the different modulation and coding schemes MCS-1 through MCS-6.
  • the modulation schemes can include PSK (Phase Shift Keying) and GMSK (Gaussian Minimum Shift Keying).
  • the modulation schemes can include PSK (Phase Shift Keying) and GMSK (Gaussian Minimum Shift Keying).
  • a block numbering scheme depending upon a payload in a block is disclosed in co-pending U.S. Patent Application Serial Number 09/120,163, entitled “Method and Apparatus for Minimizing Overhead in a Communication System", which is hereby incorporated by reference.
  • the basic principle of the numbering scheme is illustrated in FIG. 3.
  • the block sequence numbers (SNs) can be integer multiples of an identification number of a currently used modulation and coding scheme, or can be separated by a step equal in magnitude to the identification number.
  • the current modulation and coding scheme is MCS-6
  • blocks in a sequence can be assigned sequence numbers 6, 12 and 18.
  • the round trip time (RTT) shown in FIG. 3 refers to an amount of time that elapses between when one or more blocks are sent, and when acknowledgment for them is received. As shown in FIG.
  • the payload size of a block for a current modulation and coding scheme can be defined as a number of octets that is equal to a product of the identification number of the current modulation and coding scheme and a block size increment between modulation and coding schemes.
  • the initially transmitted data can be resegmented into different size blocks, or different blocks having different payload sizes, and the different size blocks can be renumbered accordingly.
  • block 12 of the MCS-6 scheme containing a payload of 150 octets
  • block 9 and 12 each containing a payload of 75 octets
  • This procedure can be repeated as necessary or appropriate. If, for example, as shown in FIG.
  • the retransmitted block 9 is not correctly received, then it can be resegmented into three blocks 7, 8 and 9 each containing a payload of 25 octets in accordance with the MCS-1 scheme, and resent as the new blocks 7, 8 and 9.
  • data can be retransmitted using a modulation and coding scheme that is appropriate at the time of retransmission.
  • the data can be retransmitted using a modulation and coding scheme that is optimal, and/or better at the time of the retransmission than the scheme used for the initial or previous transmission of the data.
  • Multiple blocks of data can also be resegmented into a fewer number of blocks for retransmission.
  • the two blocks 4 and 6 of the MCS-2 scheme can be combined to form the single block 6 of the scheme MCS-4 and retransmitted accordingly.
  • the payload of the MCS-4 scheme block 6 can be formed by concatenating the payloads of the blocks 4 and 6 of the MCS-2 scheme.
  • the resulting concatenated block is identified with the sequence number 6 of the second block.
  • the resulting combined block can be identified with the sequence number of any appropriate block in the series.
  • the combined block can be identified with the sequence number of the first block in the series, or the sequence number of the middle block, and so forth.
  • ACK/NACK (positive acknowledgment/negative acknowledgment) messages can include a Received Block Bitmap (RBB) field format 506 having a Start Sequence Number (SSN) 502 followed by a bitmap 504.
  • the bitmap 504 contains an acknowledgment for each possible sequence number in a sequence of data blocks starting with a block whose SN has the same value as that of the SSN 502.
  • a receiver must positively or negatively acknowledge all sequence numbers represented in an RBB field having the format 506, regardless of whether all of the sequence numbers are actually used to transmit data blocks.
  • FIG. 6 shows an RBB field 606 having the format 506.
  • a single bit in the bitmap 506 can be used to acknowledge a block.
  • Block sequence numbers of blocks acknowledged in the bitmap 506 correspond to bits in the bitmap 506 in a left-to-right, top-to-bottom order.
  • the bitmap 506 includes a bit for each possible sequence number between the beginning and ending block sequence numbers of an ordered sequence of blocks.
  • bits in the bitmap represent or acknowledge blocks having sequence numbers that are separated by a minimum step, regardless of whether the step in a particular ordered sequence of blocks is greater than the minimum step.
  • both used and unused SNs are represented or acknowledged in the bitmap 506.
  • every third bit in the bitmap 506 indicates the acknowledgment status of a block in a 12-block sequence.
  • the sequence starts (as indicated by the SSN 602) with data block 15, and includes blocks having SNs of 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45 and 48.
  • SSN 602 the sequence starts (as indicated by the SSN 602) with data block 15, and includes blocks having SNs of 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45 and 48.
  • blocks having SNs of 15, 18, 30 and 39 are each represented by three bits having a zero value, indicating that the blocks having SNs of 15, 18, 30 and 39 are negatively acknowledged (NACKed) and need to be retransmitted.
  • unused SNs of 16, 17, 19, 20, 22, 23, 26, 26, 28, 29, 31, 32, 34, 35, 37, 38, 40, 41, 43, 44, 46, 47, 49 and 50 are also acknowledged.
  • the RBB format shown in FIG. 5 is poorly suited for positively and negatively acknowledging transmitted blocks in a system that uses variable rate data transmission, and skips block sequence numbers depending on the rate used.
  • the RBB format would require a separate acknowledgment for each of sequence numbers ⁇ 1, 2, 3, 4, 5, ...6*N ⁇ , even though only the sequence numbers ⁇ 6, 12, 18, ...6*N ⁇ need to be considered.
  • the RBB format requires unnecessarily large overheads when used in a system that employs variable rate data transmission and skips block sequence numbers depending on the rate used.
  • a method and technique are provided for efficiently acknowledging transmitted information in a system that employs variable rate data transmission, and skips data block sequence numbers depending on the transmission rate used.
  • the ACK NACK overhead in a variable rate communication system is reduced by providing an RBB format that is more compact and which can therefore be transmitted and evaluated in less time. This conserves time and computing resources, and allows data to be retransmitted with less delay.
  • exemplary embodiments of the invention reduce an amount of time between a first transmission of data and a subsequent retransmission of the data.
  • an RBB field in an ACK/NACK message includes a starting sequence number, an indication of a sequence number step, and a bitmap.
  • the starting sequence number indicates a first block in a series of transmitted blocks that are being acknowledged via the ACK/NACK message.
  • the sequence number step is a minimum difference between sequence numbers of blocks in the series. Where the series is ordered, the sequence number step is a difference between the sequence numbers of adjacent or consecutive blocks in the series.
  • the bitmap can be configured so that each bit in the bitmap represents an acknowledgment of one of the blocks in the series.
  • the RBB field in the ACK/NACK message includes multiple starting sequence numbers, and both a sequence number step and a length for each starting sequence number.
  • Each set of starting sequence number, sequence number step and length indicates a subseries or subsequence of the series of transmitted blocks that is being acknowledged via the ACK/NACK message.
  • the starting sequence number indicates a sequence number of a first block in the subsequence
  • the length indicates how many blocks are in the subsequence
  • the sequence number step indicates a difference between sequence numbers of adjacent blocks in the subsequence.
  • FIG. 1 shows various payload sizes of different modulation and coding schemes used in the EDGE system.
  • FIG. 2 shows different block sizes, code rates, and payload sizes for the different modulation and coding schemes used in the EDGE system.
  • FIG. 3 illustrates a block numbering system that is based on the payload sizes of different blocks , and shows how data can be resegmented into more blocks for retransmission.
  • FIG. 4 illustrates how data can be resegmented into fewer blocks for retransmission.
  • FIG. 5 shows a received block bitmap (RBB) format of an RBB field in a positive acknowledgment/negative acknowledgment (ACK/NACK) message, that is known in the prior art.
  • RBB received block bitmap
  • FIG. 6 shows a specific example of an RBB field in an ACK/NACK message, that has the format shown in FIG. 5.
  • FIG. 7 shows an RBB format of an RBB field in an ACK/NACK message, in accordance with an exemplary embodiment of the invention.
  • FIG. 8 shows a specific example of an RBB field in an ACK/NACK message, that has the format shown in FIG. 7.
  • FIG. 9 shows an RBB format of an RBB field in an ACK/NACK message, in accordance with an exemplary embodiment of the invention.
  • FIG. 10 shows a specific example of an RBB field in an ACK/NACK message, that has the format shown in FIG. 9.
  • FIG. 11 A shows an RBB format of an RBB field in an ACK/NACK message, in accordance with an exemplary embodiment of the invention.
  • FIG. 1 IB shows a specific example of an RBB field in accordance with the RBB format shown in FIG. 11 A.
  • FIG. 12 shows an RBB format of an RBB field in an ACK NACK message, in accordance with an exemplary embodiment of the invention.
  • FIG. 13 shows an RBB format of an RBB field in an ACK/NACK message, in accordance with an exemplary embodiment of the invention.
  • ACK/NACK message is used to positively or negatively acknowledge a plurality of received blocks.
  • a single sequence number step (SNS) is employed.
  • the SNS defines a difference between adjacent sequence numbers in an ordered sequence of block sequence numbers. This concept is illustrated, for example, in FIG. 7.
  • an RBB format 700 includes an SSN field 702, an SNS field 704, and a bitmap field 706.
  • the SNS can be, for example, an increment or a decrement, depending on whether the values in the ordered sequence increase or decrease.
  • FIG. 8 shows an RBB field 800 having the format 700.
  • the SSN 802 is 15, the SNS 804 is 3, and the bits in the bitmap 806 indicate which of the blocks have been successfully received, and which have not.
  • the bitmap 806 can be configured so that the sequence ascends from left to right and from top to bottom across the bitmap 806, and so that "0" indicates NACK and "1" indicates ACK. Given this configuration, the bitmap 806 indicates that blocks having SNs of 15, 18, 30 and 39 are negatively acknowledged and should therefore be retransmitted, and blocks having SNs of 21, 24, 27, 33, 36, 42, 45 and 48 are positively acknowledged.
  • 3 + 12) 15 bits total (3 for the SNS 804 and 12 for the bit map 806) are necessary to positively or negatively acknowledge each block in a sequence of 12 blocks having SNs of 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45 and 48.
  • 34 bits are necessary in the bit map 604 to acknowledge each block in the sequence ⁇ 15, 18, 21, ... 48 ⁇ . This reduction in the number of bits necessary to positively or negatively acknowledge each block in a sequence of blocks reduces overhead and increases efficiency.
  • the SSN 702 can negatively acknowledge the corresponding block implicitly.
  • the MCS-3 sequence (15, 18, 21, ... 45, 48) is to be acknowledged
  • the SSN 702 could alternatively be understood to positively acknowledge the corresponding block implicitly.
  • the SSN is always 0 (zero).
  • the SSN field 702 in the RBB format 700 can be omitted.
  • blocks in a sequence of blocks that has different sequence number steps can be positively or negatively acknowledged using the same RBB field.
  • a single RBB field can be used to acknowledge all blocks in a sequence, where the sequence includes subsequences of blocks and different subsequences can have different sequence number steps.
  • FIG. 9 shows an exemplary RBB field format 900 for representing a sequence of blocks, where the sequence can include subsequences of blocks that can each have a different sequence number step.
  • the RBB field format 900 also includes a step flags field 902.
  • Each bit in the step flags field 902 represents a different possible sequence number step, and functions as a flag for that step.
  • the step flags field 902 can be configured so that when a bit in the step flags field 902 is " 1 ", the corresponding flag is set, and when the bit is "0", the corresponding flag is not set.
  • Each subsequence of blocks in the sequence is defined using a pair 904 of a starting sequence number (SSN) of a first block in the subsequence, a number of blocks L in the subsequence, and one of the flags in the step flags field 902.
  • the RBB field format can be configured so that a first set flag in the step flags field 902 corresponds to a first pair 904, a second set flag in the step flags field 902 corresponds to a second pair 904, and so forth.
  • the "first" set flag can be, for example, the first flag encountered when moving from left to right across the field 902 that is set.
  • the "first" pair 904 can be, for example, the first pair 904 encountered when moving from top to bottom through a sequence of pairs 904 in the RBB field 900.
  • the first pair 904 can be the pair 904 including the SSN field 906 and the length field 908 as shown in FIG. 9.
  • the first set flag indicates the sequence number step for the subsequence of blocks corresponding to the first pair 904 and the first set flag.
  • the second set flag indicates the sequence number step for the subsequence of blocks corresponding to the second pair 904, and so forth.
  • the SSN fields 906 and 910 of the pairs 904 can contain different SSNs from different subsequences, and the length fields 908 and 912 can each contain a number indicating a length of a corresponding subsequence.
  • the length of the subsequence can be, for example, a number of blocks in the subsequence. All of the blocks in the subsequences are acknowledged using bits in the bitmap 914.
  • FIG. 10 shows an exemplary RBB field 1000 having the format 900.
  • the step flags field 902 indicates which sequence number steps are present in a sequence of blocks represented by the field 1000.
  • the step flags field 902 represents steps in ascending value from left to right. For example, the flags corresponding to the steps or step values 1, 3 and 6 are set equal to "1", indicating that the sequence contains subsequences having the steps 1, 3 and 6. Pairs 1004 correspond to the steps present in the sequence, and are ordered in the field 1000 from top to bottom in descending step value.
  • the uppermost pair 1004 of an SSN 1006 and an L 1008 corresponds to the step having a value of 6.
  • the value 24 of the SSN 1006 indicates that the first block in the subsequence has an SN of 24.
  • the value 12 of the length L 1008 indicates that the subsequence is 12 blocks long.
  • the step 6 and the SSN 1006 and the L 1008 of the uppermost pair 1004 together represent or define a subsequence of blocks having SNs of 24, 30, 36, 42, 48, 54, 60, 66, 72, 78, 84 and 90.
  • a bitmap 1014 indicates which blocks in the sequence are positively acknowledged, and which are negatively acknowledged.
  • the bitmap 1014 is configured so that a bit value of " 1 " indicates that a corresponding block is positively acknowledged, and a bit value of "0" indicates that a corresponding block is negatively acknowledged.
  • the subsequences represented in top to bottom order of the pairs 1004 are represented in left to right and top to bottom order in the bitmap 1014.
  • the block SNs within the subsequences are represented in ascending order left to right and top to bottom in the bitmap 1014.
  • the bits in the bitmap 1014 indicate that blocks having the SNs of 24, 48, 54, 66, 84, 93, 96, 108, 112 and 115 are negatively acknowledged and need to be retransmitted.
  • step flags field 902 can represent steps in descending order from left to right, and the pairs 904 can be arrayed in order of occurrence or correspondence from bottom to top instead of top to bottom.
  • the field 902 can contain actual step values instead of single-bit flags.
  • each step value, together with a corresponding pair 904, defines a subsequence of blocks.
  • the step values can be ordered in the field 902 so that a first step value in the field 902 corresponds to a first pair 904 and helps define a first subsequence of blocks in a sequence, a second step value in the field 902 corresponds to a second pair 904 and helps define a second subsequence, and so forth.
  • each of the step values can be located with a corresponding pair SNS and length values.
  • an RBB format 1100 in accordance with an embodiment of the invention, includes triples 1104 that each define a subsequence in a sequence of blocks.
  • Each triple includes a sequence number step SNS, a sequence number of a first block in the subsequence (e.g. , an SSN), and a length L of the subsequence.
  • the RBB format 1100 can also contain a field 1106 containing a number N that indicates how many subsequences are in the sequence of blocks acknowledged and/or represented.
  • each triple 1104 can also include a bit field E, to indicate whether the bitmap will immediately follow. Thus, one of the field 1106 and the bit fields E can be omitted.
  • Other appropriate mechanisms can alternatively be provided to indicate a location of the bitmap in the RBB format 1100.
  • FIG. 11B shows an example RBB field 1102 in accordance with the RBB format 1100, which contains two triplets 1104.
  • bitmap 1114 can be replaced with a list of sequence numbers that correspond to blocks in the subsequences defined by the triplets 1104, which need to be retransmitted. If for example this technique were applied to the RBB field shown in FIG. 11B, then the list of sequence numbers would include 1, 8, 14, 16 and 20. Where the RBB field acknowledges a large number blocks and a percentage of blocks that need to be retransmitted is low, this technique can be more efficient than using the bitmap 1114.
  • an RBB format can include explicit sequence numbers, whose presence acknowledges the corresponding blocks. FIG.
  • RBB format 1200 that is similar to the RBB format 700, but also includes a list of explicit sequence number fields 1208, 1210 and 1212 which contain sequence numbers SN i5 SN j and SN k . Any appropriate number of explicit sequence number fields can be included, and the RBB format 1200 can optionally include a sequence number quantity (SNQ) 1214 that indicates how may explicit sequence numbers follow the bitmap 706.
  • the acknowledgment can be understood to be negative, or alternatively to be positive, or can be indicated by an optional bit P/N 1216 whose value indicates whether the acknowledgment is negative or positive.
  • an RBB format can include parameters that explicitly identify a sequence of sequence numbers that are all positively acknowledged or all negatively acknowledged.
  • an RBB format 1300 that is similar to the RBB format 700 also includes a set of parameters that defines a sequence of sequence numbers.
  • the set includes, for example, an SSN field 1308 that contains a starting sequence number, an SNS field 1310 that indicates a sequence number step for the sequence or subsequence, and a length field Len 1312 that indicates how many sequence numbers are in the sequence or subsequence.
  • the field Len 1312 can alternatively contain a sequence number of a last block in the sequence.
  • the acknowledgment (positive or negative) for all the blocks in the sequence can be understood, or can be indicated by an optional bit P/N 1314 whose value indicates whether the acknowledgment is negative or positive.
  • FIGS. 12 and 13 can also be implemented with other embodiments of the invention described above, besides the embodiment shown in FIG. 7. As a further alternative, when the techniques illustrated in FIGS. 12 and 13 are used the bitmap field 706 and the SSN and SNS fields 702 and 704 can be omitted entirely.
  • the order of elements within the RBB field can be varied, and the order of SNs within the RBB field can also be varied.
  • the bits in the field 1002 can alternatively represent steps that descend in value from left to right across the field 1002. Sequence numbers represented in the bitmaps can descend from left to right, and/or from top to bottom within each subsequence.
  • the subsequences can also be represented in the RBB field in different orders.
  • the subsequences can appear (as represented by information such as the pairs 1004, and/or as represented by corresponding portions in the bitmap of the RBB field) ordered in ascending or descending order by step, or by SSN.
  • the sequence number of a final block in the sequence or subsequence can be used instead of a starting sequence number corresponding to the sequence number of a first block in a sequence or subsequence.
  • information contained in fields or subfields within exemplary RBB field formats in accordance with various embodiments of the invention can be ordered in any appropriate way.
  • Information within those fields or subfields can likewise be ordered in any appropriate way.
  • numbers of bits used to represent the values can be chosen appropriately.
  • the size of the SNS field for example the number of bits used to represent the value stored in the SNS field, can be appropriately selected to be a minimum number that is sufficient to represent a largest SN of a first block in the sequence or subsequence.
  • "0" can be used to represent a positive acknowledgment
  • "1" can be used to represent a negative acknowledgment.
  • the RBB field can include a separate indication for each step, or in the alternative can include an indication that applies all of the steps, indicating whether the corresponding step(s) is a decrement or an increment.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Communication Control (AREA)

Abstract

L'invention porte sur un procédé et une technique efficaces d'accusé de réception de données transmises, dans un système pouvant transmettre des données à un débit variable et sauter des numéros de séquence de blocs de données en fonction du débit de transmission choisi. Un champ RBB dans un message d'accusé de réception positif/accusé de réception négatif (ACK/NACK) inclut un numéro de séquence de départ, une indication d'une opération de numéros de séquence, et une table de bits. Le numéro de séquence de départ indique un premier bloc dans une série ou une séquence de blocs transmis admis par le biais du message ACK/NACK. L'opération de numéros de séquence indique une différence minimale entre des numéros de séquence de blocs dans la séquence. Lorsque la séquence est ordonnée, l'opération des numéros de séquence est une différence entre les numéros de séquence de blocs adjacents ou consécutifs dans la série. La table de bits est configurée de sorte que chaque bit dans la table corresponde à un accusé de réception d'un des blocs dans la série. Le champ RBB peut également comprendre de multiples numéros de séquence de départ, ainsi qu'une opération des numéros de séquence et une longueur pour chaque numéro de séquence de départ. La série de numéros de séquence de départ, l'opération des numéros de séquence, et la longueur indiquent chacune une sous-série ou sous-séquence de la série de blocs transmis admis par le biais du message ACK/NACK. Le numéro de séquence de départ indique un numéro de séquence d'un premier bloc dans la sous-séquence; la longueur indique le nombre de blocs qu'il y a dans la sous-séquence; et l'opération des numéros de séquence indique une différence entre les numéros de séquence de blocs adjacents dans la sous-séquence.
EP99963752A 1998-11-27 1999-11-24 Accuse de reception positif/accuse de reception negatif en bande passante Withdrawn EP1133848A1 (fr)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US345961 1982-02-05
US11044498P 1998-11-27 1998-11-27
US110444P 1998-11-27
US09/345,961 US6367045B1 (en) 1999-07-01 1999-07-01 Bandwidth efficient acknowledgment/negative acknowledgment in a communication system using automatic repeat request (ARQ)
PCT/SE1999/002180 WO2000033502A1 (fr) 1998-11-27 1999-11-24 Accuse de reception positif/accuse de reception negatif en bande passante

Publications (1)

Publication Number Publication Date
EP1133848A1 true EP1133848A1 (fr) 2001-09-19

Family

ID=26808034

Family Applications (1)

Application Number Title Priority Date Filing Date
EP99963752A Withdrawn EP1133848A1 (fr) 1998-11-27 1999-11-24 Accuse de reception positif/accuse de reception negatif en bande passante

Country Status (4)

Country Link
EP (1) EP1133848A1 (fr)
AU (1) AU2012500A (fr)
TW (1) TW441199B (fr)
WO (1) WO2000033502A1 (fr)

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8223867B2 (en) * 2000-06-09 2012-07-17 Texas Instruments Incorporated Wireless communications with efficient channel coding
GB2384145A (en) * 2002-01-12 2003-07-16 Ubinetics Ltd Adaptive signalling technique for repeat transmission requests
US8233501B2 (en) 2002-02-13 2012-07-31 Interdigital Technology Corporation Transport block set segmentation
US6975650B2 (en) * 2002-02-13 2005-12-13 Interdigital Technology Corporation Transport block set segmentation
US7287206B2 (en) * 2002-02-13 2007-10-23 Interdigital Technology Corporation Transport block set transmission using hybrid automatic repeat request
US8213390B2 (en) * 2002-10-24 2012-07-03 Qualcomm Incorporated Reverse link automatic repeat request
FR2850516B1 (fr) * 2003-01-29 2005-06-03 Evolium Sas Procede pour obtimiser les performances d'un systeme de radiocommunications mobile
ATE527771T1 (de) * 2003-08-08 2011-10-15 Intel Corp Sdma-kommunikation mit nicht augenblicklicher blockbestätigung
US20050129101A1 (en) 2003-12-15 2005-06-16 Stephens Adrian P. SDMA communications with non-immediate block acknowledgment
FI116114B (fi) * 2004-01-27 2005-09-15 Nokia Corp Kuittausviestien käsittely päätelaitteessa
US8223647B2 (en) 2004-07-21 2012-07-17 Nokia Corporation System and method for increasing data throughout using a block acknowledgement
US7882412B2 (en) * 2004-10-05 2011-02-01 Sanjiv Nanda Enhanced block acknowledgement
JP4834072B2 (ja) * 2005-03-07 2011-12-07 クゥアルコム・インコーポレイテッド ワイヤレスパケットネットワークのためのブロック肯定応答プロトコル
WO2008008712A1 (fr) 2006-07-12 2008-01-17 Intel Corporation Systèmes et procédés de détermination d'un schéma de modulation et de codage prévisible
EP2238704B1 (fr) * 2008-02-04 2011-08-31 Telefonaktiebolaget L M Ericsson (publ) Procédé et agencement dans un système de télécommunications dans lequel un message d'accusé de réception est renvoyé pour un groupe de trames
US20100088569A1 (en) * 2008-10-05 2010-04-08 Ikanos Communications, Inc. Packet Retransmission
US20180131640A1 (en) * 2016-11-07 2018-05-10 Qualcomm Incorporated Techniques for encoding and decoding multiple acknowledgement signals in new radio

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5487068A (en) * 1994-07-29 1996-01-23 Motorola, Inc. Method for providing error correction using selective automatic repeat requests in a packet-switched communication system
US5553083B1 (en) * 1995-01-19 2000-05-16 Starburst Comm Corp Method for quickly and reliably transmitting frames of data over communications links
US5717689A (en) * 1995-10-10 1998-02-10 Lucent Technologies Inc. Data link layer protocol for transport of ATM cells over a wireless link
EP0771092B1 (fr) * 1995-10-23 2002-07-31 Nokia Corporation Méthode de transmission de données par paquets utilisant une procédure FEC/ARQ type II hybride
GB2313268A (en) * 1996-05-17 1997-11-19 Motorola Ltd Transmitting data with error correction

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO0033502A1 *

Also Published As

Publication number Publication date
WO2000033502A8 (fr) 2000-08-24
AU2012500A (en) 2000-06-19
WO2000033502A1 (fr) 2000-06-08
TW441199B (en) 2001-06-16

Similar Documents

Publication Publication Date Title
US6367045B1 (en) Bandwidth efficient acknowledgment/negative acknowledgment in a communication system using automatic repeat request (ARQ)
WO2000033502A1 (fr) Accuse de reception positif/accuse de reception negatif en bande passante
EP1700414B1 (fr) Procede pour creer des messages de retour pour arq dans un systeme de communication mobile
JP4579421B2 (ja) Ａｒｑプロトコルにおけるフィードバック応答を最小化する方法
EP1246385B1 (fr) Procédé pour la transmission ou la réception de paquets de données dans un système de communication de données par paquets utilisant un protocole de demande de répétition automatique hybride
US7123617B1 (en) Radio link protocol enhancements for dynamic capacity wireless data channels
CN1914845B (zh) 用于在移动通信系统中产生对自动重发请求的反馈消息的方法
RU2387087C2 (ru) Способ обмена данными, система для обмена данными и станция для передачи данных
EP1211840A1 (fr) ARQ hybride avec transmission parallèle de paquets
CN104125045B (zh) 一种用于传输ack/nack消息的方法
TWI385963B (zh) 通訊系統中傳送與接收自動重傳要求回授資訊單元的裝置及其方法
EP1276282A1 (fr) Procédé, système et bloc de données RLC pour délimiter des unités de données pour protocole LLC
US20100241919A1 (en) Method and apparatus for arq feedback in wireless communication system
EP2920905B1 (fr) Extension d'une fenêtre de transmission de commande de liaison radio
EP1195938B1 (fr) Procédé pour la transmission incrémentale asynchrone de redondance dans un système de transmission
WO2003019852A1 (fr) Procédé de mise en oeuvre d'accusé de réception de données
EP1052798B1 (fr) Procédé efficace de demande de répétition automatique utilisant des numéros de séquences de longueur variable
Mathis United States Patent (12)(10) Patent N0.: US 6,367,045 B1 Khan et al.(45) Date of Patent: Apr. 2, 2002
CN101867439A (zh) 比特映射方式的指示方法
Choi et al. Throughput analysis of a class of selective repeat ARQ with multi-copy retransmissions
HK1094842B (en) Method for creating feedback messages for arq in a mobile communication system
WO2010012298A1 (fr) Transmission de message de rétroaction arq redondante dans un espace inutilisé d'un intervalle de transmission de données

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20010430

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN

18W Application withdrawn

Withdrawal date: 20020416

RBV Designated contracting states (corrected)

Designated state(s): DE GB