# Patent

## Title
Hybrid ARQ retransmission with reordering scheme employing multiple redundancy versions and receiver/transmitter therefor

## Abstract

A hybrid ARQ retransmission method in a communication system, wherein data packets consisting of symbols encoded with a forward error correction (FEC) technique prior to transmission are retransmitted based on an automatic repeat request and subsequently combined with previously received data packets the symbols of said data packets being modulated by a mapping unit employing a predetermined signal constellation. The retransmitted data packets being retransmitted in form of a selected one of a plurality of different redundancy versions. According to the invention the transmitted bits of the modulated symbols are reordered over the retransmissions in accordance with the selected redundancy version.

## Background
This application is a continuation of application Ser. No. 11/484,776 filed Jul. 12, 2006 (pending), which is a continuation of application Ser. No. 10/853,266 filed May 26, 2004 (U.S. Pat. No. 7,110,470) which is a continuation of application Ser. No. 10/298,207 filed Nov. 18, 2002 (U.S. Pat. No. 6,798,846), which claims the priority of EP 01127244.0 filed Nov. 16, 2001.


FIELD OF THE INVENTION
The present invention relates to a hybrid ARQ retransmission method in a communication system. Further, the invention concerns a respective receiver and a transmitter.
BACKGROUND OF THE INVENTION
A common technique in communication systems with unreliable and time-varying channel conditions is to correct errors based on automatic repeat request (ARQ) schemes together with a forward error correction (FEC) technique called hybrid ARQ (HARQ). If an error is detected by a commonly used cyclic redundancy check (CRC), the receiver of the communication system requests the transmitter to send additional information (data packets retransmission) to improve the probability of correctly decoding the erroneous packet.
A packet will be encoded with the FEC before transmission. Depending on the content of the retransmission and the way the bits are combined with previously transmitted information, S. Kaliel, Analysis of a type II hybrid ARQ scheme with code combining, IEEE Transactions on Communications, Vol.38, No. 8, August 1990 and S. Kallel, R. Link, S. Bakhtiyari, Throughput performance of Memory ARQ schemes, IEEE Transactions on Vehicular Technology, Vol.48, No. 3, May 1999 define three different types of ARQ schemes:

    
    
        Type I: The erroneous received packets are discarded and a new copy of the same packet is retransmitted and decoded separately. There is no combining of earlier and later received versions of that packet.
        Type II: The erroneous received packets are not discarded, but are combined with additional retransmissions for subsequent decoding, Retransmitted packets sometimes have higher coding rates (coding gain) and are combined at the receiver with the stored soft-information from previous transmissions,
        Type III: the same as Type II with the constraint each retransmitted packet is now self-decodable. This implies that the transmitted packet is decodable without the combination with previous packets. This is useful if some packets are damaged in such a way that almost no information is reusable, If all transmissions carry identified data, this can be seen as a special case called HARQ Type III with a single redundancy version.
    
    


HARQ Type II and III schemes are obviously more intelligent and show a performance gain with respect to Type I, because they provide the ability to reuse information from of previously received erroneous packets. There exist basically three schemes of reusing the redundancy of previously transmitted packets:

    
    
        Soft-Combining
        Code-Combining
        N Combination of Soft- and Code-Combining

Soft-Combining

    
    


Employing soft-combining the retransmission packets carry identical information compared with the previously received information. In this case the multiple received packets are combined either by a symbol-by-symbol or by a bit-by-bit basis as for example disclosed in D. Chase, Code combining: A maximum-likelihood decoding approach for combining an arbitrary number of noisy packets, IEEE Trans. Commun., Vol. COM-33, pp. 385-393, May 1985 or B. A. Harvey and S. Wicker, Packet Combining Systems based on the Viterbi Decoder, IEEE Transactions on Communications, Vol. 42, No 2/3/4, April 1994.
In case of employing symbol-level combining, the retransmitted packets have to carry identical modulation symbols to the previously transmitted erroneous packets. In this case the multiple received packets are combined at modulation symbol level. A common technique is the maximum ratio combining (MRC), also called average diversity combining (ADC), of the multiple received symbols, where after N transmissions the sum/average of the matching symbols is buffered.
In case of employing bit-level combining the retransmitted packets have to carry identical bits to the previously transmitted erroneous packets. Here, the multiple received packets are combined at bit level after demodulation. The bits can be either mapped in the same way onto the modulation symbols as in previous transmissions of the same packet or can be mapped differently. In case the mapping is the same as in previous transmissions also symbol-level combining can be applied. A common combining technique is the addition of calculated log-likelihood ratios (LLRs), especially if using so-called Turbo Codes for the FEC as known for example from C. Berrou, A. Glavieux, and P. Thitimajshima, Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-Codes, Proc. ICC '93, Geneva, Switzerland, pp. 1064-1070, May 1993; S. Le Goff, A. Glavieux, C. Berrou, Turbo-Codes and High Spectral Efficiency Modulation, IEEE SUPERCOMM/ICC '94, Vol. 2, pp. 645-649, 1994; and A. Burr, Modulation and Coding for Wireless Communications, Pearson Education, Prentice Hall, ISBN 0-201-39857-5, 2001. Here, after N transmissions the sum of the LLRs of the matching bits is buffered.
Code-Combining
Code-combining concatenates the received packets in order to generate a new code word (decreasing code rate with increasing number of transmission). Hence, the decoder has to be aware of how to combine the transmissions at each retransmission instant in order to perform a correct decoding (code rate depends on retransmissions). Code-combining offers a higher flexibility with respect to soft-combining, since the length of the retransmitted packets can be altered to adapt to channel conditions. However, this requires more signaling data to be transmitted with respect to soft-combining.
Combination of Soft- and Code-Combining
In case the retransmitted packets carry some symbols/bits identical to previously transmitted symbols/bits and some code-symbols/bits different from these ones, the identical code-symbols/bits are combined using soft-combing as described in the section titled “Soft-Combining” while the remaining code-symbols/bits will be combined using code-combining. Here, the signaling requirements will be similar to code-combining.
It has been shown in M. P. Schmitt, Hybrid ARQ Scheme employing TCM and Packet Combining, Electronics Letters Vol. 34, No. 18, September 1998 that HARQ performance for Trellis Coded Modulation (TCM) can be enhanced by rearranging the symbol constellation for the retransmissions. There, the performance gain results from the maximizing the Euclidean distances between the mapped symbols over the retransmissions, because the rearrangement has been performed on a symbol basis. Considering high-order modulation schemes (with modulation symbols carrying more than two bits) the combining methods employing soft-combining have a major drawback: The bit reliabilities within soft-combined symbols will be in a constant ratio over all retransmissions, i.e. bits which have been less reliable from previous received transmissions will still be less reliable after having received further transmissions and, analogous, bits which have been more reliable from previous received transmissions will still be more reliable after having received further transmissions. Generally, HARQ schemes do not take into account the variations in bit-reliabilities. These variations downgrade the decoder performance significantly. Mainly, the variations result from two reasons.
First, the varying bit reliabilities evolve from the constraint of two-dimensional signal constellation mapping, where modulation schemes carrying more than 2 bits per symbol cannot have the same mean reliabilities for all bits under the assumption that all symbols are transmitted equally likely, The term mean reliabilities is consequently meant as the reliability of a particular bit over all symbols of a signal constellation.
Employing a signal constellation for a 16 QAM modulation scheme according to FIG. 1 showing a Gray encoded signal constellation with a given bit-mapping order i1q1i2q2, the bits mapped onto the symbols differ significantly from each other in mean reliability in the first transmission of the packet. In more detail, bits i1 and q1 have a high mean reliability, as these bits are mapped to half spaces of the signal constellation diagram with the consequences that their reliability is independent from the fact of whether the bit transmits a one or a zero.
In contrast thereto, bits i2 and q2 have a low mean reliability, as their reliability depends on the fact of whether they transmit a one or a zero. For example, for bit i2, ones are mapped to outer columns, whereas zeros are mapped to inner columns. Similarly, for bit q2, ones are mapped to outer rows, whereas zeros are mapped to inner rows.
For the second and each further retransmissions the bit reliabilities will stay in a constant ratio to each other, which is defined by the signal constellation employed in the first transmission, i.e. bits i1 and q1 will always have a higher mean reliability than bits i2 and q2 after any number of retransmissions.
Second, employing partly soft-combining, suppose that all transmitted bits would have identical reliability after the first transmission. Even then variations in bit reliabilities would be introduced over retransmissions, because reliabilities for those bits which are retransmitted (and soft-combined) would increase, whereas reliabilities of not retransmitted bits would stay unchanged. Moreover, bits which are not transmitted in the first transmission and then transmitted in retransmissions (transmitting additional redundancy) emphasize this effect.
In co-pending PCT/EP01/01982 a method has been suggested that in order to enhance the decoder performance, it would be quite beneficial to have equal or near to equal mean bit reliabilities after each received transmission of a packet. Hence, the bit reliabilities are tailored over the retransmissions in a way that the mean bit reliabilities get averaged out. This is achieved by choosing a predetermined first and at least second signal constellation for the transmissions, such that the combined mean bit reliabilities for the respective bits of all transmissions are nearly equal. I. e. bits which have been highly reliable in the first transmission are mapped in such a way that they become less reliable in the second transmission and vice versa.
Hence, the signal constellation rearrangement results in a changed bit mapping, wherein the Euclidean distances between the modulation symbols can be altered from retransmission to retransmission due to the movement of the constellation points. As a result, the mean bit reliabilities can be manipulated in a desired manner and averaged out to increase the performance the FEC decoder at the receiver.
In the solution proposed above, the benefits of the constellation rearrangement are realized for the concept of the HARQ TYPE II/III single redundancy version schemes.
SUMMARY OF THE INVENTION
The object of the present invention is to provide a hybrid ARQ retransmission method and transmitter, which effectively avoids downgrading of the decoder performance caused by the variations in bit reliabilities.
The object is solved by a method, transmitter and receiver as set forth in the independent claims.
The invention is based on the recognition that the conventional schemes do not consider this specific content (set of bits) of each transmission for reordering the bits. Hence, in order to obtain a performance gain, the reordering has to be done depending on the content of each transmitted redundancy version. Consequently, the invention can be seen as providing a HARQ Type-II/III scheme using multiple redundancy versions under consideration of the content of the transmitted redundancy version. This results in a significant gain in the decoder performance.



BRIEF DESCRIPTION OF THE DRAWINGS
For a better understanding of the invention, preferred embodiments which will be described in the following with reference to the accompanying drawings show:
FIG. 1: an exemplary constellation illustrating a 16 QAM modulation scheme with Gray-encoded bit symbols,
FIG. 2: two examples for signal constellations for a 16 QAM modulation scheme with Gray-encoded bit symbols,
FIG. 3: a generated bit sequence from a rate 1⁄3 FEC encoder,
FIG. 4: a chosen sequence for a rate 1⁄2 transmission system generated from the sequence shown in FIG. 3 with an indication of the bit reliabilities,
FIG. 5: a bit sequence for the second transmission, wherein the bits are shifted by two to the right,
FIG. 6: a bit sequence for the second transmission, wherein the bit positions are switched using different mappers.
FIG. 7: a bit sequence for the first transmission redundancy version 1 and a first pair of mapper/interleaver,
FIG. 8: a bit sequence for the second transmission for a redundancy version 2 with the same mapper/interleaver as for the first transmission,
FIG. 9: a bit sequence for the second transmission a redundancy version 2 with different mappers/interleavers as for the first transmission,
FIG. 10: resulting bit sequences from possible combinations of redundancy versions and mappers/interleavers,
FIG. 11: a first embodiment of a communication system in which the method of the present invention is carried out,
FIG. 12: a second embodiment of a communication system in which the method of the present invention is carried out,
FIG. 13: a diagram indicating the performance of several conventional strategies versus the strategy according to the method of the invention.



DETAILED DESCRIPTION OF EMBODIMENTS
In the following the concept of a Log-Likelihood-Ratio (LLR) will be described as a metric for the bit reliabilities. First the straight forward calculation of the bit LLRs within the mapped symbols for a single transmission will be shown. Then the LLR calculation will be extended to the multiple transmission case.
Single Transmission
The mean LLR of the i-th bit bni under the constraint that symbol sn has been transmitted for a transmission over a channel with additive white gaussian noise (AWGN) and equally likely symbols yields




  
    
      
        
          
            
              LLR
              
                
                  b
                  n
                  i
                
                ⁢
                
                  
                  
                    r
                    n
                  
                
              
            
            ⁡
            
              (
              
                r
                n
              
              )
            
          
          =
          
            
              log
              ⁡
              
                [
                
                  
                    ∑
                    
                      (
                      
                        m
                        ⁢
                        
                          
                          
                            
                              b
                              m
                              i
                            
                            =
                            
                              b
                              n
                              i
                            
                          
                          )
                        
                      
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    e
                    
                      
                        -
                        
                          
                            E
                            S
                          
                          
                            N
                            0
                          
                        
                      
                      ·
                      
                        d
                        
                          n
                          ,
                          m
                        
                        2
                      
                    
                  
                
                ]
              
            
            -
            
              log
              ⁡
              
                [
                
                  
                    ∑
                    
                      (
                      
                        m
                        ⁢
                        
                          
                          
                            
                              b
                              m
                              i
                            
                            ≠
                            
                              b
                              n
                              i
                            
                          
                          )
                        
                      
                    
                  
                  ⁢
                  
                    e
                    
                      
                        -
                        
                          
                            E
                            S
                          
                          
                            N
                            0
                          
                        
                      
                      ·
                      
                        d
                        
                          n
                          ,
                          m
                        
                        2
                      
                    
                  
                
                ]
              
            
          
        
        ,
      
    
    
      
        (
        1
        )
      
    
  




where rn=sn denotes the mean received symbol under the constraint the symbol sn has been transmitted (AWGN case), dn,m2 denotes the square of the Euclidean distance between the received symbol rn and the symbol sm, and ES/N0 denotes the observed signal-to-noise ratio.

It can be seen from Equation (1) that the LLR depends on the signal-to-noise ratio ES/N0 and the Euclidean distances dn,m between the signal constellation points.
Multiple Transmissions
Considering multiple transmissions the mean LLR after the k-th transmission of the i-th bit bni under the constraint that symbols sn(j) have been transmitted over independent AWGN channels and equally likely symbols yields




  
    
      
        
          
            
              LLR
              
                
                  b
                  n
                  i
                
                ⁢
                
                  
                  
                    
                      ⋂
                      
                        j
                        =
                        1
                      
                      k
                    
                    ⁢
                    
                      r
                      n
                      
                        (
                        i
                        )
                      
                    
                  
                
              
            
            ⁡
            
              (
              
                
                  r
                  n
                  
                    (
                    1
                    )
                  
                
                ,
                
                  r
                  n
                  
                    (
                    2
                    )
                  
                
                ,
                ...
                ⁢
                
                  
                
                ,
                
                  r
                  n
                  
                    (
                    k
                    )
                  
                
              
              )
            
          
          =
          
            
              log
              ⁡
              
                [
                
                  
                    ∑
                    
                      (
                      
                        m
                        ⁢
                        
                          
                          
                            
                              b
                              m
                              i
                            
                            =
                            
                              b
                              n
                              i
                            
                          
                          )
                        
                        ⁢
                        i
                      
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    e
                    
                      -
                      
                        
                          ∑
                          
                            j
                            =
                            1
                          
                          k
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            
                              (
                              
                                
                                  E
                                  S
                                
                                
                                  N
                                  0
                                
                              
                              )
                            
                            
                              (
                              j
                              )
                            
                          
                          ⁢
                          
                            
                              (
                              
                                d
                                
                                  n
                                  ,
                                  m
                                
                                
                                  (
                                  i
                                  )
                                
                              
                              )
                            
                            2
                          
                        
                      
                    
                  
                
                ]
              
            
            -
            
              log
              ⁡
              
                [
                
                  
                    ∑
                    
                      m
                      ⁢
                      
                        
                        
                          
                            b
                            m
                            i
                          
                          ≠
                          
                            b
                            n
                            i
                          
                        
                        )
                      
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    e
                    
                      -
                      
                        
                          ∑
                          
                            j
                            =
                            1
                          
                          k
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            
                              (
                              
                                
                                  E
                                  S
                                
                                
                                  N
                                  0
                                
                              
                              )
                            
                            
                              (
                              j
                              )
                            
                          
                          ·
                          
                            
                              (
                              
                                d
                                
                                  n
                                  ,
                                  m
                                
                                
                                  (
                                  i
                                  )
                                
                              
                              )
                            
                            2
                          
                        
                      
                    
                  
                
                ]
              
            
          
        
        ,
      
    
    
      
        (
        2
        )
      
    
  




where j denotes the j-th transmission ((j−1)-th retransmission). Analogous to the single transmission case the mean LLRs depend on the signal-to-noise ratios and the Euclidean distances at each transmission time.

It is clear to a skilled person, that an approximation of the LLRs can be obtained by a simplified calculation to the above detailed equations.
In the following, the case of a 16-QAM system will be exemplarily considered resulting in 2 high reliable and 2 low reliable bits, where for the low reliable bits the reliability depends on transmitting a one or a zero (see FIG. 1). Hence, overall there exist 2 levels of reliabilities wherein the second level can be further subdivided.
Level 1 (High Reliability, 2 bits): Bit mapping for ones (zeros) separated into the positive (negative) real half space for the i-bits and the imaginary half space the q-bits. Here, there is no difference whether the ones are mapped to the positive or to the negative half space.
Level 2 (Low Reliability, 2 bits): Ones (zeros) are mapped to inner (outer) columns for the i-bits or to inner (outer) rows for the q-bits. Since there is a difference for the LLR depending on the mapping to the inner (outer) columns and rows, Level 2 is further classified:
Level 2a: Mapping of in to inner columns and qnto inner rows respectively.
Level 2b: Inverted mapping of Level 2a: Mapping of in to outer columns and qn to outer rows respectively.
To ensure an optimal averaging process over the transmissions for all bits the levels of reliabilities have to be altered.
It has to be considered that the bit-mapping order is open prior initial transmission, but has to remain through retransmissions, e.g. bit-mapping for initial transmission: i1q1i2q2 bit-mapping all retransmissions: i1q1i2q2.
Some examples for possible constellations are shown in FIG. 2. The resulting bit reliabilities according to FIG. 2 are given in Table 1.











TABLE 1





Constellation
bit i1
bit q1
bit i2
bit q2







1
High Reliability
High Reliability
Low Reliability
Low Reliability



(Level 1)
(Level 1)
(Level 2b)
(Level 2b)


2
Low Reliability
Low Reliability
High Reliability
High Reliability



(Level 2a)
(Level 2a)
(Level 1)
(Level 1)


3
Low Reliability
Low Reliability
High Reliability
High Reliability



(Level 2b)
(Level 2b)
(Level 1)
(Level 1)


4
High Reliability
High Reliability
Low Reliability
Low Reliability



(Level 1)
(Level 1)
(Level 2a)
(Level 2a)









In the following, it is assumed that m denotes the retransmission number parameter, with m=0 denoting the first transmission of a packet in the ARQ context. Further let b denote the number of bits that form a symbol in the mapping entity. Typically, b can be any integer number, where the most often used values for communication systems are an integer power of 2.
Without loss of generality it can be further assumed that the number of bits n that are used as input to the interleaving process is dividable by b, i.e. n is an integer multiple of b. Those skilled in the art will perceive that if this should not be the case, then the sequence of input bits can be easily appended by dummy bits until the above condition is met.
In the following an example of a simple Gray-mapped 16-QAM transmission scheme with FEC rate 1⁄2 (Sn: systematic bits—Pn: parity bits), which is generated from a systematic encoder of rate 1⁄3 (see FIG. 3) by puncturing will be considered. A sequence and ordering of bits as shown in FIG. 4 could be selected for the 1st transmission (TX). FIG. 4 shows the generated sequence of FIG. 3 with an indication of the bit reliabilities.
A simple conventional HARQ Type-III scheme with a single redundancy version would transmit in all requested retransmissions the identical sequence (having the identical mapping M1 or identical interleaving I1). The 1st transmission is usually not interleaved, however also not to interleave can be viewed as having an interleaver with equal input and output streams. This results after combining all received (and requested) transmissions in large variations of bit reliabilities. E.g. S1 and P1 would be highly reliable (transmitted n times with high reliability) whereas S2 and P4 would be less reliable (transmitted n times with low reliability). As stated earlier, this will downgrade decoding performance at the receiver.
The performance of this basic scheme can be increased by switching the reliabilities for required retransmissions to average out the reliabilities for all transmitted bits. This can be achieved by a number of different specific implementations, where 2 possible solutions are depicted below in FIG. 5 and FIG. 6. This technique can be implemented either by interleaving the bits differently than in the 1st transmission or by using different mapping rules for the modulation symbols. In the following this will be denoted as using a 2nd mapper M2 or a 2nd interleaver I2.
FIG. 5 shows a bit sequence for the 2nd transmission, wherein, in order to average bit reliabilities, the bits are shifted by 2 to the right using different interleavers for transmission.
FIG. 6 shows a bit sequence for the 2nd transmission, wherein, in order to average bit reliabilities, the bit positions are switched using different mappers for transmissions.
In case of using just 2 different mappers (Mn) or interleavers (In) all successive transmissions are then mapped or interleaved such that no mapper/interleaver is used 2 times more often than the other one, e.g.:









TABLE 2





TX
Strategy 1
Strategy 2







1
I1/M1
I1/M1


2
I2/M2
I2/M2


3
I1/M1
I2/M2


4
I2/M2
I1/M1


5
I1/M1
I1/M1


6
I2/M2
I2/M2


7
I1/M1
I2/M2


. . .
. . .
. . .









It should be noted that for 16-QAM the usage of 4 different mappers provides a better performance and just using 2 mappers provides a sub optimum solution. 2 mappers are chosen to keep the example simple.
It can be seen from the table above the performances of the strategy 1 and 2 are equal or similar, hence, it does not make a difference if choosing mapper/interleaver M1/I1 or M2/I2 for the 3rd TX (transmission). For the 4th TX, however, it has to be taken care to choose the complementary mapper/interleaver with respect to the 3rd TX.
A simple prior art HARQ Type-III scheme with multiple redundancy versions would retransmit the systematic bits in the 2nd TX plus the additional parity bits, which have not been transmitted in the first TX. For simplicity the example is chosen such that the number of bits per transmissions is kept constant and exactly 2 transmissions can carry all encoded bits (systematic and parity). To guarantee self-decodable retransmissions all systematic bits are retransmitted. It will however be appreciated by those skilled in the art, that also non-self decodable retransmissions can be used to carry out the invention.
FIG. 7 shows a bit sequence for the 1st TX as RV1 & M11/I11.
For conventional schemes with multiple redundancy versions—not taking the variations in bit reliabilities into account, i.e. having a single mapper/interleaver as shown in the bit sequence for the sequence for the 2nd transmission RV2 & M12/I12 in FIG. 8—a similar problem arises as for schemes with a single redundancy version. Low reliable systematic bits from the 1st TX will be low reliable in the 2nd transmission.
Using 2 mappers/interleavers (see FIG. 9) the averaging will be performed for the systematic bits. However, after 2 transmissions averaging of the reliabilities is only possible for the bits transmitted twice so far (in this example the systematic bits). In the 3rd TX one is free of choice which redundancy version to transmit RV1 or RV2 (performance for both possibilities should be very similar).
The example described above having 2 redundancy versions (RV1 and RV2) basically provides 4 combinations of redundancy versions and mappers/interleavers (see Table 3 and FIG. 10):







TABLE 3





Possible Combinations

















RV1 & I11/M11



RV1 & I21/M21



RV2 & I12/M12



RV2 & I22/M22










In the following the set of bits transmitted in the 1st TX will be labeled RV1 (redundancy version 1) and the set of bits transmitted in the 2nd TX will be labeled RV2. Also, the mappers/interleavers are linked to the redundancy versions by a superscript. In the shown example the interleaver pattern and mapping for In1/Mn1 and In2/Mn2 (n=1, 2) are equal, which is a special case, because the positions of the systematic and parity bits are aligned to each other in both redundancy versions.
In accordance with the present invention, the mapper/interleaver has to be selected according to the chosen redundancy version in order to average out the reliabilities of the systematic and parity bits. This is contrary to the single redundancy version case, whereby the third transmission one can select any mapper/interleaver.
In the following, a strategy for selecting the mapper/interleaver depending on the transmitted redundancy version in order to average out all bit reliabilities is proposed.
1st TX
Let us assume the combinations RV1& I11/M11 is selected for the 1st TX—any other combination could also be selected for 1st transmission (assuming equal/similar performance considering a single transmission).
2nd TX
In the 2nd TX the remaining redundancy version should be transmitted (in this case RV2), where the reliabilities for all bits which have been already transmitted in the 1st TX (in this case all systematic bits) have to be averaged, i.e. low reliable systematic bits have to be high reliable now. This is achieved by transmitting RV2 with I22/M22.
3rd TX
For the 3rd TX one is free which redundancy version to transmit, however it has to be combined with a mapper/interleaver, which has not been yet chosen for this redundancy version, i.e. RV1 & I21/M21 in strategy 1 and RV2 I12/M12 in strategy 2. This ensures the averaging of the parity bits, which are transmitted in the current set of bits.
4th TX
For the 4th TX the combination, which is left over has to be selected. This guarantees the averaging of the remaining set of parity bits and makes sure to transmit the set of parity bits, which have just been transmitted once so far.
5th and Further TX
After the 4th TX the averaging process is finished. Hence there is a free choice of redundancy version and mapper/interleaver combination. For following TXs the rules applied to TXs 1-4 have to be considered.









TABLE 4





TX
Strategy 1
Strategy 2







1
RV1 &
RV1 & I11/M11



I11/M11


2
RV2 &
RV2 & I22/M22



I22/M22


3
RV1 &
RV2 & I12/M12



I21/M21


4
RV2 &
RV1 & I21/M21



I12/M12


5
. . .
. . .









In the provided example the positions of the systematic bits for both redundancy version RV1 and RV2 (considering same mapper/interleaver) are equal (see FIG. 10). This is not generally the case (especially for different coding rates) and is clearly a simplification. The shown example is intended to show the general procedure, which can be easily extended to more general cases mentioned below.
The proposed method is not restricted to 2 redundancy versions. Instead it can be extended to any number N of redundancy versions, which are selected to be transmitted consecutively and repeated after N transmissions as in a general HARQ Type II/III scheme with N redundancy versions.
Under the assumption that m denotes the actual mapper/interleaver version (m=1 . . . M) the number of mappers/interleavers per redundancy version might be any integer number M (resulting in at most into N·M different mappers/interleavers, where N denotes the total number of redundancy versions and M the number of mappers/interleavers per redundancy version), where the mapping rules or interleaver patterns are not necessarily designed to perform a perfect averaging of reliabilities. According to the example in Table 4, the general method is shown in Table 5, where (as mentioned earlier) all Imn/Mmn might have different mapping rules or interleaver patterns.










TABLE 5







TX
Combination









1
RV1 & I11/M11



2
RV2 & I12/M12



3
RV3 & I13/M13



. . .
. . .



N
RVN & I1N/M1N



N + 1
RV1 & I21/M21



. . .
. . .



2N
RVN & I2N/M2N



. . .
. . .



N · (M − 1) + 1
RV1 & IM1/MM1



. . .
. . .



N · M
RVN & IMN/MMN



. . .
. . .










As shown in the example, the mappers/interleavers Imn/Mmn could be the same for all redundancy versions n, i.e. mappers/interleavers are independent from n: Im/Mm (in total M different mappers/interleavers). The mapping rules or interleaver patterns might be chosen such that the averaging process for both the systematic bits and parity bits is as good as possible. Any pair of mappers/interleavers Imn/Mmn, Ikj/Mkj might have the same mapping rule or interleaver pattern.
Preferably, the number M of mappers/interleavers might be chosen according to the number of bit-reliability levels caused by the modulation scheme. Alternatively, the number M of mappers/interleavers might be chosen according to the twice the number of bit-reliability levels caused by the modulation scheme.
FIG. 11 shows an exemplary first embodiment of a communication system in which the method underlying the invention is employed.
At the transmitter 100, a bit sequence is obtained from a forward error correction (FEC) encoder (not shown) and subsequently input into an interleaver 110 and a logical bit inverter 120. The interleaver 110 and logical bit inverter 120 are each functions of the redundancy version and/or the mapper/interleaver version m and modify the input bit sequence. Subsequently, the bit sequence is input into the mapper/modulator 130 being the mapping entity. The mapper typically uses one of the signal constellations shown in FIG. 2 and maps the bits onto a symbol which is transmitted over the communication channel 200. The communication channel is typically a radio communication channel experiencing unreliable and time-varying channel conditions.
The patterns used by the mappers, interleavers and inverters are either stored at both, the transmitter and the receiver or stored at the transmitter and signalled to the receiver.
At the receiver 300, the complex symbols are first input into a de-mapper/demodulator 330 which demodulates the received symbols into a corresponding bit domain sequence (e.g. sequence of LLRs). This sequence is then input into a logical inverter 320 and subsequently into a de-interleaver 310 from which the obtained bit domain sequence is output.
The interleaver and de-interleaver operate in accordance with the well known technique of interleaving/deinterleaving by applying a determined, pseudo-random or random permutation of the input bit or symbol sequences, i.e. change the positions of the bits or symbols within a sequence, In the above described embodiment, the interleaver (and the deinterleaver) are a intra-symbol bit (de-)interleaver which change the position of the bits that form a symbol in the mapper/demapper.
The logical bit inverter operates in accordance with a well known technique of inverting the logical value of a bit, i.e. turns a logical low to a logical high value and vice versa. In one practical realization of a receiver working with log likelihood ratios, this inverting operation is equivalent to a sign inversion of the log likelihood ratio.
If a retransmission is launched by an automatic repeat request issued by an error detector (not shown) with the result that another data packet is transmitted from the transmitter 100, in the de-mapper/demodulator 330, the previously received erroneous data packets are combined with the retransmitted data packets. Due to the modification of the bit sequence by the interleaver and the logical bit inverter, the mean bit reliabilities are averaged out resulting in an increased performance in the receiver.
As an alternative approach, in the second embodiment shown in FIG. 12, the pattern for interleaving/de-interleaving the bit sequence before sending same to the mapper is left constant to i.e. does not change as a function of the redundancy version n. Instead, the rules for mapping the bits onto a symbol are changed which corresponds to having input bit sequences into the mapper only depending on the redundancy version n and simply changing the bit-to-symbol mapping rules.
In a further variant, not explicitly shown in the figures, a combination of the two described approaches above can be used, i.e. mapper/interleaver and inverter depend on the redundancy version n and the mapper/interleaver version m.
FIG. 13 shows the result of a simulation measuring the frame error rate for a 16-QAM modulation scheme employing a code rate 1⁄2 for two conventional HARQ methods and one possible implementation of the method according the present invention. For this example, strategy 2 in below table 5 has been compared with two conventional strategies. It is obvious from FIG. 13 that the method according to the invention outperforms the conventional methods.










TABLE 5






Conventional 1
Conventional 2




(using identical
(alternating between
Strategy 2


Scheme
mapping for all
mappings irrespective
(according


Transmission
transmissions)
of redundancy version)
to Table 3)







1. TX
RV1 & Mapping 1
RV1 & M1
RV1 & M1



(M1)


2. TX
RV2 & M1
RV2 & M2
RV2 & M2


3. TX
RV1 & M1
RV1 & M1
RV1 & M2


4. TX
RV2 & M1
RV2 & M2
RV2 & M1









In the table, the used redundancy versions (RVn) and mappings (Mm) for simulated methods are listed, where the mappings M11=M21=M1 and M12=M22=M2 are according to Table 4 (i.e. identical mappings used for both redundancy versions). M1 corresponds to constellation 1 and M2 corresponds to constellation 2 in FIG. 2.
Although the method described above has been described using Gray-encoded signals and a QAM modulation scheme, it is clear to a skilled person that other suitable encoding and modulation schemes, e.g. PSK-modulation can be equally used in obtaining the benefits of the invention.

## Claims

1. A transmission apparatus for transmitting data using a HARQ process comprising a transmission section that transmits data using one combination of a plurality of combinations, each of the combinations comprising one redundancy version of a plurality of redundancy versions and one constellation version of a plurality of constellation versions, at least one redundancy version of the plurality of redundancy versions being assigned to more than one of the constellation versions.

2. The transmission apparatus according to claim 1, wherein each of the constellation versions defines at least one of (i) bit positions in a bit sequence comprising a plurality of bits and (ii) logical values of the bits.

3. The transmission apparatus according to claim 1, wherein one of the constellation versions is produced by at least one of (i) exchanging a bit with another in a bit sequence comprising a plurality of bits and (ii) inverting a logical value of a bit in the bit sequence.

4. The transmission apparatus according to claim 1, further comprising: a rearranging section that rearranges a bit sequence comprising a plurality of bits according to a constellation version of the one of the combinations, to produce a rearranged bit sequence.

5. The transmission apparatus according to claim 1, further comprising: a rearranging section that operates to at least one of (i) exchange a bit with another in a bit sequence comprising a plurality of bits and (i) invert a logical value of a bit in the bit sequence.

6. The transmission apparatus according to claim 1, wherein said transmitting section (i) transmits first data using one of the combinations and (ii) transmits second data using another of the combinations.

7. The transmission apparatus according to claim 1, wherein said transmission section (i) transmits data using first combination of the combinations and (ii) retransmits data using second combination of the combinations.

8. A transmission method for transmitting data using a HARQ process comprising a step of: transmitting, with a transmitter of a communication apparatus, data using one combination of a plurality of combinations, each of the combinations comprising one redundancy version of a plurality of redundancy versions and one constellation version of a plurality of constellation versions, at least one redundancy version of the plurality of redundancy versions being assigned to more than one of the constellation versions.

9. The transmission method according to claim 8, wherein each of the constellation versions defines at least one of (i) bit positions in a bit sequence comprising a plurality of bits and (ii) logical values of the bits.

10. The transmission method according to claim 8, wherein one of the constellation versions is produced by at least one of (i) exchanging a bit with another in a bit sequence comprising a plurality of bits and (ii) exchanging a logical value of a bit in the bit sequence.

11. The transmission method according to claim 8, further comprising:
operating to at least one of (i) exchange a bit with another in a bit sequence comprising a plurality of bits and (ii) invert a logical value of a bit in the bit sequence.

12. The transmission method according to claim 8, wherein the transmitting step transmits data using first combination of the combinations, further comprising a step of:
retransmitting data using second combination of the combination.

13. A reception apparatus for receiving data transmitted using a HARQ process comprising: a receiving section that receives data transmitted using one combination of a plurality of combinations, each of the combinations comprising one redundancy version of a plurality of redundancy versions and one constellation version of a plurality of constellation versions, at least one redundancy version of the redundancy versions being assigned to more than one of the constellation versions.

14. The reception apparatus according to claim 13, further comprising: a demodulating section that demodulates the received data.

15. The reception apparatus according to claim 13, wherein each of the constellation versions defines at least one of (i) bit positions in a bit sequence comprising a plurality of bits and (ii) logical values of the bits.

16. The reception apparatus according to claim 13, wherein one of the constellation versions is produced by at least one of (i) exchanging a bit with another in a bit sequence comprising a plurality of bits and (ii) inverting a logical value of a bit in the bit sequence.

17. The reception apparatus according to claim 13, further comprising: a rearranging section that operates to at least one of (i) exchange a bit with another in a bit sequence comprising a plurality of bits of the received data and (ii) invert a logical value of a bit in the bit sequence.

18. The reception apparatus according to claim 13, wherein said receiving section (i) receives data transmitted using first combination of the combinations and (ii) receives data retransmitted using second combination of the combinations.

19. A reception method for receiving data transmitted using a HARQ process comprising a step of: receiving, with a receiver of a communication apparatus, data transmitted using one combination of a plurality of combinations, each of the combinations comprising one redundancy version of a plurality of redundancy versions and one constellation version of a plurality of constellation versions, at least one redundancy version of the redundancy versions being assigned to more than one of the constellation versions.

20. The reception method according to claim 19, further comprising:
demodulating the received data.

21. The reception method according to claim 19, further comprising:
operating to at least one of (i) exchange a bit with another in a bit sequence comprising a plurality of bits of the received data and (ii) invert a logical value of a bit in the bit sequence.

22. The reception method according to claim 19, wherein receiving step receives data transmitted using first combination of the combinations, further comprising a step of: receiving data retransmitted using second combination of the combinations.

23. A transmission system comprising:
a transmission apparatus comprising a transmission section that transmits data using one combination of a plurality of combinations, each of the combinations comprising one redundancy version of a plurality of redundancy versions and one constellation version of a plurality of constellation versions, at least one redundancy version of the plurality of redundancy versions being assigned to more than one of the constellation versions, and
a reception apparatus comprising a reception section that receives data transmitted by the transmission apparatus.