ARQ and HARQ used in HSDPA/HSUPA

The backbone of wireless communications will be based on TCP/IP and due to its workload efficient
retransmission schemes must be provided in order to avoid as many errors as possible.
One of these schemes is HA!. HA! is the combination of A! as transmission process and "#C
for error correction. In HA!$ "#C is processed in the physical layer and A! in the %AC layer.
HA! is a simple system but the increased fre&uency of retransmission re&uests has a severe impact
on the throu'hput.
HA! has different types of schemes(
A) HA! type I
In this scheme the packet is encoded for error detection usin' CC and then is encoded a'ain
usin' "#C. The receiver discards erroneous packets *when errors remain after "#C decodin')$ then
sends retransmission re&uests to the transmitter and ask for an entirely retransmission.
+) HA! type II
In the same way as in type I$ the packets are encoded with CC and "#C$ but in this type the
receiver stores the erroneous packets in a buffer in order to reuse them with symbols of newer
retransmissions$ this allows the followin' concepts(
I , Incremental edundancy( Pro'ressive parity checks are sent in each subse&uent transmission of
packets. -ith I every time there is a retransmission the puncturin' is modified without modifyin' the
number of bits punctured. This process increase the codin' 'ain of the receiver which makes it more
adaptable to the channel conditions.
Chase combinin'( etransmission by the transmitter of the same code data packet. This allow the
decoder the ability to combine multiple copies of the decoded packet measured by its respective ./
before bein' decoded. This method causes diversity 'ain and is simple to utili0e. In soft1combinin'
when the packets are received$ these packets are stored in a buffer then are combined symbol by
symbol with the new retransmitted packets before "#C decodin'.
"#C
"#C has shown been a useful tool by deliverin' reliability on the Internet$ for this reason "#C is bein'
utili0ed on wireless networks$ nonetheless wireless networks differ from wire1line networks. In
wireless we have( multi1path and interference due to obstacles form the transmitter to the receiver
causin' losses incapacitatin' the defectiveness of "#C. In "#C process the transmitter sends a ran'e of
packets with the same information *redundant encoded packets) in order to asure the receiver can
reconstruct the information in case of loss of packets$ acknowled'in' the receiver is no necessary. A
suitable selection of redundancy can 'enerate less costs compare to the retransmissions made by A!.
2espite of the fact that "#C is &uite useful is not 344 per cent reliable$ for this reason several
techni&ues have been developed combinin' A! and "#C in order to overcome the flaws that it
presents by itself.
H.2PA 5 H.2P6
H.PA is an up'rade to -C2%A network *"22 and T22) in order to increase the performance of data
packets. This up'rade was made by steps$ first H.2P in release 7 then H.6PA in release 8. These
technolo'ies their main purpose is to increase the speed in the uplink *H.6PA) and downlink *H.2PA)
H.PA
H.2PA is based on adaptive modulation and HA! to achieve hi'h throu'hput$ reduce delay and
achieve hi'h peak rates. It relies on a new transport channel H.12.CH which is terminated on /ode+.
.o in H.2PA soft combinin' is used meanin' that the faulty T+ *Transport +lock$ carries data n the
physical layer) will be stored in a receivin' buffer and recombined with the transmitted T+ in order to
enhance the likelihood of correct decodin'.
HA! is based on synchronous downlink and uplink schemes. This is based on I. The 6TA/ must
take into account the 6# soft memory capability when confi'urin' the different transport formats
includin' possible multiple redundancy version for the effective code rate and when selectin' trasnport
formats for transmission and retransmission.
HA! works faster than A!$ HA! is used per T+$ while A! is used per 9C P26 *adio 9ink
Control$ used for error reduction between 6# and /ode+). HA! is used for non1real1time and real
time services. /on the less A! is still useful$ when HA! fails in non1real1time services.
H.2PA Architecture
:"rom A/ H.2PA 2escription$ Huawei Technolo'ies ;44<=
3The differences between the H.2PA protocol architecture and the >> protocol architecture
are as follows(
3. 9C and %AC1d are unchan'ed.
;. The H.12.CH "P is added to handles the data transport from ./C to C/C if the Iur
interface is involved and the data transport between C/C and /ode+. In >>$ it is the
2CH "P that handles such data transport.
?. A new entity called %AC1hs is added at the %AC layer of both 6# and /ode+. The
%AC1hs handles new functions$ such as HA! and H.12.CH schedulin'.
@. There are two types of %AC protocol confi'urations on the 6TA/ side(
A Confi'uration with the %AC1c/sh( The %AC1c/sh implements flow control between
%AC1d$ %AC1c/sh$ and %AC1hs.
A Confi'uration without %AC1c/sh( The %AC1hs and H.12.CH "P implement flow
control between %AC1hs and %AC1d over Iub/Iur.
.i'nalin'
6plink
In the uplink a report is used identifyin' ACB or /ACB
2ownlink *.hared control channel si'nalin')
These are the most common parameters carried on H.1.CCH(
A. HA! process identifier$ every HA! process is assi'ned an identifier wich is used to process the
receiver and the transmitter.
+. /ew data indicator$ used to distin'uish data blocks it is specific to the HA! process$ increments
each data block. "or %I%O mode with four transmit antennas the data indicator is implied by the
redundancy indicator carried on the H.1.CCH
#rror handlin'
The most fre&uent cases are(
3. /ACB detected as an ACB the network starts afresh with new data in the HA! process. The
datablcok is discarded in the network and lost. etransmission is leftp up to hi'her layers
;. ACB is detected as a /ACB( If the network retransmits the data block$ the 6# will re1send an ACB
to the
network. If in this case the transmitter at the network sends an abort indicator by incrementin' the
/ew Packet
Indicator$ the receiver at the 6# will continue to process the data block as in the normal case.
?. If a CC error on the H.1.CCH is detected$ 6# receives no data and sends no status report. If the
absence of the
status report is detected$ /- can retransmit the block.

H.6PA
H.6PA is applied to the uplink between the 6# and /ode+. H.6PA uses similar technolo'ies as
H.2PA with differences in the links. This measn that the 6. has an encreased of speed in the uplink
with a therical maCim of %AC1e rate of 7.D? %bit/s :;=
%ain features(
A. ; ms short frame( It enables less TT *ound Trip Time) in HA! process$ wich is controlled by
the /ode+. It also shortens the shedulink response time.
+. HA! at the physical layer$ used to achieve rapid retrasnmissions for erroneous packets between
6# and /ode+
C. /ode+ controlled 69 fast schedulin'$ used to encrease resource utili0ation and efficiency.
H.6PA Architechture
:"rom A/ H.6PA 2escription$ Huawei Technolo'ies ;44<=
H.6PA is implemented in the followin' ways(
3. A new %AC entery is added to 6# below the %AC1d to handle retrasnmission$ schedulin'$ %AC1e
multipleCin' and #12CH trasnport format combination *#1T"C) selection.
;.A new %AC entety is added to /ode+ to handle HA! retrasnmission$ schedulin' and %AC1e
multipleCin'.
?.A new %AC entety is added to ./C to combine si'nals from different /obe+ in soft handover and
deliver data to the %AC1d in se&uence.
@. A new trasnport hannel *#12CH) is added to transfer data blocks between /ode+$ %AC1e and
./C %AC1es
The key technolo'ies of H.6PA are(
HA!$ short TTI and fast schedulin' with these$ H.6PA provides a maCimum uplink %AC1e rate of
7.D? %bit/s wich encreases the cell throu'hput. As we mention before$ HA! is a multiservice .top1
And1-aith *.A-) protocol. "or every H.6PA user$ an HA! entety is present on both the 6# and
/ode+.
HA! #ntety
In the 6#$ the HA! entety is located in the %AC1e/%AC1e$ the HA! #ntety can store the %AC1e
paloads and retransmit them. In the /ode+ the HA! entety s located in the %AC1e$ each process is
responsible for 'eneratin' ACB and /ACB$ wich indicates the status of the #12CH transmissions.
Combinin' %odes of HA!
HA! supports two codin' combinin' modes(
3. Chase combinin'$ which retransmits the same bit set.
;. Incremental edundancy$ that retransmit a different set of bits
edundancy version
2efines the selection of bits that can be transmitted on the air interface resource which is know as the
rate matchin' pattern.
eferences
:3= Eohan oman$ Hybrid A! .chemes for future wireless systems based on %C1C2%A$ -ireless
.ystems and Al'orithms
.T%icroelectronics /.F
?>$ chemin du champ des filles 3;;< Plan1les1Ouates/Geneva$ .wit0erland
:;= ?GPP The %obile +roadband standard$ H.PA$ :%ay ;=
http(//www.?'pp.or'/technolo'ies/keywords1acronyms/>>1hspa
:?= 6niversal %obile Telecommunications .ystem *6%T.)H
Hi'h .peed 2ownlink Packet Access *H.2PA)H
Overall descriptionH
.ta'e ;$ elease 34$ pp ??
:@= 2imitrios Boutsonikolas
$ I. Charlie Hu
$ .chool of #lectrical and Computer #n'ineerin'
Center for -ireless .ystems and Applications
Purdue 6niversity$ -est 9afayette$ I/ @D>4D$ The Case for "#C1based eliable %ulticast in -ireless
%esh /etworks
:7= Huawei Technolo'ies$ ;44< #dition$ Chapter ? pp ?13