WO2001039420A1 - Procede permettant d'adapter le debit binaire dans un dispositif de communication et dispositif de communication correspondant - Google Patents

Procede permettant d'adapter le debit binaire dans un dispositif de communication et dispositif de communication correspondant Download PDF

Info

Publication number
WO2001039420A1
WO2001039420A1 PCT/DE2000/001373 DE0001373W WO0139420A1 WO 2001039420 A1 WO2001039420 A1 WO 2001039420A1 DE 0001373 W DE0001373 W DE 0001373W WO 0139420 A1 WO0139420 A1 WO 0139420A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit
frame
bits
puncturing
punctured
Prior art date
Application number
PCT/DE2000/001373
Other languages
German (de)
English (en)
Inventor
Bernhard Raaf
Original Assignee
Siemens Aktiengesellschaft
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 Aktiengesellschaft filed Critical Siemens Aktiengesellschaft
Publication of WO2001039420A1 publication Critical patent/WO2001039420A1/fr

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/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0067—Rate matching
    • H04L1/0068—Rate matching by puncturing
    • H04L1/0069—Puncturing patterns
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0071—Use of interleaving

Definitions

  • the present invention relates to a method according to the preamble of claim 1 for adapting the bit rate in a communication device and to a corresponding communication device according to the preamble of claim 20.
  • UMTS mobile radio standard Universal Mobile Telecommunications System'
  • UMTS Universal Mobile Telecommunications System
  • an interleaver which rearranges the bits of the bit stream supplied to it and divides them into several frames to be sent in succession (with UMTS with a frame duration of 10 ms each).
  • a rate matching is carried out in the transmitter, wherein bits are either removed from the bit stream or multiplied, in particular doubled, in the bit stream. Removing bits is called 'puncturing' and multiplying is called 'repeating'.
  • the pattern or scheme with which the rate adjustment is carried out and the individual bits are punctured or repeated should be chosen such that the punctured or repeated bits are distributed as evenly as possible over the individual frames. It is also disadvantageous if there are several immediately consecutive bits of the interleaver originally zugebuchten bitstream punk ⁇ be advantage.
  • the aforementioned second condition for example, hurt when possiblege to each of the interleaver ⁇ enclosed frame always one and the same puncturing or REPE is applied t istsmuster since then each frame m respectively, the same bit positions punctured or are repeated, but the m the original bit stream, which is fed to the interleaver, correspond to consecutive bits. If, for example, the bits were divided into eight frames by interleaving, this procedure had the consequence that eight consecutive bits of the original bit stream were punctured or repeated, which is undesirable.
  • FIG. 3 shows the interleaving scheme for dividing the individual bits of a bit stream into a total of eight frames. is set, ie the individual bits are alternately assigned to frame No. 1, No. 2 ... No. 8, so that frame No. 1 has bits No. 0, No. 8, No. 16, etc., for example ,
  • FIG. 3 shows the example for a puncturing scheme which is to be applied to the individual frames after interleaving, each punctured bit being indicated by a thick border.
  • the puncturing pattern is selected such that bits are punctured with a generally uniform spacing in the original bit stream. In the example shown in FIG. 3, for example, every sixth bit is punctured. After the fourth puncturing, ie the puncturing of bit no.
  • the puncturing distance q is shortened once to five bits, so that bit no. 23 is punctured (instead of bit no. 24). Then the normal puncturing distance is continued. After each column and thus each frame has been punctured once, the puncturing pattern is repeated, ie shifted down to bit no. 48. Accordingly, there is a further reduction in the puncturing distance between bits No. 66 and No. 71.
  • a "normal" puncturing distance is indicated by a thin arrow and a "shortened” puncturing distance by a thick arrow.
  • bit no. 104 In order to be able to actually obtain the desired puncturing rate, the puncturing of bit no. 104 must be continued after the repetition of the puncturing pattern described above and starting with bit no. 48. this has however, the consequence is that there is a relatively large distance between the last punctured bit No. 89 and the bit No. 104 to be punctured. In the example shown, a puncturing distance of five bits, twelve times a puncturing distance of six bits, once a puncturing distance of seven bits and once a puncturing distance of 15 bits are thus used in total.
  • the present invention is based on the object of providing a method for adapting the bit rate in a communication device and a corresponding communication device, it being possible to achieve a more uniform distribution of the bits to be punctured or repeated in particular, larger distances between punctured or repeated bits that follow one another in the original bit stream can be avoided.
  • the puncturing or repetition of the bits of the further frames takes place on the basis of this puncturing or repetition pattern of the first frame, the distance between those to be punctured or repeated and by the
  • Interleaving bits divided into the further frames depending on the puncturing or repetition distance of the first frame is selected.
  • the puncturing or repetition distance for the bits of the further frames is preferably determined individually for each puncturing or repetition.
  • the present invention is based on the knowledge that the puncturing or repeating patterns of the individual frames do not have to be identical, but only have to be offset from one another, the nesting of the puncturing or repeating pattern of the individual frames not only globally but also locally each individual puncturing or repetition can be carried out. In this way, the puncturing or repeating pattern of the individual columns becomes irregular; overall, however, a very uniform puncturing or repetition is achieved when considering the overall framework, in particular larger puncturing or repetition distances are avoided or their frequency is at least reduced.
  • a special puncturing / repetition algorithm with bit-specific update parameters can be applied to the bits assigned to the first frame, so that the puncturing / repetition density of the first frame or the first column, which the Forms the basis for puncturing / repeating the other frames or columns, can be controlled in a targeted manner.
  • the present invention is particularly suitable for adapting the bit rate in (UMTS) mobile radio systems, this relating both to the area of the mobile radio transmitter and to that of the mobile radio receiver which is designed to receive a bit stream processed according to the invention.
  • UMTS universal mobile subscriber identity
  • the invention is not restricted to this area of application, but can generally be used wherever the data rate of a bit stream has to be adapted.
  • the present invention is described in more detail below with reference to the accompanying drawing using a preferred exemplary embodiment.
  • FIG. 1 shows a simplified block diagram of a mobile radio transmitter according to the invention
  • FIG. 2 shows a representation of a preferred exemplary embodiment for a puncturing scheme which can be used according to the invention by a unit shown in FIG. 1 for adapting the bit rate,
  • FIG. 4A shows a possible algorithm that can be used to puncture a first frame shown in FIG. 2,
  • FIG. 4B shows a possible algorithm that can be used to repeat the first frame shown in FIG. 2, and
  • FIG. 5 shows another possible algorithm that can be used to puncture and repeat the first frame shown in FIG. 2.
  • FIG. 1 schematically shows the structure of a mobile radio transmitter 1 according to the invention, from which data or communication information, in particular voice information, is transmitted to a receiver via a high-frequency transmission channel.
  • the information supplied by a data source 2 for example a microphone, is first converted into a bit sequence using a digital source encoder 3.
  • the encoded data is then encoded with the aid of a channel encoder 4, the actual user or message bits being encoded redundantly, as a result of which transmission errors can be recognized and then corrected.
  • So-called block codes or convolutional codes are usually used for channel coding. According to the current state of UMTS standardization, the use of convolutional codes is proposed.
  • An essential difference from block codes is that convolutional codes do not encode individual data blocks one after the other, but that they are continuous processing, each current code word of an input sequence to be coded also depending on the previous input sequences.
  • the channel-coded information Before the channel-coded information is transmitted to the receiver, it is fed to an interleaver 5, which rearranges the bits to be transmitted in time according to a certain scheme and thereby spreads them in time, as a result of which the errors which generally occur in bundles are distributed in order to create a so-called memoryless Obtain transmission channel with a quasi-random error distribution.
  • the information or data coded in this way is fed to a modulator 7, the function of which is to modulate the data onto a carrier signal and to transmit it to a receiver via a high-frequency transmission channel in accordance with a predetermined multiple access method.
  • a rate adjustment ('rate matching') is carried out in front of the modulator 7 with the aid of a unit 6, with the unit 6 puncturing, ie removing, certain bits according to a predetermined scheme , or repeated, ie multiplied.
  • the unit 6 is a puncturing unit.
  • the invention explained in more detail below with reference to FIG. 2 can of course also be applied to the case of repetition. ) 0J N> l- 1 P 1
  • bit 47 with a puncturing distance of six bits each (corresponding to the puncturing distance between bits No. 0 and 48 in the first frame), while the puncturing up to bit No. 103 is carried out horizontally with a puncturing distance of seven bits each (accordingly the puncturing distance between bits No. 48 and 104 in the first frame).
  • the puncturing scheme shown in FIG. 2 can be repeated to finally obtain the desired puncturing rate.
  • the total number of bits to be punctured or the total number of bits to be transmitted are not fixed a priori in UMTS systems, but depend on the totality of the services to be transmitted.
  • the puncturing, at least with an uplink is not fixed a priori in UMTS systems, but depend on the totality of the services to be transmitted.
  • tail puncturing Another application for uneven puncturing is so-called "tail puncturing". If convolutional coding is used for channel coding, which is common practice, the bits at the beginning and at the end of a frame are better protected against transmission errors than the bits present in the middle frame area. However, this is sometimes not necessary. A stronger puncturing in the edge areas of the frame can then achieve a more uniform error distribution and thus an overall better transmission performance.
  • m denotes the position of the currently considered bit x m in the respective frame
  • N indicates the number of bits in the frame.
  • the algorithm evaluates a continuously updated error value e, which describes the error between the current puncturing rate and the desired puncturing rate. For each bit x ". an individual error value e, which is composed of the error value of the bit x m - ⁇ preceding in the corresponding frame and an update parameter e m ⁇ n u ⁇ / e p ⁇ us , is calculated as follows.
  • the error value e is initially set to an initial error e ⁇ n ⁇ .
  • This initial value usually has the value 1 for the sake of simplicity.
  • the index of the currently viewed bit is set to 1 and the sequence embedded in a WHILE loop (3) is carried out.
  • the error value is thus updated for bit x ⁇ , the difference between the current error value and a predetermined first update parameter e minus being calculated (step (4)). If the result e ⁇ 0 (step (5)), the bit x- is punctured (step (6)) and then the error value e is updated again, with the current error value e being adjusted by a predetermined second update parameter e p ⁇ us is increased (step (7)).
  • the index of the bit under consideration is then increased in a step (8) and the WHILE loop for the next bit of the respective frame is thus run through.
  • each individual bit x m can be assigned an individual value e m ⁇ nU ⁇ (x m ) and / or e p ⁇ us (x m ). It is also conceivable that the bits are combined into specific groups, the bits within a group being assigned the same parameter values, while the parameter values differ from group to group. For example, the first ten bits, the next 20 bits, etc. can form such a group.
  • the puncturing density depends on the parameters e minus and e p ⁇ U3 , the puncturing can be individually controls and thus uneven puncturing can be achieved.
  • FIG. 4B shows a corresponding algorithm for the case of repetition of bits.
  • the repetition algorithm differs from the puncturing algorithm only in that a WHILE loop is provided instead of the IF instruction, so that the respective bit x ⁇ is repeated and the error value e assigned to bit x m is increased by e D ⁇ us until the error value is greater than zero.
  • variable bit-specific parameter values e minus (x n ) are used in order to achieve an uneven repetition density .
  • the algorithm shown in FIG. 5 corresponds to a combination of the algorithms shown in FIGS. 4A and 4B, wherein steps (5) - (7) are used to execute a WHILE loop, which the corresponding bit x m is used for the transmission to a receiver is selected and the corresponding error value e is increased by e p ⁇ U ⁇ until the error value e assumes a value greater than zero.
  • steps (5) - (7) are used to execute a WHILE loop, which the corresponding bit x m is used for the transmission to a receiver is selected and the corresponding error value e is increased by e p ⁇ U ⁇ until the error value e assumes a value greater than zero.
  • the bit x m is not selected at all for the transmission and is therefore punctured if the error value e updated in step (4) is greater than zero.
  • the bit x n is repeated just as often as the error value e by e p ⁇ us until the value zero is reached can be enlarged.
  • the algorithm shown in FIG. 5 it can be controlled by varying the parameter neus in which areas bits are punctured and in which areas bits are to be repeated. Puncturing generally takes place in those areas where e m ⁇ n u S ⁇ e plus applies, while conversely a repetition is carried out where e m ⁇ nU s ⁇ e DtUS applies ).
  • the parameter e minus (x m ) for the more important class A bits can thus be chosen to be relatively large, in order to achieve repetition of these bits while these parameters are being used
  • the parameter e minus (x m ) for the more important class A bits can thus be chosen to be relatively large, in order to achieve repetition of these bits while these parameters are being used
  • the less important Class B or Class C bits it can be chosen to be relatively small in order to achieve a low repetition or even a puncturing.
  • the signaling required for this ie the transmission of values for determining the parameters e dius (x m ) and / or e m ⁇ nus (x m ) or the relationship between the individual parameters, is no more complex than the currently known solution, which is provided for is to send the bits of different classes m independent transport channels for which the puncturing or repetition is carried out independently of one another. Only the total number of bits of all transport channels after puncturing or repetition must correspond to the number of bits available for the transmission. With this procedure, therefore, for each class of bits, its relative weight or a corresponding parameter, which determines whether repetition or puncturing is used for the respective class, must also be transmitted.
  • the puncturing / repetition algorithm described above with reference to FIGS. 4A, 4B and 5 can be combined with the puncturing / repetition scheme described with reference to FIG. 2 in order to obtain an uneven puncturing / repetition.
  • an individual value for e mnUs can be assigned to each bit for the first column shown in FIG. 2, which corresponds to the first interleaving frame.
  • the resulting puncturing / repetition pattern of the first column is then used according to the shift algorithm described with reference to FIG. 2 as the basis for the puncturing / repetition of the bits assigned to the other columns or frames.
  • the shift explained with reference to FIG. 2 is not necessarily determined between successive repeated bits, since, for example, all bits could also be repeated. Rather, in this case the shift between two successive bits is determined, which are not repeated or not repeated as often as the other bits.
  • These bits are transferred to the other columns or frames analogously to in the case of puncturing according to FIG. However, it would also be conceivable to transfer the more frequently repeated bits of the first frame or the first column to the further frames or columns.
  • N denotes the number of bits per frame before the rate adjustment
  • N c the number of bits per frame after the rate adjustment
  • K denotes a constant corresponding to the weighting described below:
  • w (x m ) K.
  • w (x m ) K.
  • w (x m ) K.
  • w (x m ) denotes the weight assigned to the bit x m , i.e. the mth bit. In a simplified nomenclature, this can also be expressed by w (m) N. 1 P 1

Abstract

L'objectif de la présente invention est d'adapter le débit binaire d'un flux binaire qui est réparti par entrelacement sur plusieurs trames se suivant dans le temps. Afin d'atteindre cet objectif, les bits répartis sur une première trame définie sont d'abord retirés, puis les bits répartis sur les autres trames sont retirés, de façon que, pour les autres trames, la distance (q) entre les retraits qui se suivent dans le flux binaire initial correspond à la distance à l'intérieur de la première trame, entre le bit de la première trame, qui précède respectivement dans le flux binaire initial et est précédemment retiré, et le bit de la première trame, qui suit respectivement dans le flux binaire initial et est précédemment retiré.
PCT/DE2000/001373 1999-11-25 2000-05-02 Procede permettant d'adapter le debit binaire dans un dispositif de communication et dispositif de communication correspondant WO2001039420A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE19956807.3 1999-11-25
DE19956807 1999-11-25

Publications (1)

Publication Number Publication Date
WO2001039420A1 true WO2001039420A1 (fr) 2001-05-31

Family

ID=7930333

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE2000/001373 WO2001039420A1 (fr) 1999-11-25 2000-05-02 Procede permettant d'adapter le debit binaire dans un dispositif de communication et dispositif de communication correspondant

Country Status (1)

Country Link
WO (1) WO2001039420A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001095500A1 (fr) * 2000-06-02 2001-12-13 Qualcomm Incorporated Procede et appareil de perforation de symboles de code dans un systeme de communication
WO2003024014A2 (fr) * 2001-09-05 2003-03-20 Siemens Aktiengesellschaft Procede d'adaptation du debit binaire d'un flux binaire devant etre transmis dans un systeme de communication et dispositif de communication correspondant
WO2003085873A3 (fr) * 2002-04-08 2003-12-04 Siemens Ag Procede et dispositif de communication pour adapter le debit de donnees dans un dispositif de communication
JP2005529509A (ja) * 2002-04-08 2005-09-29 シーメンス　アクチエンゲゼルシヤフト 通信装置においてデータレートをマッチングするための方法及び通信装置
KR100771029B1 (ko) * 2000-06-02 2007-10-29 퀄컴 인코포레이티드 통신 시스템에서 코드 심볼을 펑처링하는 방법 및 장치

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0676875A1 (fr) * 1994-04-05 1995-10-11 Sony Corporation Méthode et dispositif pour transmission de données numériques par multiplexage avec divers débits et priorités
US5581575A (en) * 1993-11-01 1996-12-03 Qualcomm Incorporated Method and apparatus for transmission of variable rate digital data
EP0912009A2 (fr) * 1997-10-24 1999-04-28 Nokia Mobile Phones Ltd. Conversion de débit de donées employant des codes de répétition

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5581575A (en) * 1993-11-01 1996-12-03 Qualcomm Incorporated Method and apparatus for transmission of variable rate digital data
EP0676875A1 (fr) * 1994-04-05 1995-10-11 Sony Corporation Méthode et dispositif pour transmission de données numériques par multiplexage avec divers débits et priorités
EP0912009A2 (fr) * 1997-10-24 1999-04-28 Nokia Mobile Phones Ltd. Conversion de débit de donées employant des codes de répétition

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
MATSUOKA H ET AL: "ADAPTIVE MODULATION SYSTEM WITH VARIABLE CODING RATE CONCATENATED CODE FOR HIGH QUALITY MULTI-MEDIA COMMUNICATION SYSTEMS", IEEE VEHICULAR TECHNOLOGY CONFERENCE,US,NEW YORK, IEEE, vol. CONF. 46, 28 April 1996 (1996-04-28), pages 487 - 491, XP000594323, ISBN: 0-7803-3158-3 *

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100782317B1 (ko) * 2000-06-02 2007-12-06 퀄컴 인코포레이티드 통신 시스템에서 코드 심볼들을 펑쳐링하는 방법 및 장치
WO2001095500A1 (fr) * 2000-06-02 2001-12-13 Qualcomm Incorporated Procede et appareil de perforation de symboles de code dans un systeme de communication
US6690734B1 (en) 2000-06-02 2004-02-10 Qualcomm, Incorporated Method and apparatus for puncturing code symbols in a communications system
KR100782316B1 (ko) * 2000-06-02 2007-12-06 퀄컴 인코포레이티드 통신 시스템에서 코드 심볼을 펑처링하는 방법 및 장치
KR100771029B1 (ko) * 2000-06-02 2007-10-29 퀄컴 인코포레이티드 통신 시스템에서 코드 심볼을 펑처링하는 방법 및 장치
WO2003024014A2 (fr) * 2001-09-05 2003-03-20 Siemens Aktiengesellschaft Procede d'adaptation du debit binaire d'un flux binaire devant etre transmis dans un systeme de communication et dispositif de communication correspondant
WO2003024014A3 (fr) * 2001-09-05 2003-10-09 Siemens Ag Procede d'adaptation du debit binaire d'un flux binaire devant etre transmis dans un systeme de communication et dispositif de communication correspondant
CN1312874C (zh) * 2001-09-05 2007-04-25 西门子公司 用于匹配通信系统中要传输的比特流的比特速率的方法和相应的通信装置
US7280609B2 (en) 2001-09-05 2007-10-09 Siemens Aktiengesellschaft Method for matching the bit rate of a bit stream which is to be transmitted in a communication system and corresponding communication device
WO2003085873A3 (fr) * 2002-04-08 2003-12-04 Siemens Ag Procede et dispositif de communication pour adapter le debit de donnees dans un dispositif de communication
CN100347981C (zh) * 2002-04-08 2007-11-07 西门子公司 通信装置中匹配数据率的方法和通信装置
JP2005529509A (ja) * 2002-04-08 2005-09-29 シーメンス　アクチエンゲゼルシヤフト 通信装置においてデータレートをマッチングするための方法及び通信装置
KR101045449B1 (ko) 2002-04-08 2011-07-01 지멘스 악티엔게젤샤프트 통신 장치에서 데이터 레이트를 적응시키기 위한 방법 및통신 장치
US8009550B2 (en) 2002-04-08 2011-08-30 Siemens Aktiengesellschaft Method and communications device for adapting the data transfer rate in a communications device
KR101120368B1 (ko) * 2002-04-08 2012-03-13 지멘스 악티엔게젤샤프트 통신 장치에서 데이터 레이트를 적응시키기 위한 방법 및 통신 장치

Similar Documents

Publication Publication Date Title
DE69908293T2 (de) Codier- und decodiervorrichtung zur ratenanpassung bei datenübertragung
WO2001039421A2 (fr) Procede d'adaptation du debit de donnees dans un dispositif de communication et dispositif de communication correspondant
EP1397881B1 (fr) Procede et dispositif pour la transmission de donnees selon un procede arq
DE3943879B4 (de) Digitales Codierverfahren
DE60107800T2 (de) Vorrichtung und verfahren zur tfci-kodierung und dekodierung in einem mobilen kommunikationssystem
EP1232584B1 (fr) Procede permettant de representer des bits d'identification de format sur une trame devant etre envoyee en mode comprime
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
DE3736193C2 (fr)
WO2001063773A1 (fr) Procede pour adapter les blocs de donnees a conduire jusqu'a un codeur turbo, et dispositif de communication correspondant
DE3131764A1 (de) Digitalsignal-uebertragungssystem
DE3006958A1 (de) Digitalsignal-uebertragungssystem
CH693978A5 (de) Verfahren zum Erweitern der Informationstragekapazitaet eines Datenrahmens bei einer Datenuebertragung.
WO2001039420A1 (fr) Procede permettant d'adapter le debit binaire dans un dispositif de communication et dispositif de communication correspondant
EP1219060B1 (fr) Procede et dispositif de transmission de trames de donnees et procede et dispositif d'adaptation des debits de donnees
DE60217428T2 (de) Verfahren und Vorrichtung zur Kodierung/Dekodierung in einem mobilen CDMA Nachrichtenübertragungssystem
WO2000057562A1 (fr) Transmission de donnees avec entrelacement puis adaptation de debits par perforation ou repetition
DE60003855T2 (de) Bitstromverschachtelungsverfahren in einem mobiltelefonsystem
DE10024444A1 (de) Vorrichtung und Verfahren zur arithmetischen Codierung/Decodierung und computerlesbares Aufzeichnungsmedium
WO2002007373A1 (fr) Procede et dispositif d'emission en diversite d'informations codees
EP1232597B1 (fr) Procede d'adaptation du debit binaire dans un dispositif de communication et dispositif de communication correspondant
EP1219034B1 (fr) Procede et dispositif de codage de voie dans un systeme de transmission d'informations
EP1511215B1 (fr) Procédé et dispositif de transmission de données selon un procédé ARQ hybride
WO2001026273A1 (fr) Procede d'adaptation du debit de donnees dans un dispositif de communication
WO2000021229A2 (fr) Procede d'adaptation du debit binaire
WO2001043332A1 (fr) Procede de modification dynamique de facteurs d'adaptation du debit binaire dans un systeme de radiocommunication

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): CN HU US

AL Designated countries for regional patents

Kind code of ref document: A1

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

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase