Académique Documents
Professionnel Documents
Culture Documents
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.
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
As a result, N-channel S&W achieves better Our simulations are based on simulator of ARQ
performance than SR in UMTS. Simple advantage schemes and its enhancements for simulating
against SR is making transmission robust over convolutional codes. It was created and developed at
repeating errors in one of N channels. If an error KTL FEI STU in Bratislava.
occurs in one channel, other channels may keep on This simulator was primarily intended for
transmitting data. Another reason for employing simulation of pure ARQ schemes [6]. Its
S&W protocol is its simplicity, which allows using modifications enabled it for simulations of hybrid
schemes like Chase combining and Incremental ARQ schemes using Reed-Solomon codes,
redundancy. Even more MAC-hs (Medium access convolutional codes and punctured convolutional
control-high speed) layer is able to allocate all codes. We are using module SOFT-DECISION
channels for one user when radio conditions are VITERBI DECODER which works for AWGN
good. This strategy puts strict criteria on acceptable channel, codes with base rate ½ and codes derived
delays. Transmitter must be ready to resend packet from this mother code applying puncture patterns.
just N-1 intervals after previous transmission. Our modification is inserted before decoding
module while applying combining mechanism of
different puncture patterns in IR and after decoding
3. CHASE COMBINING & IR MODELS module while combining same not decodable
versions in CC.
Fundamental principles of CC and IR are
depicted in Fig. 2, Fig. 3. Original version of data 4.1 Channel model with independent error
block is numbered 1, retransmitted is marked 2. In occurrence
CC, retransmitted version is identical to original and
both of them are combined after receiving (in case This model assumes that errors origination in
when second version was not decodable without transport channel is not dependent i.e. each binary
combination). As a result SNR (Signal to Noise symbol is received in error with the same error
Ratio) is increased and final throughput is higher [2]. probability Pb, without influence of previously
received symbols. In this simulation, we are using
AWGN channel model because of its simplicity.
Information Transmitted Received Combined Recovered
bits packet
R
4.2 Relative bit throughput
1 Error detection
NACK Key value, which is used for comparison of
+
single HARQ techniques, is relative bit throughput.
2
On the physical basis, block throughput is defined
as:
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 all bits in second version in case of unsuccessful
decoding of first one. This is the mean we created
In HSDPA convolution and turbo codes are used. 1-2-restart combining for IR. 1-2-3-restart
Base rate of turbo encoder for HSDPA is 1/3. We combining was simulated like application of CC
have available convolution encoder with base rate ½. scheme on data stored in receiver after incoming and
Codes with various rates are obtained by applying decoding of first two versions in 1-2-restart
puncturing patterns. combining scheme for IR.
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
0.04
4.7 Chase Combining
0.03
flushed. Disadvantage of our simulator is that it is Fig. 4. Chase combining on hybrid S&W
unable to change simulated SNR while delivering
versions of the same packet. We can only rely on Blue colour depicts simulations without CC, i.e.
random simulator of Gaussian noise. with only one version for decoding in the receiver.
Red and black colour shows combinations of
4.8 Incremental Redundancy identical copies of the same data block with two or
three used versions.
Principle of this strategy is repeating differently We can see that after CC was applied, schemes
punctured versions of blocks encoded by which had originally lower correcting ability (lower
convolution code and consecutive combination in constraint length L) start to transmit data at lower
the receiver before decoding. We implemented self SNR than schemes with originally higher correcting
decodable IR. ability.
Software implementation of this strategy was Most notable is example of code (2, 1, 3) with
done by using puncture pattern in first version and 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
0.06
ACKNOWLEDGEMENT
0.04
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