Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
2002-11-18
2004-07-27
Ton, David (Department: 2133)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
C714S761000
Reexamination Certificate
active
06769085
ABSTRACT:
The present invention relates to a method for modifying a bit sequence in an ARQ retransmission in a communication system. Further, the invention concerns a corresponding receiver and transmitter.
1. Field 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 resend the erroneously received data packets.
2. Background Art
S. Kallel,
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 1: 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: Is 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.
Types 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
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. 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 performed, 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 decoder 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.
Combination of Soft- and Code-Combining
In case the retransmitted packets carry some symbols identical to previously transmitted 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 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.
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 i
1
q
1
i
2
q
2
, the bits mapped onto the symbols differ from each other in mean reliability in the first transmission of the packet. In more detail, bits i
1
and q
1
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 i
2
and q
2
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 i
2
, ones are mapped to outer columns, whereas zeros are mapped to inner columns. Similarly, for bit q
2
, 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 i
1
and q
1
will always have a higher mean reliability than bits i
2
and q
2
after any number of retransmissions.
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.
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 th
Golitschek Edler Von Elbwart Alexander
Seidel Eiko
Wengerter Christian
Stevens Davis Miller & Mosher LLP
Ton David
LandOfFree
Method for modifying a bit sequence in an ARQ... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for modifying a bit sequence in an ARQ..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for modifying a bit sequence in an ARQ... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3241967