EP1258096A1 - Procede, systeme de communication et recepteur permettant de transmettre des donnees en paquets - Google Patents

Procede, systeme de communication et recepteur permettant de transmettre des donnees en paquets

Info

Publication number
EP1258096A1
EP1258096A1 EP01913675A EP01913675A EP1258096A1 EP 1258096 A1 EP1258096 A1 EP 1258096A1 EP 01913675 A EP01913675 A EP 01913675A EP 01913675 A EP01913675 A EP 01913675A EP 1258096 A1 EP1258096 A1 EP 1258096A1
Authority
EP
European Patent Office
Prior art keywords
identifier
coding unit
receiver
coding units
transmitter
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
EP01913675A
Other languages
German (de)
English (en)
Inventor
Christina Gessner
Thomas Gruhn
Frank Hillebrand
Lutz Jarbot
Reinhard KÖHN
Gerald Lehmann
Georgios Papoutsis
Jürgen Schindler
Jörg Schniedenharn
Armin Sitte
Frank Wegner
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.)
Siemens AG
Original Assignee
Siemens AG
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
Application filed by Siemens AG filed Critical Siemens AG
Publication of EP1258096A1 publication Critical patent/EP1258096A1/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/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
    • 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
    • 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/1829—Arrangements specially adapted for the receiver end
    • H04L1/1835—Buffer management
    • H04L1/1845—Combining techniques, e.g. code combining

Definitions

  • the invention relates to a method, a stem and Komr ⁇ unikationssy- th a receiver for the transmission of pake ⁇ .
  • sequence number In digital radio communication systems, data are often sent in m packets (PDUs) which are provided with an identification number (sequence number, hereinafter also referred to as “identifier *).
  • sequence number In the case of so-called ARQ (Automatic Repeat Request) error correction methods in particular, sequence numbers are used so that the receiver can request additional information for the correction of incorrectly transmitted packets.
  • the data quantities sent in each case which are used individually or by a suitable combination for the reconstruction of the packet data on the receiver side, are referred to as “coding units”. These are the data packets to be transmitted in coded form.
  • the receiving side informs the sending station directly or indirectly of the sequence numbers of the unsuccessfully decoded coding units, which are then sent again by the sending station.
  • Hybrid ARQ II or Hybrid ARQ Ill method an incorrectly received (first) coding unit is linked to additional information (2nd, 3rd, ..., n. Coding unit) subsequently requested by the transmitter in order to restore the data packet.
  • the coding units are coding polynomials, for example using the rate-matchmg method are further processed.
  • the combination verscmedener into a data packet belonging coding units already clever coding units can be re gen übertra ⁇ and combined with maxi to combimng ratio with the previously transmitted version.
  • Coding units that have already been sent or sent can also be sent again and combined with the version already sent by means of a combination in the best possible ratio (maximum ratio combimng).
  • the coding unit can no longer be used with the previously used methods in order to support the decoding of the associated data packet in combination with other coding units.
  • the object of the invention is to improve the decoding vc to data packets coded to coding units in the receiver z_.
  • the method according to the invention for transmitting data in the form of a packet between a transmitter and a receiver provides that, in the event that one of the identifiers of the coding units cannot be identified by the receiver, the corresponding coding unit in the receiver for a later decoding, which is subsequently used data to be transmitted by the transmitter is to be saved.
  • such coding units are advantageously also provided for decoding, the identifiers of which were received in a disrupted manner or the correctness of the received ones
  • the stored coding unit of a data packet can be used for decoding in particular in that a further coding unit of the same data packet is transmitted from the transmitter to the receiver, the stored -assured encoding unit is combined with the additional coding unit in the receiver and the combination of these co ⁇ d istsritten is then decoded.
  • the Kombinie ⁇ ren of coding units for example, as in the hybrid ARQ II or the hybrid ARQ III method done.
  • a further development of the invention provides that are received, ger stores ⁇ further coding unit, before Kombina ⁇ the coding units tion further coding unit without using the stored coding unit is decoded and the combination with the stored Cod istsein ⁇ integrated only in case of incorrect decoding of further coding unit, and decodes the combination. So it is first tried whether the decoding of the further coding unit alone is already successful. This may make the combination of the two coding units unnecessary.
  • the receiver can transmit corresponding acknowledgment signals to the transmitter, which allow conclusions to be drawn about the respective identification, and the transmitter can determine which of the transmitted coding units is used by comparing the acknowledgment signals received with the identifications of the previously transmitted coding units Identifier was not identifiable.
  • the acknowledgment signals can be in particular, for acknowledge edge / not acknowledge signals used by common communication, which are also used in the known ARQ processes. As a result, there is no increased signaling outlay in the invention compared to these methods.
  • the receiver can also transmit corresponding information to the transmitter if it was unable to identify the identifier of a received coding unit. This enables the transmitter to take note of an error without the transmitter having already evaluated the acknowledgment signals.
  • the receiver informs the sender how many received coding units have an identifier during a certain reception period that cannot be identified by him. This will tell the sender how many data packets were not received correctly.
  • the receiver can also tell the transmitter which of the data packets to be received by it could not identify a coding unit with a corresponding identifier. For this it is necessary that the recipient is informed about which data packets or associated identifiers he had to have received. It is advantageous that the transmitter can then immediately send further coding units for each of the data packets mentioned to the receiver.
  • the information transmitted from the receiver to the transmitter can also include information that enables further encoding of the possibly incorrectly transmitted coding units on the transmitter side.
  • the information can indicate at what time or during what time period the coding unit with the unidentifiable identifier was received.
  • a TDMA process this also includes transmission method with a TDMA component a) it can involve the communication of Zeitrahmennum- mer (SFN) or tent slot number han ⁇ eln, m which the ge ⁇ stored coding unit was received.
  • the information can also indicate the spread code with which the coding unit is coded with the unidentifiable identifier.
  • the information can also indicate the carrier frequency with which the coding unit with the unidentifiable identifier was transmitted.
  • the information can also contain at least a section of the coding unit with the unidentifiable identifier or a section of a header section of this coding unit. Then the transmitter may be able to identify the coding unit stored in the receiver on the basis of the detail and transmit a corresponding further coding unit for the same data packet.
  • the transmitter side for at least some of the data packets.
  • the information then advantageously contains the identification number of the coding unit with the unidentifiable identifier.
  • the transmitter notes the identifiers of the further coding units which it transmits to the receiver. This can prevent it from becoming a later Transmits the same further coding unit again at the time.
  • the transmitter can note the order of transmission of the coding units and the receiver the order of reception of the coding units provided with an unidentifiable identifier. If the sender then the further coding units transmits their assignment to the pa ⁇ ketene m the same order with respect to how the ursprung- lent transmitted coding units with the unidentifiable identifiers in the receiver the allocation of additional coding units is relieved to the stored coding units with unidentifiable identifier ,
  • the transmitter transmits information to the receiver which indicates that the further coding unit is assigned to a data packet, the identifier of which was previously not identifiable by the receiver.
  • the receiver can distinguish the further coding units from other coding units that are transmitted, for example, as the first coding units of a data packet.
  • a combination with the stored coding units is desired only for the further coding units.
  • FIG. 1 shows a section of the communication system according to the invention with a transmitter and a receiver
  • FIG. 2 the coding of data packets to coding units
  • Figure 3 shows the coding of a data packet to several different coding units
  • Figures 4 to 6 different decodings of coding units in the receiver.
  • the invention is illustrated nikationssystems by way of Mobilfunkkommu-, although they also nikationssysteme to other commu ⁇ , m where illerschulubertragung ER follows is applicable.
  • FIG. 1 shows a radio cell Z of a mobile radio system.
  • the radio cell Z has a base station BS and a mobile station MS.
  • BS base station
  • MS mobile station
  • the base station m will be considered as a transmitter and the mobile station m as a receiver.
  • the base station BS receives data Pi from a base station controller BSC, which it is to transmit in packet form to the mobile station MS.
  • the base station has a unit UI for assigning an identifier to the data packets Pi in order to identify their sequence during the transmission.
  • the base station has a unit U2 for coding the data packets Pi to coding units Ci.
  • the coded data packets Pi are transmitted from a unit U3 to the mobile station MS in the form of the coding units Ci, provided with the corresponding identifier.
  • the term “coding unit” denotes information or redundancy quantities generated from the data packets Pi, which enable the data packets Pi to be restored either individually or by suitable linking to other coding devices.
  • the mobile station MS m Figure 1 a unit U4 for ⁇ from the identifier evaluation on each coding unit C, which it receives.
  • the mobile station MS has a memory U5 for storing those coding units Ci whose identification cannot be identified by the evaluation unit U4. This is the case if the identifier in question is exposed to large interference flows during the transmission.
  • the mobile station MS to a decoder U6, which is used for decoding the coding units Ci.
  • FIG. 2 shows the coding of the data packets Pi to the coding units Ci.
  • Figure 2 also shows that the data packets Pi identifiers assigned K.
  • the coding unit U2 of the Basissta ⁇ tion BS generates at its output the coding units Ci, where they m a head portion H (header) the relevant identifier C of the associated data packet Pi prefixing. While the mobile station MS FIG. 1 stores the received coding units Ci, the identifier K of which could not be identified, in the memory U5, it decodes the other coding units, the identifier of which can be easily identified.
  • the mobile station can determine whether the respective decoding has been carried out with errors or without errors.
  • the mobile station MS then transmits corresponding acknowledgment signals ACK, NACK to the base station BS.
  • the one acknowledgment signal ACK indicates that the corresponding coding unit Ci could be successfully decoded, while the second acknowledgment signal NACK indicates that the associated coding unit Ci with the corresponding identifier was received, but the decoding was incorrect.
  • the base station BS can repeat the transmission of the coding unit in question in a known manner (for example according to a known ARQ method) or send out another coding unit of the same data packet.
  • the base station BS due to the acknowledgment signals ACK, NACK already find that those have been Codtechniksein ⁇ units Ci received for which a corresponding acknowledgment signal, either have not been received from the mobile station MS has been received or, but having an identifier K, that could not be identified by the recipient.
  • Mobile station MS in addition to the acknowledgment signals ACK, NACK also information I to the base station BS.
  • the information I is used to make it easier for the base station BS to determine which of the transmitted coding units Ci was unable to identify the associated identifier K in the receiver.
  • the information I can include, for example, the number of coding units Ci received with an unidentifiable identifier K within a specific reception period. It is also possible for the information I to contain those identifiers K to which none of the received coding units Ci could be assigned. This is possible if the mobile station knows which identifiers it should have received in a certain period of time.
  • the information I ⁇ can also indicate with which carrier frequency, which spreading code or at what point in time or during which period the coding unit with the unidentifiable identifier K was received.
  • the spreading code can of course only be specified if it is a CDMA transmission method.
  • the specification of a time period for such a reception can take the form of, for example, TDMA transmission methods Number of the reception time frame or reception time slot ge ⁇ happen.
  • the base station BS (or more generally: the transmitter) sends, after it has determined which of the previously ⁇ NEN coding units Ci transfer a identification of zuge Anlageni ⁇ gene identification K m of the mobile station MS was not possible to know ⁇ tere coding units to the mobile station MS.
  • the further coding units are used to enable error-free decoding and thus determination of the underlying data packet Pi in the receiver using the coding units stored in the mobile station MS with an unidentifiable identifier.
  • the base station BS provides the further coding units transmitted from it to the mobile station MS with a corresponding identification INF. The mobile station MS can see from the identification INF that a coding unit with an unidentifiable identification K has already been transmitted to the associated data packet Pi
  • FIG. 3 shows that the coding unit U2 of the base station BS can generate several different coding units CI, C2 from one data packet PI by different coding.
  • a coding method of this type includes the inclusion of error correction codes and, for example, spreading codes, provided that it is a CDMA transmission method.
  • the encoder U2 (although possibly at different times, see below) generates two different coding units CI, C2 for the data packet PI.
  • the two coding units CI, C10 differ in their code rates.
  • the coding unit CI has the code rate 1, while the coding unit C10 has the code rate 0.5.
  • the base station BS initially generates only the first coding unit CI for the data packet PI and transmits this with the coding units of the other data packets Pi to the mobile MS station. Only when the base station BS determines the identifier K ⁇ ass the first encoding unit CI of the mobile ⁇ station MS could not be identified and m whose memory is stored U5, the encoder U2 generates the base station BS, the further coding unit CIO from the data packet PI. The further coding unit CIO then also transmits this to the mobile station MS.
  • FIG. 4 shows the case where both coding units CI, CIO assigned to the data packet PI have already been stored in the memory U5 of the mobile station MS.
  • a bracket around the identifier K of the respective coding unit Ci indicated that the identifier K in question could not be identified by the receiver.
  • the decoder U6 of the mobile station MS first decodes the further coding unit CIO. If this decoding is successful, which can be determined by evaluating the error correction codes used, the data packet PI has been correctly reconstructed in the receiver. Then the two coding units CI, CIO can be deleted in the memory U5.
  • the mobile station MS has a combination unit U7 which combines the coding units CI, CIO with one another to form a combined coding unit CX.
  • the combined coding unit CX is then decoded by the decoder U6.
  • the correct data packet PI can be determined in the receiver using both the originally transmitted coding unit CI with the unidentifiable identifier K and the further coding unit C10.
  • the combination of the coding units can take place, for example, like corresponding combinations in the hybrid ARQII or ARQIII method.
  • Figure 5 shows the case that the mobile station MS, two coding units CI, C2 stored with not identifizierba ⁇ rer identifier K in the memory U5.
  • the base station BS has transmitted a further coding unit CIO, C20 to the mobile station MS for each data packet PI, P2 concerned.
  • the combination unit U7 may first combine the further coding unit CIO of the first data packet PI with the coding unit C2 of the second data packet P2 Coding unit CX combined. This incorrectly performed combination CX is then decoded by the decoder U6. Using the error correction code used, it can be determined that the decoding result is incorrect.
  • a new combination of the further coding unit CIO is then formed, this time with the coding unit CI of the first data packet PI.
  • Combination unit U7 generates a corresponding combined coding unit CY. This is in turn fed to the decoder U6, whose output signal corresponds to the data packet PI this time.
  • the further coding unit C20 of the second data packet P2 can then be combined and decoded with the coding unit C2 of the second data packet P2.
  • the coding units CI, CIO, which are no longer required, can be deleted beforehand.
  • the invention enables that in the case of hybrid ARQ II / III or similar error correction methods, transmitted coding units are also referenced in which the identification of the sequence number / coding entity number was unsuccessful. It is thereby achieved that a higher susceptibility to errors in the transmission of coding units which relate to their identifier is tolerable. It finds an optimal one Utilization of data transmitted over the air interface Infor ⁇ mation instead.
  • the information I (FIG. 1) transmitted by the mooil station MS can have, for example, the form of a bit pattern and a start identifier SSN as a simultaneous acknowledgment signal.
  • the data packet for example, are always assigned to two bits, wherein the first bei ⁇ en bits relate to the data packet with the identifier SSN, the next two data packet with the identifier SSN + 1, etc .. It can now be set, for example, the following meanings of the bit pattern:
  • the receiver FIG. 1 can also send, as information I (i.e. when an unidentified coding unit is reported), a section of the unidentified coding unit, which serves to decide on the transmitter side from which data packet the unidentified coding unit could have come. If several coding units come into question, the sender can compare this data fragment with the corresponding digits in the coding units in question and select the coding unit in which this comparison gives the greatest match.
  • information I i.e. when an unidentified coding unit is reported
  • the sender can compare this data fragment with the corresponding digits in the coding units in question and select the coding unit in which this comparison gives the greatest match.
  • the sender and receiver can also note the time frame number of the transmitted coding units and of the received, unidentifiable coding units.
  • the receiver now informs the sender in what time frame that at which SFN number means how many coding units were received unidentified.
  • the number of transmitted coding units per time frame is generally much smaller than the number of transmitted coding units between two status reports, in which the acknowledgment signals ACK, NACK are usually transmitted. Accordingly, the number of unidentified coding units per time frame is on average smaller than the number of unidentified coding units between two status reports. This significantly simplifies the assignment of the further coding units to the previously received, stored coding units with unsuccessful identification identification and increases the number of cases in which the assignment is unambiguous.

Landscapes

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

Abstract

Un identificateur K est affecté à chaque paquet de données Pi afin d'identifier son ordre chronologique. Chaque paquet de données Pi est codé en une unité de codage Ci. Chaque unité de codage Ci est transmise avec l'identificateur K du paquet de données Pi associé de l'émetteur BS au récepteur MS. Dans le récepteur MS, l'identificateur K associé est évalué pour chaque unité de codage Ci. Si un identificateur K ne peut pas être identifié, l'unité de codage C1 correspondante est mémorisée dans le récepteur MS en vue d'un décodage ultérieur qui s'effectue à l'aide de données devant être transmises ultérieurement par l'émetteur BS.
EP01913675A 2000-02-18 2001-02-16 Procede, systeme de communication et recepteur permettant de transmettre des donnees en paquets Withdrawn EP1258096A1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE10007564 2000-02-18
DE10007564A DE10007564A1 (de) 2000-02-18 2000-02-18 Verfahren, Kommunikationssystem und Empfänger zum Übertragen von Daten in Paketform
PCT/DE2001/000624 WO2001061908A1 (fr) 2000-02-18 2001-02-16 Procede, systeme de communication et recepteur permettant de transmettre des donnees en paquets

Publications (1)

Publication Number Publication Date
EP1258096A1 true EP1258096A1 (fr) 2002-11-20

Family

ID=7631519

Family Applications (1)

Application Number Title Priority Date Filing Date
EP01913675A Withdrawn EP1258096A1 (fr) 2000-02-18 2001-02-16 Procede, systeme de communication et recepteur permettant de transmettre des donnees en paquets

Country Status (4)

Country Link
US (1) US20030078008A1 (fr)
EP (1) EP1258096A1 (fr)
DE (1) DE10007564A1 (fr)
WO (1) WO2001061908A1 (fr)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI239730B (en) * 2002-02-19 2005-09-11 Interdigital Tech Corp Method and apparatus for providing a highly reliable ACK/NACK for time division duplex (TDD) and frequency division duplex (FDD)
US7792134B2 (en) * 2004-04-30 2010-09-07 Alcatel-Lucent Usa Inc. Method and apparatus for detecting an uplink packet data channel in a CDMA wireless communications system
KR100692922B1 (ko) * 2006-02-08 2007-03-12 주식회사 이노와이어리스 이동통신망의 진단데이터 원격 로깅 방법
US7996744B2 (en) * 2007-04-30 2011-08-09 Nokia Corporation Method and apparatus for providing a data retransmission scheme
US20100131916A1 (en) * 2008-11-21 2010-05-27 Uta Prigge Software for modeling business tasks
US8429597B2 (en) * 2008-11-21 2013-04-23 Sap Ag Software for integrated modeling of user interfaces with applications
US20100153149A1 (en) * 2008-12-12 2010-06-17 Sap Ag Software for model-based configuration constraint generation
US20100153150A1 (en) * 2008-12-12 2010-06-17 Sap Ag Software for business adaptation catalog modeling

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5010553A (en) * 1988-12-05 1991-04-23 Compuquest, Inc. High speed, error-free data transmission system and method
DE4217003A1 (de) * 1992-05-22 1993-11-25 Sel Alcatel Ag Verfahren und Schaltungsanordnung zum Wiederherstellen der richtigen Anzahl von Zellen einer gestörten ATM-Verbindung
US6445717B1 (en) * 1998-05-01 2002-09-03 Niwot Networks, Inc. System for recovering lost information in a data stream
FI105734B (fi) * 1998-07-03 2000-09-29 Nokia Networks Oy Automaattinen uudelleenlähetys
US6359877B1 (en) * 1998-07-21 2002-03-19 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for minimizing overhead in a communication system
FI109252B (fi) * 1999-04-13 2002-06-14 Nokia Corp Tietoliikennejärjestelmän uudelleenlähetysmenetelmä, jossa on pehmeä yhdistäminen
KR100703107B1 (ko) * 2000-04-10 2007-04-05 유티스타콤코리아 유한회사 무선통신 시스템에서 데이터 자동 재전송 방법
JP3507810B2 (ja) * 2000-04-10 2004-03-15 ヒュンダイ エレクトロニクス インダストリーズ カムパニー リミテッド 広帯域無線通信システムのダウンリンクにおけるハイブリッド自動再送要求２／３方式のためのデータ処理方法
ES2301110T3 (es) * 2000-05-17 2008-06-16 Matsushita Electric Industrial Co., Ltd Sistema arq hibrido para transmision de datos en paquetes con un canal de control y un canal de datos.
DE10050117A1 (de) * 2000-10-11 2002-04-25 Philips Corp Intellectual Pty Drahtloses Netzwerk mit einem Datenaustausch nach der ARQ-Methode

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
WO2001061908A1 (fr) 2001-08-23
DE10007564A1 (de) 2001-08-30
US20030078008A1 (en) 2003-04-24

Similar Documents

Publication Publication Date Title
DE69632147T2 (de) Verbund-fehlererkennung und datenpaketnumerierung in einem hierarchischen arq-übertragungssystem
DE69736684T2 (de) Kommunikationsanordnung und Übertragungsstation mit Fehlerdetektion und Wiederübertragung
EP1461888B1 (fr) Procédé et dispositif de transmission de données, dont un modèle d'adaptation de débit binaire est signalé entre émetteur et récepteur
DE60002884T2 (de) Verfahren und system zur datenempfangsquittierung
DE602004010433T2 (de) Verfahren, system und vorrichtung zur arq-datenübertragung
EP0903025B1 (fr) Procede de retrosignalisation assiste par ordinateur dans un procede de demande de repetition automatique
WO2004107653A1 (fr) Procede et appareil de controle permettant de determiner un taux d'erreur
DE69031015T2 (de) Zur Ausführung einer Wiederholungskontrolle pro Zeiteinheit fähiges Signalübertragungssystem
EP1258096A1 (fr) Procede, systeme de communication et recepteur permettant de transmettre des donnees en paquets
EP1236301B1 (fr) Procede de transmission de donnees par paquets dans un systeme de communication radio
EP1352492A1 (fr) Transmission parallele de donnees identiques vers plusieurs terminaux et retransmission d'informations concernant la qualite de transmission
DE60108792T2 (de) Übertragungswiederholungsverfahren und -gerät für funkverbindungen
WO2005083920A1 (fr) Procede de transmission de donnees utiles dans un systeme a sauts multiples et dispositif noeud de reseau a cet effet
EP1281253B1 (fr) Transmission de paquets de donnees codes, le recepteur selectionnant le codage des paquets de donnees par signalisation explicite
EP1500222B1 (fr) Procede et dispositif de gestion d'une memoire destinee a la memorisation temporaire de blocs de donnees dans des systemes de transmission arq
EP1511215B1 (fr) Procédé et dispositif de transmission de données selon un procédé ARQ hybride
EP1609266B1 (fr) Procede et appareil de mesure pour determiner un taux d'erreurs sans redondance incrementale
EP0473869A1 (fr) Procédé de réémission automatique d'un message reçu avec erreurs
WO2000035138A1 (fr) Procede de codage canal enchaine adaptatif
DE10345713B4 (de) ARQ-Verfahren
DE10023826B4 (de) Verfahren zum Übertragen einer Rahmennummer in einem Kommunikationssystem
DE102020003290A1 (de) Verfahren sowie Vorrichtung zum Übertragen von Daten
DE10031675A1 (de) Verfahren zum gleichzeitigen Übertragen mehrerer Teildatenströme und Vorrichtung zum Korrigieren von Übertragungsfehlern
EP1708403B1 (fr) Procédé ARQ hybride de transmission de données, émetteur et récepteur correspondants
EP1518345A1 (fr) Procede d'adaptation de debit

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: 20020725

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 TR

AX Request for extension of the european patent

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

RBV Designated contracting states (corrected)

Designated state(s): DE FR GB

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

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20040901