CA2488267C - Hybrid arq method with signal constellation rearrangement - Google Patents
Hybrid arq method with signal constellation rearrangement Download PDFInfo
- Publication number
- CA2488267C CA2488267C CA2488267A CA2488267A CA2488267C CA 2488267 C CA2488267 C CA 2488267C CA 2488267 A CA2488267 A CA 2488267A CA 2488267 A CA2488267 A CA 2488267A CA 2488267 C CA2488267 C CA 2488267C
- Authority
- CA
- Canada
- Prior art keywords
- mapping
- transmission
- bit
- level
- mappings
- Prior art date
- Legal status (The legal status 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 status listed.)
- Expired - Lifetime
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/32—Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
- H04L27/34—Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
-
- 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/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/1829—Arrangements specially adapted for the receiver end
- H04L1/1835—Buffer management
- H04L1/1845—Combining techniques, e.g. code combining
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
A hybrid ARQ retransmission method in a communication system, wherein data packets being encoded with a forward error correction (FEC) technique prior to transmission, are retransmitted based on an automatic repeat request and subsequently soft-combined with previously received erroneous data packets either on a symbol-by-symbol or a bit-by-bit basis. The symbols of said erroneous data packets are modulated by employing a predetermined first signal constellation. The symbols of the retransmitted data packets are modulated by employing at least a predetermined second signal constellation. Each symbol bit has a mean bit reliability defined by the individual bit reliabilities over all symbols of the predetermined signal constellation. According to the invention, the predetermined first and the at least second signal constellation are selected such that the combined mean bit reliabilities for the respective bits of all transmissions are averaged out.
Description
HYBRID ARQ METHOD WITH SIGNAL CONSTELLATION REARRANGEMENT
Field of the Invention The present invention relates to a hybrid ARQ retransmission method in a communi-cation system.
Related Art 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 resend the er-roneously received data packets.
S. Kallel, Analysis of a type Il hybrid ARQ scheme with code combining, IEEE
Trans-actions 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 Il: The erroneous received packets are not discarded, but are combined with some incremental redundancy bits provided by the transmitter for subse-quent decoding. Retransmitted packets sometimes have higher coding rates and are combined at the receiver with the stored values. That means that only little redundancy is added in each retransmission.
^ Type III: Is the same as Type 11 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 dam-aged in such a way that almost no information is reusable.
Types 11 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
Field of the Invention The present invention relates to a hybrid ARQ retransmission method in a communi-cation system.
Related Art 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 resend the er-roneously received data packets.
S. Kallel, Analysis of a type Il hybrid ARQ scheme with code combining, IEEE
Trans-actions 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 Il: The erroneous received packets are not discarded, but are combined with some incremental redundancy bits provided by the transmitter for subse-quent decoding. Retransmitted packets sometimes have higher coding rates and are combined at the receiver with the stored values. That means that only little redundancy is added in each retransmission.
^ Type III: Is the same as Type 11 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 dam-aged in such a way that almost no information is reusable.
Types 11 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
2 previously received erroneous packets. There exist basically three schemes of reus-ing the redundancy of previously transmitted packets:
= Soft-Combining Code-Combining = Combination of Soft- and Code-Combining Soft-Combining Employing soft-combining the retransmission packets carry identical symbols com-pared with the previously received symbols. In this case the multiple received pack-ets are combined either by a symbol-by-symbol or by a bit-by-bit basis as for exam-ple disclosed in D. Chase, Code combining: A maximum-likelihood decoding ap-proach 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 Com-bining Systems based on the Viterbi Decoder, IEEE Transactions on Communica-tions, Vol. 42, No. 2/3/4, April 1994. By combining this soft-decision values from all received packets the reliabilities of the transmitted bits will increase linearly with the number and power of received packets. From a decoder point of view the same FEC
scheme (with constant code rate) will be employed over all transmissions.
Hence, the decoder does not need to know how many retransmissions have been per-formed, since it sees only the combined soft-decision values. In this scheme, all transmitted packets will have to carry the same number of symbols.
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 de-coder has to be aware of the FEC scheme to apply at each retransmission instant.
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.
= Soft-Combining Code-Combining = Combination of Soft- and Code-Combining Soft-Combining Employing soft-combining the retransmission packets carry identical symbols com-pared with the previously received symbols. In this case the multiple received pack-ets are combined either by a symbol-by-symbol or by a bit-by-bit basis as for exam-ple disclosed in D. Chase, Code combining: A maximum-likelihood decoding ap-proach 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 Com-bining Systems based on the Viterbi Decoder, IEEE Transactions on Communica-tions, Vol. 42, No. 2/3/4, April 1994. By combining this soft-decision values from all received packets the reliabilities of the transmitted bits will increase linearly with the number and power of received packets. From a decoder point of view the same FEC
scheme (with constant code rate) will be employed over all transmissions.
Hence, the decoder does not need to know how many retransmissions have been per-formed, since it sees only the combined soft-decision values. In this scheme, all transmitted packets will have to carry the same number of symbols.
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 de-coder has to be aware of the FEC scheme to apply at each retransmission instant.
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.
3 Combination of Soft- and Code-Combining In case the retransmitted packets carry some symbols identical to previously trans-mitted symbols and some code-symbols different from these, the identical code-symbols are combined using soft-combing as described in the section titled "Soft Combining" while the remaining code-symbols will be combined using code-combining. Here, the, signaling requirements will be similar to code-combining.
As 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 draw-back: 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.
The varying bit reliabilities evolve from the constraint of two-dimensional signal con-stellation 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-ure 1 showing a Gray encoded signal constellation with a given bit-mapping order i,gli2g2, the bits mapped onto the symbols differ from each other in mean reliability in the first transmission of the packet. In more detail, bits ii and q, have a high mean reliability, as these bits are mapped to half spaces of the signal constellation diagram
As 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 draw-back: 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.
The varying bit reliabilities evolve from the constraint of two-dimensional signal con-stellation 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-ure 1 showing a Gray encoded signal constellation with a given bit-mapping order i,gli2g2, the bits mapped onto the symbols differ from each other in mean reliability in the first transmission of the packet. In more detail, bits ii and q, have a high mean reliability, as these bits are mapped to half spaces of the signal constellation diagram
4 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 de-pends 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 con-stant ratio to each other, which is defined by the signal constellation employed in the first transmission, i.e. bits il and qi will always have a higher mean reliability than bits i2 and q2 after any number of retransmissions.
Summary of the Invention The object underlying the present invention is to provide a hybrid ARQ
retransmis-sion method with an improved error correction performance. This object is solved by a method as set forth in claim 1.
The method subject to the invention is based on the recognition that in order to en-hance 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 idea underlying the invention is to tailor the bit reliabilities 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 transmis-sions are nearly equal.
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.
Brief Description of the Drawings For a more in depth understanding of the present invention, preferred embodiments will be described in the following with reference to the accompanying drawings.
Figure 1 is an exemplary signal constellation for illustrating a 16 QAM
modulation scheme with Gray encoded bit symbols, figure 2 shows four examples for signal constellations for a 16 QAM modulation scheme with Gray encoded bit symbols, figure 3 shows an exemplary signal constellation for 64-QAM Gray encoded bit sym-bols, figure 4 shows six exemplary signal constellations for 64-QAM Gray encoded bit symbols figure 5 is an exemplary embodiment of a communication system in which the method underlying the invention is employed, and figure 6 explains details of the mapping unit shown in figure 5.
Detailed Description of the Preferred Embodiments For a better understanding of the 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 bõ' under the constraint that symbol sõ has been trans-mitted for a transmission over a channel with additive white gaussian noise (AWGN) and equally likely symbols yields _3 dt Fs d1 LLRh, Irn )=10 g r le N, -1og ( E e N (1) (mbwebR/ (n4,*bl) where rõ = sõ denotes the mean received symbol under the constraint the symbol sn has been transmitted (AWGN case), dn,m2 denotes the square of the Euclidean dis-tance between the received symbol rõ and the symbol sm, and Es/No denotes the ob-served signal-to-noise ratio.
It can be seen from Equation (1) that the LLR depends on the signal-to-noise ratio EslNo 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 bõ under the constraint that symbols s, have been transmitted over inde-pendent AWGN channels and equally likely symbols yields r (E' 0),(a ) L $s U),(dU))'], LLR t ~r~)I,r(Z) ,...,r.(o)=log e `NQ) .~' -log Ze !-1 N0) (2) b, U) (mlb ,*b, where j denotes the j-th transmission ((j -1)-th retransmission).Analogous to the sin-gle transmission case the mean LLRs depend on the signal-to-noise ratios and the Euclidean distances at each transmission time.
If no constellation rearrangement is performed the Euclidean distances dn,Jh =
dn,mt1?
are constant for all transmissions and, hence, the bit reliabilities (H Rs) after k trans-missions will be defined by the observed signal-to-noise ratio at each transmission time and the signal constellation points from the first transmission. For higher level modulation schemes (more than 2 bits per symbol) this results in varying mean LLRs for the bits, which in turn leads to different mean bit reliabilities. The differences in mean reliabilities remain over all retransmissions and lead to a degradation in de-coder performance.
16-QAM Strategy In the following, the case of a 16-QAM system will be exemplarily considered result-ing in 2 high reliable and 2 low reliable bits, where for the low reliable bits the reliabil-ity depends on transmitting a one or a zero (see Figure 11. Hence, overall there exist 3 levels of reliabilities.
Level I (High Reliability, 2 bits): Bit mapping for ones (zeros) separated into the positive (negative) real half space for the !-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 qn to inner rows respectively.
Level 2b: Inverted mapping of Level 2a: Mapping of in to outer columns and qõ
to outer rows respectively.
To ensure an optimal averaging process over the transmissions for all bits the levels of reliabilities have to be altered by changing the signal constellations according to the algorithms given in the following section.
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:
i1q,i2g2 bit-mapping all retransmissions: ilgli2g2.
For the actual system implementation there are a number of possible signal constel-lations to achieve the averaging process over the retransmissions. Some examples for possible constellations are shown in Figure 2. The resulting bit reliabilities ac-cording to Figure 2 are given in Table 1.
} I
Constella- bit i, bit q, bit i2 bit q2 tion fi.,t~nt>;llrt,>.= \.la?tii`EIti >~~~` ~. ': .~.~'i,.::-=,="' High Reliability High Reliability (Level 1) (Level 1) Qt r. \..
,.\'~ '~~= i h Reliabilit Hi h Reliability iki% H g Y 9 :ii::u .=..i.. ;..4.:;W;:;";C .:..:: :.h t.....
<,~.::;$...:,.>?.':. .':=..>< n; :~::;~ti ~ w ~;:~, ,:7 .Level 1 Level 1 ) High Reliability High Reliability a 3 ..:.. Level 1) ;.,.(Ã (Level 1) ( 'vSR '.==~S= v'{`. :a:y::N\,^;{`, , :==h.,::Z 'vli, '\ .:2n i. T,y R}. ,\;;
High Reliability . n,;.; ;t~j~k=Lj High Reliability =;'N
.:.<::;:;>\-,`. }= ... ., r,,iy sf\'= mss:. , h:::)"$. .'v ..,~:~:,=:;:..:....~.~,~;~~~=<,..`~v:.:.,:.`hi Level1 (Leve11) ( ) +a;::. ,h. ...:a:i*~...: i=;aya :,.',ate.. `t :y"~\.9:T:\,+.`., \, Table 1. Bit reliabilities for 16-QAM according to signal constellations shown in Figure 2 Moreover, Table 2 provides some examples how to combine the constellations for the transmissions 1 to 4 (using 4 different mappings).
Scheme l Scheme 2 Scheme 3 (with Scheme 4 Transmis- sion N (with Con- (with Con- Constellations) (with Con-stellations) stellations) stellations) Table 2. Examples for Constellation Rearrangement strategies for 16-QAM (using mappings) with signal constellations according to Figure 2 and bit reliabilities according to Table 1.
Two algorithms are given which describe schemes using 2 or 4 mappings overall.
The approach using 2 mappings results in less system complexity, however has some performance degradation with respect to the approach using 4 mappings.
The mapping for i- and q-bits can be done independently and, hence, in the following the mapping for the i-bits only is described. The algorithms for the q-bits work analog.
16-QAM Algorithms A. Using 2 Mappings 1. Step (1. Transmission) 1. Mapping defined 2. Step (2. Transmission) Choose Level 1 for i2 Level 2 for i, - free choice if 2a or 2b 2. Mapping defined 3. Step Options:
(a) Go to 1. Step and proceed with alternating between 1. and 2. Mapping (b) Use 2. Mapping and proceed with using 2 times 1. Mapping, 2 times 2.
Mapping and so on ...
B. Using 4 Mappings 1. Step (1. Transmission) Choose Level 1 for i, Level 2 for i2 - free choice if 2a or 2b = 1. Mapping defined 2. Step (2. Transmission) Choose Level 1 for i2 = Level 2 for i, - free choice if 2a or 2b 2. Mapping defined 3. Step (3. Transmission) Options:
(a) Choose Level I for i, Level 2 for i2 with following options (al) if in 1. Transmission 2a was used then use 2b (a2) if in 1. Transmission 2b was used then use 2a (b) Choose Level 1 for i2 Level 2 for i, with following options (b1) if in 2. Transmission 2a was used then use 2b (b2) if in 2. Transmission 2b was used then use 2a 3. Mapping defined 4. Step (4. Transmission) if option (a) in 3. Step Choose Level I for i2 = Level 2 for i, with following options (a2) if in 2. Transmission 2b was used then use 2a if option (b) in 3. Step Choose Level I for ii Level 2 for i2 with following options (al) if in 1. Transmission 2a was used then use 2b (a2) if in 1. Transmission 2b was used then use 2a 4. Mapping defined
In contrast thereto, bits i2 and q2 have a low mean reliability, as their reliability de-pends 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 con-stant ratio to each other, which is defined by the signal constellation employed in the first transmission, i.e. bits il and qi will always have a higher mean reliability than bits i2 and q2 after any number of retransmissions.
Summary of the Invention The object underlying the present invention is to provide a hybrid ARQ
retransmis-sion method with an improved error correction performance. This object is solved by a method as set forth in claim 1.
The method subject to the invention is based on the recognition that in order to en-hance 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 idea underlying the invention is to tailor the bit reliabilities 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 transmis-sions are nearly equal.
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.
Brief Description of the Drawings For a more in depth understanding of the present invention, preferred embodiments will be described in the following with reference to the accompanying drawings.
Figure 1 is an exemplary signal constellation for illustrating a 16 QAM
modulation scheme with Gray encoded bit symbols, figure 2 shows four examples for signal constellations for a 16 QAM modulation scheme with Gray encoded bit symbols, figure 3 shows an exemplary signal constellation for 64-QAM Gray encoded bit sym-bols, figure 4 shows six exemplary signal constellations for 64-QAM Gray encoded bit symbols figure 5 is an exemplary embodiment of a communication system in which the method underlying the invention is employed, and figure 6 explains details of the mapping unit shown in figure 5.
Detailed Description of the Preferred Embodiments For a better understanding of the 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 bõ' under the constraint that symbol sõ has been trans-mitted for a transmission over a channel with additive white gaussian noise (AWGN) and equally likely symbols yields _3 dt Fs d1 LLRh, Irn )=10 g r le N, -1og ( E e N (1) (mbwebR/ (n4,*bl) where rõ = sõ denotes the mean received symbol under the constraint the symbol sn has been transmitted (AWGN case), dn,m2 denotes the square of the Euclidean dis-tance between the received symbol rõ and the symbol sm, and Es/No denotes the ob-served signal-to-noise ratio.
It can be seen from Equation (1) that the LLR depends on the signal-to-noise ratio EslNo 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 bõ under the constraint that symbols s, have been transmitted over inde-pendent AWGN channels and equally likely symbols yields r (E' 0),(a ) L $s U),(dU))'], LLR t ~r~)I,r(Z) ,...,r.(o)=log e `NQ) .~' -log Ze !-1 N0) (2) b, U) (mlb ,*b, where j denotes the j-th transmission ((j -1)-th retransmission).Analogous to the sin-gle transmission case the mean LLRs depend on the signal-to-noise ratios and the Euclidean distances at each transmission time.
If no constellation rearrangement is performed the Euclidean distances dn,Jh =
dn,mt1?
are constant for all transmissions and, hence, the bit reliabilities (H Rs) after k trans-missions will be defined by the observed signal-to-noise ratio at each transmission time and the signal constellation points from the first transmission. For higher level modulation schemes (more than 2 bits per symbol) this results in varying mean LLRs for the bits, which in turn leads to different mean bit reliabilities. The differences in mean reliabilities remain over all retransmissions and lead to a degradation in de-coder performance.
16-QAM Strategy In the following, the case of a 16-QAM system will be exemplarily considered result-ing in 2 high reliable and 2 low reliable bits, where for the low reliable bits the reliabil-ity depends on transmitting a one or a zero (see Figure 11. Hence, overall there exist 3 levels of reliabilities.
Level I (High Reliability, 2 bits): Bit mapping for ones (zeros) separated into the positive (negative) real half space for the !-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 qn to inner rows respectively.
Level 2b: Inverted mapping of Level 2a: Mapping of in to outer columns and qõ
to outer rows respectively.
To ensure an optimal averaging process over the transmissions for all bits the levels of reliabilities have to be altered by changing the signal constellations according to the algorithms given in the following section.
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:
i1q,i2g2 bit-mapping all retransmissions: ilgli2g2.
For the actual system implementation there are a number of possible signal constel-lations to achieve the averaging process over the retransmissions. Some examples for possible constellations are shown in Figure 2. The resulting bit reliabilities ac-cording to Figure 2 are given in Table 1.
} I
Constella- bit i, bit q, bit i2 bit q2 tion fi.,t~nt>;llrt,>.= \.la?tii`EIti >~~~` ~. ': .~.~'i,.::-=,="' High Reliability High Reliability (Level 1) (Level 1) Qt r. \..
,.\'~ '~~= i h Reliabilit Hi h Reliability iki% H g Y 9 :ii::u .=..i.. ;..4.:;W;:;";C .:..:: :.h t.....
<,~.::;$...:,.>?.':. .':=..>< n; :~::;~ti ~ w ~;:~, ,:7 .Level 1 Level 1 ) High Reliability High Reliability a 3 ..:.. Level 1) ;.,.(Ã (Level 1) ( 'vSR '.==~S= v'{`. :a:y::N\,^;{`, , :==h.,::Z 'vli, '\ .:2n i. T,y R}. ,\;;
High Reliability . n,;.; ;t~j~k=Lj High Reliability =;'N
.:.<::;:;>\-,`. }= ... ., r,,iy sf\'= mss:. , h:::)"$. .'v ..,~:~:,=:;:..:....~.~,~;~~~=<,..`~v:.:.,:.`hi Level1 (Leve11) ( ) +a;::. ,h. ...:a:i*~...: i=;aya :,.',ate.. `t :y"~\.9:T:\,+.`., \, Table 1. Bit reliabilities for 16-QAM according to signal constellations shown in Figure 2 Moreover, Table 2 provides some examples how to combine the constellations for the transmissions 1 to 4 (using 4 different mappings).
Scheme l Scheme 2 Scheme 3 (with Scheme 4 Transmis- sion N (with Con- (with Con- Constellations) (with Con-stellations) stellations) stellations) Table 2. Examples for Constellation Rearrangement strategies for 16-QAM (using mappings) with signal constellations according to Figure 2 and bit reliabilities according to Table 1.
Two algorithms are given which describe schemes using 2 or 4 mappings overall.
The approach using 2 mappings results in less system complexity, however has some performance degradation with respect to the approach using 4 mappings.
The mapping for i- and q-bits can be done independently and, hence, in the following the mapping for the i-bits only is described. The algorithms for the q-bits work analog.
16-QAM Algorithms A. Using 2 Mappings 1. Step (1. Transmission) 1. Mapping defined 2. Step (2. Transmission) Choose Level 1 for i2 Level 2 for i, - free choice if 2a or 2b 2. Mapping defined 3. Step Options:
(a) Go to 1. Step and proceed with alternating between 1. and 2. Mapping (b) Use 2. Mapping and proceed with using 2 times 1. Mapping, 2 times 2.
Mapping and so on ...
B. Using 4 Mappings 1. Step (1. Transmission) Choose Level 1 for i, Level 2 for i2 - free choice if 2a or 2b = 1. Mapping defined 2. Step (2. Transmission) Choose Level 1 for i2 = Level 2 for i, - free choice if 2a or 2b 2. Mapping defined 3. Step (3. Transmission) Options:
(a) Choose Level I for i, Level 2 for i2 with following options (al) if in 1. Transmission 2a was used then use 2b (a2) if in 1. Transmission 2b was used then use 2a (b) Choose Level 1 for i2 Level 2 for i, with following options (b1) if in 2. Transmission 2a was used then use 2b (b2) if in 2. Transmission 2b was used then use 2a 3. Mapping defined 4. Step (4. Transmission) if option (a) in 3. Step Choose Level I for i2 = Level 2 for i, with following options (a2) if in 2. Transmission 2b was used then use 2a if option (b) in 3. Step Choose Level I for ii Level 2 for i2 with following options (al) if in 1. Transmission 2a was used then use 2b (a2) if in 1. Transmission 2b was used then use 2a 4. Mapping defined
5. Step (5., 9., 13., ... Transmission) Choose one out of 4 defined mappings
6. Step (6., 10., 14., ... Transmission) Choose one out of 4 defined mappings except (a) the mapping used in 5. Step (previous transmission) (b) the mapping giving Level 1 reliability to the same bit as in previous trans-mission
7. Step (7., 11., 15., ... Transmission) Choose one out of 2 remaining mappings not used in last 2 transmissions
8. Step (8., 12., 16., ... Transmission) Choose mapping not used in last 3 transmissions
9. Step Go to 5. Step 64-QAM Strategy In case of a 64-QAM system there will be 2 high reliable, 2 medium reliable and 2 low reliable bits, where for the low and medium reliable bits the reliability depends on transmitting a one or a zero (see Figure 3). Hence, overall there exist 5 levels of reli-abilities.
Level I (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 for the q-bits. Here, there is no difference whether the ones are mapped to the positive or to the negative half space.
Level 2 (Medium Reliability, 2 bits): Ones (zeros) are mapped to 4 inner and 2x2 outer columns for the i-bits or to 4 inner and 2x2 outer rows for the q-bits.
Since there is a difference for the LLR depending on the mapping to the inner or outer col-umn/row Level 2 is further classified:
Level 2a: Mapping of in to 4 inner columns and qõ to 4 inner rows respectively.
Level 2b: Inverted mapping of 2a: in to outer columns and qn to outer rows respec-tively Level 3 (Low Reliability, 2 bits): Ones (zeros) are mapped to columns 1-4-5-for the i-bits or to rows 1-4-5-8/2-3-6-7 for the q-bits. Since there is a difference for the LLR depending on the mapping to columns/rows 1-4-5-8 or 2-3-6-7 Level 3 is further classified:
Level 3a: Mapping of in to columns 2-3-6-7 and qõ to rows 2-3-6-7 respectively Level 3b: Inverted mapping of 2a: in to columns 1-4-5-8 and qõ to rows 1-4-5-8 re-spectively To ensure an optimal averaging process over the transmissions for all bits the levels of reliabilities have to be altered by changing the signal constellations according to the algorithms given in the following section.
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:
ilgli2g2 i3q3 = bit-mapping all retransmissions: ilq,i2g2 i3g3.
Analog to 16-QAM for the actual system implementation there are a number of pos-sible signal constellations to achieve the averaging process over the retransmissions.
Some examples for possible constellations are shown in Figure 4. The resulting bit reliabilities according to Figure 4 are given in Table 3.
Constel- bit it bit qj bit i2 bit q2 bit i3 bit q3 lation .,; ?..
g h Reli Hi gh Reli- Midd(1-:= >IVi':I.:Fll:... ,, .tsFZ ::e; t?.:` 1 Hi 1 ability ability abth y ability ~\.st Ãlit ~f:, % :. >%%
eyeJ 2b ( vel b . i<. ve# >;" ' .. ;
(Level 1 Level l I-A
eti High Reli- High Reli Mi d e F tl~ Mtd' R Ita txi~ nr Re:: ~vl l !?1' ,,.
2 liai ability ability k :.af~h:=~):.'.: ==l~tlÃIr..~.f>;
=ti _ (! ~Yef>ka I ave~ 3J' {; (Level 1 Level 1 Lvel. >' t12i' >:
M ddle; eli Middle Refs ow F sli% %':t tt l High Reli- High Reli-3 a qty abilit fkltf .Ã''' <:. '"lye õ-< ability ability Lev 1 ......., rel2 .. 2 t. i+ t~ x el=f Level 1 Level 1 High Reli- High Reli- Mtddle Reli` tlliCde Rtl' Atat {<F'~l#5' -' i . tk abilit :.:: ; lltty t(ft f, ability 4 abtltty ;. ; ~=~SS=f ff:pS.>;: {,: SS'=iiif$`.: .>.Y,f.a j +yy : t:r:~~yn Level 1 Level 1 ... 'It\ .
ll- '` :..=.}:...,.,1. ,:,,:; { <>llf' High Reli- High Re ;[1 dfe f,~li\ tk 0W 11111 .
}
lty;bt!Ãtt ability ability abtltty :ellrty tlvla lwv{ } (Level 1 (Level 1) >*ev..el 2::......, t yet 2.
Mtddle feel Middle Relt #õt~s~r;F i _ 3 q <R u High Reli- High ReJi-6 ` ability ability tlits'k 2. x:ffiil ability ability Level 2a) (L:evel2a ey t ~3 L r '$h Level1 Level1 Table 3, Bit reliabilities for 64-QAM according to signal constellations shown in Figure 4.
Moreover, Table 4 provides some examples how to combine the constellations for the transmissions 1 to 6 (using 6 different mappings).
Transmission Scheme 1 (with Scheme 2 (with Scheme 3 (with Scheme 4 (with No. Constellations) Constellations) Constellations) Constellations) Table 4. Examples for Constellation Rearrangement strategies for 64-QAM (using mappings) with signal constellations according to Figure 4 and bit reliabilities according to Table 3.
Two algorithms are given which describe schemes using 3 or 6 mappings overall.
The approach using 3 mappings results in less system complexity, however has some performance degradation with respect to the approach using 6 mappings.
The mapping for i- and q-bits can be done independently and, hence, in the following the mapping for the i-bits only is described. The algorithms for the q-bits work analog.
64-QAM Algorithms A. Using 3 Mappings 1. Step (1. Transmission) 1. Step (1. Transmission) Choose Level 1 for i, Choose Level 2 for 12 (free choice if 2a or 2b) Level 3 for i3 - free choice if 3a or 3b 1. Mapping defined 2. Step (2. Transmission) Options:
(a) Choose Level I for i2 Choose Level 2 for 6 (free choice if 2a or 2b) = Level 3 for i, - free choice if 3a or 3b (b) Choose Level I for i3 Choose Level 2 for it (free choice if 2a or 2b) Level 3 for i2 - free choice if 3a or 3b = 2. Mapping defined 3. Step (3. Transmission) if (a) in 2. Step Choose Level I for 13 Choose Level 2 for ii (free choice if 2a or 2b) Level 3 for i2 - free choice if 3a or 3b if (b) in 2. Step Choose Level 1 for i2 Choose Level 2 for i3 (free choice if 2a or 2b) Level 3 for ii - free choice if 3a or 3b 3. Mapping defined WO 02/067491 PCTIEPO1l01982 4. Step (4., 7., 10, ... Transmission) Choose one out of 3 defined mappings 5. Step (5., 8., 11, ... Transmission) Choose one out of 3 defined mappings except the mapping used in previous trans-mission 6. Step (6., 9., 12, ... Transmission) Choose one out of 3 defined mappings except the mapping used in last 2 transmis-sions 7. Step Go to 4. Step 6. Using 6 Mappings 1. Step (1. Transmission) Choose Level I for i, Choose Level 2 for i2 (free choice if 2a or 2b) Level 3 for 13 - free choice if 3a or 3b 1. Mapping defined 2. Step (2. Transmission) Options:
(a) Choose Level I for 12 Choose Level 2 for 13 (free choice if 2a or 2b) Level 3 for i, - free choice if 3a or 3b (b) Choose Level I for i3 Choose Level 2 for i, (free choice if 2a or 2b) = Level 3 for i2 - free choice if 3a or 3b = 2. Mapping defined 3. Step (3. Transmission) if (a) in 2. Step Choose Level I for i3 Choose Level 2 for i, (free choice if 2a or 2b) Level 3 for i2 - free choice if 3a or 3b if (b) in 2. Step Choose Level I for i2 WO 02/067491 /l PCT/EP01/01982 Choose Level 2 for i3 (free choice if 2a or 2b) = Level 3 for i, - free choice if 3a or 3b 3. Mapping defined 4. Step (4. Transmission) Choose Level I for one bit out of ii, i2 or i3 Choose Level 2 for one out of two remaining bits with following restrictions (al) if in one of the previous transmission 2a was used for this bit then use 2b (a2) if in one of the previous transmission 2b was used for this bit then use 2a Level 3 for remaining bit with following restrictions (b1) if in one of the previous transmission 3a was used for this bit then use 3b (b2) if in one of the previous transmission 3b was used for this bit then use 3a 4. Mapping defined 5. Step (5. Transmission) Choose Level 1 for one out of two bits not having Level I in 4. Step Choose Level 2 for one out of two bits not having Level 2 in 4. Step with following restrictions (al) if in one of the previous transmission 2a was used for this bit then use 2b (a2) if in one of the previous transmission 2b was used for this bit then use 2a Level 3 for remaining bit with following restrictions (b1) if in one of the previous transmission 3a was used for this bit then use 3b (b2) if in one of the previous transmission 3b was used for this bit then use 3a 5. Mapping defined 6. Step (6. Transmission) Choose Level I for bit not having Level I in 4. Step and 5. Step Choose Level 2 for bit not having Level 2 in 4. Step and 5. Step with following restric-tions (al) if in one of the previous transmission 2a was used for this bit then use 2b (a2) if in one of the previous transmission 2b was used for this bit then use 2a Level 3 for remaining bit with following restrictions (b1) if in one of the previous transmission 3a was used for this bit then use 3b (b2) if in one of the previous transmission 3b was used for this bit then use 3a 6. Mapping defined 7. Step (7., 13., 19., ... Transmission) Choose one out of 6 defined mappings 8. Step (8., 14., 20., ... Transmission) Choose one out of 6 defined mappings except (a) the mapping used in 7. Step (previous transmission) (b) the mapping giving Level I reliability to the same bit as in previous trans-mission 9. Step (9., 15., 21., ... Transmission) Choose one out of 6 defined mappings with giving Level 1 reliability to the bit not having Level I in last 2 transmissions
Level I (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 for the q-bits. Here, there is no difference whether the ones are mapped to the positive or to the negative half space.
Level 2 (Medium Reliability, 2 bits): Ones (zeros) are mapped to 4 inner and 2x2 outer columns for the i-bits or to 4 inner and 2x2 outer rows for the q-bits.
Since there is a difference for the LLR depending on the mapping to the inner or outer col-umn/row Level 2 is further classified:
Level 2a: Mapping of in to 4 inner columns and qõ to 4 inner rows respectively.
Level 2b: Inverted mapping of 2a: in to outer columns and qn to outer rows respec-tively Level 3 (Low Reliability, 2 bits): Ones (zeros) are mapped to columns 1-4-5-for the i-bits or to rows 1-4-5-8/2-3-6-7 for the q-bits. Since there is a difference for the LLR depending on the mapping to columns/rows 1-4-5-8 or 2-3-6-7 Level 3 is further classified:
Level 3a: Mapping of in to columns 2-3-6-7 and qõ to rows 2-3-6-7 respectively Level 3b: Inverted mapping of 2a: in to columns 1-4-5-8 and qõ to rows 1-4-5-8 re-spectively To ensure an optimal averaging process over the transmissions for all bits the levels of reliabilities have to be altered by changing the signal constellations according to the algorithms given in the following section.
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:
ilgli2g2 i3q3 = bit-mapping all retransmissions: ilq,i2g2 i3g3.
Analog to 16-QAM for the actual system implementation there are a number of pos-sible signal constellations to achieve the averaging process over the retransmissions.
Some examples for possible constellations are shown in Figure 4. The resulting bit reliabilities according to Figure 4 are given in Table 3.
Constel- bit it bit qj bit i2 bit q2 bit i3 bit q3 lation .,; ?..
g h Reli Hi gh Reli- Midd(1-:= >IVi':I.:Fll:... ,, .tsFZ ::e; t?.:` 1 Hi 1 ability ability abth y ability ~\.st Ãlit ~f:, % :. >%%
eyeJ 2b ( vel b . i<. ve# >;" ' .. ;
(Level 1 Level l I-A
eti High Reli- High Reli Mi d e F tl~ Mtd' R Ita txi~ nr Re:: ~vl l !?1' ,,.
2 liai ability ability k :.af~h:=~):.'.: ==l~tlÃIr..~.f>;
=ti _ (! ~Yef>ka I ave~ 3J' {; (Level 1 Level 1 Lvel. >' t12i' >:
M ddle; eli Middle Refs ow F sli% %':t tt l High Reli- High Reli-3 a qty abilit fkltf .Ã''' <:. '"lye õ-< ability ability Lev 1 ......., rel2 .. 2 t. i+ t~ x el=f Level 1 Level 1 High Reli- High Reli- Mtddle Reli` tlliCde Rtl' Atat {<F'~l#5' -' i . tk abilit :.:: ; lltty t(ft f, ability 4 abtltty ;. ; ~=~SS=f ff:pS.>;: {,: SS'=iiif$`.: .>.Y,f.a j +yy : t:r:~~yn Level 1 Level 1 ... 'It\ .
ll- '` :..=.}:...,.,1. ,:,,:; { <>llf' High Reli- High Re ;[1 dfe f,~li\ tk 0W 11111 .
}
lty;bt!Ãtt ability ability abtltty :ellrty tlvla lwv{ } (Level 1 (Level 1) >*ev..el 2::......, t yet 2.
Mtddle feel Middle Relt #õt~s~r;F i _ 3 q <R u High Reli- High ReJi-6 ` ability ability tlits'k 2. x:ffiil ability ability Level 2a) (L:evel2a ey t ~3 L r '$h Level1 Level1 Table 3, Bit reliabilities for 64-QAM according to signal constellations shown in Figure 4.
Moreover, Table 4 provides some examples how to combine the constellations for the transmissions 1 to 6 (using 6 different mappings).
Transmission Scheme 1 (with Scheme 2 (with Scheme 3 (with Scheme 4 (with No. Constellations) Constellations) Constellations) Constellations) Table 4. Examples for Constellation Rearrangement strategies for 64-QAM (using mappings) with signal constellations according to Figure 4 and bit reliabilities according to Table 3.
Two algorithms are given which describe schemes using 3 or 6 mappings overall.
The approach using 3 mappings results in less system complexity, however has some performance degradation with respect to the approach using 6 mappings.
The mapping for i- and q-bits can be done independently and, hence, in the following the mapping for the i-bits only is described. The algorithms for the q-bits work analog.
64-QAM Algorithms A. Using 3 Mappings 1. Step (1. Transmission) 1. Step (1. Transmission) Choose Level 1 for i, Choose Level 2 for 12 (free choice if 2a or 2b) Level 3 for i3 - free choice if 3a or 3b 1. Mapping defined 2. Step (2. Transmission) Options:
(a) Choose Level I for i2 Choose Level 2 for 6 (free choice if 2a or 2b) = Level 3 for i, - free choice if 3a or 3b (b) Choose Level I for i3 Choose Level 2 for it (free choice if 2a or 2b) Level 3 for i2 - free choice if 3a or 3b = 2. Mapping defined 3. Step (3. Transmission) if (a) in 2. Step Choose Level I for 13 Choose Level 2 for ii (free choice if 2a or 2b) Level 3 for i2 - free choice if 3a or 3b if (b) in 2. Step Choose Level 1 for i2 Choose Level 2 for i3 (free choice if 2a or 2b) Level 3 for ii - free choice if 3a or 3b 3. Mapping defined WO 02/067491 PCTIEPO1l01982 4. Step (4., 7., 10, ... Transmission) Choose one out of 3 defined mappings 5. Step (5., 8., 11, ... Transmission) Choose one out of 3 defined mappings except the mapping used in previous trans-mission 6. Step (6., 9., 12, ... Transmission) Choose one out of 3 defined mappings except the mapping used in last 2 transmis-sions 7. Step Go to 4. Step 6. Using 6 Mappings 1. Step (1. Transmission) Choose Level I for i, Choose Level 2 for i2 (free choice if 2a or 2b) Level 3 for 13 - free choice if 3a or 3b 1. Mapping defined 2. Step (2. Transmission) Options:
(a) Choose Level I for 12 Choose Level 2 for 13 (free choice if 2a or 2b) Level 3 for i, - free choice if 3a or 3b (b) Choose Level I for i3 Choose Level 2 for i, (free choice if 2a or 2b) = Level 3 for i2 - free choice if 3a or 3b = 2. Mapping defined 3. Step (3. Transmission) if (a) in 2. Step Choose Level I for i3 Choose Level 2 for i, (free choice if 2a or 2b) Level 3 for i2 - free choice if 3a or 3b if (b) in 2. Step Choose Level I for i2 WO 02/067491 /l PCT/EP01/01982 Choose Level 2 for i3 (free choice if 2a or 2b) = Level 3 for i, - free choice if 3a or 3b 3. Mapping defined 4. Step (4. Transmission) Choose Level I for one bit out of ii, i2 or i3 Choose Level 2 for one out of two remaining bits with following restrictions (al) if in one of the previous transmission 2a was used for this bit then use 2b (a2) if in one of the previous transmission 2b was used for this bit then use 2a Level 3 for remaining bit with following restrictions (b1) if in one of the previous transmission 3a was used for this bit then use 3b (b2) if in one of the previous transmission 3b was used for this bit then use 3a 4. Mapping defined 5. Step (5. Transmission) Choose Level 1 for one out of two bits not having Level I in 4. Step Choose Level 2 for one out of two bits not having Level 2 in 4. Step with following restrictions (al) if in one of the previous transmission 2a was used for this bit then use 2b (a2) if in one of the previous transmission 2b was used for this bit then use 2a Level 3 for remaining bit with following restrictions (b1) if in one of the previous transmission 3a was used for this bit then use 3b (b2) if in one of the previous transmission 3b was used for this bit then use 3a 5. Mapping defined 6. Step (6. Transmission) Choose Level I for bit not having Level I in 4. Step and 5. Step Choose Level 2 for bit not having Level 2 in 4. Step and 5. Step with following restric-tions (al) if in one of the previous transmission 2a was used for this bit then use 2b (a2) if in one of the previous transmission 2b was used for this bit then use 2a Level 3 for remaining bit with following restrictions (b1) if in one of the previous transmission 3a was used for this bit then use 3b (b2) if in one of the previous transmission 3b was used for this bit then use 3a 6. Mapping defined 7. Step (7., 13., 19., ... Transmission) Choose one out of 6 defined mappings 8. Step (8., 14., 20., ... Transmission) Choose one out of 6 defined mappings except (a) the mapping used in 7. Step (previous transmission) (b) the mapping giving Level I reliability to the same bit as in previous trans-mission 9. Step (9., 15., 21., ... Transmission) Choose one out of 6 defined mappings with giving Level 1 reliability to the bit not having Level I in last 2 transmissions
10. Step (10., 16., 22., ... Transmission) Choose one out of 3 remaining mappings not used in last 3 transmissions
11. Step (11., 17., 23., ... Transmission) Choose one out of 2 remaining mappings not used in last 4 transmissions
12. Step (12., 18., 24., ... Transmission) Choose remaining mapping not used in last 5 transmissions
13. Step Go to 7. Step Figure 5 shows an exemplary embodiment of a communication system to which the present invention can be applied. More specifically, the communication system com-prises a transmitter 10 and a receiver 20 which communicate through a channel which can either be wire-bound or wireless, i.e. an air inteeace. From a data source 11, data packets are supplied to a FEC encoder 12, where redundancy bits are added to correct errors. The n bits output from the FEC decoder are subsequently supplied to a mapping unit 13 acting as a modulator to output symbols formed ac-cording to the applied modulation scheme stored as a constellation pattern in a table 15. Upon transmission over the channel 30, the receiver 20 checks the received data packets, for example, by means of a cyclic redundancy check (CRC) for correctness.
If the received data packets are erroneous, the same are stored in a temporary buffer 22 for subsequent soft combining with the retransmitted data packets.
A retransmission is launched by an automatic repeat request issued by an error de-tector (not shown) with the result that an identical data packet is transmitted from the transmitter 10. In the combining unit 21, the previously received erroneous data packets are soft-combined with the retransmitted data packets. The combining unit 21 also acts as a demodulator and the same signal constellation pattern stored in the table 15 is used to demodulate the symbol which was used during the modulation of that symbol.
As illustrated in figure 6, the table 15 stores a plurality of signal constellation patterns which are selected for the individual (re)-transmissions according to a predetermined scheme. The scheme, i.e. the sequence of signal constellation patterns used for ' modulating/demodulating are either pre-stored in the transmitter and the receiver or are signaled by transmitter to the receiver prior to usage.
As mentioned before, the method underlying the invention rearranges the signal con-stellation patterns for the individual (re)-transmissions according to a predetermined scheme, such that the mean bit reliabilities are averaged out. Hence, the perform-ance of the FEC decoder 23 is significantly improved, resulting in a low bit error rate (BER) output from the decoder.
If the received data packets are erroneous, the same are stored in a temporary buffer 22 for subsequent soft combining with the retransmitted data packets.
A retransmission is launched by an automatic repeat request issued by an error de-tector (not shown) with the result that an identical data packet is transmitted from the transmitter 10. In the combining unit 21, the previously received erroneous data packets are soft-combined with the retransmitted data packets. The combining unit 21 also acts as a demodulator and the same signal constellation pattern stored in the table 15 is used to demodulate the symbol which was used during the modulation of that symbol.
As illustrated in figure 6, the table 15 stores a plurality of signal constellation patterns which are selected for the individual (re)-transmissions according to a predetermined scheme. The scheme, i.e. the sequence of signal constellation patterns used for ' modulating/demodulating are either pre-stored in the transmitter and the receiver or are signaled by transmitter to the receiver prior to usage.
As mentioned before, the method underlying the invention rearranges the signal con-stellation patterns for the individual (re)-transmissions according to a predetermined scheme, such that the mean bit reliabilities are averaged out. Hence, the perform-ance of the FEC decoder 23 is significantly improved, resulting in a low bit error rate (BER) output from the decoder.
Claims (8)
1. A transmission apparatus for transmitting data comprising:
a table that stores four mappings for a 16QAM modulation scheme, a selection section that selects a first mapping and a second mapping of said four mappings, a modulation section that modulates data using said selected first mapping and said selected second mapping, a transmission section that transmits the data modulated using said selected first mapping in a first transmission, and retransmits the data modulated using said selected second mapping of the mappings in a retransmission, wherein:
one of said four mappings is represented as a bit sequence (i1q1i2q2), and the other three mappings are produced, with respect to the bit sequence (i1q1i2q2), by: (1) swapping i1, and q1 with i2 and q2 and inverting logical values of i1 and q1, (2) swapping ii, and q1 with i2 and q2 and (3) inverting logical values of i2 and q2.
a table that stores four mappings for a 16QAM modulation scheme, a selection section that selects a first mapping and a second mapping of said four mappings, a modulation section that modulates data using said selected first mapping and said selected second mapping, a transmission section that transmits the data modulated using said selected first mapping in a first transmission, and retransmits the data modulated using said selected second mapping of the mappings in a retransmission, wherein:
one of said four mappings is represented as a bit sequence (i1q1i2q2), and the other three mappings are produced, with respect to the bit sequence (i1q1i2q2), by: (1) swapping i1, and q1 with i2 and q2 and inverting logical values of i1 and q1, (2) swapping ii, and q1 with i2 and q2 and (3) inverting logical values of i2 and q2.
2. A transmission apparatus according to claim 1, wherein said transmission section transmits data using a HARQ process.
3. A transmission apparatus according to claim 1, wherein said transmission section transmits information indicating the mapping used for transmitting data to a receiving apparatus.
4. A transmission apparatus according to claim 1, wherein the one of the mappings is used in accordance with a predetermined sequence.
5. A transmission method for transmitting data comprising:
selecting a first mapping and a second mapping of four mappings for a 16 QAM modulation scheme stored in a table, modulating data using said selected first mapping and said selected second mapping for a QAM modulation scheme, transmitting the data modulated using said selected first mapping in a first transmission, and retransmitting the data modulated using said selected second mapping in a retransmission, wherein:
one of said four mappings is represented as a bit sequence (i1q1i2q2), and the other three mappings are produced, with respect to the bit sequence (i1q1i2q2), by: (1) swapping i1 and q1 with i2 and q2 and inverting logical values of i1, and q1, (2) swapping i1 and q1 with i2 and q2 and (3) inverting logical values of i2 and q2.
selecting a first mapping and a second mapping of four mappings for a 16 QAM modulation scheme stored in a table, modulating data using said selected first mapping and said selected second mapping for a QAM modulation scheme, transmitting the data modulated using said selected first mapping in a first transmission, and retransmitting the data modulated using said selected second mapping in a retransmission, wherein:
one of said four mappings is represented as a bit sequence (i1q1i2q2), and the other three mappings are produced, with respect to the bit sequence (i1q1i2q2), by: (1) swapping i1 and q1 with i2 and q2 and inverting logical values of i1, and q1, (2) swapping i1 and q1 with i2 and q2 and (3) inverting logical values of i2 and q2.
6. A transmission method according to claim 5, wherein said retransmission uses a HARQ process.
7. A transmission method according to claim 5 further comprising transmitting information indicating the mapping used for transmitting data to a receiving apparatus.
8. A transmission method according to claim 5, wherein one of the mappings is used in accordance with a predetermined sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CA2488267A CA2488267C (en) | 2001-02-21 | 2001-02-21 | Hybrid arq method with signal constellation rearrangement |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CA2488267A CA2488267C (en) | 2001-02-21 | 2001-02-21 | Hybrid arq method with signal constellation rearrangement |
| CA002406234A CA2406234C (en) | 2001-02-21 | 2001-02-21 | Hybrid arq method with signal constellation rearrangement |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002406234A Division CA2406234C (en) | 2001-02-21 | 2001-02-21 | Hybrid arq method with signal constellation rearrangement |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2488267A1 CA2488267A1 (en) | 2002-08-29 |
| CA2488267C true CA2488267C (en) | 2011-03-29 |
Family
ID=34120656
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA2488267A Expired - Lifetime CA2488267C (en) | 2001-02-21 | 2001-02-21 | Hybrid arq method with signal constellation rearrangement |
Country Status (1)
| Country | Link |
|---|---|
| CA (1) | CA2488267C (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100420177C (en) * | 2005-06-27 | 2008-09-17 | 华为技术有限公司 | Mixed automatic retransmitting method |
-
2001
- 2001-02-21 CA CA2488267A patent/CA2488267C/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| CA2488267A1 (en) | 2002-08-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1293059B1 (en) | Hybrid arq method with signal constellation rearrangement | |
| EP1313248B1 (en) | Hybrid ARQ method for packet data transmission | |
| EP1313247B1 (en) | Incremental redundancy ARQ retransmission method using bit reordering schemes | |
| US7697565B2 (en) | Data transmission apparatus and communication system using a constellation rearrangement | |
| EP1427128B9 (en) | Hybrid ARQ method with signal constellation rearrangement | |
| JP3836810B2 (en) | Data transmission device | |
| CA2488267C (en) | Hybrid arq method with signal constellation rearrangement | |
| JP4427094B2 (en) | Data transmitting apparatus, data transmitting method, data receiving apparatus, data receiving method, and data communication system | |
| CN101068138B (en) | Mixing automatic request retransmitting method using signal constellation rearrangement | |
| JP4500288B2 (en) | Data transmission device | |
| EP1760928B1 (en) | Hybrid ARQ method with mapping rearrangement of the signals constellation | |
| JP4427095B2 (en) | Data transmitting apparatus, data receiving apparatus, and data communication system | |
| JP4429378B2 (en) | Data transmitting apparatus, data receiving apparatus, and data communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKEX | Expiry |
Effective date: 20210222 |