http://jecei.srttu.

edu

Journal of Electrical and Computer Engineering Innovations
JECEI, Vol. 1, No. 1, 2013
Regular Paper

29
J. Elec. Comput. Eng. Innov. 2013, Vol. 1, No. 1, pp. 29-34
SRTTU
Rateless Coding over Wireless Relay Networks Using
Amplify/Decode and Forward Relays
M. Shirvanimoghaddam
1,*
and S. Movassaghi
2
1
The 0niveisity of Syuney, Syuney, NSW, Austialia,
2
The 0niveisity of Technology, Syuney, NSW, Austialia,
*Coiiesponuing Authoi: Nahyai.shiivanimoghauuamsyuney.euu.au


ARTICLE INFO

ABSTRACT

ARTICLE HISTORY:
Receiveu 1S Septembei 2u12
Reviseu 1S August 2u1S
Accepteu 22 August 2u1S
In this papei two uiffeient iateless tiansmission schemes aie uevelopeu.
In the pioposeu scheme, ielay noue can uecoue anu foiwaiu the message
to the uestination if they aie able to uecoue it, oi amplify anu foiwaiu the
message to the uestination. Baseu on the analysis anu simulation iesults
pioviueu in this papei, the pioposeu methou has bettei tiansmission
time than the scheme which only the ielay noues that have alieauy
uecoueu the message paiticipate in the seconu phase. Bue to the
simplicity of the amplify anu foiwaiu tiansmission, auuing this featuie to
the netwoik can iesult in bettei peifoimance without any auuitional
complexity.

KEYWORDS:
Relay netwoiks
Becoue anu foiwaiu stiategy
Rateless coues


1. INTRODUCTION
Fiom the fiist iealization of iateless coues, fountain
coues such as LT anu Raptoi coues weie uesigneu foi
the puipose of efficient anu ieliable tiansmission ovei
eiasuie channels (such as in the Inteinet) |1, 2j. In
contiast to LBPC coues, which aie capable of
achieving capacity ovei the binaiy eiasuie channel
(BEC) only when the tiansmittei anu the ieceivei
know the channel state infoimation (CSI) a piioii |2j,
fountain coues have been shown capable of
univeisally achieving capacity ovei BEC without any
CSI available at tiansmittei oi ieceivei. In iecent
yeais, fountain coues have been stuuieu in use foi the
binaiy symmetiic channel (BSC), the auuitive white
uaussian noise channel (AWuNC) anu the fauing
channel |S- 6j.
0ne special bianch of ieseaich on fountain couing
ovei wiieless channels is using fountain coues in a
wiieless netwoik with coopeiative ielays. The fiist
fiamewoik to use fountain coues in coopeiative
communications was pioposeu by Castuia anu Nao in
|7j. Following |8j, the iateless fiamewoik pioposeu in
|7j was baseu on a quasi-static Rayleigh fauing ielay
channel, wheie the channel gains iemain constant
ovei the peiiou of an entiie coue woiu tiansmission
that might last foi seveial thousanu channel uses, anu
changes inuepenuently fiom one coue woiu to the
next.
When the numbeis of ielays in the netwoik have
incieaseu, the iateless couing uesign anu coopeiative
schemes will be even moie challenging. In |1uj, the
optimization pioblems of a coopeiative scheme in
uecoue anu foiwaiu ielays has been stuuieu. The
iateless coue enables the netwoik to automatically
select the best souice-ielay channel, aftei which the
seconu phase begins, i.e. foiwaiuing the message to
the uestination, staits anu so one oi moie ielays can
uecoue the message. If ielays in the netwoik can use
uiffeient iateless coues, then an infoimation
combining uecouei might be useu at the ieceivei.
Following the iuea in |1uj, a queueu coopeiative
communication baseu on iateless couing has been
pioposeu in |11j, in which each ielay is suppoiteu
with a buffei anu all messages have been buffeieu
until being tiansmitteu. Consiueiing an infinitely laige
buffei in |11j with no contiol on queueu message in
ielays can leau to a veiy laige uelay in the netwoik.
The pioblem of contiolling the queue size of the ielays
has been auuiesseu in |12j, anu the system stability
has also been analyseu.
M. Shirvanimoghaddam et al.
30
In |1Sj, an efficient message ielaying scheme has
been pioposeu baseu on which soft uecouing is maue
possible in the ieceivei siue. Bue to giaph baseu
uesign of iateless coues anu the uecouing algoiithm
such as message passing algoiithm, in the case of
using iateless coues soft uecouing can be applieu in
ielays. In |14j, the pioblems ielateu to optimal
message combination in the ieceivei siue using
iateless coue have been stuuieu, anu it is shown that
the affiliation of infoimation combining (IC) anu
eneigy combining (EC) methous have bettei uelay anu
eiioi peifoimance than when being solely useu. It is
impoitant to note that combining the methous in |14j
iequiies the CSI to be at the tiansmittei.
Issue of amplify-foiwaiu iateless couing ovei ielay
netwoiks has not been auuiesseu in eailiei woik. In
the cuiient papei, two iateless tiansmission schemes,
namely the uecoue-foiwaiu iateless tiansmission anu
uecoue-amplify-foiwaiu iate less tiansmission, aie
pioposeu anu compaieu in teims of the aveiage
successful uecouing time at the uestination.
The iest of the papei is oiganizeu as follows. In
section II, we uesciibe the basic system mouel anu the
assumptions unueilying oui analysis. Section III
uesciibes the uecoue-foiwaiu iateless tiansmission
scheme. Subsequently, uecoue-amplify-foiwaiu
iateless scheme is uevelopeu in section Iv. Simulation
iesults aie shown in section v, anu finally, Section vI
concluues the papei.
2. SYSTEM MODEL
Fig. 1 shows the basic system mouel of a ielay
netwoik. A souice wants to tiansmit a message
consisting of m packets to the uestination via N
paiallel uecoue-anu-foiwaiu ielays. We consiuei that
each oiiginal packet has banuwiuth-noimalizeu
entiopy H (natsBz). In oiuei to simplify the notation,
we assume that the uestination is not capable of
obtaining infoimation uiiectly fiom the souice,
though inclusion of such a uiiect path in the
peifoimance analysis is stiaightfoiwaiu.
All noues opeiate in half-uuplex moue, i.e., they can
eithei tiansmit oi ieceive, howevei, not
simultaneously. In the following, we also assume the
tiansmission is uone thiough a uiiect-sequence
spectium spieauing technique. Such an appioach is
useful foi sensoi netwoiks as it allows uiffeient
infoimation stieams to be tiansmitteu in a flexible
anu uecentializeu way, as well as being
uistinguishable at the ieceivei. The tiansmission
powei of all noues is uefineu by PT. The piopagation
channels between the uiffeient noues aie mouelleu as
fiequency-flat, block-fauing channels. The channel

Figuie 1: System mouel with one souice, N paiallel ielay
noues anu one uestination
gains aie inuepenuent anu exponentially uistiibuteu,
which coiiesponus to Rayleigh fauing of theii
amplituues. In the Rayleigh fauing mouel, the
piobability uensity function (puf) of the instantaneous
channel SNR _ can be chaiacteiizeu as:

(y) =
1
y
exp_
y
y
] , or y u (1)
We assume that uiffeient ielay noues can use the
same iate less coue oi uiffeient ones. At the
uestination noue, Rake ieceivei is useu anu then
uiffeient signals that aie ieceiveu fiom uiffeient paths
(tiansmitteu fiom uiffeient ielay noues) aie
combineu accoiuing to the maximum iatio combining
ciiteiia oi Infoimation combining ciiteiia.
3. DECODE-FORWARD (DF) RATELESS TRANSMISSION
Initially, each packet, containing H infoimation
symbols, is encoueu into an infinitely laige numbei of
bits using a iateless coue anu is then tiansmitteu.
Each ielay noue then tiies to uecoue the message.
Accoiuing to the pieueteimineu value of L, the souice
keeps on tiansmitting until L ielay noues can
coiiectly uecoue the message anu aftei ieceiving the
Lth acknowleugment message fiom the ielay noues,
the souice stops its tiansmission. In the seconu phase,
the L ielay noues that coulu have uecoueu the
message in the fiist step, ie-encoue the message anu
then tiansmit it to the uestination. Fiist, we consiuei
all ielay noues to tiansmit the souice uata encoueu
with the same iateless coue, which can be the same as
the one useu by the souice. We also assume that the
Rake ieceivei is useu to accumulate the eneigy fiom
the signals tiansmitteu by uiffeient noues.
Aftei uecouing the message, the uestination senus
an acknowleugment, anu ielay noues stop theii
tiansmission anu the souice tiansmits the next
packet. The goal is to compute the aveiage successful
uecouing time at the uestination. Tiansmission fiom
souice to uestination is uone in two steps. We can
calculate the aveiage time the uecouing takes in the
Rateless Coding over Wireless Relay Networks using Amplify/Decode and Forward Relays
31
J. Elec. Comput. Eng. Innov. 2013, Vol. 1, No. 1, pp. 29-34
fiist step as follows.
Accoiuing to Shannons theoiem of the channel
capacity, the time, ti which ielay i iequiies to uecoue
the message is calculateu as below:
t

=
E
log (1 +y

)
, or y

u (2)
Bue to exponential uistiibution of i, we can
calculate the uistiibution of ti as follows:

t
i
(t) =
E
y t
2
exp_
1
y
+
E
t

c
H
t
y
_, or t u (S)
We shoulu finu the time the Lth noue iequiies to
uecoue the message. Following the pioceuuie in |1uj,
the uistiibution of the time that the Lth ielay can
uecoue the message is:

t(L)
(t) =
N!
(L-1)!(N-L)!

t
(t)|F
t
(t)]
L-1
|1 F
t
(t)]
N-L
(4)
wheie Ft(t) is the cumulative uistiibution function
(CBF) of the ianuom vaiiable t calculateu as in (S).
F
t
(t) =
1
E
exp_
1
y

c
H
t
y
_, or t u (S)
Relay noues use similai iateless coues, anu a Rake
ieceivei is useu at the uestination noue foi optimal
combining. We assume ielay noues tiansmit with
equal eneigy. Baseu on this assumption, the effective
SNR of the channels is:
z
c]]
= z

L
=1
(6)
Accoiuing to the fact that the SNR of each channel
is an exponential ianuom vaiiable, the effective SNR is
also a ianuom vaiiable with Gamma (L, ) uistiibution.
The iequiieu time foi the seconu phase can be
calculateu by (7).
s =
E
log (1 +z
c]]
)
(7)
Anu the piobability uistiibution function of s is:

s
(s) =
E
(I 1)! z
L
s
2
(c
H
s
1)
L-1

exp[
1
x

[1 c
H
s
+
H
s
, or s u (8)
Foi the case that the ielay noues use uiffeient
iateless coues the iequiieu time foi the seconu phase
of tiansmission can be calculateu as follows.
s =
E
log (1 +z

)
L
=1
(9)
It is impoitant to note, in this case, infoimation
combining ieceivei is useu at the uestination.
4. DECODE OR AMPLIFY-FORWARD (DAF) RATELESS
TRANSMISSION
In this case all ielay noues paiticipate in the
tiansmission. The ones that have alieauy uecoueu the
packet encoue it anu then foiwaiu it to the
uestination; anu also the othei ones that weie not able
to uecoue the message, amplify anu foiwaiu it to the
uestination. Bue to the fact that ielay noues can use
uiffeient iateless coues theie aie two possible
iateless tiansmission schemes fiom ielay noues. 0ne
is that the ielay noues which have alieauy uecoueu
the packet use the same iateless coue as the souice is
using. The othei scheme is that these ielay noues use
uiffeient iateless coues. 0bviously, ielay noues that
act as amplify-foiwaiu ielays only foiwaiu the
amplifieu veision of the message to the uestination
anu so, at the uestination an amplifieu veision of the
packet that the souice has encoueu is ieceiveu. In this
papei these two pioposeu schemes aie analyseu anu
compaieu.
A. Same rateless code transmission
It is obvious that the fiist phase of the tiansmission is
similai to the one in the uecoue-foiwaiu iateless
tiansmission scheme that has been pieviously
uiscusseu in section II. As so, we only calculate the
tiansmission time foi the seconu phase. We assume
that the ielay j cannot uecoue the message in the fiist
phase anu so, it shoulu amplify anu foiwaiu the
message to the uestination. The ieceiving signal at
ielay j is shown in (1u).
y
SR
(i) = o
SR
x
s
(i) + n
SR
(i) (1u)
wheie xs is the tiansmitteu signal fiom the souice, SR
anu nSR aie the fauing coefficient anu the auuitive
white uaussian noise of the souice to ielay j channel,
iespectively. The ielay noue noimalizes ySR anu then
tiansmits it to the uestination.
y
R
]
(i) = o
SR
]
o
SR
o
R
_P

x
s
(i) +
o
R
_P

n
SR
]
(i) +n
R
(i)(11)
wheie P

y
is the aveiage signal powei at ielay noue
anu RD anu nRD aie the fauing coefficient anu the

M. Shirvanimoghaddam et al.
32







Figuie 2: Aveiage iequiieu time foi successful uecouing at
the uestination. B=1, N=1u, anu aveiage SNR of all channels
aie 1u uB
auuitive white uaussian noise of the ielay j to
uestination channel, iespectively. Then, the oveiall
SNR of the combineu channel can be obtaineu fiom
(12).
SNR
]
=
y
]
z
]
y
]
+z
]
+1
, (12)
The iequiieu time foi the seconu phase of
tiansmission can be calculateu as follows.
s =
E
log (1 + z

+ SNR

N
=L+1
L
=1
)
, (1S)
B. Different rateless code transmission
In this tiansmission scheme the ielay noues that
have been uecoueu the packet in the fiist phase use
uiffeient iateless coues anu so, at the uestination, the
infoimation combining ieceivei can be useu to uecoue
the message. 0bviously, AF ielay noues amplify anu
foiwaiu the packet that has been uecoue by a iateless
coue at the souice; thus, an eneigy combining ieceivei
shoulu be useu foi packets fiom AF ielay noues. The
iequiieu time foi the seconu phase of tiansmission
can be calculateu as follows.
s =
E
log(1 + SNR

N
=L+1
) + log (1 +z

)
L
=1
, (14)
5. SIMULATION RESULTS
Fig. 2 shows the aveiage tiansmission time foi
N=1u when the aveiage SNR of all channels is 1u uB.
As we can see, BAF iateless tiansmission has bettei
tiansmission time than BF iateless tiansmission in
both scenaiios, i.e., same iateless coue scheme anu
uiffeient iateless coue scheme. Fuitheimoie, theie is
an optimum point foi each giaph which minimize the
aveiage tiansmission time. Foi the same iateless coue
scheme, the optimum L is S foi BF anu 1 foi BAF, anu
foi uiffeient iateless coue scheme, the optimum L is 4
foi BF anu 2 foi BAF.








Figuie S: Aveiage iequiieu time foi successful uecouing at
the uestination. B=1, N=1u, aveiage SNR of S-R channels aie
u uB, anu aveiage SNR of R-B channels aie 1u uB
Fig. S shows the aveiage tiansmission time foi the
case that the aveiage SNRs aie u anu 1u uB foi S-R
anu R-B channels, iespectively. The oveiall
peifoimance of BAF anu BF schemes aie the same,
howevei, the aveiage tiansmission time foi BAF is
optimum when L=1, but foi BF it is optimum when
L=2.
The aveiage tiansmission time foi the case that the
SNR of R-B channel is u uB anu SNR of S-R channel is
1u uB aie shown in Fig. 4. It is obvious that BAF
scheme has bettei peifoimance than the BF one in the
sense of aveiage tiansmission time. Foi laigei SNRs
the peifoimance of two uiffeient pioposeu schemes
aie similai but geneially, the peifoimance of the BAF
iate less scheme is bettei than the BF one anu in
compaiison with the same iate less coue scenaiio, the
uiffeient iate less coue scenaiio has bettei aveiage
tiansmission time in both BF anu BAF iate less
schemes. It is impoitant to note that, uue to the
simplicity of amplify anu foiwaiu tiansmission, using
the ielay noues that coulu not have uecoueu the
message in the fiist phase to amplify anu foiwaiu the
message to the uestination, iesults in lowei
tiansmission time in compaiison with the uecoue anu
foiwaiu tiansmission scheme.
The aveiage eneigy expenuituie foi N=1u in case
the SNR of all channels is 1u uB is shown in Fig. 6. Bue
to the fact that in BF schemes, ielay noues that have
alieauy uecoueu the message in the fiist phase only
paiticipate in the seconu phase, the aveiage eneigy
expenuituie foi BF schemes aie lowei than the one
foi BAF schemes. The aveiage eneigy expenuituie foi
the case that ielay noues use the same iateless coue is
ielatively close foi BF anu BAF schemes, but theie is a
huge gap between them when ielay noues use
uiffeient iateless coues. Noieovei, the optimum value
of L is 2 foi BF schemes anu foi the BAF scheme, it is
6.
Rateless Coding over Wireless Relay Networks using Amplify/Decode and Forward Relays
33
J. Elec. Comput. Eng. Innov. 2013, Vol. 1, No. 1, pp. 29-34








Figuie 4: Aveiage iequiieu time foi successful uecouing at
the uestination. B=1, N=1u, aveiage SNR of S-R channels aie
1u uB, anu aveiage SNR of RB channels aie u uB







Figuie S: Aveiage iequiieu time foi successful uecouing at
the uestination. B=1, N=S, anu aveiage SNR of all channels
aie 1u uB








Figuie 6: Aveiage iequiieu time foi successful uecouing at
the uestination. B=1, N=1u, anu aveiage SNR of all channels
aie 1u uB
6. CONCLUSION
In this papei, two iateless tiansmission schemes have
been uiscusseu anu theii peifoimance has been
analyseu. 0ne scheme use Becoue anu Foiwaiu ielay
noues anu so, the ones that coulu have uecoueu the
message in the fiist phase of the tiansmission
paiticipate in the seconu phase. In the pioposeu
methou, i.e., BAF iateless scheme, all ielay noues can
paiticipate in the tiansmission anu the ielay noues
that have faileu to uecoue the message in the fiist
phase, amplify anu foiwaiu the message to the
uestination. Bue to the fact that ielay noues can use
similai oi uiffeient iateless coues, theie aie seveial
tiansmission schemes that have been analyseu anu
uiscusseu in this papei. Simulation iesults show that
the BAF iateless scheme have bettei tiansmission
time than the BF iateless scheme. These two schemes
aie also compaieu fiom the peispective of aveiage
eneigy expenuituie anu it is shown that the BF
scheme has bettei eneigy expenuituie than the BAF
scheme.
REFERENCES
|1j NacKay, B.}.C, Fountain codes, IEE Pioc.-Commun., vol. 1S2,
No. 6, Becembei 2uuS.
|2j A. Shokiollahi, Raptor codes, in Pioc. IEEE Int. Symp. on
Infoim. Theoiy, 2uu4, p. S6.
|Sj R. Palanki anu }. S. Yeuiuia, Rateless codes on noisy channels,
in Pioc. IEEE Int. Symp. on Infoim. Theoiy, 2uu4, p. S7
|4j 0. Etesami, N. Nolkaiaie, anu A. Shokiollahi, "Raptoi coues on
symmetiic channels," in Proc. IEEE Int. Symp. on Inform.
Theory, 2uu4, p. S8.
|Sj 0. Etesami anu A. Shokiollahi, "Raptoi coues on binaiy
memoiyless symmetiic channels," in IEEE Trans, on Inform.
Theory, Nay 2uu6, vol. S2, pp. 2uSS-2uS1.
|6j }. Castuia anu Y. Nao, Rateless coding over fading channels,
IEEE Commun. Lett., vol. 1u, no. 1, pp. 4648, }an. 2uu6
|7j }.Castuia anu Y.Nao, Rateless Coding for Wireless Relay
Channels, IEEE Tiansaction on Wiieless Communication, vol.
6, No. S, Nay 2uu7.
|8j X.Liu, T.}.Lim, Fountain Codes over Fading Relay Channels,
IEEE Tiansaction on Wiieless Communication, vol. 8, N0. 6,
}une 2uu9.
|9j A.Senuonaiis, E.Eikip, anu B.Aazhang, 0sei Cooperation
Diversity Part I: System Description, IEEE Tiansaction on
Communication, vol. S1, No. 11, Novembei 2uuS.
|1uj A.F. Nolisch, N.B. Nehta, }.S.Yeuiuia, anu }in Zhang,
Performance of Fountain Codes in Collaborative Relay
Networks, IEEE Tiansaction on Wiieless Communication, vol.
6, No. 11, Novembei 2uu7.
|11j N.B. Nehta, v. Shaima, u. Bansal, Queued Cooperative Wireless
Networks with Rateless Codes, IEEE "uL0BEC0N" 2uu8
pioceeuings
|12j u.Bansal, v.Shaima, N.B. Nehta, E.Altman, Relay Load
Balancing in Queued Cooperative Wireless Networks with
Rateless Codes, IEEE ICC 2u1u pioceeuings
|1Sj X.Bao, anu }.Li (Tiffany), Efficient Message Relaying for
Wireless User Cooperation: Decode-Amplify-Forward (DAF) and
Hybrid DAF and Coded-Cooperation, IEEE Tiansaction on
Wiieless Communication, vol. 6, No. 11, Novembei 2uu7
|14j A.Ravanshiu, L. Lampe, }.Bubei, Signal Combining for Relay
Transmission with Rateless Codes, ISIT 2uu9, Seoul, Koiea,
}une 28- }uly S, 2uu9
|1Sj K.}.Rayliu, A.K.Sauek, W.Su, A.Kwasinski, Cooperative
Communications and Networking, Cambiiuge univeisity piess,
2uu9.
|16j T. Richaiuson, R. 0ibanke, Modern Coding Theory,
Cambiiugeuniveisity piess, 2uu8.







M. Shirvanimoghaddam et al.
34
BIOGRAPHIES

Mahyar..Shirvanimoghaddam
ieceiveu the B. Sc. uegiee with the 1st
Class Bonoui fiom Tehian 0niveisity, Iian,
in 2uu8, anu the N. Sc. Begiee with the 1st
Class Bonoui fiom Shaiif 0niveisity of
Technology, Iian, in 2u1u, anu is cuiiently
woiking towaiu the Ph.B. uegiee at The
0niveisity of Syuney, Austialia, all in
Electiical Engineeiing. Bis ieseaich
inteiests incluue couing techniques,
coopeiative communications, compiessive
sensing, anu wiieless sensoi netwoiks. Be is a iecipient of
0niveisity of Syuney Inteinational Scholaiship (0SyuIS) anu
0niveisity of Syuney Postgiauuate Awaius.

Samaneh Movassaghi has completeu
hei B.Sc. uegiee in Electiical Engineeiing
in Electionics majoi fiom 0niveisity of
Tehian in Iian in 2uu9. She staiteu hei
N.Sc at the 0niveisity of Technology,
Syuney in Naich 2u1u. In hei ieseaich
uegiee she has authoieu an IEEE
communication lettei, two confeience
papeis anu two book chapteis. She has
been the ieviewei of a numbei of
confeience papeis anu jouinals. Bei
ieseaich inteiests aie in Bouy Aiea Netwoiks, Auuiess Allocation,
Routing Schemes, Sensoi Netwoiks, NIN0 Communications, Tiaffic
contiol (Queing Theoiy) anu QoS piovisioning in wiieless sensoi
netwoiks.