WO2003085873A2 - Procede et dispositif de communication pour adapter le debit de donnees dans un dispositif de communication - Google Patents

Procede et dispositif de communication pour adapter le debit de donnees dans un dispositif de communication Download PDF

Info

Publication number
WO2003085873A2
WO2003085873A2 PCT/DE2003/001061 DE0301061W WO03085873A2 WO 2003085873 A2 WO2003085873 A2 WO 2003085873A2 DE 0301061 W DE0301061 W DE 0301061W WO 03085873 A2 WO03085873 A2 WO 03085873A2
Authority
WO
WIPO (PCT)
Prior art keywords
bits
puncturing
rate
pattern
data
Prior art date
Application number
PCT/DE2003/001061
Other languages
German (de)
English (en)
Other versions
WO2003085873A3 (fr
Inventor
Martin DÖTTLING
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
Priority to AU2003232589A priority Critical patent/AU2003232589A1/en
Priority to KR1020047015848A priority patent/KR101045449B1/ko
Priority to BRPI0318842A priority patent/BRPI0318842B1/pt
Priority to JP2003582939A priority patent/JP4847679B2/ja
Priority to US10/510,896 priority patent/US8009550B2/en
Priority to BRPI0309059A priority patent/BRPI0309059B1/pt
Priority to EP03745745.4A priority patent/EP1497943B1/fr
Priority to KR1020107010009A priority patent/KR101120368B1/ko
Publication of WO2003085873A2 publication Critical patent/WO2003085873A2/fr
Publication of WO2003085873A3 publication Critical patent/WO2003085873A3/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/0059—Convolutional codes
    • 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

Definitions

  • the present invention relates to a method for adapting the data rate in a communication device and a corresponding communication device according to the preamble of claim 16.
  • the underlying transmission channels usually offer e.g. because of the embedding in certain broadcast formats, only a fixed one
  • UMTS mobile radio standard Universal Mobile Telecommunication System'
  • the data to be transmitted via a high-frequency channel are subjected to channel coding, with convolutional codes being used in particular for this purpose.
  • the channel coding encodes the data to be transmitted redundantly, which enables a more reliable recovery of the transmitted data on the receiver side.
  • a rate matching ('rate matching') is carried out in the transmitter, bits being either removed from the data stream or doubled in the data stream according to a certain pattern. Removing bits is called 'puncturing' and doubling is called 'repeating'.
  • bit error rate decreases at the edge of a correspondingly coded data block. It is also known that the bit error rate within a data block can be changed locally by puncturing that is distributed unevenly. It is also known from WO 01 / 26273A1 and WO 01/39421 AI that it is advantageous for the individual
  • Puncture data blocks of the data stream for adapting the data rate according to a specific puncturing pattern, the puncturing pattern being designed such that it has a puncturing rate which increases continuously from a central region of the individual data blocks to at least one end of the individual data blocks.
  • the present invention is therefore based on the object of providing a method for adapting the data rate of a data stream in a communication device and a corresponding communication device which have a ensure a satisfactory bit error rate and can be used in particular in mobile radio systems with convolutional coding.
  • the system of the convolutional code was used to find heuristic puncturing patterns, after which all bits of the punctured data block have a bit error rate that corresponds to their importance.
  • the puncturing pattern preferably has a puncturing rate increasing from the central region to both ends of the respective data block.
  • the bits are punctured more strongly at the beginning and end of the data block to be punctured, this being done not with a uniform puncturing rate but with a puncturing rate that increases essentially towards the two ends of the respective data block, i.e. the distance between the punctured bits becomes the two ends of the
  • This puncturing leads to an evenly distributed error rate of the individual over the punctured data block Bits and also results in a reduced overall error probability.
  • the present invention is particularly suitable for adapting the data rate of a convolutionally coded data stream and can therefore preferably be used in UMTS mobile radio systems, this relating to both the area of the mobile radio transmitter and that of the mobile radio receiver.
  • the invention is not limited to this area of application, but can generally be used wherever the data rate of a data stream has to be adapted.
  • FIG. 1 shows a simplified block diagram of a mobile radio transmitter according to the invention
  • the HS-SCCH channel is the so-called high-speed shared control channel, via which certain configuration information is transmitted and which can be divided into two parts, the so-called Part 1 and Part 2.
  • Part 1 is transmitted first and contains the information that the mobile station needs first to process the following data channel
  • Part 2 contains information that the mobile station only needs a little later. This division in two means that the delay through the HS-SCCH is as small as possible, since only the first part has to be decoded before the data can be received.
  • Fig. 4 a comparison with an inventive
  • Puncturing upper curve, crosses
  • conventional puncturing lower curve, circles
  • frame error rate the probability that at least one bit of a block was incorrectly transmitted
  • Fig. 5 underlying schemes for convolutional codes in UMTS.
  • Fig. 6 the bit error rate BER per bit for in UMTS
  • Fig. 7 how many input bits are affected when an output bit is punctured in the different output stages Output 1, Output 2 and Output 3.
  • Figure 9 a table with the results of puncturing depending on the number of punctured bits.
  • Fig. 12 different embodiments for a
  • Fig. 26 Exemplary embodiments for puncturing from 48 to 40 bits
  • Fig. 27 Exemplary embodiments for puncturing from 11 to 80 bits.
  • Fig. 28 Rate adjustment rule from the 3 GPP
  • 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. 1 shows, in particular, the components involved in the coding of this information or data.
  • 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 speech-coded data are then coded with the aid of a channel encoder 4, the actual useful or message bits being coded redundantly, as a result of which transmission errors can be recognized and then corrected.
  • the channel encoder 4 can be one
  • n the total number of coded bits, i.e. the number of redundant bits added corresponds to the expression n - k.
  • a code with the code rate r defined above is also referred to as an (n, k) code, the performance of the code increasing with decreasing code rate r.
  • So-called block codes or convolutional codes are usually used for channel coding.
  • convolutional codes do not encode individual data blocks one after the other, but that they are continuous processing, with each current code word of an input sequence to be coded also depending on the previous input sequences.
  • the 'constraint length' specifies the number of cycles of k new input bits of the channel encoder 4 by means of which a bit influences the code word output by the channel encoder 5.
  • the channel-coded information Before the channel-coded information is transmitted to the receiver, it can be 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 ) Receive 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 3 in accordance with a predetermined multiple access method.
  • the coded data stream is divided into data blocks, the channel encoder 4 being set to a known state at the start of a data block.
  • each coded data block is terminated by so-called 'tail bits', so that the channel encoder 4 is again in a known state.
  • This construction of the convolutional code and of the channel encoder 4 ensures that the bits at the beginning and end of an encoded data block are better protected against transmission errors than in the middle of the block. It is irrelevant whether these tail bits all have the known value 0, or some other value.
  • the values of these tail bits can also be chosen arbitrarily, whereby both sender and receiver must know the values to be used.
  • the error probability of a bit differs depending on its position within the respective data block. This effect is used, for example, in voice transmission in GSM mobile radio systems by placing the most important bits at the two ends of the block, where the probability of errors is lowest.
  • data packets are generally already discarded when only a single transmitted bit is faulty, which can be determined, for example, in the receiver by a so-called 'cyclic redundancy check' (CRC). It is therefore not possible to speak of important or less important bits in a data transmission, but all bits are to be regarded as equally important. If errors occur in a control block, i.e. a data block that contains control information that contains information about how subsequent user data are encoded and transmitted, it is generally no longer possible to correctly detect this user data if only a single bit is received incorrectly because the received data is then interpreted incorrectly.
  • a rate adjustment ('rate matching') is carried out in front of the modulator 7.
  • the rate adjustment takes place in the rate adjustment unit 6b, the puncturing unit 6a first performing puncturing in accordance with a specific puncturing pattern in order to achieve a more uniform error distribution over a data block.
  • the sequence of the puncturing unit 6a and the interleaver 5 shown in FIG. 1 are to be understood only as an example.
  • the interleaver can also be arranged after the unit 6b.
  • the interleaver 5 can also be replaced by two interleavers before and after the rate adjustment unit 6b, etc.
  • This channel transmits configuration information which specifies how the actual user data sent via a special data channel is coded and further details, for example the spreading codes used for transmission. In contrast to the data channel, over which a lot of data can be transmitted, this is comparatively little data.
  • convolutional codes with the rate V or 1/3 are used for coding, the polynomials used are shown in FIG. 5. Polynomials also refer to the exact design of the "tapping points", that is to say which delay stages for the individual output bit streams are tapped and linked by an exclusive-or operation. The invention is therefore particularly applicable to the so-called HS-SCCH (High Speed Shared Controll CHannel).
  • the block length of the two parts of the HS-SCCH is currently 8 bits for the first part, or if the end bits (tail bits) are included 16 bits, 29 bits for the second part, or if the end bits (tail bits) are also included become 37 bits. Since the specification is still in flow, changes in various parameters can also result in other block lengths. Furthermore, the convolutional codes with the rate h or 1/3 can also be used. The following rate adjustments are particularly relevant:
  • the first bits are e.g. also linked to the bits preceding them, that is, bits that actually do not exist. These "non-existent bits” are then set to a known value, usually zero. This is known to the receiver, who in turn decodes the first transmitted bits with these bits set to zero. Decoding is very safe here, since some of the bits are known with absolute certainty. The same applies to the last bits: Following them, bits, the so-called end bits or “tail bits”, are again artificially inserted into the delay elements D of the decoder; these end bits are in turn set to a known value, usually zero.
  • the envelope curve of the bit error rate compared to the frame number is here initially shaped convexly with even repetition or puncturing.
  • the envelope curve essentially represents a horizontal
  • bit error rate is essentially the same for all bits within a frame. This is done, for example, by dotting on the edge or
  • the edge is punctured so strongly, for example, that the bits in the central area of the frame have a lower bit error rate.
  • bit error rate is irregular compared to the
  • the aim is therefore to eliminate opportunities that are not sensible from the outset. This is not done by repeating and / or puncturing, which is why alternative c) is not considered further here.
  • FIG. 7 An ordering principle is shown in FIG. 7. For the first 9 input bits 1-9 and the last 9 input bits n-8 to n the puncturing level for the respective output stage Output 0, Output ⁇ l, Output 2 is shown.
  • the output stages themselves, as can be seen in FIG. 5, are the respective output functions which are formed from all input bits preceding the input bit under consideration by linking.
  • the output stages of FIG. 5b) are considered here, that is to say the rate 1/3 convolutional encoder. For puncturing with as little information loss as possible, it is advisable to omit bits (puncturing) that have little influence on other bits.
  • Puncturing level therefore indicates how many bits are affected by puncturing the considered bit.
  • FIG. 8 An exemplary procedure for omitting or puncturing bits is shown in FIG. 8.
  • the first 9 input bits 1-9 and the last 9 input bits n-8 to n are specified in the first column.
  • the bit numbers of the information bits affected by the puncturing i.e. information bits or input bits, are for the respective one
  • the table fields have an increasingly dark background as the number of information bits affected increases. The bits belonging to the bright table fields are therefore candidates for puncturing.
  • a table is shown in FIG. 9, in which the important variables when puncturing near the ends, ie puncturing the first and last bits, are illuminated.
  • N input bits information bits
  • k coded bits bits at the output stage, output bits
  • the first column shows the number of punctured output bits (# punct bits)
  • the last column cumulative) the number of information bits affected at the input, whereby input bits that are affected several times, i.e. by puncturing several output bits, also be counted accordingly several times.
  • the second column under Sequence indicates which output bit (bit number) was punctured in this step. The puncturing is done, starting with the least important bits in the first line, up to the following bits in the following lines.
  • the total puncturing pattern for, for example, 7 bits to be punctured results from the bits specified in column 2 in rows 1 to 7, that is to say bits 1, k, 4, k-4, k-6, 2, k-1.
  • This pattern thus comprises bits 1, 2, 4, k-6, k-4, k-1, k.
  • Above the first line is the indexing for the first information bits 1-9 and the last information bits k-8 to k. For space reasons, only -8 etc. is written instead of k-8.
  • the entries in the columns below the indexing of the information bits indicate how strong the information bit in question is by puncturing the
  • Output bits that are specified in the 2nd column up to the respective line and are therefore punctured are affected. That is, how many of the punctured output bits were associated with this information bit. This is a measure of how much the information bit in question has been weakened by the puncturing.
  • the mean puncturing rate (mean P-rate) is the column "mean value" divided by 18, the total number of "exclusive or” links occurring per information bit during the encoding.
  • One way to puncture any number of bits is to make tables analogous to those mentioned above. For rate 1/3 and the polynomials considered Convolutional encoder, the tables shown can be used. With other coding rates and / or other polynomials, the tables can easily be determined analogously. With the help of these tables, a puncturing order is then determined, where those output bits are first punctured which have only a minor influence on the cumulative puncturing strength. If there are several alternatives, then bits are preferably punctured which minimize the maximum of the puncturing strength of the individual bits.
  • bits that would be punctured first according to the heuristic are now repeated last and that generally a uniform repetition is carried out first in the middle section, preferably by the polynomials with the most links. Then those bits are repeated on the edge that (in the case of puncturing) have the greatest possible influence on the cumulative puncturing strength.
  • the invention therefore uses a heuristic method which allows:
  • bit error rate distribution the bit error rate of each individual information bit
  • Rate adjustment patterns are further refined and optimized.
  • the bit error rate distribution of the unpunctured / non-repeated block serves as start information
  • the puncturing strength Si pro is used as a heuristic metric
  • a good rate adjustment pattern is sought according to the following quality criteria:
  • tables are set up based on the generator polynomials of the code, for the beginning and the end of the coded block, which represent the cumulative puncturing strength per coded bit, as well as the information bits concerned.
  • the coded bits can thus be divided into so-called classes of cumulative puncturing strength.
  • bits to be punctured / repeated are selected on the basis of these tables in such a way that for those information bits that show a lower bit error rate than other bits, the puncturing strength is increased and at the same time the cumulative puncturing strength is kept low.
  • the puncturing strength is therefore chosen to be inversely proportional to the bit error rate of the information bit and, in addition, bits are selected which contribute little to the cumulative puncturing strength.
  • This method is then applied iteratively based on the first determined pattern, so that after just a few simulations, a rate adjustment pattern specifically optimized for the respective convolution code can be found.
  • 11 and 12 show different possibilities for puncturing patterns according to the invention, the numbers of the bits to be punctured (the counting starts at 1). The tables are for different numbers of to be transferred
  • FIG. 4 shows the course of the bit error rate for the individual transmitted bits of a data block as a function of their position in the data block for conventional puncturing with a regular puncturing pattern with coding with rate 1/3 and puncturing 8 bits (48) 40 bit). This corresponds to a transmission of 8 input bits.
  • FIG. 10 shows the distribution if, instead, the puncturing pattern No. 3 from FIG.
  • FIG. 16 shows further preferred exemplary embodiments in the context of the invention with a puncturing of 14 out of 54 bits, the patterns 3 and 4 achieving the best results.
  • the present invention has so far been described in terms of use in a mobile radio transmitter.
  • the invention can, however, also be extended to mobile radio receivers where a signal punctured or repeated in order to adapt the data rate in the manner described above corresponds to the puncturing or Repetition patterns must be worked up.
  • additional bits are inserted into the received bit stream in the respective receiver for punctured or repeated bits on the transmission side, or two or more bits of the received bit stream are combined.
  • additional bits are inserted, this is noted in the form of a so-called 'soft decision' information that their information content is very insecure.
  • the processing of the received signal can take place in the respective receiver in the reverse order to FIG. 1.
  • the previously specified puncturing patterns mainly focus on puncturing in the end areas and / or repeating in the middle area.
  • the further rate adjustment patterns now described were determined using the method explained above for various proposals for HS-SCCH coding in the standardization.
  • the bits to be punctured or repeated are given in each case.
  • the bits are numbered from 1 to N.
  • the preferred pattern is mentioned first, but the other patterns always have similarly favorable properties.
  • puncturing patterns for different output bit rates are shown in FIGS. 18-24 and further repetition patterns in FIG. 25.
  • the bits are marked with x ll , x l2 , x, ..., x ⁇ X .
  • i represents the transport channel number
  • the sequence itself is in sections 4.2.7.4 of the specification for the uplink and in 4.2.7.1. defined for the downlink.
  • the uplink is the connection of a communication device to the base station
  • the downlink is the connection of a base station to a communication device.
  • bit to be punctured it is checked whether the bit should be punctured with the index m, a bit to be punctured then being set to a value ⁇ that is different from 0 or 1.
  • a repeated bit is set directly after the original bit.
  • ⁇ i, e ⁇ n i, e p ⁇ US and e m i nU s are each selected so that the desired rate adjustment can be achieved.
  • e ⁇ n i can in principle be chosen arbitrarily in the range between 1 and e p ⁇ us , whereby there is a slight shift in the pattern, this is used in certain cases (rate adjustment after a first interleaving (nesting)) to differentiate the pattern Suitable to move the frame against each other.
  • the parameter i identifies different transport channels in the specification. However, this parameter is irrelevant in the present case and is therefore omitted. The following shows how you can use this rate matching algorithm
  • Rate matching patterns for short block sizes in convolutional codes can approximate.
  • an attempt is made to use bits at the ends of the code block when puncturing, and especially bits from the middle of the code block when repeating.
  • a key aspect of this embodiment is the parameter i ei n is not to be limited to the range of values from 1 to p e ⁇ U ⁇ , but to select instead in an advantageous manner outside this range. At first glance, such a choice may seem contradictory, because then it is no longer ensured that the desired number of bits is punctured or repeated. By an advantageous Adjusting the values of e p ⁇ us and e m inus can, however, be achieved so that the desired number is nevertheless achieved.
  • N p number of bits to be punctured / repeated (the index p in N p indicates the number of bits to be punctured, but N p can also denote the number of bits to be repeated)
  • the parameters of the rate matching algorithm are chosen so that the first N 0 bits are punctured at the beginning of the code block
  • the puncturing points that are not printed in bold can be varied by varying the e ⁇ n i value according to (1) and (2). either partially or completely decreased by one.
  • the table shown below in FIG. 27 shows in the same way the resulting patterns for puncturing from 111 bits to 80 bits.
  • Puncturing patterns which were already discussed above, can be achieved with this method, a certain improvement in the transmission quality compared to the current state of the specification can be achieved, the changes to be made are comparatively small.
  • the position of the first bit to be repeated is Ji, and N p bits are repeated as required.
  • a combination of the above criteria is also possible when selecting a puncturing pattern. For example, you can combine a pattern from two patterns presented here, using the beginning of one pattern at the beginning and the end of the second pattern at the end. Furthermore, it is irrelevant if the bits are output in a different order, and at the same time the puncturing pattern is adjusted analogously. For example, the order of the polynomials in the convolutional encoder can be exchanged.

Landscapes

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

Abstract

L'invention concerne un procédé permettant d'adapter le débit de données d'un flux de données dans un dispositif de communication, selon lequel, le flux de données peut être subdivisé en au moins un bloc de données qui contient des bits de transmission à transmettre ; les bits de transmission sont formés par un processus de codage de bits d'entrée transmettant des informations ; pour adapter le débit de données, des bits de transmission déterminés à partir d'un bloc de données du flux de données sont enlevés (munis de points) ; un modèle de dotation de points permet de déterminer les bits de transmission à enlever et le modèle de dotation de points est conçu de manière à enlever de préférence les bits de transmission qui dépendent de peu de bits d'entrée au cours du processus de codage. L'invention concerne en outre un dispositif de communication correspondant.
PCT/DE2003/001061 2002-04-08 2003-04-01 Procede et dispositif de communication pour adapter le debit de donnees dans un dispositif de communication WO2003085873A2 (fr)

Priority Applications (8)

Application Number Priority Date Filing Date Title
AU2003232589A AU2003232589A1 (en) 2002-04-08 2003-04-01 Method and communications device for adapting the data transfer rate in a communications device
KR1020047015848A KR101045449B1 (ko) 2002-04-08 2003-04-01 통신 장치에서 데이터 레이트를 적응시키기 위한 방법 및통신 장치
BRPI0318842A BRPI0318842B1 (pt) 2002-04-08 2003-04-01 processo para a equalização da taxa de transmissão de dados em um dispositivo de comunicação e dispositivo de comunicação
JP2003582939A JP4847679B2 (ja) 2002-04-08 2003-04-01 通信装置においてデータレートをマッチングするための方法及び通信装置
US10/510,896 US8009550B2 (en) 2002-04-08 2003-04-01 Method and communications device for adapting the data transfer rate in a communications device
BRPI0309059A BRPI0309059B1 (pt) 2002-04-08 2003-04-01 processo para a equalização da taxa de transmissão de dados em um dispositivo de comunicação e dispositivo de comunicação
EP03745745.4A EP1497943B1 (fr) 2002-04-08 2003-04-01 Procede et dispositif de communication pour adapter le debit de donnees dans un dispositif de communication
KR1020107010009A KR101120368B1 (ko) 2002-04-08 2003-04-01 통신 장치에서 데이터 레이트를 적응시키기 위한 방법 및 통신 장치

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE10215380.9 2002-04-08
DE10215380 2002-04-08
DE10291151.4 2002-04-29

Publications (2)

Publication Number Publication Date
WO2003085873A2 true WO2003085873A2 (fr) 2003-10-16
WO2003085873A3 WO2003085873A3 (fr) 2003-12-04

Family

ID=32009773

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE2003/001061 WO2003085873A2 (fr) 2002-04-08 2003-04-01 Procede et dispositif de communication pour adapter le debit de donnees dans un dispositif de communication

Country Status (1)

Country Link
WO (1) WO2003085873A2 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7486644B2 (en) 2004-12-01 2009-02-03 Samsung Electronics Co., Ltd Method and apparatus for transmitting and receiving data with high reliability in a mobile communication system supporting packet data transmission

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6819718B1 (en) * 1998-10-07 2004-11-16 Siemens Aktiengesellschaft Apparatus and method for transmitting punctured or repeated data
WO2001039420A1 (fr) * 1999-11-25 2001-05-31 Siemens Aktiengesellschaft Procede permettant d'adapter le debit binaire dans un dispositif de communication et dispositif de communication correspondant
US6675347B1 (en) * 2000-07-19 2004-01-06 Qualcomm, Incorporated Method and apparatus for combined puncturing and repeating of code symbols in a communications system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7486644B2 (en) 2004-12-01 2009-02-03 Samsung Electronics Co., Ltd Method and apparatus for transmitting and receiving data with high reliability in a mobile communication system supporting packet data transmission

Also Published As

Publication number Publication date
WO2003085873A3 (fr) 2003-12-04

Similar Documents

Publication Publication Date Title
DE60034203T2 (de) Vorrichtung zur übereinstimmung der datenrate und verfahren zur datenübertragung
DE10030407B4 (de) Verfahren zur optimalen Ratenanpassung in einem Mobilkommunikationssystem
EP1232596A2 (fr) Procede d'adaptation du debit de donnees dans un dispositif de communication et dispositif de communication correspondant
DE69433529T2 (de) Verfahren zur kommunikation in einem funktelefonsystem
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
WO2003001730A1 (fr) Procede et dispositif pour la transmission de donnees selon un procede arq
EP1198913A1 (fr) Procede pour empecher les erreurs dans un train de bits d'information
WO2000022740A1 (fr) Procede et dispositif de codage ou de decodage
DE20211492U1 (de) Einrichtung zur Bestimmung eines Modulationsschemas in einem Kommunikationssystems
DE102015110602A1 (de) Verfahren und Vorrichtung zum iterativen Decodieren einer Datentransferstruktur
EP1497943B1 (fr) Procede et dispositif de communication pour adapter le debit de donnees dans un dispositif de communication
DE60032714T2 (de) Verfahren und Apparat für den Kanalfehlerschutz eines quellencodierten Bitstromes
WO2001026274A1 (fr) Procede et dispositif de transmission de trames de donnees et procede et dispositif d'adaptation des debits de donnees
EP1512242B1 (fr) Pointillage identique pour donnees d'identification d'equipement utilisateur et pour donnees utiles de canal hs-scch
WO2003085873A2 (fr) Procede et dispositif de communication pour adapter le debit de donnees dans un dispositif de communication
EP1142185B1 (fr) Procede et systeme pour le codage de canaux ou le decodage d'informations a structure de trame
DE10219151A1 (de) Verfahren und Kommunikationsvorrichtung zur Anpassung der Datenrate in einer Kommunikationsvorrichtung
WO2001026273A1 (fr) Procede d'adaptation du debit de donnees dans un dispositif de communication
EP1708403B1 (fr) Procédé ARQ hybride de transmission de données, émetteur et récepteur correspondants
DE102023207765A1 (de) Transceiver sowie Betriebsverfahren
DE10023826B4 (de) Verfahren zum Übertragen einer Rahmennummer in einem Kommunikationssystem
EP1518345A1 (fr) Procede d'adaptation de debit
WO2005043800A1 (fr) Procede de repetition de transmission automatique hybride avec redondance amelioree
DE19956748A1 (de) Verfahren zur Anpassung der Datenrate in einer Kommunikationsvorrichtung und entsprechende Kommunikationsvorrichtung
WO2004021632A1 (fr) Procede de transmission de donnees

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PH PL PT RO RU SC SD SE SG SK SL TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

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

Ref document number: 2003745745

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 1020047015848

Country of ref document: KR

WWE Wipo information: entry into national phase

Ref document number: 20038078368

Country of ref document: CN

Ref document number: 2003582939

Country of ref document: JP

Ref document number: 10510896

Country of ref document: US

WWP Wipo information: published in national office

Ref document number: 1020047015848

Country of ref document: KR

WWP Wipo information: published in national office

Ref document number: 2003745745

Country of ref document: EP