WO2006111539A1 - Modele de poinçonnage pour la transmission de nouveaux bits de parite uniquement dans le paquet de repetition - Google Patents

Modele de poinçonnage pour la transmission de nouveaux bits de parite uniquement dans le paquet de repetition Download PDF

Info

Publication number
WO2006111539A1
WO2006111539A1 PCT/EP2006/061663 EP2006061663W WO2006111539A1 WO 2006111539 A1 WO2006111539 A1 WO 2006111539A1 EP 2006061663 W EP2006061663 W EP 2006061663W WO 2006111539 A1 WO2006111539 A1 WO 2006111539A1
Authority
WO
WIPO (PCT)
Prior art keywords
data packet
bits
parity
transmission
bit
Prior art date
Application number
PCT/EP2006/061663
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 WO2006111539A1 publication Critical patent/WO2006111539A1/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/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/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/0064—Concatenated codes
    • H04L1/0066—Parallel concatenated 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 data transmission as well as a suitably designed transmitter and receiver.
  • the data transmission takes place in particular according to an ARQ method or a hybrid ARQ method, in a communication system, in particular a mobile radio system.
  • Packet-oriented data connections in this case can significantly increase the efficiency compared to other data transmission methods in which a continuous data stream is present, since in data transmission methods with a continuous data stream, a once allocated resource, such as e.g. a carrier frequency or timeslot allocated throughout the communication relationship, i. a resource remains occupied even if there are currently no data transmissions, so that this resource is not available to other network subscribers. This leads to a non-optimal use of the tight frequency spectrum for mobile systems.
  • a once allocated resource such as e.g. a carrier frequency or timeslot allocated throughout the communication relationship
  • Future mobile radio systems such as for example in accordance with the UMTS mobile communications standard ("Universal Mobile Telecommunications System"), will offer a multitude of different services, with multimedia applications becoming increasingly important in addition to pure voice transmission.
  • the so accompanying service diversity with different transmission rates requires a very flexible access protocol on the air interface of future mobile radio systems. Packet-oriented data transmission methods have proven to be very suitable here.
  • ARQ Automatic Repeat Request
  • both the transmission of data and so-called header information is provided in a data packet, the header information also provides information for error checking, such as CRC bits ("Cyclic Redundancy Check”) and may also be encoded for error correction (so-called "Forward Error Correction", FEC).
  • CRC bits Cyclic Redundancy Check
  • FEC Forward Error Correction
  • HARQ methods are used in particular for implementing the HSDPA (High Speed Downlink Packet Access) and for implementing the so-called EDCH (Enhanced Uplink).
  • turbo codes are used to encode the data to be transmitted, whereby the the data or bit are converted into systematic bit and parity bit.
  • an appropriate subset must be selected for the first transmission (first data packet) and also for the repetition (s) (repetition data packet (s)).
  • This selection is realized by a so-called rate matching algorithm, in particular a puncturing algorithm, whereby appropriate bits are removed (punctured) from the total quantity of the bits, which are then not transmitted.
  • a punctuation algorithm has already been specified for the UMTS Release 99. This algorithm removes a given number of bits from a block of bits and selects these bits as evenly as possible, i. with as even spacing as possible.
  • turbo codes it was further specified that the so-called systematic bits are not punctured and first parity bits (parity 1 (bit)) and second parity bits (parity 2 (bit)) are each punctured separately, both parity bits becoming punctured Streams preferably equally punctured.
  • parity bits are not punctured, instead the systematic bits are punctured.
  • Such a transmission is preferably used for a retransmission. This is intended to ensure that in the retransmission, the parity bits, which were partially dotted during the initial transmission, are now transmitted as completely as possible. If there are not so many bit locations available for the retransmission, ie in the retransmission data packet, that all parity bits can be transmitted, then no systematic bits are transmitted in the resection data packet and the first and second parity bits are both equally punctured.
  • the individual bits to be transmitted or the bits to be punctured are selected by a defined rate matching algorithm (rate matching algorithm).
  • the rate adjustment procedure is carried out according to the following regulation:
  • the parameters e p i us , e minus and X 1 are set slightly differently for the first and second parity bits in order to achieve different puncturing patterns here as well. Also for different transfers, the puncturing pattern can be varied by varying the parameter to avoid making identical transfers. A variation of one shifts the puncturing pattern; this is controlled by the parameter r.
  • E-DCH EDCH
  • 3GPP TS 25.212 V6.3.0 2004-12
  • Chapter 4.5.4.3 defines how to calculate the parameters e p i us , e minus and X 1 for the systematic bits, the parity 1 bit (first parity bit) and the parity 2 bit (second parity bit) for the rate matching algorithm ,
  • the rate matching algorithm itself is then described in chapter 4.2.7.5 (see above).
  • the procedure according to the prior art is disadvantageous or not optimal for the following reasons: In this case, between 1/4 and 1/2 of the parity bits are transmitted during the first transmission. During repeat transmission, more parity bits can be transmitted, in this case between 3/4 and all. In either case, a larger number of parity bits are transmitted in first transmission and retransmission together than are present after the encoding. It would be theoretically possible to transfer all parity bits at least once. However, this is not achieved by the given prior art algorithm.
  • the value of the error variable e at the time of the if query is plotted (the value 20 in the line denoted by ini corresponds to the initial value of e, ie e ini ).
  • the invention is based on the object to provide a technical teaching, which allows a reliable and preferably simple transmission of data.
  • the invention is based on the object of specifying a technical teaching which allows a simple and reliable transmission of data according to an ARQ method, which uses turbo coding at a rate between 2/3 and 3/4 (taking into account Rate matching) and / or includes a rate matching method with a punctuation rate between 1/2 and 5/9.
  • the invention is based first of all on the realization that according to the prior art, in particular even at a puncturing rate between 1/2 and 5/9, it is not always possible to transmit all parity bits at least once.
  • a further step in the invention lies in recognizing that transmission of all parity bits is possible, in particular in the stated range of the puncturing rate. If necessary, however, three transmissions must be combined.
  • a third data packet must be used to transmit all data packets and, like the first data packet, preferably contains systematic bits.
  • the complex simulations underlying the invention showed that, in particular when using a rate matching algorithm for selecting the bit contained in a data packet, in particular in the mentioned range of the puncturing rate, a transmission of all parity bits is possible if the repetition data packet contains no parity bits contained in the first data packet. This means that in the repetition data packet, no parity bits are transmitted repeatedly even if there is room in the retry data packet. Because of this surprising statement can be achieved that, in particular when using a rate matching algorithm for selecting the bit contained in a data packet for transmission in the repetition data packet only those parity bits are selected that have not already been selected for transmission in the first data packet.
  • the invention is based on the idea of converting in particular a specific amount of data to be transmitted by turbo-coding into systematic bits and parity bits.
  • a transmitter sends to a receiver a first data packet containing the systematic bits and containing a portion of the parity bits. If there is a corresponding request from the receiver, at least one retry data packet is sent to the receiver that does not contain any parity bits contained in the first data packet.
  • the parity bit consists only of a certain group of parity bits, besides which further parity bits may be the result of turbo coding, which then also together with the particular group of parity bits or separately from the particular group of parity bits be subjected to a bit rate adjustment.
  • a first repeating data packet contains the parity bits which are contained neither in the first data packet nor in a further repeating data packet.
  • the term "further repetition data packets" does not include a repeated first data packet and a repeated first repetition data packet. Because a repeated the first data packet and a repeated first repeat data packet are then sent repeatedly if the transmission has not been successful even after all the repetition data packets have been sent.
  • the first repeating data packet includes systematic bits besides parity bits not included in the first data packet.
  • systematic bits can be transmitted repeatedly, which increases the reliability of the transmission.
  • the (bit) rate matching algorithm contains the following method steps:
  • X 1 is the number of bits to be processed m is the loop index X 1 , m is the bit number m ⁇ is the designation for a punctured, ie remote, bit
  • the same rate matching algorithm is used, which in a UMTS System already used for other purposes anyway. This allows the rate matching algorithm to be implemented with less effort.
  • the initial value e m ( (r) for the error variable of the rate matching algorithm is chosen such that the first repetition data packet does not contain any parity bits contained in the first data packet, and preferably contains such parity bits not in either the first data packet or in another Repeat data packet are included.
  • e m ⁇ r f c -r e m Ir 1 J 1 mode, J + 1,
  • the description starts with a treatment of the case that the coding rate is between H and 2/3, later also the case is treated that the coding rate is between 2/3 and Z ⁇ .
  • Algorithm for first transmission analysis called Al:
  • the goal is to achieve that for every bit, that is, for all m, then at A2 the bit is used or transmitted, if it is punctured at Al, and vice versa.
  • e m2 (r) ⁇ X, - ⁇ (r + l) -e p p l l u u s s'r ' ⁇ max] I) / m lu "od u e c p_Jlus. + l
  • the invention makes it possible to achieve a marked improvement in the transmission properties if only the parameters for calculating the number of parity 1 and parity 2 bit and the calculation of e ini are used in the retransmission is adjusted.
  • the formulas for this are no more complex than the formulas measured in the prior art.
  • fewer parity bits are transmitted in the second transmission than provided in the prior art.
  • the remaining bits are then preferably filled with systematic bits.
  • Repetition transfer can achieve a similar effect so that a similar improvement in system performance can be achieved.
  • the puncturing patterns for the case of the first data packet and the case of the repeat data packet are interleaved with one another.
  • the inventive method for data transmission in the context of a hybrid ARQ method for the realization of HSDPA or EDCH (E-DCH) is used.
  • the parity bits contained in a data packet or repetition data packet are converted from the turbo coding by a rate matching algorithm. selected parity bit. If certain bits are selected from a set of bits by the rate matching algorithm because all bits are not transferred from the set of bits or are contained in a data packet, then the rate matching algorithm acts as a puncturing algorithm. The punctured by the puncturing algorithm bit are not transmitted and are not included in the corresponding data packet. The remaining bits are contained in the corresponding data packet.
  • the puncturing rate is between 1/2 and 5/9 or the coding rate is between 2/3 and 3/4, it is achieved in the invention that all parity bits in the first data packet or in the first repeat data packet or in the second repeat data packet are transmitted exactly once become.
  • the puncturing rate of the rate matching algorithm is in the range between 2/3 and 3/4; that is the case when puncturing between 1/2 and 5/9 of the bits.
  • the puncturing rate of the rate matching algorithm is in the range between 2/3 and 3/4; that is the case when puncturing between 1/2 and 5/9 of the bits.
  • between 1/4 and 1/6 of the parity bits are transmitted in the first transfer (and the third) and at least 4/6 of the parity bits in the second transfer, so in total, all parity can be transferred in first, second and third transfer Bit are transmitted.
  • theoretically more parity bits could be transmitted, namely between 4/6 and 3/4. According to the invention, however, only the parity bits still missing from the first transmission and the second repetition transmission are transmitted.
  • the coding rate of the turbo-coder is preferably between 2/3 and 3/4, taking account of the rate adaptation.
  • the influence of the so-called tail bits on the bits generated by turbo code is not considered in detail.
  • one third of the termination bits can be added to the systematic bit, the parity 1 and the parity 2 bits.
  • the coding rate is slightly less than specified due to the influence of the termination bits, since, strictly speaking, the termination bits would also have to be taken into account for the calculation of the coding rate.
  • this fineness is irrelevant to the invention, which is why both types of calculation are encompassed by the invention.
  • the total number of parity 1 and parity 2 bits is relevant, regardless of whether they are "real" parity bits or termination bits.
  • the invention also encompasses data transmissions in which, in addition to the stipulated puncturing rates or code rates, any other puncturing rates or code rates are used, wherein any other rate adaptation methods or initial values for the error variable can be used at the other puncturing rates or code rates.
  • data transfers within the scope of the invention in which, at a puncturing rate between 1/2 and 5/9, rate matching or bit selection according to the method claims is applied, and in others
  • Puncturing rates a rate adaptation or bit selection according to the prior art, in particular according to the rate matching algorithm according to the currently current UMTS standard (see above) is used.
  • a hardware and / or software technically appropriately arranged transmitter which comprises in particular a mobile station or a base station
  • a hardware and / or software technically appropriately configured receiver which comprises in particular a base station or a mobile station.
  • the transmitter comprises a processor device which is set up in such a way
  • the receiver for receiving data in the form of data packets, the data being converted by a turbo-coding into systematic bits and parity bits comprises a processor device which is set up in such a way that
  • FIG. 1 shows a representation to clarify the signal processing according to a packet-oriented ARQ method
  • FIG. 2 shows a representation to clarify the communication in a mobile radio system.
  • a packet-oriented data transmission in a mobile radio system is to be realized.
  • the communication between a base station 1 and a mobile station 2 of a mobile radio system e.g. a UMTS mobile radio system, shown.
  • the transmission of information from the base station 1 to the mobile station 2 takes place via the so-called "downlink" channel DL, while the transmission of the information from the mobile station 2 to the base station 1 takes place via the so-called "uplink” channel UL is done.
  • the present invention is explained below by way of example with reference to a packet-oriented data transmission from the base station 1 to the mobile station 2, ie based on a packet-oriented data transmission via the "downlink" channel, but the present invention applies analogously to a data transmission over the "uplink” channel is. Furthermore, the present invention is explained below with reference to the signal processing measures to be carried out in the respective transmitter, wherein, however, it is to be noted that corresponding signal processing in reverse order is required in the respective receiver for evaluating the data processed in this way on the transmitter side, so that Not only the transmitter side but also the receiver side is concerned and encompassed by the present invention. Although no puncturing is made in the receiver in the sense that bits are selected from a bit stream, the then not be transferred.
  • the receiver preferably implements a corresponding algorithm that takes into account which bits have been punctured, that is, not transmitted, to correctly determine the relationship of the actual transmitted bits to the bits of the original coded bitstream.
  • the punctured bits can not be recovered, but at the receiving end, the identity of the transmitted bits is correctly detected in order to use them correctly for decoding.
  • FIG. 1 shows the signal processing of the data and header information to be transmitted in the data packets according to a hybrid ARQ method.
  • the header information generated by a function block 3 is supplied to a function block 12, which ensures that all headers of all data packets to be sent in one and the same radio packet are combined into a single header (so-called header concatenation ").
  • a function block 13 adds CRC bits for header recognition to the resulting header information.
  • a channel coding is carried out by a function block 14 and a rate adaptation of the resulting bit stream by a function block 15.
  • An interleaver 16 causes the symbols or bits supplied to it to be reordered and time-spread in a specific manner.
  • the data blocks output by the interleaver 16 are assigned by a function block 17 to the individual transmission or radio frames (so-called "radio frame segmentation").
  • the coding of the header information is only of secondary importance for the invention.
  • a function block 4 is also provided for adding CRC bits.
  • a function block 5 is used for Splitting the data supplied to a channel coder 6 in such a way that the channel coder 6 can always carry out a coding limited to a certain number of bits.
  • the channel coding performed by the channel coder 6 adds redundant information to the data actually to be transmitted. As a result, several data packets transmitted one after the other have bits with the same informational origin.
  • the bits output by the channel coder 6 are applied to a function block 19 which adjusts the bit rate of the bit stream by fading individual bits (so-called puncturing) or by repeating individual bits (so-called repetition). From a subsequent function block 9 so-called DTX bits ("Discontinuous Transmission”) can be added to the data stream. Furthermore, function blocks 10 and 11 are also provided on the data page, which function in the same way as the function blocks 16 and 17 provided on the header side.
  • bits output on the data and header side are mapped or multiplexed (so-called “multiplexing") by a function block 18 to the respectively present physical transmission channel and by means of a suitable modulation, for example a QAM modulation , transmitted to the receiver.
  • a suitable modulation for example a QAM modulation
  • a retry data packet is requested which is wholly or partially identical to the data packet previously sent and incorrectly received. depend Whether the retry data packet has less or the same amount of data as the original data packet is called a full or partial retry.
  • the data packet and the respective repetition data packet thus have bits with an at least partially identical information origin.
  • the receiver can thus recover the originally transmitted information with better quality by jointly evaluating the originally transmitted data packet and the requested subsequent repetition data packets.
  • the present invention essentially relates to the functional section 19 shown in FIG. 1.
  • This functional section 19 comprises a functional block 20 which, depending on an activation by the functional block 3, divides the coded bits output by the upstream channel coder 6 into at least two parallel partial bit streams. which are each separately, ie independently, subjected to a rate adjustment.
  • FIG. 1 three partial bit streams AC are shown, wherein for each partial bit stream a functional block 21-23 is provided for carrying out a corresponding rate adaptation, ie for puncturing or repetition of individual bits. In this way, a plurality of differently coded parallel Operabit- streams, which are supplied to another functional block 24.
  • This further function block 24 has the task of collecting the individual bits of the parallel bit streams in the same sequence which was used by the function block 20 for the bit separation, ie for the division onto individual parallel partial bit streams (bit collection). This ensures that overall the order of bits left after rate matching does not change.
  • the rate adaptation provided by the individual sub-bit streams AC by the function blocks 21-23 can take place completely independently of one another. In particular, the bits of one or more sub-bit streams can not undergo puncturing or repetition at all.
  • the rate matching of the individual parallel partial bit streams AC is to be selected so that a desired rate matching pattern is applied by the entire functional section 19 to the channel-coded bit stream output by the function block 6 per data packet or repetition data packet. With the realization of the functional section 19 shown in FIG. 1 with a plurality of rate adjustments carried out in parallel, extremely high flexibility in the coding can be achieved.
  • the functional section 19 is designed in such a way that, depending on the control by the function block 3, it applies a different rate matching pattern to the bits of a repetition data packet than to the bits of the corresponding originally transmitted data packet. That the function section 3 is informed by the function block 3 whether a repetition data packet has been requested by the respective receiver, wherein the function section 19 in this case selects or sets the rate adaptation pattern realized by the individual function blocks 21-23 such that the total bits of the retry data packet are processed with a different rate matching pattern than the bits of the underlying originally transmitted data packet.
  • the total rate adaptation realized by the functional section 19 can be carried out, for example, according to the rate matching algorithm, which is already known per se from the prior art (see above).
  • Functional section 19 may be arranged so that one or more of the following embodiments are put into practice:
  • the data is converted into systematic bits and parity bits by channel coding, in particular turbo coding.
  • the sender sends to the receiver a first data packet containing the systematic bits and part of the parity bits. If there is a corresponding request from the receiver (2), at least one retry data packet is sent to the receiver (2) containing the parity bits not contained in the first data packet.
  • the retry data packet contains no parity bits contained in the first data packet.
  • the retry data packet contains systematic parity bits not included in the first data packet
  • the coding rate of the turbo coder is between 2/3 and ⁇ considering the rate adaptation.
  • the parity bits contained in a data packet or repetition data packet are selected by a rate matching algorithm from the turbo-coding resulting parity bits.
  • the puncturing rate of the rate matching algorithm is between H and 1/3.
  • the initial value of the error variable of the rate matching algorithm is selected such that the repeat data packet ket contains no parity bits contained in the first data packet.
  • the rate matching algorithm contains the following process steps: a) Setting the error variable to the initial value b) Setting the bit index to the first bit c) Subtracting the value of the reduction of the error variable from the error variable. d) If the error variable is less than or equal to 0, perform steps e) to f) e) puncturing the bit index indicated by the bit index f) adding the increment value to the error variable g) incrementing the bit index h) repeating steps c) through g ) until the bit index exceeds the number of bits to be processed.
  • the first data packet and the cancellation data packet are combined, in particular by combining (combining) and also soft combining (summarizing the soft-decission values, that is to say combining the truth values). the fact that individual bits have the value 1 or 0) is decoded.
  • the embodiments just explained are particularly suitable for the case where the coding rate is in the range between 2/3 and 1/2; this is the case when puncturing between 1/2 and 1/3 of the bits.
  • the coding rate is in the range between 2/3 and 1/2; this is the case when puncturing between 1/2 and 1/3 of the bits.
  • between 1/4 and 1/2 of the parity bits are transmitted during the first transmission and at least 3/4 of the parity bits in the second transmission, so that all parity bits can be transmitted in the first and second transmission.
  • the formulas given above are then preferably not applied directly.
  • the starting value e ini may preferably be selected such that the least possible overlap results between the parity bits which are transmitted on the first and second times.
  • the puncturing patterns for the 1st and 3rd transmission are shifted against each other. It is possible, by suitable choice of the parameter e ini for the 3rd transmission, to achieve that the amount of parity bits transmitted in the 1st and 3rd transmission together is a similar distribution (a similar one) Pattern), such as a single transmission, but with twice as many bits being transmitted.
  • the second transmission can now be optimized to transmit exactly those bits that are transmitted neither in the first transmission nor in the third transmission.
  • the above-mentioned formulas can be used in an analogous manner, whereby, of course, it is taken into account that twice as many parity bits are transmitted in the first and third transmission as in the first transmission alone.
  • the formulas for the optimal choice of the parity 1 bit and parity 2 bit to be transmitted in the second transmission can then be derived as follows: Determine an equivalent rate fitting that selects the parity 1 and parity 2 bits that are used in the first or third transmission be transmitted. The number of transmitted bits corresponds to the sum, the value of eini should be determined accordingly. Possibly. If one chooses the value of one for the third transmission appropriately (in relation to the value of one for the first transmission), these two transmissions can be grouped together to give a total transmission pattern, as in a single transmission. The value for the number of parity 1 and parity 2 bits to be transmitted and the value of one for the second transmission can then be determined on the basis of the pattern combined for this.
  • the reduction value is the same for the first, third and hypothetical transfer, but the increase value for the hypothetical transfer is twice as large.
  • the result is, if one plots the value of e over m each a sawtooth-like curve, the height of the spikes is the same, but the slope of the spikes for the hypothetical curve twice as large and thus the number of spikes.
  • Each spike corresponds to a transmitted bit.
  • the aim is to find a parameterization for the hypothetical transmission in which exactly the bits which are transmitted together in the first and second transmission are transmitted.
  • the third and first transmission must be well nested, which can be achieved if their values differ from one half the value of the increase value, ie if the difference is (a N t , p / 2). This is already the case according to the current state of the standard.
  • the number of systematic or parity 1 and parity 2 bits to be transmitted in the second transmission is then in the range of the coding rate discussed here, ie if
  • e ini2 (X 1 mod e plus ) * 2 + 2.
  • bits 2 transmitted in the first to third transmission opt second transmission according to the embodiment 1-3 opt: bits transmitted in the first to third transmission according to the embodiment 1 + 2 opt: bits transmitted in the first and second transmission the embodiment
  • the parameters of the hypothetical transmission are actually chosen so that the same bits are selected as in the first and third transmission together. Furthermore, it can be seen that in the first to third transmission according to the embodiment, all the parity bits are transmitted, in contrast to the prior art. In the last two columns it is shown that according to the invention not an advantage results after the third transmission, but already after the second transmission. Although in this example in the second transmission according to the embodiment only 12 instead of 14 as in the prior art transmitted are the total number of transmitted in the first and second transmission according to the embodiment parity bit is 16 and thus higher than in the prior art (14). This invention is particularly suitable for the case where the coding rate is in the range between 2/3 and 3/4; that is the case when puncturing between 1/2 and 5/9 of the bits.
  • a transmission consists of 100 system bits each, parity 1 bit and parity 3 bits, ie a total of 300 bits.
  • 140 bits are transmitted in a transmission.
  • the 100 systematic bits and 20 each parity 1 and parity 2 bits are transmitted.
  • each 40 parity 1 and parity 2 bits are missing 60 parity 1 and parity 2 bits each.
  • Exactly these bits are now transmitted in the second transmission.
  • 140-60-60 20 systematic bits are also transmitted in the second transmission.
  • N the number of systematic bits; this is at the same time the number of parityl and also the parity2 bit (a generalization to the case that these numbers are different is easily possible but will be omitted here for the sake of clarity)
  • Ns2, N12 and N22 be the number of systematic, parityl and parity2 bits to be transmitted in the second transmission. Then:
  • N12 N-N11-N13
  • N22 N-N21-N23
  • N + N21 + N23 Nsl + Nl3 + N23 + 2 * (N11 + N21-N)
  • This generalization of the method according to the invention thus allows the application up to quite high coding rates for the first transmission.
  • a rate greater than H one needs two retransmissions, which prefer parity bits to arrive at a total of three retransmissions. transmits all parity bits.
  • all the parity bits are already transmitted by the two retransmissions, so that it is not decisive for the performance after receipt of the third transmission which of the parity bits were additionally sent in the first transmission.
  • the invention can be applied in a modified form also in this case.
  • the value of e ini should again be chosen such that as few overlaps as possible result, and it may again be advantageous to transmit less parity bit in a transmission than would be possible in order to achieve a better intermeshing of the patterns.
  • Functional section 19 may be arranged so that one or more of the following embodiments are put into practice:
  • the data is converted into systematic bits and parity bits by channel coding, in particular turbo coding.
  • the sender sends to the receiver a first data packet containing the systematic bits and part of the parity bits. If there is an appropriate request from the receiver (2), at least one retry data packet is sent to the receiver (2) which does not contain any parity bits contained in the first data packet.
  • a first retry data packet contains the parity bits which are neither contained in the first data packet nor in a further retry data packet.
  • the first retry data packet contains systematic bits in addition to parity bits that are not contained in the first data packet.
  • the second repetition data packet contains the parity bits which are contained neither in the first data packet nor in the first repetition data packet.
  • the coding rate of the turbo coder is between 2/3 and 3/4, taking into account the rate adaptation.
  • the parity bits contained in a data packet or repetition data packet are selected by a rate matching algorithm from the turbo-coding resulting parity bits.
  • the puncturing rate of the rate matching algorithm is between 1/2 and 5/9.
  • the initial value of the error variable of the rate matching algorithm is chosen such that the first repetition data packet contains no parity bits contained in the first data packet.
  • the initial value of the error variable of the rate matching algorithm is selected such that the first repetition data packet contains such parity bits which are contained neither in the first data packet nor in a further repetition data packet.
  • the rate matching algorithm comprises the following method steps: a) setting the error variable to the initial value, b) setting the bit index to the first bit, c) subtracting the reduction value of the error variable from the error variable, d) if the error variable is less than or equal to 0, carry out the steps e) to f), e) puncturing the bit index indicated by the bit index, f) adding the increment value to the error variable, g) increasing the bit index, h) repeating steps c) to g) until the bit index increases the number of exceeds the processing bit.
  • Nsys Number of systematic bits before rate matching
  • Nt, sys number of systematic bits after rate matching
  • Nt, pl number of parity 1 bit after rate matching
  • Nt, p2 number of parity 2 bits after rate matching.

Landscapes

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

Abstract

La présente invention repose sur l'idée de convertir des données à transmettre par un turbocodage en bits systématiques et en bits de parité. Un premier paquet de données qui contient les bits systématiques et une partie des bits de parité est envoyé d'un expéditeur à un destinataire. En cas de demande de la part du destinataire, au moins un paquet de données de répétition ne contenant pas de bits de parité contenus dans le premier paquet de données est envoyé au destinataire.
PCT/EP2006/061663 2005-04-22 2006-04-19 Modele de poinçonnage pour la transmission de nouveaux bits de parite uniquement dans le paquet de repetition WO2006111539A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE200510018870 DE102005018870A1 (de) 2005-04-22 2005-04-22 Verfahren zur Datenübertragung, Sender und Empfänger
DE102005018870.2 2005-04-22

Publications (1)

Publication Number Publication Date
WO2006111539A1 true WO2006111539A1 (fr) 2006-10-26

Family

ID=36615690

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2006/061663 WO2006111539A1 (fr) 2005-04-22 2006-04-19 Modele de poinçonnage pour la transmission de nouveaux bits de parite uniquement dans le paquet de repetition

Country Status (2)

Country Link
DE (1) DE102005018870A1 (fr)
WO (1) WO2006111539A1 (fr)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030097629A1 (en) * 2001-11-02 2003-05-22 Samsung Electronics Co., Ltd. Transceiver apparatus and method for efficient retransmission of high-speed packet data
DE10200296A1 (de) * 2002-01-07 2003-07-17 Siemens Ag Verfahren und Vorrichtung zur Datenübertragung
WO2004021635A1 (fr) * 2002-08-27 2004-03-11 Nokia Corporation Perforation variable pour systemes a repetition automatique sur demande (arq)
US20040081103A1 (en) * 2002-10-25 2004-04-29 Benoist Sebire Method for rate matching to support incremental redundancy with flexible layer one
WO2004084476A1 (fr) * 2003-03-21 2004-09-30 Siemens Aktiengesellschaft Dispositif de communication et procede

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030097629A1 (en) * 2001-11-02 2003-05-22 Samsung Electronics Co., Ltd. Transceiver apparatus and method for efficient retransmission of high-speed packet data
DE10200296A1 (de) * 2002-01-07 2003-07-17 Siemens Ag Verfahren und Vorrichtung zur Datenübertragung
WO2004021635A1 (fr) * 2002-08-27 2004-03-11 Nokia Corporation Perforation variable pour systemes a repetition automatique sur demande (arq)
US20040081103A1 (en) * 2002-10-25 2004-04-29 Benoist Sebire Method for rate matching to support incremental redundancy with flexible layer one
WO2004084476A1 (fr) * 2003-03-21 2004-09-30 Siemens Aktiengesellschaft Dispositif de communication et procede

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"Universal Mobile Telecommunications System (UMTS); Multiplexing and channel coding (FDD) (3GPP TS 25.212 version 6.3.0 Release 6); ETSI TS 125 212", ETSI STANDARDS, EUROPEAN TELECOMMUNICATIONS STANDARDS INSTITUTE, SOPHIA-ANTIPO, FR, vol. 3-R1, no. V630, December 2004 (2004-12-01), XP014027617, ISSN: 0000-0001 *
GHOSH A ET AL: "Incremental redundancy (IR) schemes for W-CDMA HS-DSCH", PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, 2002. THE 13TH IEEE INTERNATIONAL SYMPOSIUM ON SEPT. 15-18, 2002, PISCATAWAY, NJ, USA,IEEE, 15 September 2002 (2002-09-15), pages 1078 - 1082, XP010611428, ISBN: 0-7803-7589-0 *

Also Published As

Publication number Publication date
DE102005018870A1 (de) 2006-10-26

Similar Documents

Publication Publication Date Title
EP1397881B1 (fr) Procede et dispositif pour la transmission de donnees selon un procede arq
DE60037688T2 (de) Methode und Telekommunikationssystem zum Ausgleichen des Eb/I Verhältnisses in einem Dienstemultiplex CDMA System
DE60007090T2 (de) Vorwärtsfehlerkorrektur über multiplexierte cdma kanäle die hohe kodierungsleistung ermöglichen
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
AT407686B (de) Digitales mobilkommunikationssystem sowie verfahren zur datenübertragung und sende/empfangs-vorrichtung in einem mobiltelefonnetz
DE102006032729A1 (de) Vorrichtung zum Bestimmen einer Anzahl von Datenpaketen
DE10251289A1 (de) Sendeempfängervorrichtung und Verfahren zur effizienten Neuübertragung von Hochgeschwindigkeits-Paketdaten
CH694114A5 (de) Verfahren, Datenübertragungsvorrichtung und mobile Station zum Verringern der Rahmenfehlerrate bei Datenübertragung in Form von Datenrahmen.
DE19941331A1 (de) Verfahren zum Übertragen von Information zu Hintergrundrauschen bei Datenübertragung mittels Datenrahmen sowie Kommunikationssystem, Mobilstation und Netzwerkelement
DE69932482T2 (de) Übertragungssystem mit adaptivem kanalkodierer und -dekoder
EP1497943A2 (fr) Procede et dispositif de communication pour adapter le debit de donnees dans un dispositif de communication
EP1511215B1 (fr) Procédé et dispositif de transmission de données selon un procédé ARQ hybride
EP1708403B1 (fr) Procédé ARQ hybride de transmission de données, émetteur et récepteur correspondants
WO2006111539A1 (fr) Modele de poinçonnage pour la transmission de nouveaux bits de parite uniquement dans le paquet de repetition
EP1329048B1 (fr) Dispositif et procede d'adaptation de debit
DE102005036295A1 (de) Verfahren zur Datenübertragung, Sender und Empfänger
WO2006103175A1 (fr) Procede arq hybride pour transmettre des donnees, emetteur et recepteur a cet effet
WO2003107580A1 (fr) Pointillage identique pour donnees d'identification d'equipement utilisateur et pour donnees utiles de canal hs-scch
DE60215333T2 (de) Konfiguration der physicalischen schicht für eine funk schnittstelle
DE10345713B4 (de) ARQ-Verfahren
DE10200296A1 (de) Verfahren und Vorrichtung zur Datenübertragung
WO2005043800A1 (fr) Procede de repetition de transmission automatique hybride avec redondance amelioree
DE10034259A1 (de) Verfahren und Anordnung zur Codierung von Datensymbolen
WO2003085873A2 (fr) Procede et dispositif de communication pour adapter le debit de donnees dans un dispositif de communication
WO2000035138A1 (fr) Procede de codage canal enchaine adaptatif

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: DE

NENP Non-entry into the national phase

Ref country code: RU

WWW Wipo information: withdrawn in national office

Country of ref document: RU

122 Ep: pct application non-entry in european phase

Ref document number: 06743338

Country of ref document: EP

Kind code of ref document: A1

WWW Wipo information: withdrawn in national office

Ref document number: 6743338

Country of ref document: EP