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.
HARQ
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. 0ith I every time there is a retransmission the puncturin' is
modified without modifyin' the number of bits punctured. This process increases 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
allows the decoder the ability to combine multiple copies of the decoded packet measured by
its respective 12 before bein' decoded. This method causes diversity 'ain and is simple to
utili3e. In soft4combinin' 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'.
FEC
"#C has shown been a useful tool by deliverin' reliability on the Internet$ for this reason "#C
is bein' utili3ed on wireless networks$ nonetheless wireless networks differ from wire4line
networks. In wireless we have+ multi4path and interference due to obstacles form the
transmitter to the receiver causin' losses incapacitatin' the defectiveness of "#C (5*. In "#C
process the transmitter sends a ran'e of packets with the same information -redundant
encoded packets, in order to assure 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!.
6espite of the fact that "#C is &uite useful is not )77 per cent reliable$ for this reason several
techni&ues have been developed combinin' A! and "#C in order to overcome the flaws
that presents by itself.
HSDPA & HSUPA
H16PA and H18PA are technolo'ies that belon' to the H1PA -Hi'h41peed Packet access,
family. H1PA is an up'rade to 0C6%A network -"66 and T66, in order to increase the
performance of data packets. This up'rade was made in steps by first H16P in release 9 and
then H18PA in release :(;*. The main purpose of these technolo'ies is to increase the speed
in the uplink -H18PA, and downlink -H16PA,
HSDPA - High-Speed Downlink Packet Access
H16PA 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 H1461CH -Hi'h 1peed
6ownload 1harin' Channel$ used by the 8# for downlink, which is terminated on 2ode.. In
H16PA soft combinin' is used$ meanin' that the faulty T. -Transport .lock$ carries data in
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' (<*.
"#C
"#C channel codes are used to improve the ener'y of wireless systems. On H16PA the
transmitter side adds redundancy -in HA! errors are corrected by addin' "#C bits$ auto fi=
correction, to the #6 -#rror 6etection, bits$ in such way that the reasonable number of errors
can be corrected$ on the receiver side the information is decoded by usin' "#C once more
(>*$ as for H18PA the "#C process is similar ()7*. 0hen usin' HA! there is a reduction of
transmissions$ however each transmission carries redundant information.
HA! is based on synchronous downlink and uplink schemes. This is based on I. The
8TA2 must take into account the 8# soft memory capability when confi'urin' the different
transport formats includin' possible multiple redundancy version for the effective code rate
and when selectin' transport formats for transmission and retransmission.
HA! works faster than A!$ HA! is used per T.$ while A! is used per ?C P68
-adio ?ink Control$ used for error reduction between 8# and 2ode.,. HA! is used for non4
real4time and real time services. 2on the less A! is still useful when HA! fails in non4real4
time services (<*.
H16PA Architecture
("rom A2 H16PA 6escription$ Huawei Technolo'ies ;77@ (9**
H16PA is implemented in the followin' ways+
). The ?C and %AC4d -6edicated channels$ 'rant access to dedicated transport channels,
have not chan'es.
;. "rom the 12C -1ervin' adio 2etwork Controller$ allows mobility for the user and
connects to the Core 2etwork, to the C2 the H1461CH "P -"rame protocol, controls the
data transport.
<. The %AC4hs -Hi'h 1peed$ retransmits erroneous blocks and delivers data to the upper
layer, is added at the %AC layer of the 8# and 2ode..
5. 8TA2 %AC protocol confi'urations+
A. %AC4c/sh -Common A 1hared Chennels$ controls the data carried on the Common
and 1hared Chennels,$ confi'urations+ "low control between %AC4d %AC4c/sh$ and %AC4hs
is accomplished by %AC4c/sh
.. 0ithout %AC4c/sh confi'uration+ The flow control between between %AC4hs and %AC4d
over Iub/Iur -Iub interface between the 2C and the 2ode .$ Iur+ lo'ical interface between
two 2Cs, is done by %AC4hs and H1461CH "P
1i'nalin'
8plink+ A report is used to identify ACB or 2ACB
6ownlink -1hared control channel si'nalin', parameters++
A. #very HA! process is assi'ned an I6
.. 6ata indicator$ distin'uishes data blocks (<*.
#rror handlin'
). 2ACB detected as an ACB. The datablock is discarded and lost. etransmission is left for
the hi'her layers.
;. ACB is detected as a 2ACB+ If the network retransmits the data block$ the 8# will re4send
an ACB to the network.
<. If a CC error on the H141CCH is detected$ the 8# desnCt receive data and does not send
status report. If theres is not status report$ the network retransmits the block.
HSUPA - High-Speed Uplink Packet Access
H18PA is applied to the uplink between the 8# and 2ode.. H18PA uses similar technolo'ies
as H16PA with differences in the links. This means that the 8u -adio interface between
8TA2 and the 8ser #&uipment, has an increased of speed in the uplink with a theorical
ma=im of %AC4e rate of 9.D< %bit/s (;*
%ain features+
A. ; ms short frame+ It enables less TT -ound Trip Time, controlled by the 2ode.. It also
shortens the schedulin' response time.
.. HA! at the physical layer$ used to achieve rapid retransmissions for erroneous packets
between 8# and 2ode.
C. 2ode. controlled 8? fast schedulin'$ used to increase resource utili3ation and efficiency.
H18PA Architecture
("rom A2 H18PA 6escription$ Huawei Technolo'ies ;77@ (9**
H18PA is implemented in the followin' ways+
). A new %AC entity is added to 8# below the %AC4d to handle retransmission$ schedulin'$
%AC4e multiple=in' and #46CH transport format combination -#4T"C, selection.
;.A new %AC entity is added to 2ode. to handle HA! retransmission$ schedulin' and
%AC4e multiple=in'.
<.A new %AC entity is added to 12C to combine si'nals from different 2obe. in soft
handover and deliver data to the %AC4d in se&uence.
5. A new transport channel -#46CH, is added to transfer data blocks between 2ode.$ %AC4e
and 12C %AC4es
The key technolo'ies of H18PA are+
HA!$ short TTI and fast schedulin' with these$ H18PA provides a ma=imum uplink %AC4e
rate of 9.D< %bit/s which increases the cell throu'hput. As we mention before$ HA! is a
multiservice 1top4And40ait -1A0, protocol. "or every H18PA user$ an HA! entity is
present on both the 8# and 2ode..
!D-"!E
"#C
"#C is an error control mechanism for real4time data transmissions. In order to have a
reconstruction of data the transmitter adds redundant information in the packets. A!
assures a reliable transmission of data$ the drawback of this method is that if the channel is
bad delays occurs which cannot be tolerated for time4sensitive applications like voice. Takin'
into account the advanta'es and drawbacks of A! and "#C$ HA! was developed$
deliverin' reliable and real time services over the channel (D*.
Process+
T= encodes the data usin' "#C$ = decodes the information after receivin' them by usin'
"#C. If the = could decode the data it sends an ACB to T= otherwise it sends 2ACB. If T=
receives 2ACB it retransmits the packet$ otherwise sends the ne=t packet.
HA!
HA! is achieved at the %AC layer and corrects erroneous T.s$ for this reason re&uires
redundant transmissions and delays for the data that receives as well as for the
acknowled'es. In ?T# the 6? is asynchronous so the HA! occur at any time and the
schedulers are processed in the e2ode. in order to improve the HA! process$ respectin'
the 8#$ it transmits the acknowled'es dependin' on the T.s received throu'h the 6? HA!
process (:*.
The TT -ound Trip Time$ is the time that a si'nal takes to 'o from one point to the other
and comeback$ in this case the HA! process, in "66 is fi=ed. The TT in T66 depends on
the 8P and 6? confi'uration -Table).), due to each subframe are separated in the time
domain -the e2ode. or the 8# have to wait for a frame to be available before the
transmission occurs,$ for this reason the HA! TT is different at each subframe$ 5 bits are
used to identify the process.
T66 6?/8? confi'uration
The delays that occur at the arrivals of ACB/2ACB and retransmissions$ makes the need to
define a number of HA! process to keep track of the data flow$ which in turn dependent on
confi'urations that 'o from 54)9 (@* havin' each HA! process its own process I6.
Table).)
TDD DL/UP
Configuration
Number of H-ARQ Process (DL) Number of H-ARQ Process (UP)
0 !
" !
# "0 #
$ % $
"# #
& "& "
' ' '
"or a confi'uration of ) in the 8P we have 5 ma=imum HA! process per frame.
"or a confi'uration of ) in the 6? we have D ma=imum HA! process per frame.
1ynchronous and Asynchronous HA!
6? and 8? transmit feedback after a determined time. As for the retransmissions for 8P and
6? is different. 8? uses synchronous which is fi=ed. "or 6? asynchronous is used to make
way for the retransmission occur at any time.
HA! feedback in 6?
The HA! feedbacks have to be retransmitted because no always the number of subframes
is the same for 8? as for 6?. If the number of subframes is bi''er than 8?$ many 6? HA!
feedbacks have to be bunched in a sin'le 8? subframe. "or this reason the retransmission
time after bein' received a feedback is bi''er in T66 than in "66$ so in conse&uence HA!
TT is lar'er.
Re#e$ences
()* Eohan oman$ Hybrid A! 1chemes for future wireless systems based on %C4C6%A$
0ireless 1ystems and Al'orithms 1T%icroelectronics 2.F <>$ chemin du champ des filles
);;@ Plan4les4Ouates/Geneva$ 1wit3erland
(;* <GPP The %obile .roadband standard$ H1PA$ (%ay ;*
http+//www.<'pp.or'/technolo'ies/keywords4acronyms/>>4hspa
(<* 8niversal %obile Telecommunications 1ystem -8%T1,H
Hi'h 1peed 6ownlink Packet Access -H16PA,H Overall descriptionH 1ta'e ;$ elease )7$ pp
<<
(5* 6imitrios Boutsonikolas$ I. Charlie Hu$ 1chool of #lectrical and Computer
#n'ineerin'Center for 0ireless 1ystems and Applications Purdue 8niversity$ 0est ?afayette$
I2 5D>7D$ The Case for "#C based eliable %ulticast in 0ireless %esh 2etworks
(9* Huawei Technolo'ies$ ;77@ #dition$ Chapter < pp <4)
(:* %inseok Bim$ 1un'bon' Bim$ and Ion'hoon ?im$ An Implementation of 6ownlink
Asynchronous HA! for ?T# T66 1ystem$ Test and %easurement Al'orithm 6evelopment
Team$ Innowireless$
1eon'nam4si$ Gyeon''i4do$ 5:<4577$ 1outh Borea
#mail+ Jminseok$ sammet$ yhlimKLinnowireless.co.kr
(D* #nhancin' "#C Application in
?T# Cellular 2etworks$ Antonios Ale=iou2$ Christos .ouras1,2$ Fasileios Bokkinos1,2$
Andreas Papa3ois1,2$ Geor'ia Tseliou1,2,1 esearch Academic Computer Technolo'y
Institute, 2 Computer #n'ineerin' and Informatics 6epartment$ 8niversity of Patras, Patras$
Greece, ale=iuaLceid.upatras.'r$ bourasLcti.'r$ kokkinosLcti.'r$ papa3oisLceid.upatras.'r$
tseliouLcti.'r
(@* Arunabha Ghosh$ "undamentals of ?T#$ ;7)) #dition$ Prentice Hall$ Chapter D A Chapter
@
(>* H16PA 4 Hi'h 1peed 6ownlink Packet Access
#valuatin' HA! with 1oft Combinin' for H16PA$ 6aniel Arenha'e$ Eoel Pettersson$
Peyman .ara3andeh$ Andre ?as3lo
%P2#T$ %PCO%$ %P2#T$ %P2#T
farenha'e$ petMoe$ peymanb$ andrel'Lstudent.chalmers.se
()7* Moritz Harteneck, S%S!E& "E'E" DES()* C+*S(DERA!(+*S F+R HSUPA USER
EQU(P&E*!, 8bi2etics Test 1olutions / An Aerofle= Company
Cambrid'e Technolo'y Center$ oyston$ Herts$ 1G@ :6P$ 8nited Bin'dom
email+ morit3.harteneckLaerofle=.com