WO2004006489A1 - Procede d'adaptation de debit - Google Patents

Procede d'adaptation de debit Download PDF

Info

Publication number
WO2004006489A1
WO2004006489A1 PCT/DE2003/001949 DE0301949W WO2004006489A1 WO 2004006489 A1 WO2004006489 A1 WO 2004006489A1 DE 0301949 W DE0301949 W DE 0301949W WO 2004006489 A1 WO2004006489 A1 WO 2004006489A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
rate
bits
rate adjustment
coding
Prior art date
Application number
PCT/DE2003/001949
Other languages
German (de)
English (en)
Inventor
Martin DÖTTLING
Jürgen MICHEL
Bernhard Raaf
Ralf Wiedmann
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 AU2003250748A priority Critical patent/AU2003250748A1/en
Priority to EP03762396A priority patent/EP1518345A1/fr
Publication of WO2004006489A1 publication Critical patent/WO2004006489A1/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/0056—Systems characterized by the type of code used
    • H04L1/007—Unequal error protection
    • 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/0072—Error control for data other than payload data, e.g. control data
    • 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/08—Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system

Definitions

  • the present invention relates to a method for rate adaptation, in which the bit rate of data streams is adapted to a fixed bit rate, for example a physical channel.
  • Transmission channels in mobile radio systems for example, only offer fixed data or raw data transmission rates due to their embedding in transmission formats, while the transmission or reception data rates of different signals or applications differ. It is therefore generally necessary to adapt the data rates to one another at an interface.
  • UMTS Universal Mobile Telecommunication System
  • the associated control information is transmitted via the "High-Speed Shared Control Channel” (HS-SCCH), such as, for example, the channelization codes used for the HS-DSCH, which are codes with which transmissions are spread on a receiver-specific basis and the modulation scheme, for example QPSK (Quadrature Phase Shift Keying) or 16QAM (16 Quadrature Amplitude Modulation).
  • QPSK Quadrature Phase Shift Keying
  • 16QAM 16 Quadrature Amplitude Modulation
  • the essence of the invention is to design the rate adaptation for user data and identification data in the overall coding of a channel used by a plurality of communication subscribers, with the aid of which it is made clear, for whom the data is intended, according to a common scheme.
  • This has the advantage that the complexity of the decoding is reduced, in particular on the receiver side.
  • Another aspect of the invention aims at the design of a rate adjustment pattern which allows the rate adjustment for user data and identification data according to a common scheme while maintaining the original information as well as possible.
  • a rate adjustment pattern indicates which Bits from a data sequence are repeated or shortened (punctured) in order to obtain the desired data rate.
  • FIG. 1 shows an overview of the overall coding for a channel in which the data to be transmitted are masked using the identification data
  • FIG. 2 shows a diagram which represents individual processes in the overall coding
  • FIG. 3 shows the previous implementation of the overall coding in the HS-SCCH according to the prior art
  • FIG. 4 shows an exemplary embodiment of an implementation of the total coding in the HS-SCCH according to the invention
  • FIG. 5 shows an exemplary implementation on the receiver side for receiving the HS-SCCH in the currently used specification (release 99);
  • FIG. 6 shows an exemplary embodiment of the implementation on the receiver side in the case of overall coding in accordance with the proposal shown in FIG. 4.
  • FIG. 1 Overall coding of useful and identification data
  • FIG. 1 schematically shows an overall coding for user data (LD: Load Data) and identification data (ID: Identification Data), which are sent via a shared channel in a communication system.
  • Transmitted data TD: Transferred Data
  • LD Load Data
  • ID Identification Data
  • Transmitted data TD: Transferred Data
  • LD Load Data
  • ID Identification Data
  • TD Transferred Data
  • Channel Coding is understood to mean the adaptation of digital values to the physical transmission medium, that is to say, for example, coding with subsequent
  • total coding is understood to mean the coding, rate adaptation and linking of the useful and identification data. However, it is not absolutely necessary for all of the steps listed to take place; the overall coding can also consist, for example, of coding alone without rate adjustment.
  • FIG. 1 The scheme shown in FIG. 1 is known per se, but the prior art and the invention differ in the procedure for the overall coding.
  • the user data LD are first subjected to a coding C_LD.
  • C_LD coding
  • LD redundancy is added to the useful data, which means that the transmitted data TD can be recovered more reliably in the event of transmission errors on the receiver side.
  • a problem associated with coding is that the data rate is reduced by the factor R and the information is therefore packed and thus a partial loss can be more problematic than with less densely packed information.
  • a rate adjustment (rate matching) RM_LD is carried out in the transmitter, bits being either removed from the data stream or repeated in the data stream according to a certain pattern. Removing bits is called “puncturing” and repeating bits is called “repeating”.
  • the identification data ID are first subjected to a coding C_ID and then to a rate adjustment RM_ID. Subsequently, identification data and user data are linked to one another in a linking process L, as a result of which the data TD to be transmitted are formed.
  • FIG. 3 shows the implementation of the overall coding of the HS-SCCH part 1 in accordance with the current specification UMTS standard (FDD, Release 5).
  • the user data LD are formed by the channel information bits x CC s, ⁇ , x Cc ⁇ , 2 / • • • ⁇ ⁇ x ccs7 .
  • the channel information bits are referred to in specialist circles as “channelization code set bits”.
  • the modulation scheme bit x mS ⁇ l which is also referred to as "modulation scheme bit” flows into the user data.
  • This user data is encoded with a rate 1/3 convolutional encoder in accordance with the 1999 standard (Release 99).
  • the Multiplexer MUX enables an alternate polling of channel information bits X ccs and the modulation scheme bit X ⁇ .
  • the entirety of the data present after the multiplexer is referred to as X.
  • This coded bit block is referred to as Z x .
  • the index 1 means here that it is a size that concerns part 1 of the HS-SCCH.
  • Part 1 of this control channel contains data which the receiver must decode immediately in order to process incoming data on the HS-DSCH (HS Downlink Shared Channel) accordingly. Accordingly, the availability of the data of Part 2 (Part 2) is less time-critical.
  • a rate matching takes place according to the following rate matching pattern (pattern 1): from the bit block or the sequence Z x , which results from coding process C_LD the bits are punctured at positions 1, 2, 4, 8, 4 ' 2, 45, 47, 48. If a notation with a second index j is used, which identifies the bit position and runs from 1 to 48 in the case shown, then the bits to be punctured can be specified as Z 1 (1 , Z 12 / Z 1 (4f Z lfB ⁇ Z l ⁇ 42 _ Z 145> Z lj47> Z 148. As before, the first index indicates that it is part 1 of the HS-SCCH. In this notation, the sequence R 1 (1 R l ⁇ 2 , ••• R ⁇ / 40 before.
  • the control channel HS-SCCH is intercepted by several mobile stations or mobile radio terminals (UE: User Equipment).
  • UE Mobile Radio terminals
  • the user data consisting of channel information data and the modulation scheme, are identified by the identification data or a specific mask dependent on the identification number of the mobile station.
  • a so-called scrambling code for the identification number of the mobile station is generated, with which the user data be masked.
  • the identification number of the mobile station UE ID is assigned to the mobile station in the respective cell by the respective base station. Scrambling is therefore a "personalization" of the information. This is done using the so-called “scrambling codes", with which the signal is modified in order to separate or separate signals for individual terminals or base stations.
  • C_ID Rate% convolutional encoder
  • x2 48 bits of a sequence B at the output of the convolutional encoder.
  • the rate adjustment algorithm from the 1999 standard (Release 99) for puncturing is used for the rate adjustment RM_ID (RM_ID), in which of the sequence B, consisting of bits b x _ b 2p ...
  • individual bits have different importance after the coding stage. This different importance depends on how many input bits of the coding stage an output bit of the coding stage is associated with. The more input bits flow into the output bit, the more important the output bit is to restore the original data.
  • bits are preferably punctured which are of less importance in this sense.
  • different rate adaptation patterns lead to different distance properties with regard to the Hamming distances of the resulting code sequences or code words and thus determine the performance of the coding.
  • the aim of the invention is to make the overall coding, in particular the rate adjustment, less complex than is currently the case, that is to say the specification according to Release 5.
  • a main aspect of the invention is to perform the rate adjustment for identification data ID and user data LD according to a common rate adjustment pattern SR.
  • SR rate adjustment pattern
  • two solutions are conceivable for this: i) The use of a common rate adjustment pattern, but separate implementation of the rate adjustment for user data LD and identification data ID. ii) Using a common rate adjustment pattern and performing the rate adjustment together.
  • FIG. 4 now shows a process sequence designed according to solution ii), likewise for the example of the control channel HS-SCCH.
  • the identification data ID here referred to as identification bit sequence X ue
  • the channel information data here X ccs and X ,. s already after the respective coding C_LD or C_ID, linked together and then subjected to a common rate adjustment.
  • the linking is done, for example, by an XOR function if the two values that a bit can take are defined with 0 and 1. If the values - 1 and 1 are assumed, the link can be made by multiplication. However, other bitwise links can also be used.
  • the data resulting from the coding process are designated Z 1 .
  • the bit block or the bit sequence or the sequence R x denotes the data before the common rate adjustment, but after the link.
  • Another aspect of the invention is the design of a rate adjustment pattern, which is approximately equally suitable as a common scheme for user data LD and identification data ID.
  • An important aspect here is, among other things, that the Hamming distance or the Hamming distance after the link is as large as possible, for Example of the linked data in the event of a fault
  • Hamming distance is understood to mean the number of bits by which two code words of the same length differ from one another. This is used for error detection by comparing received data units with valid characters. Any correction is made according to the probability principle. To keep the information content of the user data LD as good as possible, a large Hamming
  • the size of the shelf k is determined by the distance of the last to bit position to the last bit position. If the last bit to be punctured is at position 42, the puncturing pattern can be shifted back by a maximum of 6 positions with a total length of 48 bits.
  • the puncturing pattern used is the puncturing pattern "Pattern 1" [1] optimized for the user data of Part 1 of the HS-SCCH:
  • a new puncturing pattern which simultaneously optimizes the coding properties of the data of Part 1 of the HS-SCCH and the recognition possibilities of the masking with the UE ID, can be solved by an optimization, whereby the secondary conditions through the data structure in the identification data branch and are specified in the user data branch.
  • a target function is first formed, in which the variable to be optimized is mapped. Taking into account the secondary conditions caused by the system, an extremum is then sought for this target function, for example the target function is minimized.
  • the optimization function serves as the target function to be minimized
  • Detection is understood here to mean that the decision based on the scrambling with identification data that the packet is intended for the mobile station is made correctly. that, that is.
  • This objective function can be calculated or approximated under system-related boundary conditions, such as the number of channels to be observed, or boundary conditions of the control channel allocation. Based on the usual detection criteria and decoding algorithms specifically proposed for this, a rate adaptation pattern is then sought which minimizes the target function.
  • False alarm probability is the case when the mobile station incorrectly assumes that the data packet is intended for it, although it is actually intended for another or no mobile station. This contribution is made as follows: If the mobile station in the previous period (also called TTI, Transmission Time Interval) incorrectly selected a different HS-SCCH than the HS-SCCH on which the information is currently being transmitted from the base station due to a false alarm the mobile station can use all resources for the current time slot that are required for "listening" to the other, unselected HS-SCCH's for other tasks. This is because the standard provides for the case that that the same HS-SCCH is always used in successive time steps from a base station to a mobile station.
  • TTI Transmission Time Interval
  • the channel information bits can indicate a number of the codes signaled for the subsequent data transmission which is greater than the number of codes which the mobile station supports or which are currently configured in the base station. Such an assignment indicates that the channel information bits were received incorrectly and the corresponding HS-SCCH can consequently be discarded.
  • the modulation scheme bit if it indicates an unsupported modulation type. Based on this objective function, the following puncturing pattern appears to be particularly suitable. For better readability, the positions at which the bit is punctured are marked with 0, positions at which there is no puncturing are marked with 1: 011101101011111111111111111111111111111111111100011101
  • Simplification of the decoding on the receiver side is a great advantage due to the lower complexity of the decoding. Differences in the decoding, how it is currently carried out and how it is done of the invention are set out below.
  • FIG. 5 shows an exemplary implementation in the receiver device, as is required in the current specification (release 99).
  • the transmitted data TD is received via the air interface AI (Air Interface). These transmitted data TD are demodulated in the demodulator demodulator. After demodulation, this data is fed directly to a bit error count unit. On the other hand, this data is linked to the masking data, for example by an XOR connection or a multiplication.
  • the masking data are generated in the mobile station from the identification number of the mobile station UE ID, which is encoded and then subjected to a rate adjustment (RM2). This is followed by the link with the demodulated, transmitted data TD.
  • the rate adjustment RM2 of the masking data is required to match the bit lengths of the masking data.
  • the rate adjustment RM1 "1 is undone for the linked signal before decoding Dec. This data is decoded and re-encoded to check whether the information was intended for the respective receiving mobile station and subjected to a further rate adjustment RM1 before it is repeated.
  • the result of this new combination also flows into the bit error counting unit, in which the detection of the errors is based on a processing of 40 bits, that is as many bits as via the air interface AI per HS-SCCH Frame (HS-SCCH subframe), which consists of three so-called slots or time slots, are transmitted.
  • FIG. 6 shows two exemplary implementations that can be used with a rate adjustment carried out according to the invention.
  • bit error detection in the bit error count unit Bit Error Count is also based on 40 bits. Due to the same rate adjustment pattern used in the transmitter for identification data ID and user data LD, the rate adjustment only takes place together with the transmitted data TD received via the air interface, immediately before the bit error counting unit Bit Error Count. In this way, compared to the prior art, a rate adjustment is saved, namely that, as can be seen from FIG. 5, of the masking data before it is linked to the received data.
  • the transmitted data TD are received via the air interface AI. Become a demod after a demodulation process the data is divided and flows on the one hand in a first
  • the rate adjustment RM "1 is undone and subsequently linked to the masking data, which are generated by coding the mobile station identification number.
  • no rate adjustment of the masking data is required because the rate adjustment the transferred data was undone before the link was created.
  • the linked data is decoded in a decoding process Dec.
  • the required data is then available, on the other hand, this data is subjected to coding in a further coding process and linked again with the masking data. This is done for the purpose of
  • the transmitted data TD are received via the air interface AI. Subsequently, the rate adjustment RM "1 is canceled, which is necessary because, on the one hand, the data is passed in a first branch directly to the bit error counting unit Bit Error Count, in which the bit error detection takes place on the basis of 48 bits.
  • this data is linked to the masking data generated in the mobile station from the mobile station identification number UE ID.
  • the required data are then available.
  • the data is subjected to a coding coding for the subsequent error detection and then linked to the masking data.
  • a rate adjustment after the linking is not necessary since there are 48 bits, on the basis of which the error detection also takes place.
  • the detection can be supported by further criteria or based on entirely different criteria. These criteria are explained below: Since the probability of false alarms is also an essential factor for the detection of HS-SCCH, Part 1, a combination, for example, that is to say a logical AND combination of the bit error counting unit, can be carried out using a so-called status criterion. This state criterion assumes that data is only available if the best decoding metric occurs in a decoding state, which element is a predefined state set. Decoding metric is a measure of the probability of decoding.
  • Viterbi decoder is often used to determine the best decoding metric from a data set.
  • the following explanations therefore relate to one Viterbi decoders, but can be adapted accordingly to others
  • a Viterbi decoder compares the received data record with all possible data records, that is to say the predefined set of states, and then selects the data sequence which has the greatest probability of agreeing with the data sequence actually transmitted.
  • the Viterbi decoder or decoder is widely used for decoding convolutionally coded data. It calculates a set of states for each bit position, the number of which depends on the so-called influence length Le. Each state then corresponds to a possible value of the last Le bits under consideration. A metric is calculated for each state, which represents a measure of the probability that this state or the associated bit sequence is the one that is actually transmitted.
  • tail bits which generally have the value 0 are inserted in the coding process after the actual data.
  • the zero state in which the last Le bits are assumed to be 0, should be the most likely.
  • the state set for the final state in which it is assumed that the data packet is actually intended for the mobile station, only contains the zero state. Then the criterion is also called a zero state criterion. The mobile station then only assumes that the data packet is intended for it if the zero state actually appears as that at the end of the decoding
  • This criterion serves in particular to reduce the probability of false alarms.
  • the mobile station compares a priori information with this criterion, namely the known fact that the tail or end bits have the value 0, with the value of these bits, which is determined by a decoding tion without using this knowledge. A match is then seen as an indication that the entire coding is consistent and therefore correct.
  • the zero state criterion is expanded to a best state criterion and the presence of data is assumed as soon as the best decoding metric occurs in a state which is in a predetermined set of states M is included, for example, in addition to state 0 (that is ... 00), states 1 (that is ... 01) and 2 (that is
  • This tail area is characterized by the fact that it depends on fewer and fewer data bits, particularly with the last bits. As a result, the bits in the tail area are increasingly correlated. On the one hand then these bits are less helpful for decoding the data by a decoder. On the other hand, these bits are then better suited for the detection of differences in a mask, ie the identification data. Bits that do not contain any information at all would be ideal for this, but on the other hand this would represent a waste of bits in the decoding.
  • the secondary conditions are then modified or the selected areas are expanded.
  • the computer-assisted search could also be extended to the first 28 bits, that is to say partly also to an area in which the tail bits already have an influence, in order to find a good puncturing pattern there.
  • rate adjustment patterns has been explained in particular for the HS-SCCH, but is not limited to this.
  • Masking of the useful data is also used in other control channels, as a result of which the invention can be used in various configurations.
  • pattern is also used for rate adjustment patterns
  • Physical channel mapping x also means the mapping to the physical data channel.
  • XOR is used as a shorthand for an exclusive OR combination.
  • UE User Equipment design for a UMTS mobile station
  • the cited document is a document from 3GPP (Third Generation Gartnership Project), address: ETSI, Mobile Competency Center, 650, route des Lucioles, 06921 Sophia-Antipolis Cedex and is cited here in the format used by this organization.

Landscapes

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

Abstract

L'invention concerne un procédé permettant d'adapter un débit à un débit binaire déterminé. Selon ce procédé, les données, dont le débit est adapté, sont composées d'au moins deux flux de données codés et l'adaptation des débits binaires des deux flux de données au débit binaire déterminé s'effectue à l'aide d'un modèle d'adaptation de débit, qui est identique pour ces deux flux de données et par l'intermédiaire duquel le schéma de répétition ou de pointage de séquences de données individuelles est déterminé à partir des flux de données.
PCT/DE2003/001949 2002-07-02 2003-06-11 Procede d'adaptation de debit WO2004006489A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
AU2003250748A AU2003250748A1 (en) 2002-07-02 2003-06-11 Rate matching method
EP03762396A EP1518345A1 (fr) 2002-07-02 2003-06-11 Procede d'adaptation de debit

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE2002129640 DE10229640A1 (de) 2002-07-02 2002-07-02 Verfahren zur Ratenanpassung
DE10229640.5 2002-07-02

Publications (1)

Publication Number Publication Date
WO2004006489A1 true WO2004006489A1 (fr) 2004-01-15

Family

ID=29796088

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE2003/001949 WO2004006489A1 (fr) 2002-07-02 2003-06-11 Procede d'adaptation de debit

Country Status (4)

Country Link
EP (1) EP1518345A1 (fr)
AU (1) AU2003250748A1 (fr)
DE (1) DE10229640A1 (fr)
WO (1) WO2004006489A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10345638A1 (de) 2003-09-29 2005-06-02 Siemens Ag Verfahren zur Datenübertragung

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1999053628A2 (fr) * 1998-03-27 1999-10-21 Nokia Networks Oy Communication de donnees et systeme radio
WO2001052467A1 (fr) * 2000-01-10 2001-07-19 Qualcomm Incorporated Procede et appareil de prise en charge de donnees adaptatives a debits multiples (amr) dans un systeme de communications amcr
WO2002035710A2 (fr) * 2000-10-24 2002-05-02 Siemens Aktiengesellschaft Dispositif et procede d'adaptation de debit

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1999053628A2 (fr) * 1998-03-27 1999-10-21 Nokia Networks Oy Communication de donnees et systeme radio
WO2001052467A1 (fr) * 2000-01-10 2001-07-19 Qualcomm Incorporated Procede et appareil de prise en charge de donnees adaptatives a debits multiples (amr) dans un systeme de communications amcr
WO2002035710A2 (fr) * 2000-10-24 2002-05-02 Siemens Aktiengesellschaft Dispositif et procede d'adaptation de debit

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"ETSI TS 125 212 Universal Mobile Telecommunications system (UMTS);Multiplexing and channel coding (FDD)", ETSI TS 125 212 V3.1.1, XX, XX, XP002161524 *

Also Published As

Publication number Publication date
EP1518345A1 (fr) 2005-03-30
DE10229640A1 (de) 2004-01-29
AU2003250748A1 (en) 2004-01-23

Similar Documents

Publication Publication Date Title
DE69803994T2 (de) Verfahren zur übertragung von sprachinaktivität signalen mit reduzierter leistung in einer tdma anordnung
EP1121762B1 (fr) Procede et dispositif de codage ou de decodage
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
DE60307165T2 (de) Verfahren zur Kodierung eines Benutzeridentifikator in einem Kommunikationssystem
DE69917307T2 (de) Vorrichtung und verfahren zur übertragung von punktierten oder wiederholten daten
DE60219572T2 (de) Verfahren zür Kodierung und Dekodierung von Steuerinformationen in einem drahtlosen Kommunikationssystem
DE60202115T2 (de) Verfahren zur blinden Erkennung von Transport-Format
EP1169778B1 (fr) Transmission de donnees avec entrelacement puis adaptation de debits par perforation ou repetition
DE602004008595T2 (de) Bitaustausch für verschiedene verschachtelungstiefen
EP1512242B1 (fr) Pointillage identique pour donnees d'identification d'equipement utilisateur et pour donnees utiles de canal hs-scch
EP1497943B1 (fr) Procede et dispositif de communication pour adapter le debit de donnees dans un dispositif de communication
EP1046254B1 (fr) Procede et dispositif pour le codage et la transmission de donnees, par decodage de voie a commande source
EP1142185B1 (fr) Procede et systeme pour le codage de canaux ou le decodage d'informations a structure de trame
WO2004006489A1 (fr) Procede d'adaptation de debit
EP1511215B1 (fr) Procédé et dispositif de transmission de données selon un procédé ARQ hybride
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
EP1116334B1 (fr) Procede pour le codage commun de source et de canal
DE10023826B4 (de) Verfahren zum Übertragen einer Rahmennummer in einem Kommunikationssystem
DE60123348T2 (de) Übertragungsverfahren mit verschiedenen Betriebsmoden
WO2004021632A1 (fr) Procede de transmission de donnees
EP1016236B1 (fr) Decodage rapide de donnees codees par convolution, partiellement recues
DE10117034A1 (de) Vefahren zur Kanalcodierung
EP1708403B1 (fr) Procédé ARQ hybride de transmission de données, émetteur et récepteur correspondants
DE19856085A1 (de) Adaptives verkettetes Kanalcodierverfahren
DE10219151A1 (de) Verfahren und Kommunikationsvorrichtung zur Anpassung der Datenrate in einer Kommunikationsvorrichtung

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

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

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

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
WWE Wipo information: entry into national phase

Ref document number: 2003762396

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 2003762396

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP

WWW Wipo information: withdrawn in national office

Ref document number: 2003762396

Country of ref document: EP