th

50 International Symposium ELMAR-2008, 10-12 September 2008, Zadar, Croatia

HARQ schemes for HSDPA – analysis and simulation

Vladimír Hájovský, Kvetoslava Kotuliaková, Ivan Kotuliak

SLOVAK UNIVERSITY OF TECHNOLOGY
Ilkoviþova 3, 812 19 Bratislava
Slovak Republic
E-mail: hajovsky@ktl.elf.stuba.sk

Abstract - Presented paper concerns with HSDPA (High Speed Packet Data Access) concept, especially
describes HARQ (hybrid ARQ) schemes used to achieve high data throughput in 3G networks. Simulation is
done in AWGN channel using Soft decision Viterbi decoder for decoding convolutionally encoded data.
Comparative simulation of Stop&Wait protocol using Chase combining and Incremental redundancy is shown.

Keywords - HSDPA, HARQ, Chase combining, Incremental redundancy

1. INTRODUCTION versions separately. In other case, versions are

3GGP standardized three HARQ scheme types
for HSDPA:
x Chase combining (CC)
x Incremental redundancy (IR)
x Self decodable IR
In [1], Chase showed that sequence gained by
combination of identical data block versions
provides lower BER (bit error rate) than separate
sequences do. This leads to idea of storing not
decodable copy in UE (User equipment) buffer. As
soon as next identical copy arrives, it is soft
combined with stored one. This technique of soft
combining was named „Chase combining“. Stated
concept, evolved within 3GPP Rel. 5 specifications,
reduces delays in comparison with HARQ schemes
used in Rel. 99 for UMTS (Universal mobile
telecommunications system).
Main disadvantage of this scheme is the
requirement for the same modulation and coding
scheme (MCS) within retransmission. This fact
reduces advantages gained by using adaptive
modulation and coding (AMC) and fast link
adaptation.
Subsequently, there were introduced new
algorithms based on incremental redundancy (IR).
IR scheme is based on achieving coding gain while
adding redundant information into retransmitted data
block instead of repeating same block. Before
decoding in receiver, these blocks are combined
together with first sent block. This procedure
ensures better data protection and more efficient use
of AMC. Disadvantage of this scheme is inability to
decode retransmitted versions separately.
To soften IR disadvantage, self decodable IR
scheme has been proposed. In this case, redundant
information is added to the first data block and
single versions are produced by employing puncture
patterns. In case of good channel conditions during
retransmission, receiver is able to decode all
combined according to their puncturing patterns and
then decoded.
In this article, we compare Chase Combining and
Incremental Redundancy HARQ schemes in terms
of relative bit throughput. The rest of article is
organized as follows: Section 2 describes basic
principle of N-channel Stop&Wait protocol, in the
section 3, we show models of CC and IR, section 4
comprises description and parameters of our
simulations and finally, section 5 depicts results and
explanation of our simulations.
2. N–CHANNEL STOP&WAIT
3GPP Rel. 99 deploys Selective Repeat (SR)
ARQ scheme. As it is known about this scheme,
only incorrectly received blocks are retransmitted.
Transmission is ensured by Radio link control
(RLC) layer in Radio network controller (RNC).
There is need for identifying of each data block by
its own sequence number. This and many other
requirements which HSDPA carries are out of the
scope of this work and can be found in [3]. But just
them and increasing complexity of system lead to
ARQ scheme replacement. Protocol Stop&Wait is
easy to implement but due to its low efficiency there
was compromise between SR and S&W
standardized called N-channel Stop&Wait scheme.
The 3 channel example is given in Fig. 1. N-
channel S&W can be described as activation of N
parallel HARQ processes, while each of them
employs separate single S&W protocol. Each HARQ
process transmits data in downlink direction (High
speed downlink shared channel), while other
instances wait for acknowledgement (ACK) in
uplink direction (Uplink dedicated physical control
channel)

557

uthorized licensed use limited to: NUST School of Electrical Engineering and Computer Science (SEECS). Downloaded on August 03,2010 at 12:27:28 UTC from IEEE Xplore. Restrictions apply
 th
50 International Symposium ELMAR-2008, 10-12 September 2008, Zadar, Croatia

UE2
Info Encoded Transmitted Received Combined Recovered
ULDPCC A X
bits packet
R
UE1 R`
ULDPCC A N A A A 1 Error detection
NACK R` (<R)
Node-B

HS-DSCH 2
UE1 UE1 UE2 UE1 UE1 UE2 UE1 UE1 UE2

Fig. 3. Principle of Incremental redundancy

UE1 – channel 1 UE1 – channel 2 UE2 – channel 3 ACK NACK

Fig. 1. 3-channel S&W 4. SIMULATION ENVIRONMENT

As a result, N-channel S&W achieves better
performance than SR in UMTS. Simple advantage
against SR is making transmission robust over
repeating errors in one of N channels. If an error
occurs in one channel, other channels may keep on
transmitting data. Another reason for employing
S&W protocol is its simplicity, which allows using
schemes like Chase combining and Incremental
redundancy. Even more MAC-hs (Medium access
control-high speed) layer is able to allocate all
channels for one user when radio conditions are
good. This strategy puts strict criteria on acceptable
delays. Transmitter must be ready to resend packet
just N-1 intervals after previous transmission.
3. CHASE COMBINING & IR MODELS
Fundamental principles of CC and IR are
depicted in Fig. 2, Fig. 3. Original version of data
block is numbered 1, retransmitted is marked 2. In
CC, retransmitted version is identical to original and
both of them are combined after receiving (in case
when second version was not decodable without
combination). As a result SNR (Signal to Noise
Ratio) is increased and final throughput is higher [2].
Information Transmitted Received
bits
R
1 Error detection
NACK
2
Our simulations are based on simulator of ARQ
schemes and its enhancements for simulating
convolutional codes. It was created and developed at
KTL FEI STU in Bratislava.
This simulator was primarily intended for
simulation of pure ARQ schemes [6]. Its
modifications enabled it for simulations of hybrid
ARQ schemes using Reed-Solomon codes,
convolutional codes and punctured convolutional
codes. We are using module SOFT-DECISION
VITERBI DECODER which works for AWGN
channel, codes with base rate ½ and codes derived
from this mother code applying puncture patterns.
Our modification is inserted before decoding
module while applying combining mechanism of
different puncture patterns in IR and after decoding
module while combining same not decodable
versions in CC.
4.1 Channel model with independent error
occurrence
This model assumes that errors origination in
transport channel is not dependent i.e. each binary
symbol is received in error with the same error
probability Pb, without influence of previously
received symbols. In this simulation, we are using
AWGN channel model because of its simplicity.
Combined Recovered
packet
4.2 Relative bit throughput
Key value, which is used for comparison of
+
single HARQ techniques, is relative bit throughput.
On the physical basis, block throughput is defined
as:

Fig. 2. Chase combining principle succesfully _ received _ blocks (1)

KB
all _ transmitted _ blocks
In IR, puncturing pattern is typically different
from original version, i.e. next version carries And relationship between block and bit
redundant information. That is after receiving throughput is:
combined with original version according to agreed m (2)
Kb ˜K B
puncturing pattern. This leads to more powerful n
forward error correcting code with lower code rate
(R). Increasing of coding gain improves throughput where m stands for length of information field in the
as a result [2]. data block and n stands for entire data block length.

558

uthorized licensed use limited to: NUST School of Electrical Engineering and Computer Science (SEECS). Downloaded on August 03,2010 at 12:27:28 UTC from IEEE Xplore. Restrictions apply
 th
50 International Symposium ELMAR-2008, 10-12 September 2008, Zadar, Croatia

4.3 FEC – used codes
In HSDPA convolution and turbo codes are used.
Base rate of turbo encoder for HSDPA is 1/3. We
have available convolution encoder with base rate ½.
Codes with various rates are obtained by applying
puncturing patterns.
all bits in second version in case of unsuccessful
decoding of first one. This is the mean we created
1-2-restart combining for IR. 1-2-3-restart
combining was simulated like application of CC
scheme on data stored in receiver after incoming and
decoding of first two versions in 1-2-restart
combining scheme for IR.

4.4. Enumeration of errors 5. SIMULATION RESULTS

As stated above, we are using SOFT-DECISION In our simulations, we used S&W scheme with
VITERBI DECODER. By using it, we have access block length 3319 bits and Roundtrip delay (RTD) =
to bit level of decoded packet. If an error occurs in 4. First we applied CC strategy on pure ARQ
decoded packet, it is declared as wrong, its decoding schemes. We acknowledged dependency of RTD
is stopped and we are waiting for next packet. For and block length on relative bit throughput. Later,
simulation requirements, in case of CC, we need to we simulated SR and S&W scheme. We showed that
decode entire packet to store information about bit N-channel S&W fully replaces SR in terms of
error probability. In the next cycle, this probability is throughput.
compared bit by bit. Bit, which was decoded Primary goal of this paper is to cover simulation
correctly, is chosen. Packets are not discarded until results of CC and IR in comparison to base rate code
number of allowed versions reaches limit. and punctured code without combining.
In following simulations we will use
4.5 Modulations convolutional encoder with base rate ½. In Fig. 4,
there is depicted result of CC simulation applied on
Deployed modulations are important factor, convolutional codes (n, k, L):
which has influence on resulting channel throughput. (2, 1, 3), (2, 1, 5) and (2, 1, 7) with appropriate
In HSDPA, QPSK is used primarily. For achieving generation polynomials:
higher bit rates 16QAM is proposed. Available (7, 5 oct.), (35, 23 oct.) and (171, 133 oct.).
simulator uses BPSK modulation. For investigation where n = output bits, k = input bits, L =
of principles of CC and IR, this modulation and constraint length of code and oct. is octal value.
AWGN channel model is fully sufficient.
0.1
H-S&W, L=3
H-S&W, L=3, CC - 2x
4.6 Redundant data 0.09
H-S&W, L=3, CC - 3x
H-S&W, L=5
0.08
H-S&W, L=5, CC - 2x
Except information and parity bits, there is also H-S&W, L=5, CC - 3x
0.07 H-S&W, L=7
24 bit CRC (Cyclic redundancy check) added to
relative bit throughput

H-S&W, L=7, CC - 2x
each transmitted block. This redundancy is not taken 0.06 H-S&W, L=7, CC - 3x

in account while computing throughput. 0.05

0.04
4.7 Chase Combining
0.03

We implemented this strategy like soft decision 0.02

about block integrity by means of comparing bit by

0.01
bit. We have proposed 1-2-restart combining and 1-
2-3-restart combining scheme. Their names tell how 0
-2 -1 0 1 2 3 4 5 6 7

many versions are stored before the buffer in UE is SNR [dB]

flushed. Disadvantage of our simulator is that it is
unable to change simulated SNR while delivering
versions of the same packet. We can only rely on
random simulator of Gaussian noise.
4.8 Incremental Redundancy
Principle of this strategy is repeating differently
punctured versions of blocks encoded by
convolution code and consecutive combination in
the receiver before decoding. We implemented self
decodable IR.
Software implementation of this strategy was
done by using puncture pattern in first version and
Fig. 4. Chase combining on hybrid S&W
Blue colour depicts simulations without CC, i.e.
with only one version for decoding in the receiver.
Red and black colour shows combinations of
identical copies of the same data block with two or
three used versions.
We can see that after CC was applied, schemes
which had originally lower correcting ability (lower
constraint length L) start to transmit data at lower
SNR than schemes with originally higher correcting
ability.
Most notable is example of code (2, 1, 3) with
three versions. Coding gain in dB for CC is depicted
by arrows with appropriate line styles. We can see

559

uthorized licensed use limited to: NUST School of Electrical Engineering and Computer Science (SEECS). Downloaded on August 03,2010 at 12:27:28 UTC from IEEE Xplore. Restrictions apply
 th
50 International Symposium ELMAR-2008, 10-12 September 2008, Zadar, Croatia

that coding gain is decreasing with increasing violet colour shows IR applied with significant shift
constraint length. However, it is natural that more in SNR.
powerful coding schemes offer their advantages in
earlier raise of higher throughput that achieves
approximately 50% of maximal value. 6. CONCLUSION
Fig. 5 depicts behaviour of IR scheme while
using different puncturing patterns. We used In this paper, we focused on Chase combining
following patterns: {1, 0, 1, 0, 1, 0, 1}, {1, 1, 0, 1, 0, and Incremental redundancy schemes for HSDPA.
1, 0} and {1, 0}, {1, 1}. Our goal was to describe them in terms of relative
Move of margin SNR, which ensures possible bit throughput with use of different codes,
transmission is the same among differently puncturing schemes and allowed number of
punctured schemes. The only difference is retransmitted copies.
throughput, which is proportionally lower at first Our results acknowledge undoubted contribution
version and at both combinations. of CC & IR. Simulations showed that the use of the
IR compensates disadvantage of puncturing which is
0.18
increasing SNR needed for transmission. By the
H-S&W, (8, 7, 7) - punct.
0.16 H-S&W, (8, 7, 7) - punct. IR - 2x means of the IR, we can exploit advantage of high
H-S&W, (8, 7, 7) - punct. IR - 3x
H-S&W, (3, 2, 7) - punct.
bit throughput when the channel condition is good –
0.14
H-S&W, (3, 2, 7) - punct. IR - 2x
H-S&W, (3, 2, 7) - punct. IR - 3x
this is given by puncturing characteristics and also
0.12 advanteges of punctured versions combining that
relative bit throughput

carries adequate throughput during bad channel

0.1
conditions.
0.08

0.06
ACKNOWLEDGEMENT
0.04

This work has been supported by Slovak national

0.02
grant agency under the Grant No. 1/4084/07, No.
0 1/0883/08 and applied research grant.
-1 0 1 2 3 4 5 6 7 8 9 10
SNR [dB]

Fig. 5. Incremental redundancy on hybrid S&W

REFERENCES
When applying CC and IR with three versions,
IR achieves better results in terms of throughput in [1] Chase, D. 1985. Code Combining—A
comparison to results within 1-2-restart combing. Maximum-Likelihood Decoding Approach for
In the Fig. 6, comparison of best achieved results Combining an Arbitrary Number of Noisy
is depicted. Packets. IEEE Transactions on
Communications 33, no. 5:385–93 (May).
0.18
[2] Mohamad Assaad, Djamal Zeghlache TCP
H-S&W, (2, 1, 7)
0.16 H-S&W, (2, 1, 7), CC - 3x Performance over UMTS-HSDPA Systems,
H-S&W, (8, 7, 7), punct.
H-S&W, (8, 7, 7), punct. IR - 3x
2007
0.14
[3] 3GPP TS 25.308 V5.7.0 (2004-12) 3rd
0.12 Generation Partnership Project; Technical
relative bit throughput

Specification Group Radio Access Network;

0.1
High Speed Downlink Packet Access
0.08 (HSDPA); Overall description; Stage 2
(Release 5)
0.06
[4] Kacur, J., Korosi, J. An Accuracy Optimization
0.04 of a Dialog ASR System Utilizing Evolutional
Strategies, ISPA 2007, Istanbul, Turkye, Sept.
0.02
2007
0
-2 0 2 4 6 8 10
[5] Trúchly, P., Urbanoviþ, M.: MPLS Throughput
SNR [dB] over GEO satellites, ELMAR-2006, 48th
Fig. 6. CC, IR, base rate code and punctured code on International Symposium on Multimedia
hybrid S&W Signal Processing and Communications, 7-9
June 2006, Zadar, Croatia, str. 305-308
Blue colour depicts original base rate code with [6] Košút, P., Polec, J.: Investigation into optimum
maximal throughput about 0.1, red colour shows CC go-back-N ARQ strategy of Bruneel and
applied on this code with shift in SNR. Black colour Moeneclaey, Electronics Letters, Vol.36, No.4
shows punctured code without any combination, February 2000, ISSN: 0013-5194 381-382

560

uthorized licensed use limited to: NUST School of Electrical Engineering and Computer Science (SEECS). Downloaded on August 03,2010 at 12:27:28 UTC from IEEE Xplore. Restrictions apply