Note: Descriptions are shown in the official language in which they were submitted.
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-1-
DATA TRANSMITTING/RECEIVING METHOD
IN HARQ DATA COMMUNICATION SYSTEM
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates generally to a data transmitting device and
method for a wireless communications system, and in particular, to a device
and
method for retransmitting data that has errors during transmission.
2. Description of the Related Art
For forward packet data transmission, a mobile station is assigned a
forward channel such as a dedicated channel (DCH) from a base station.
Wireless
communications systems as mentioned below include satellite systems, ISDN,
digital cellular systems, W-CDMA, UMTS, and IMT-2000. Upon receipt of the
forward packet data, the mobile station determines whether the reception is
successful and if it is, the mobile station transmits the packet data to its
higher
layer. On the other hand, if errors are detected from the packet data, the
mobile
station requests its retransmission by the HARQ (Hybrid Automatic Repeat
Request) scheme. HARQ is a retransmission scheme using both FEC (Forward
Error Correction) and ARQ (Automatic Repeat Request) for requesting
retransmission of a data packet having errors. HARQ increases transmission
throughput and improves system performance by channel coding for error
correctioin. The main channel coding methods are convolutional coding and
turbo
coding.
A HARQ system uses soft combining to increase throughput. There are
two types of soft combining: packet diversity combining and packet code
combining. These are also referred to as soft packet combining. Despite having
lower performance characteristics relative to packet code combining, paclcet
diversity combining is widely used when performance loss is low, due to its
simple implementation.
In general, it is known that there is little performance difference between
packet diversity combining and packet code combining for convolutional codes
with a low code rate. However, the difference is conspicuous for turbo codes
because iterative decoding and parallel recursive convolutional codes are
used.
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-2-
For the turbo codes, packet code combining offers a greater performance gain
than packet diversity combining.
In this case, it is difficult to transmit multiple data. "Multiple data" is
defined as data with different characteristics or service qualities in one
packet.
Wireless communications systems do not transmit multiple data. Therefore, the
existing methods have limitations in carrying out transmission and
retransmission
of multiple data. Moreover, existing systems cannot increase transmission
throughput when multiple data is retransmitted by ARQ.
SUMMARY OF THE INVENTION
It is, therefore, an object of the present invention to provide an HARQ
scheme by which to implement a system using packet code combining and
packet diversity combining selectively depending on data rates.
It is another object of the present invention to provide a method of
efficiently transmitting inultiple data in a packet.
It is a further object of the present invention to provide a method of
transmitting multiple data for a reduced transmission time in order to
increase a
transmission gain.
The foregoing and other objects can be achieved by providing a data
transmitting/receiving method in an HARQ data communication system. To
transmit a physical layer information stream having a plurality of sub-blocks,
each sub-block having an error correction code, a QoS (Quality of Service),
and a
priority if the sub-blocks has a different QoS, the encoded physical layer
information stream is divided into a plurality of slots. The slot data are
sequentially transmitted to a receiver in predetermined time intervals. If an
HARQ (Hybrid Automatic Repeat Request) message for the initial slot data is
received from the receiver, indicating that at least one of the sub-blocks in
the
initial slot data has a reception error and the other sub-blocks are good in
reception, slot data witli a sub-block having errors, repeated within the
number of
the sub-blocks, is retransmitted after transmission of initial slot data.
The failed sub-block should be transmitted at least twice, and the slot
data includes only the failed sub-block.
CA 02395215 2006-05-09
-3-
The sub-blocks are encoded using quasi-complementary turbo codes
(QCTCs). A code set is generated beforehand and the initial transmission is
performed using a predetermined code in the code set.
If at least one sub-block is retransmitted after the sub-blocks are
transmitted a predetermined number of times, the code of the retransmission-
requested sub-block is changed. The code is changed to an unused code in the
code set in a predetermined order.
The repetition times of failed sub-blocks are determined according to the
priorities of the sub-blocks.
If the number of the transmitted sub-blocks is an integer-multiple of the
number of the failed sub-blocks, the failed sub-blocks are repeated the same
number of times if the failed sub-blocks have the same priority.
If sub-blocks are transmitted at least twice and a signal is received
before the sub-blocks are transmitted at least twice, indicating that the
transmitted sub-blocks have been successfully received in the receiver, the
further transmission of the sub-blocks is discontinued and the sub-blocks for
the next physical layer information stream are transmitted.
In another aspect, there is provided a method of transmitting a physical
layer packet having a plurality of sub-blocks, each sub-block having an error
correction code, and a priority if the sub-blocks have a different QoS
(Quality
of Service), the method comprising the steps of dividing the physical layer
packet into a plurality of slots, initially one of the plurality of slots to a
receiver
and upon receipt of indication information that the receiver fails to receive
at
least one of the sub-blocks in the initially transmitted slot, repeating
within the
length of a slot permitted in retransmission, and re-transmitting the repeated
sub-block.
CA 02395215 2007-09-06
3a
According to an aspect of the present invention there is provided a method of
transmitting a physical layer packet having a plurality of sub-blocks that
have a different
QoS (Quality of Service), comprising the steps of:
encoding the physical layer packet using quasi-complementary turbo codes
(QCTCs);
dividing the encoded'physical layer packet into a plurality of slots;
transmitting one of the plurality of slots to a receiver; upon receipt of
indication
information that the receiver fails to receive at least one of the sub-blocks
in the
transmitted slot, repeating the at least one sub-block that the receiver
failed to receive
within a number of the sub-blocks constituting the physical layer packet, and
re-transmitting the at least one repeated sub-block,
wherein repetition times are determined based on the different QoS of the
plurality of
sub-blocks.
BRIEF DESCRIPTION OF THE DRAWINGS
The above and other objects, features and advantages of the present invention
will
become more apparent from the following detailed description when taken in
conjunction
with the accompanying drawing in which:
FIG I is a graph showing the performance difference between packet code
combining and packet diversity combining in a packet data system using turbo
codes;
FIG 2 is a block diagram of a turbo encoder according to an embodiment of the
present invention;
FICz 3 illustrates an embodiment of packet transmission by HARQ in the case of
a
Physical Layer Packet (PLP) occupying one slot according to the present
invention;
FIG. 4 illustrates another embodiment of packet transmission by HARQ in the
case of a PLP occupying two slots according to the present invention;
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-4-
FIG. 5 illustrates data transmission in forward and reverse slots
according to ACK/NACK messages in connection with FIG. 3;
FIG. 6 illustrates data transmission in forward and reverse slots
according to ACK/NACK messages in connection with FIG. 4;
FIG. 7 is a flowchart illustrating an embodiment of a data retransmission
procedure when a multiple data service is provided according to the present
invention;
FIG. 8 is a view illustrating a data flow between a transmitter and a
receiver for multiple data retransmission according to the present invention;
and
FIG. 9 illustrates repeated data for data retransmission according to the
present invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
Preferred embodiments of the present invention will be described
hereinbelow with reference to the accompanying drawings. In the following
description, well-known functions or constructions are not described in detail
since they would obscure the invention in unnecessary detail.
1. Packet Code Combining
In general, a system using a retransmission scheme (e.g., HARQ) uses
the packet code combining scheme to improve transmission throughput. A
transmitter transmits a different code with a code rate R at each packet
transmission. If an error is detected in the received packet, a receiver
requests
retransmission and performs soft coinbining between the original packet and a
retransmitted packet. The retransmitted packet may have a different code from
that of the previous packet. The packet code combining scheme is a process of
combining received N packets with a code rate R to a code with an effective
code
rate of R/N prior to decoding, to thereby obtain a coding gain.
With regard to the packet diversity combining scheme, on the other hand,
the transmitter transmits the same code with a code rate R at each packet
transmission. If an error is detected in the received packet, the receiver
requests a
retransmission and performs soft combining between the original packet and the
retransmitted packet. The retransmitted packet has an identical code to that
in the
previous packet. In this sense, the packet diversity combining scheme can be
considered symbol averaging on a random channel. The packet diversity
combining scheme reduces noise power by averaging the soft outputs of input
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-5-
symbols and achieves a diversity gain as offered by a multipath channel
because
the same code is repeatedly transmitted on a fading channel. However, the
packet
diversity combining scheme does not provide such an additional coding gain as
obtained accordiilg to a code structure in the packet code combining scheme.
Due to implementation simplicity, most packet communication systems
have used the packet diversity combining scheme, which is under study for
application to the synchronous IS-2000 system and the asynchronous UMTS
(Universal Mobile Telecommunication System) system. The reason is that
existing packet communication systems have used convolutional codes, and even
packet code combining does not offer a great gain when convolutional codes
with
a low data rate are used. If a system with R=1/3 supports retransmission,
there is
not a wide difference in performance between the packet code combining scheme
and the packet diversity combining scheme. Thus, the packet diversity
combining
scheme is selected considering implementation simplicity.
However, the use of turbo codes as FEC codes requires a different packet
combining mechanism because the turbo codes are designed to perform very
close to the "Shannon Channel Capacity Limit", and their performance varies
obviously with the coding rates unlilce convolutional codes. Therefore, it can
be
concluded that packet code combining is feasible for a packet communication
system using turbo codes in a retransmission scheme to achieve the goal of
optimum performance.
Accordingly, the present invention proposes a method of designing codes
for optimal packet code combining, a system that selectively employs a packet
code combining scheme and a packet diversity combining scheme according to
the data rates, and an HARQ protocol by which this system is operated.
First, the operation of the system that selectively uses the packet code
combining scheme and the packet diversity scheme combining according to the
data rates will be described.
In a system using R=1/5 turbo codes, for example, packet code
combining applies until the overall code rate of codes produced by soft-
combining of retransmitted packets reaches 1/5. For the subsequent
retransmitted
packets, packet diversity combining and then packet code combining are
performed. If the first packet is transmitted at a data rate of 1/3, the
required
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-6-
redundancy symbols are provided at a retransmission request to make the
overall
code rate 1/5. Thus, when a receiver receives both packets, the overall code
rate
becomes 1/5. Each of the following packets is repeated prior to transmission
and
the receiver performs packet diversity combining and then packet code
combining on the retransmitted packets at the data rate 1/5.
It is generally lalown that there is not a wide performance difference
between the packet diversity coinbining scheme and the packet code combining
scheme for convolutional codes with a low code rate. However, there is an
obvious performance difference between these schemes for turbo codes, unlike
convolutional codes. The Packet code combining offers a greater performance
gain for turbo codes than packet diversity combining. In view of the above-
described nature of the turbo codes, throughput can be improved markedly by
HARQ Type II/III schemes using turbo codes.
FIG. 1 is a graph showing the performance difference between packet
code combining and packet diversity combining in the case of turbo codes. As
shown in FIG. 1, a turbo code with a low data rate of 1/6 exhibits a greater
performance gain than a turbo code with a high code rate of 1/3 with the same
symbol energy Es and obtains a performance gain of 3dB from packet code
combining. Consequently, generation of R=1/6 turbo codes by packet code
combining of R=1/3 sub-codes produces a gain that turbo codes with a code rate
lower than 1/3 exhibits and a gain that code combining of different codes
offers,
contemporaneously.
More specifically, for the same code symbol energy Es and the same
given code rate, turbo codes provide performance close to the "Shannon Channel
Capacity Limit" according to the code rates only if iteration decoding is
fully
implemented, unlike convolutional codes. It is known that a turbo code with a
low code rate offers a greater performance gain than a turbo code with a high
code rate with the same code symbol energy Es. For example, when R=1/3 is
reduced to R=1/6, the performance difference can be estimated by analyzing a
change in the "Shannon Channel Capacity Limit". The reason for assuming the
same symbol energy irrespective of R=1/3 or 1/6 for the curves of FIG. 1 is
that
the same symbol energy Es is used for each retransmission in an HARQ system,
as compared to a conventional analysis of the performance of turbo codes by
checking the decrease of symbol energy caused by reduced code rates.
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-7-
If an R=1/3 code is repeated once and the two codes are packet-diversity-
combined on an AWGN (Additive White Gaussian Noise) channel, a maximum
gain of 3dB is obtained in terms of a symbol energy-to-noise ratio (Es/No).
The
same is the case with an R=1/6 code. Thus, a performance curve for the R=1/3
turbo code shifts to the left in parallel by a +3dB scale due to a packet
diversity
combining gain, and a performance curve for the R=1/6 turbo code also shifts
to
the left in parallel by a +3dB scale when the same symbol energy is given.
Here,
the performance curves are derived with respect to the energy-to-noise ratio
(Eb/No) which is measured to compare code performances according to the code
rates. As a consequence, the difference between the turbo code performance
curves is equivalent to the performance difference between packet diversity
combining and packet code combining. The performance difference according to
the code rates can be estimated from the "Shannon Channel Capacity Limit" and
a minimum performance difference can be obtained using a minimum required
signal-to-noise ratio (SNR).
2. Minimum Required Eb/No for Code Rates
In a system using turbo codes with a code rate R and a very large
encoder block size L, a minimum Eb/No required to provide an error-free
channel is expressed as
EblNo ) (4R -1)/2R
.....(1)
According to the above equation, the minimum required Eb/No in
AWGN at each code rate for the turbo codes is listed in Table 1 below. In
Table 1,
a typical Eb/No indicates a required Eb/No for a bit error rate (BER) below
0.00001 when the encoding block size L of the turbo codes is 1024.
(Table 1)
Code rates Required Eb/No (dB) Typical Eb/No (dB) for
BER=10-5
3/4 0.86 3.310
2/3 0.57 2.625
1/2 0.00 1.682
3/8 -0.414 1.202
1/3 -0.55 0.975
1/4 -0.82 0.756
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-8-
1/5 -0.975 0.626
1/6 -1.084 0.525
0 -1.62 NA
As shown in Table 1, the required Eb/No are 0.86, 0.57, 0.0, -0.414,
-0.55, -0.82, -0.975, and -1.084dB respectively, for the code rates of 3/4,
2/3,
1/2, 3/8, 1/3, 1/4, 1/5, and 1/6. A performance difference of at least 0.53dB
exists between a system using an R=1/3 code and a system using an R=1/6 code.
This is a minimum performance difference based on the "Shannon Channel
Capacity Limit". In addition, when considering implementation of a real
decoder
and system environment, the difference becomes wider. During a simulation, an
approximately 1.12dB performance difference was observed between a system
using packet code combining for R=2/3 codes and a system using packet
diversity combining for the R=2/3 codes.
Table 2 shows the performance difference between packet code
combining and packet diversity combining after one retransmission in a system
with a sub-code code rate of 2/3. As shown in Table 2, a minimum performance
difference is 1.12dB and the packet code combining scheme produces a higher
performance gain in the system using turbo codes.
(Table 2)
Items Packet combining Code combining
Mother code rate R,,, 1/3 1/3
(X, Y0, Y'O) in FIG. 2 (X, Y0, Y'O) in FIG. 2
Block size (L) 496 496
Maximum number of 8 8
iterations
Number of transmissions 2 2
Actual Tx code rate Re 2/3 (by puncturing) 2/3 (by puncturing)
for each transmission See section 2 See section 3
Redundancy selection Identical pattern for all Different pattern for all
transmissions. transmissions.
Soft combining Packet diversity Packet code combining
combining
Gain through Symbol repetition gain Coding gain for low rate
retransmissions codes
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-9-
Minimuin required +0.57 (dB) R-2/3 +0.57 (dB)
Eb/No in Table 1 R-2/6 -0.55 (dB)
Required Eb/No at 2nd +0.57-3.0 (dB) -0.55-3.0 (dB)
retransmissions
Relative performance 0 1.12 (=0.57+0.55) dB
gain
Simulated relative gain 0 2.5 (dB)
(@ BER = 10-5)
As described above, the packet code combining scheme shows excellent
performance in the turbo code-using retransmission system. Therefore, the
present invention provides a sub-code generating method for optimal packet
code
combining in a retransmission system using turbo codes. Generation of sub-
codes
for packet code combining according to a predetermined rule produces the
aforementioned code combining gain and maximizes the performance of a
system requesting sub-codes of the same size for each retransmission.
FIG. 2 is a block diagram of a sub-code generating apparatus using turbo
codes according to an embodiment of the present invention. As shown in FIG. 2,
the sub-code generating apparatus includes a turbo encoder 200, a sub-code
generator 204, and a controller 205.
First, with regard to the turbo encoder, a first component encoder (or a
first constituent encoder) 201 encodes an input information bit stream and
outputs first code symbols, i.e., information symbols X and first parity
symbols
Y0 and Yl. An interleaver 202 interleaves the input information bit stream
according to a predetermined rule. A second component encoder (or a second
constituent encoder) 203 encodes the interleaved information bit stream and
outputs second code symbols, i.e., information symbols X' and second parity
symbols Y'O and Y'l. Thus, the output symbols of the turbo encoder are the
first
and second code symbols. Since the information symbols X' generated from the
second component encoder 203 are not transmitted in reality, the code rate of
the
turbo encoder is 1/5.
The sub-code generator 204 generates sub-codes from the first and
second code symbols received from the first and second component encoders 201
and 203 by puncturing and repetition under the control of the controller 205.
The
controller 205 stores generated puncturing (and repetition) matrixes and
outputs
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-10-
symbol selection signals for the puncturing matrixes to the sub-code generator
204. Then, the sub-code generator 204 selects a predetei-mined number of code
symbols within a predetermined puncturing range according to the symbol
selection signals.
The reference characters as used here, X, Y0, Y1, Y'O, and Y'l are
defined as follows.
X': turbo interleaved systematic code symbol or information symbols
X: systematic code symbol or information symbol
Y0: redundancy symbol from the upper component encoder of the turbo
encoder
Y1: redundancy symbol from the upper component encoder of the turbo
encoder
Y'O: redundancy symbol from the lower conlponent encoder of the turbo
encoder
Y' 1: redundancy symbol from the lower component encoder of the turbo
encoder
Hereinbelow, ENC 1(referred to as first code symbols) indicate the
information symbols X and the first parity symbols Y0 and Y1 output from the
first component encoder 201, and ENC2 (referred to as second code symbols)
indicate the second parity symbols Y'O and Y' 1 output from the second
component encoder 203.
3. Redundancy Selection (Quasi-Complementary Code Set)
The sub-codes are lcinds of complementary codes, although they are not
in a strict sense of the term because repeated symbols exist and each sub-code
exhibits a different characteristic. In view of the sub-codes being produced
from
turbo codes, they will be called quasi-complementary turbo codes (QCTCs). An
HARQ system employs the following retransmission scheme using QCTCs.
The HARQ system is a major example using packet code combining.
Packet code combining is available to the present HARQ systems, HARQ Type I,
Type II, and Type III. In these systems, a retransmission technique can be
implemented using QCTCs. If a transport unit (TU) is defined as an information
bit block being a basic unit for packet transmission, one sub-code C; is
selected
for each TU transmission in the hybrid systems.
A retransmission unit and an initial transmission TU can be the same or
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-11-
different in size. For every transmission, the following QCTC set is used.
From a QCTC Cq having a code set size S, a mother code C can be
reconstructed, or a new code Cq with a lower code rate than the mother code C
can be generated by combining (or code-combining) sub-codes C; (i = 0, 1,
2, ...,S-1). The mother code has a minimum code rate available in the encoder.
Then, the QCTC is defined as
Original code C with code rate R=Rm or code C with code rate R<Rm
s-i
=uCi
i-O
.....(2)
where S is the number of sub-codes with a code rate of Ri and Rm is the mother
code rate.
The operation of a system transmitting TUs of the same size for an initial
transmission and each retransmission using a QCTC will be described. Needless
to say, the transmission scheme using different TUs is also supported in the
present invention. Here, S is 4 and R is 1/5.
(Step 1) Transmission is performed on a TU basis and a sub-code C; of
the QCTC is transmitted at the initial transmission and each retransmission.
(Step 2) When the overall code rate of codes produced by soft combining
of the initially transmitted and retransmitted packets is greater than 1/5,
each sub-
code C; of the QCTC is transmitted in the order of Co, Ci, C2, ..., CS-1 at
each
retransmission request. This is packet code combining.
(Step 3) When the overall code rate of codes produced by soft combining
of the initially transmitted and retransmitted packets is less than or equal
to 1/5,
each sub-code C; of the QCTC is repeatedly transmitted in the order of Co, C1,
Ca, ..., CS-1 at each retransmission request. This is packet diversity
combining.
(Step 4) The QCTC set size can be an arbitrary value, determined by
Rmax and Rmin. For R=1/5 and a sub-code code rate of 2/3 for retransmission,
up to four sub-codes can be used.
Table 3 below lists QCTC sets for forward traffic channel packet data
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-12-
rates that are expected to be available in the present IS-2000 1XEVDV system.
Here, a mother code rate R=1/5 and a sub-code code rate R=2/3, 1/3, or 1/6.
(Table 3)
Set size S Code set Sub-code rate set Data rates
1 {Co} Co: Ro=1/6 307.2kbps
153.6kbps
76.8kbps
38.4kbps
19.2kbps
2 {Co, C1} Co: Ro=1/3 1228.8kbps
C1: R1=1/3 921.6kbps
614.4kbps
307.2kbps
4 {Co, C1, C2, C3} Co: Ro=2/3 2457.6kbps
C1: R1=2/3 1843.2kbps
C2: R2=2/3 1228.8kbps
C3: R3=2/3
As seen from Table 3, for a sub-code code rate of 1/6 less than the
mother code rate 1/5, the same code Co is used at each transmission. For a sub-
code code rate of 1/3, greater than the mother code rate 1/5, a different code
C
and C1 is used at each transmission. In this case, the code set size S is 2.
For a
sub-code code rate of 2/3, greater than the mother code rate 1/5, a different
code
Co, C,, C2, C3 is used at each transmission. The code set size S is 4. When S
sub-
codes are all transmitted, the receiver can recover the mother code rate R and
obtain the maxim coding gain offered by the encoder.
4. Puncturing Matrix for Quasi-Complementary Codes
Table 4 illustrates examples of a puncturing matrix for each sub-code
code rate.
(Table 4)
Code Co C1 C2 C3
rates
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-13-
R=1/ X 2 NA NA NA
6 Y0 1
Yl = 1
Y'0 1
Y'l 1
R=1/ 1 1
3 1 1
0 0 NA NA
1 1
0 0
R=2/ 0 1 1 0 0 1 1 0
3 1 0 0 1 0 0 0 0
0 0 0 0 1 0 0 1
0 1 1 0 0 0 0 0
0 0 0 0 0 1 1 0
R=2/ 1 1 1 1 0 0 0 0 0 0 0 0 1 1 1 1
3 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 1 0 1 0 0 1 0
0 0 1 0 1 1 0 1 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0
As shown in Table 4, when a rate 1/5 turbo code is used as a mother code
and a rate 2/3 sub-code is generated with code symbols output for 4
information
bits, 20 code symbols are generated from the 4 information bits. The rate 2/3
sub-
code is generated by puncturing 14 symbols among the 20 symbols. For packet.
diversity combining of such sub-codes, Co produced from the above puncturing
matrixes is repeatedly transmitted at each retransmission request. On the
other
hand, for paclcet code combining, a different code symbol is transmitted at
each
retransmission request. After transmitting all sub-codes Co, C1a C2, C3 in the
set,
the pacleet diversity combining is executed. For HARQ Type III using packet
code combining, full code symbols of the mother code are decoded after four
transmissions occur.
Meanwhile, "1"s in the puncturing matrixes of Table 4 indicate that the
symbols at the positions are selected or transmitted and "0"s indicate that
the
symbols at the positions are punctured. A "2" indicates that the symbol at the
position occurs twice. The puncturing (and repetition) matrixes are designed
to
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-14-
satisfy the following conditions.
(Condition 1) An information symbol X is repeated in a sub-code of a
QCTC when repetition is used.
(Condition 2) If the information symbol X is repeated in a sub-code of
the QCTC using repetition, the repeating period is set to be a minimal
constant in
the QCTC having all sub-codes in combination.
(Condition 3) If puncturing is used, redundancy symbols except the
information syinbol X are punctured if possible in the sub-codes of the QCTC.
(Condition 4) If puncturing is used, redundancy symbols except the
information symbol X are uniformly punctured if possible in the sub-codes of
the
QCTC.
A puncturing and repetition matrix with R=1/6 satisfying the above
conditions will be described.
In Table 4, for R=1/6, the sequence of transmission code symbols are
given as
Co: X,X,Y0,Y1,Y' ,Y'1,X,X,Y0,Y1,Y'O,Y'1, . . .
Because six code symbols are generated for the input of one information
symbol, the code rate of the sub-code is 1/6. Concerning the puncturing and
repetition matrix with R=1/6, decoding is carried out after the symbols X that
occur twice are soft-coinbined and so the real code rate for the decoder is
1/5.
The rate 1/5 code, having the energy of the information symbol X increased,
has
an improved performance, as compared to a rate 1/5 code having a uniform
symbol energy across the symbols. In other words, the most appropriate symbol
to be repeated is an information symbol. It can be said that the puncturing
and
repetition matrix with R=1/6 shown in Table 4 is constructed in such a way
that
information symbol energy is increased through uniform repetition of the
information symbols.
For R=1/3, the sequence of transmission code symbols are given as
Co: X, Y0, Y' 0, X, Y0, Y' 0, X, Y0, Y' 0, X, Y0, Y' 0....
C1: X, Y1, Y' 1, X, Yl, Y' 1, X, Yl, Y' 1, X, Yl, Y' 1, ...
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-15-
Because three code symbols are generated for the input of one
information symbol, the code rate of the sub-code is 1/3. A different code is
transmitted at each transmission due to the use of a different puncturing
matrix.
After soft combining of Co and C1, X occurs twice and each of Y0, Y1, Y'O and
Y' 1 occurs once. The decoder with a code rate 1/5 can be used in this case
and
the puncturing matrixes satisfy the above-described conditions, ensuring
performance.
In the first case with R=2/3 shown in Table 4, the sequence of
transmission code symbols are given as
Co: Y0, X, Y' 0, Y0, X, Y' 0, Y0, X, Y' 0, Y0, X, Y' 0, ...
C1: X, Y'0, Y0, X, Y'0, Y0, X, Y'0, Y0, X, Y'0, Y0, ...
...
C2: Y1, X, Y'l, Y1, X, Y'l, Yl, X, Y' 1, Y1, X, Y'l,
C3: X, Y' 1, Y1, X, Y'l, Yl, X, Y'l, Y1, X, Y'l, Y1, ...
Because three code symbols are generated for the input of two
information symbols, the code rate of the sub-code is 2/3. A different code is
transmitted at each transmission due to the use of a different puncturing
matrix.
After soft combining of Co, Cl, C2, C3, X occurs twice and each of Y0, Yl, Y'O
and Y' 1 occurs once. The decoder with a code rate 1/5 can be used also in
this
case as for R=1/6 and the puncturing matrixes satisfy the above-described
conditions, ensuring performance.
In the second case with R=2/3 shown in Table 4, the sequence of
transmission code syinbols are given as
Co:X,YO,X,X,Y'O,X,X,YO,X,X,Y'O,X,X,YO,X,X,Y'O,X,...
C 1: Y' 0, Y0, Y' 0, Y0, Y0, Y' 0, Y' , Y0, Y' 0, Y0, Y0, Y' 0, ...
CZ: Y1, Y1, Y' 1, Y' 1, Y1, Y' 1, Y1, Y1, Y' l, Y' 1, Yl, Y' l, ...
C3: X,Y'1,X,X,Y'1,X,X,Y'1,X,X,Y'1,X, . . .
Because six code symbols are generated for the input of four information
symbols, the code rate of the sub-code is 2/3. A different code is transmitted
at
each transmission due to the use of a different puncturing matrix. After soft
combining of Co, C1, C2, C3, X occurs twice and each of Y0, Y1, Y'O and Y'l
occurs once. The decoder with a code rate 1/5 can be used also in this case as
for
R=1/6 and the puncturing matrixes satisfy the above-described conditions,
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-16-
ensuring performance.
5. Transmission protocol
Since a packet transmission protocol applies to both a forward traffic
channel and a reverse traffic channel in adopting HARQ Type III for traffic
channels, the bi-directional traffic channels will be termed as "traffic
channels"
collectively unless there is a need for discriminating them.
5.1. Relationship between Transmission Packet Length and Physical
Channel
Paclcet length is variable in transmitting packets on traffic channels by
HARQ Type III. One packet to be transmitted is defined as a Physical Layer
Packet (PLP). One PLP may include a plurality of sub-packets called TUs and
each TU is also variable in length. Thus, PLP length is variable. Needless to
say,
one TU can be transmitted in one PLP.
An HARQ Type III protocol will be described below in connection with
two main cases. A packet is 1TU, 2TU, 3TU or 4TU in length and each TU has
at least 768 or 1536 bits. A packet with TU=768 is called a short format and a
packet with TU=1536, a long format. The maximum number of TUs for a PLP is
variable, determined according to a data rate on a physical transmission
channel.
It is assumed here that four TUs are transmitted in one PLP.
One PLP is transmitted on a slot basis. The number of data per slot is
variable from 1 to any number, determined by the data rate available from the
physical transmission chanliel. In other words, the number of slots is
determined
according to the data rate for a PLP. By way of example, two cases are
considered: a packet transmitted in a short format with 1 to 32 slots and a
packet
transmitted in a long format with 2 to 64 slots. This kind of classification
is
equivalent to the discrimination between TU=768 and TU=1536. On the
assumption that a PLP with TU=768 is transmitted in up to 16 slots, the PLP
with
the TU length is defined as a short format. On the other hand, a PLP with
TU=1536 transmitted in up to 32 slots is defined as a long format. The
definitions are made based on packet length and have no fundamental relation
with the iniplementation of the HARQ Type III protocol. Yet, they influence
the
packet length-related system throughput.
5.2. Error Detection from Transmitted Traffic and Retransmission
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-17-
Method
Each TU in a single PLP has an independent error correction code.
Therefore, errors can be detected from each TU or from the whole TU in one
PLP using one error correction code before a retransmission request can be
issued. In reality, a receiver determines whether errors are detected in a
received
packet and reports the determination result to a transmitter on a PLP basis.
However, a retransmitted PLP may have a different TU constitution depending
on whether individual TUs have errors in the PLP.
FIG. 3 illustrates an HARQ transmission scheme for a PLP occupying
one slot. As shown in FIG. 3, one PLP is interlaced with adjacent three slots
for
transmission. A different packet can be transmitted in each of four slots and
an
independent signal ACK/NACK is transmitted on a reverse channel for each
packet. In this structure, each PLP may follow an independent Stop-and-Wait
ARQ (SW-ARQ) protocol and a predetermined reverse control signal is always
transmitted from the receiver to the transmitter. This structure is defined as
"modulo N HARQ" and the number of interlaced slots is determined by N = 4 in
FIG. 3. One user can use the interlaced slots and in this case, each slot is
available for PLP transmission. However, the HARQ Type III protocol for the
user operates as the Selective Repeat-ARQ (SR-ARQ) and a memory for storing
data received in four slots (N=4) must be provided for a physical channel in
the
receiver. Here, a description will be confined to SW-ARQ without the memory
requirement, while the same description is valid to SW-ARQ requiring such a
memory capacity.
FIG. 4 illustrates an HARQ transmission scheme for a PLP occupying
two slots. As shown in FIG. 4, one PLP is transmitted in two slots interlaced
with
adjacent three slots. Therefore, the receiver can recover one full PLP after
receiving two slots. A different packet can be transmitted in each of four
slots
and an independent signal ACK/NACK is transmitted for the packet on a reverse
channel. Therefore, each PLP follows an independent SW ARQ protocol and a
predetermined reverse control signal is transmitted from the receiver to the
transmitter in this so-called modulo N HARQ structure. The number of
interlaced
slots is determined by N.
If NACK is detected from at least one of ACK/NACK indicator bits, the
transmitter transmits a retransmission-requested PLP using a quasi-
complementary code set shown in Table 5 and Table 6 on a forward traffic
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
- 18-
channel. Various ACK/NACK combinations can be made fiom a plurality of
ACK/NACK indicator bits and in each case, the transmitter can include TUs in a
retransmitted PLP also in various ways. In general, TU transmission must
satisfy
the following conditions.
(Condition 1) No TUs with ACK are retransmitted.
(Condition 2) TUs with NACK are retransmitted with priority and their
transmission priorities depend on their QoS.
(Condition 3) If the total number of bits available for slots of a
retransmitted PLP exceeds the number of bits for TUs with NACK, TUs with
higher priorities determined according to (Condition 2) are repeatedly
transmitted.
(Condition 4) If QoS must be preserved for each TU, a weight is given to
the TU to maintain the QoS in retransmission. For example, if QoS for TUO,
TU1,
TU2, and TU3 are QoSO, QoS 1, QoS2 and QoS3 in a PLP having the four TUs,
(QoSO+QoS1+QoS2+QoS3)=1.0, and only TUO is received with ACK and TU1,
TU2 and TU3 are received with NACK, the QoS is set for retransmission as
follows:
QoS1=QoSlx(1/(QoSO+QoS1+QoS2)) where (QoSO+QoS1+QoS2) < 0
QoS2=QoS2x(1/(QoSO+QoS1+QoS2)) where (QoSO+QoS1+QoS2) < 0
QoS3=QoS3x(1/(QoSO+QoS1+QoS2)) where (QoSO+QoSl+QoS2) < 0
To generalize the above QoS determination process, if one PLP has P
TUs, TUO, TU1, TU2, ..., TU(P-1) and TU(i), TU(j), . . ., TU(s) are received
with NACK (here, i, j, ..., s E{0, 1, 2, 3, 4, ..., P-1}, weights for
retransmitted
TUs are calculated by
QoS(i)=QoS(i)x(1/(QoS(i)+QoS(j)+ . . . + QoS(s)))
where (QoS(i)+QoS(j)+ . . . + QoS(s)) < 0
QoS(j)=QoS(j)x(1/(QoS(i)+QoS(j)+ . . . + QoS(s)))
where (QoS(i)+QoS(j)+. . . + QoS(s)) < 0
QoS(s)=QoS(s)x(1/(QoS(i)+QoS(j)+ . . . + QoS(s)))
where (QoS(i)+QoS(j)+ . . . + QoS(s)) < 0
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-19-
to thereby reset the number of transmission bits.
Only when all the ACK/NACK indicator bits received on a reverse ACK
channel indicate ACK, a new PLP is transmitted on the forward traffic channel.
5.3. Transmission Code Selection for Traffic Channel
A PLP is encoded using a quasi-complementary code for each
transmission on a traffic channel. For an initial transmission, Co is used
from a
complementary code set with a set size S determined according to a PLP data
rate for the traffic channel in Table 5 and Table 6. Then, every time NACK is
received on the reverse ACK channel, codes are selected in the circulating
order
of C1, C2, ..., CS_1, Co, C1, . . . for the traffic channel.
(Table 5)
Data Slots/ TU/ Code Repetition ACK/NACK ACK Quasi
Rates PLP PLP Rate Period Indicator Complementary
(kbps) (slots) Bits/Reverse Code Set
ACK
Channel
19.2 32 1 1/6 16 2x4 1 {Co}
38.4 16 1 1/6 8 2x4 1 {Co}
76.6 8 1 1/6 4 2x4 1 {Co}
153.6 4 1 1/6 2 2x4 1 {Co}
307.2 2 1 1/6 1 2x4 1 {Co}
614.4 1 1 1/3 1 1x4 1 {Co, C,}
307.2 4 2 1/3 2 2x4 2 {Ca1 C1}
614.4 2 2 1/3 1 2x4 2 {Co1 CI}
1228.8 1 2 2/3 1 1x4 2 {Ca1 CI, C21 C3}
921.6 2 3 1/3 1 2x4 3 {Co, C,}
1843.2 1 3 2/3 1 1 x4 3 {Co, C,, CZ, C3}
1228.8 2 4 1/3 1 2x4 4 {Co, Cl}
2457.6 1 4 1/3 1 1x4 4 {Co, C,, C21 C3}
(Table 6)
Data Slots/ TU/ Code Repetition ACK/NACK ACK Quasi
Rates PLP PLP Rate Period Indicator Complementary
(kbps) (slots) Bits/Reverse Code Set
ACK
Channel
19.2 32 1 1/6 16 2x8 1 {Co}
38.4 16 1 1/6 8 2x8 1 {Co}
76.6 8 1 1/6 4 2x8 1 {Co}
153.6 4 1 1/6 2 2x8 1 {Co}
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-20-
307.2 2 1 1/6 1 2x8 1 {Co}
614.4 1 1 1/3 1 1x8 1 {Co, Cl}
307.2 4 2 1/3 2 2x8 2 {Ca, Cl}
614.4 2 2 1/3 1 2x8 2 {Co, Cl}
1228.8 1 2 2/3 1 lx 8 2 {Co, C,, C21 C3}
921.6 2 3 1/3 1 2x 8 3 {Ca, Cl}
1843.2 1 3 2/3 1 lx 8 3 {Co, C,, CZ, C3}
1228.8 2 4 1/3 1 2x 8 4 {Ca, Cl}
2457.6 1 4 1/3 1 1x 8 4 {Co, C,, C21 C3}
If three consecutive NACKs are received on the reverse ACK channel,
sub-codes are used in the order of C1, C2, and C3 for the forward traffic
channel.
If two more NACKs are received, the sub-codes Co and Cl are used. If ACK is
then received, transmission is discontinued and a new PLP is transmitted on
the
forward traffic channel. The transmitter does not notify the type of a quasi-
complementary code for each retransmission but it is lmown beforehand to both
the transmitter and the receiver that the codes are transmitted in the
circulating
order of 0, 1, 2, . . ., S-1, 0, 1, . . . according to the set size S
determined by the
data rates. The type of the selected QCTC sub code among S sub codes
6. Sti-ucture of Reverse ACK Channel and Transmission on the Channel
The receiver transmits a message indicating whether an error is detected
for each received PLP on the reverse ACK channel. An ACK/NACK indicator
bit is transmitted for each TU of the PLP by an ACK/NACK message. Therefore,
if four independent TUs are transmitted on the forward traffic channel, the
reverse ACK channel transmits four ACK/NACK bits. That is, as many
ACK/NACK bits as TUs are transmitted.
6.1. Periodical Transmission of ACK/NACK signal on Reverse ACK
Channel
In the inventive HARQ scheme of the present invention, a predetermined
ACK/NACK transmission period is used irrespective of an SR-ARQ or SW-
ARQ protocol and the ACK/NACK signal period is determined according to the
traffic data rate. Since the length of each sub-code transmitted on a traffic
channel is one or two slots, a sub-code corresponding to one PLP is always
received in two slots at the longest. In other words, all codes used for
traffic
transmission are designed to be completely transmitted in one or two slots.
Therefore, an ACK/NACK signal is transmitted in one- or two-slot units with a
predetermined interval. Table 3 and Table 4 illustrate sub-codes for data
rates.
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-21-
The ACK/NACK message is transmitted on the reverse ACK channel as
specified in Table 5 or Table 6 according to the packet data rate and packet
format of a PLP received on a traffic channel and according to whether the PLP
occupies interlaced multiple slots. If the PLP uses four interlaced slots in a
short
format, it can be considered separately in two ways according to its period:
four
slots (5msec) and eiglit slots (lOmsec). That is, the receiver time-
multiplexes the
ACK/NACK message in the first half of the second slot from the traffic
reception
time. Therefore, the ACK/NACK message is always transmitted one slot after the
receiver receives the traffic.
The first ACK/NACK message transmitted on the reverse ACK channel
after receiving the PLP on the traffic channel is labeled with ACK/NACK #1.
Then, in the case of a four slot period as shown in FIG. 3, each ACK/NACK
message is used for early termination regardless of whether it is an odd-
numbered message or an even-numbered message. The ACK/NACK message is
also used as a control message for changing a quasi-complementary sub-code for
PLP retransmission on the forward traffic channeL
On the other hand, in the case of an eight slot period as shown in. FIG. 4,
each ACK/NACK message is used for early termination regardless of whether it
is an odd-nuinbered message or an even-numbered message and only an even-
numbered ACK/NACK message is used as a control message for changing a
quasi-complementary sub-code for PLP retransmission.
Early termination refers to discontinuation of slot transmission for a PLP
on a traffic channel before all slots assigned to the PLP are transmitted in a
situation where the PLP can be received without errors, and then transmission
of
a new PLP, to thereby increase transmission throughput.
Meanwhile, if the PLP is in a long format, it can also be considered
separately in two ways according to its period: 8 slots (lOmsec) and 16 slots
(20msec). An odd-numbered ACK/NACK message and an even-numbered
ACK/NACK message functions in the same way as for the short format.
6.2. Implementation of Transmission protocol
FIGs. 5 and 6 illustrate forward and reverse slot transmissions according
to the present invention. As stated before, transmission of the ACK/NACK
message is controlled separately for 1 slot/PLP and 2 slots/PLP for all data
rates.
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-22-
FIG. 5 illustrates slot processing by HARQ for 1 slot/PLP and FIG. 6
illustrates slot processing by HARQ for 2 slots/PLP. They differ in whether a
sub-code change for retransmission occurs at one slot level or at a two slot
level.
FIG. 7 is a flowchart illustrating an embodiment of a control operation
for data retransmission when a multiple data service is provided according to
the
present invention. For better understanding, it is assumed hereinafter that a
transmitter transmitting multiple data is provided to a base station and a
receiver
to a UE (User Equipment), that is, inultiple data is transmitted on a forward
link.
Referring to FIG. 7, the transmitter transmits multiple data to a user
receiving the multiple data service in step 300. Each service data (Tus,
s=0,1,2,...) is encoded according to the data rate prior to transmission and a
PLP
structure varies with the data rate and the number of Tus. The case where a
PLP
has four different TUs will be described with reference to FIG. 8.
FIG. 8 is a diagram showing data flow between the transmitter and the
receiver, referred to for describing retransmission of multiple data according
to
the present invention.
If a PLP directed to a particular user includes four different data TUO,
TU1, TU2 and TU3 as indicated by reference numeral 400, the code rate and data
rate of the PLP are determined in the above-described method. A PLP is not a
real transmission unit in the air but a processing unit in the higher layer.
In the air,
the PLP can be transmitted in a plurality of slots. As shown in FIG. 8, one
PLP
410 can be transmitted in three slots. The following description is made for
the
case where four different TUs constitute one PLP and the PLP is transmitted to
receiver during[in] three slots.
In step 300, the transmitter transmits a PLP with four different multiple
data TUO to TU3 as indicated by reference numeral 400 in Fig.8. The multiple
data are interleaved and uniformly distributed in PLP data 410 to 430. For
initial
transmission, the PLP is encoded with the first code Co. The PLP can be
transmitted at one time in three consecutive slots or separately a plurality
of
times at every predetermined period. In the embodinient of the present
invention,
the PLP is transmitted in the latter method by way of example.
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
- 23 -
Therefore, the PLP data 410 is first transmitted in step 300. Due to
interleaving as described above, the first PLP data 410 has all four multiple
data
TUO to TU3. Since the PLP is transmitted periodically in three separate slots,
the
transmitter transmits the PLP for the particular user at time to, and then
data for
other users. The PLP data are marked in FIG. 8. The PLP data arrive at the
receiver witli a time delay according to the channel environment and the
distance
between the transmitter and the receiver. The receiver decodes the delayed PLP
data and transmits a multi-response signal for the PLP data to the
transmitter.
After decoding, the receiver performs a CRC (Cyclic Redundancy Code) check
on the four different data TUO to TU3 and determines that the data is good
when
it proves CRC-good. The term "decoding success" will be used below in the
sense that the CRC of decoded data is checked to be good. The multi-response
signal includes a message indicating successful reception (ACK) or failed
reception (NACK) for each TU. The ACK message indicates decoding success
and the NACK message, decoding failure. The receiver transmits the multi-
response signal for the multiple data to the transmitter. The response signal
for
each TU can be one bit or two bits. In the following description, the response
signal for each TU occupies one bit and if it is set to 1, this implies
successful
reception and if it is set to 0, this implies failed reception.
When the decoding results of the four TUs are all good, the ACK/NACK
signal is "1111" and when they are all bad, the ACK/NACK signal is "0000". In
this manner, reception success or reception failure can be determined for each
received TU.
Returning to FIG. 7, after transmitting the first PLP data 410, the
transmitter monitors reception of a multi-response signal for the PLP data.
Upon
receipt of the multi-response signal, the transmitter determines whether
retransmission is requested in step 302. Retransmission is requested when
reception failure occurs to at least one CRC-bad TU in the PLP data. Upon a
retransmission request, the process goes to step 310. If the overall PLP data
are
CRC-good in the receiver, the transmitter goes to step 304.
In step 304, the transmitter checks whether reception success has
occurred for the one PLP, that is, whether an ACK signal has been received for
the third PLP data 430 in the third slot Co #3 encoded with the code Co
indicated
as 410 in FIG. 8.
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-24-
The reason for performing step 304 is that successful reception of all the
PLP data can occur in different ways. More specifically, the first PLP data
410 is
transmitted at time to in slot Co #1, the second PLP data 420 at time tl in
slot Co
#2, and the third PLP data 420 at time t2 in slot Co #3. The reception result
of the
first PLP data 410 is reported between time to and time tl, the reception
result of
the second PLP data 420 between time tl and time t2, and the reception result
of
the third PLP data 430 between time t2 and time t3. When a PLP is divided into
three slot data, therefore, the transmitter initiates transmitting the next
PLP in
step 308 after transmitting the third PLP data 430 and then receiving a multi-
response signal for all TUs TUO to TU3 of the PLP data 430. Referring to FIG.
8,
when the first PLP 400 includes four different data TUO to TU3 and the second
PLP 500 includes three different data TUO, TUl and TU2, the second PLP 500 is
transmitted after the first PLP 400.
On the other hand, when the transmitter receives a multi-response signal
indicating all TUs are CRC-good for the transmitted PLP data before the PLP-
basis transmission is completed, that is, it receives an ACK signal for the
first
slot Co#1 or the second slot Co #2, the transmitter proceeds from step 304 to
step
306, discontinues transmission of the present PLP data, and goes to step 308.
For example, if the first slot Co #1 has been successfully received, the
transmitter
transmits a new PLP (500 in FIG. 8) without transmitting the second and third
slots Co #2 and Co #3. One point to be noted here is that numerals labeled to
TUs in FIG. 8 represent just the sequence of the multiple data and thus TUO in
the PLP 400 can be identical to or different from TUO in the PLP 500. The PLP
500 can be transmitted in three slots like the previous PLP 400 or in more or
less
slots.
Meanwhile, if the multi-response signal represents a retransmission
request in step 302, the transmitter checks whether the transmission failure
has
occurred on a PLP basis in step 310. and then in step 312, the transmitter
takes
the next available code, for example, Cl for the PLP. The PLP-basis
transmission
refers to transmission of all three slot data 410, 420 and 430 separated from
the
PLP 400(TUO, TU 1, TU2, TU3). After transmission of the first PLP data 410,
the
second and third PLP data 420 and 430 can be differently constituted according
to the reception result of the first PLP data 410. The data construction after
the
initial transmission will be described in more detail referring to FIG. 9. It
is
determined whether the PLP-basis transmission is completed by counting the
number of transinissions of the PLP with respect to the slot number of the
PLP.
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
- 25 -
In step 314, the transmitter determines whether there is a successfully
transmitted TU by monitoring the retransmission request signal. Since the
multi-
response signal represents ACK/NACK for each TU, it is determined whether at
least one TU is successfully transmitted by checking the multi-response
signal.
If at least one TU has been successfully received in the receiver in step
314, the transmitter goes to step 318 and otherwise, it goes to step 316. When
no
successfully decoded data exist in the receiver, the transmitter retransmits
all the
transmitted PLP data in step 316. Here, the retransmission can be considered
in
two ways: when one PLP is fully transmitted, the next available code is taken
and
the PLP is retransmitted with the code; and when the PLP is not completely
transmitted, for example, only the first PLP data 410 or only the first and
second
PLP data 410 and 420 are transmitted, the transmitted PLP data is
retransmitted
with the original code in the following slot.
In step 318, the transmitter determines whether two or more TUs are to
be retransmitted. If two or more TUs are to be retransmitted, the transmitter
goes
to step 322. In this case, since the transmitter must transmit the failed TU
at the
same data rate as in the initial transmission, it encodes the one failed TU
and
reconstructs a PLP in the same form as for the transmission of the four data.
For
example, if only TUO is failed, the transmitter simply retransmits TUO. In
constructing a PLP, four TUs are needed as in the initial transmission.
Therefore,
the transmitter repeats TUO in the places of TU1, TU2 and TU3. After the thus-
construction of the PLP only with the failed TU, the transmitter divides the
PLP
into slots. That is, the new PLP is divided into slot data.
Meanwhile, if two or more TUs are to be retransmitted, the transmitter
determines whether the total number of transmitted TUs is an integer-multiple
of
the number of the failed TUs in step 322. Referring to FIG. 8, since four TUs
are
transmitted, two TUs must be successful and the other two TUs must be failed
to
satisfy the above condition. While four TUs are transmitted in the embodiment
of
the present invention, it is the same as in the case of six or eight TUs. If
the
condition is satisfied in step 322, the transmitter goes to step 324 and if it
is not,
the transmitter goes to step 326.
In step 324, the transmitter determines whether the retransmission-
requested TUs are to be repeated the same number of times according to their
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
- 26 -
ToS (Type of Service) or QoS which can be listed beforehand in the form of a
table or deterinined using an algorithm. If the failed TUs are to be repeated
the
same number of times, the transmitter goes to step 328 and otherwise, it goes
to
step 326.
In step 328, the transmitter sequentially repeats the TUs, or inserts one
TU as many times as determined and then the next data the same repetition
times.
On the other hand, if different repetition times must be taken or the total
number
of the transmitted TUs is not an integer-multiple of the failed TUs, the
transmitter determines how many times the failed TUs are to be repeated
according to their priority in step 326. Only one TU with the highest priority
can
be repeated, or the failed TUs can be repeated a different number of times
according to their priority. This is system implementation-dependent.
Data retransmission will be described in more detail referring to Fig. 9.
FIG. 9 illustrates repeated data for retransmission according to the
present invention.
One PLP includes four different TUs, is encoded with a code selected in
the order of Co, C1, . . . for each transmission, and is transmitted in three
slots.
The first PLP data 400 (TUO to TU3) is encoded with the first code Co and the
encoded TUs are transmitted in the first slot Co #1. The transmitter transmits
the
first slot Co #1 at time to. After a predetermined time, the receiver receives
the
first PLP data 410, decodes it, and detects CRC-good TUs from the decoded
data.
The receiver transmits ACK signals for the CRC-good TUs and NACK signals
for the CRC-bad TUs to the transmitter. ACK/NACK is transmitted for each TU
by a multi-response signal bit. If the receiver transmits a multi-response
signal
"1100", this represents that TUO and TU1 are CRC-good and TU2 and TU3 are
CRC-bad. The CRC-bad TUs are repeated in the next slot Co #2 and encoded
with the code Co. In FIG. 9, if the two TUs are repeated the same number of
times, they alternately occur twice as indicated by reference numeral 410-a
and
410-b, or one of them occurs consecutively twice and then the other follows
consecutively twice as indicated by reference numeral 410-b. If the nlultl-
response signal is "1000" and TUl has the highest priority, only TUI can occur
twice as indicated by reference numeral 410-c. In this case, TU1 can be
positioned between TU2 and TU3 or at the last. That is, the positions of
repeated
TUs can be changed. When TU3 is again CRC-bad, only TU3 can be repeated in
CA 02395215 2002-06-20
WO 02/33877 PCT/KR01/01791
-27-
the four positions for the third slot Co #3. Despite the transmission, when
the
same TU3 is CRC-bad, only TU3 is encoded with the next code Cl for
retransmission. This procedure is repeated until the PLP is error-free.
While the invention has been shown and described with reference to a
certain preferred embodiment thereof, it will be understood by those skilled
in
the art that various changes in form and details may be made therein without
departing from the spirit and scope of the invention as defined by the
appended
claims.
