Characterization of Optimum

Throughput in a Wireless Channel Using

Various Schemes
Fazlay Rabby Reza, Md. Shoaibur Rahman
AbstractIn wireless communication, a channel refers either to a physical transmission medium such as a wire, or to a logical
connection over a multiplexed medium such as a radio channel which is used to convey an information signal, for example a digital
bit stream, from one or several senders (or transmitters) to one or several receivers. This research represents a mathematical and
graphical frame work for maximizing throughput in a wireless fading Channel using packet length, transmission rate, signal to noise
ratio for various modulation scheme. Binary PSK, Differential PSK, Coherent FSK and Non-coherent FSK are the modulation
schemes for this research. The throughput is defined as the number of bits per second correctly received. Trade-offs between the
packet length and the transmission rate are observed, and equations are derived for the optimal choice of these variables. For a
wireless channel, choosing Rayleigh fading channel for this research because there be many scatters present means that Rayleigh
fading can be a useful model in heavily built-up city centers(or barriers) where there is no line of sight between the transmitter and
receiver and many buildings and other objects attenuate, reflect, refract, and diffract the signal.

Index TermsWireless Channel, Optimization, Throughput, Rayleigh Fading channel, Packet length, Transmission rate, Signal-to-
Noise Ratio (SNR).

1 INTRODUCTION
IN
the earl y days of wi rel ess tel egraphy, Marconi
successful l y demonstrated that wi rel ess si gnal s can
cross the Atl anti c and Pacific Oceans. Today, the
rol e of radi o has changed: we are not usi ng radi o
technol ogy merel y to cover l arge di stances, but
rather for i ts fl exi bil i ty and comfort. Short-range
wi rel ess l i nks provi de access to the fi xed
tel ecommuni cati on i nfrastructure. Throughput,
defi ned as the data rate successful l y recei ved, i s a
key measure of quali ty of servi ce (QoS) for wi rel ess
data transmi ssi on systems. Throughput i s affected
by the channel envi ronment such as the di stance
between the transmi tter and recei ver, the fadi ng

..
- Fazl ay Rabby Reza i s wi t h t he D affodi l I nt er nat i onal
U ni ver si t y,D haka,Bangl adesh.

- M d.Shoai bur Rahman i s wi t h U ni ver si t y of A si a Paci fi c,D haka,
Bangl adesh
state of the channel , the noi se and i nterference
power characteri sti cs, the packet si ze, the
transmi ssi on rate, the number of overhead bi ts i n
each packet, the modul ati on technique, and the
channel condi ti ons. From these vari abl es, we can
calcul ate other i mportant quanti ti es such as the
si gnal -to-noi se rati o, the bi nary error rate, and the
packet success rate[1] .

Wi rel ess communi cati ons i s a rapi dl y growi ng
segment of the communi cati ons i ndustry, wi th the
potenti al to provi de hi gh-speed hi gh-qual i ty
i nformati on exchange between portabl e devices
l ocated anywhere i n the worl d. Thi s appl i cati ons
enabl ed by thi s technol ogy i ncl ude mul ti medi a
Internet-enabl ed cel l phones, smart homes and
appl i ances, automated hi ghway systems, vi deo
tel econferenci ng and di stance l earni ng, and
autonomous sensor networks, to name just a few.
However, supporti ng these appl i cati ons usi ng
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 6, JUNE 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 30
wi rel ess techni ques poses a si gni fi cant techni cal
chall enge. Thi s research paper i s anal yzed i n
wi rel ess communi cati ons for voi ce, data, and
mul ti medi a; here these are represented by bi ts.
Then, I characteri ze the wirel ess channel (Rayl ei gh
Fadi ng channel ), regardi ng Packet l ength,
Transmi ssi on rate, Si gnal -to-Noi se Rati o (SNR) [2].
Every wi rel ess system has to combat transmi ssi on
and propagati on effects that are substanti all y more
hosti l e than for a wi red system. Cri ti cal techni cal
bottl enecks i n a wi rel ess l i nk are the capaci ty of the
radi o channel , i ts unrel i abi li ty due to adverse ti me-
varyi ng, mul ti path propagati on and severe
i nterference from other transmi ssi ons, i n
nei ghbori ng cel l s.

Rayl ei gh fadi ng i s a reasonabl e model when there
are many objects i n the envi ronment that scatter
the radi o si gnal before i t arri ves at the recei ver. In a
wi rel ess communi cati on channel , the transmi tted
si gnal can travel from transmi tter to recei ver over
mul ti pl e refl ecti ve paths. Thi s gi ves ri se to
mul ti path fadi ng whi ch causes fl uctuati ons i n
ampl i tude, phase and angl e of arri val of the
recei ved si gnal . For exampl e, the transmi tted
si gnal from the BTS (base transcei ver stati on) may
suffer mul ti pl e refl ecti ons from the bui l di ngs
nearby, before reachi ng the mobi l e stati on whi ch
cause del ay. The del ays associ ated wi th different
si gnal paths i n a mul ti path fadi ng channel change
i n an unpredi ctabl e manner and can onl y be
characteri zed stati sti cal l y. When there are a l arge
number of paths, the central l i mi t theorem can be
appl i ed to model the ti me-vari ant i mpul se
response of the channel as a compl ex-val ued
Gaussi an random process. When the i mpul se
response i s model ed as a zero mean compl ex-
val ued Gaussi an process, the channel i s sai d to a
Rayl ei gh Fadi ng channel .
The model behi nd Ri ci an fadi ng i s si mi l ar to that
for Rayl ei gh fadi ng, except that i n Rician fadi ng a
strong domi nant component i s present. Thi s
domi nant component can for i nstance be the l i ne-
of-si ght wave[3][4].

2 VARIOUS ASPECTS FOR THIS WORK
2.1 Concepts
System throughput (T) i s the number of payl oad
bi ts whi ch means the essenti al data that i s bei ng
carri ed wi thi n a packet or transmi ssi on uni t per
second recei ved correctl y. If the payl oad
transmi ssi on rate i s (KR/L) and the packet success
rate f() which defined as the probability of
recei vi ng a packet correctl y .so i t can be wri tten i n
the terms of bi ts per second,
) ( Rf
L
K
T =
(2.1)
Thi s probabi l i ty i s a functi on of the si gnal -to-noi se
rati o which can be defi ned as
R N
P
N
E
b
0 0
= = (2.2)
Here, Eb = P/R joul es i s the recei ved energy per bi t.
We wil l l ook at maxi mi zi ng the throughput i n a
Gaussi an whi te noi se channel and Rayl ei gh Fadi ng
Channel wi th respect to the transmi ssi on rate and
packet l ength.
Modul ati on i s the process of faci li tati ng the
transfer of i nformati on over a medi um. Sound
transmi ssi on i n ai r has l i mi ted range for amount of
power our l ungs can generate. To extend the range
of our voi ce can reach; we need to transmi t i t
through a medi um other than air, such as a phone
l i ne or radi o. The process of converti ng
i nformati on so that i t can be successful l y sent
through a medi um (wi re and radi o waves)i s cal l ed
modul ati on.
2.2 Parameters

The transmi tter, operati ng at R b/s, sends data i n
packets. Each packet contai ns L bi ts i ncl udi ng a
payl oad of K bi ts and a cycli c redundancy check
error-detecti ng code wi th C bi ts. A forward error
correcti on encoder produces the remai ni ng L-K-C
bi ts i n each packet. The channel adds whi te noi se
wi th power spectral densi ty No watts/Hz and the
si gnal arri ves at the recei ver at a power l evel of P
watts. In thi s research paper I assume to be the
sum of al l noi se and i nterference, whi ch can be
model ed as Gaussi an whi te noi se. The CRC
decoder detects transmi ssi on errors and generates
acknowl edgments that cause packets wi th errors to
be retransmi tted. Tabl e 1 di spl ays a summary of
the vari abl es i n our anal ysi s and thei r uni t,
notati on. [5]

JOURNAL OF COMPUTING, VOLUME 4, ISSUE 6, JUNE 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 31
TABLE 1
VARIABLES IN ANALYSIS
Symbol Quanti ty Uni t Val ue

Si gnal to
Noi se Rati o
dB 10/Vari ed
wi th
Transmi ssi on
Rate
P Recei ved
si gnal power
Watts
5*
9
10

W
No Recei ver
noi se power
spectral
densi ty
W/Hz

15
10

W/Hz
R Bi nary
transmi ssi on
rate
bi ts/s Varied
L Packet si ze bi ts Varied
CRC Cycl ic
Redundancy
Check
bi ts 16bi ts
We have used some equati ons for opti mi zi ng
throughput and si mul ated those i n MATLAB and
then observed the resul ts i n graphi cal
representati on i n MATLAB wi ndow. By anal yzi ng
these graphi cal representati ons we wi l l suggest
opti mal range for throughput i n each channel on
each condi ti on.

2.3 Assumptions
Thi s anal ysi s i ncl udes the fol l owi ng si mpl i fyi ng
assumpti ons on whi ch we anal yze :
The CRC decoder detects all errors in the output
of the FEC decoder.
Transmission of acknowledgments from the
recei ver to the transmi tter i s error free and
i nstantaneous.
In the presence of errors, the system performs
sel ecti ve repeat ARQ retransmi ssi ons.
The received signal power is P watts, either a
constant or a random vari abl e wi th a Rayl ei gh
probabi l i ty densi ty functi on, representati ve of
fadi ng wi rel ess channel s.
The bi t rate defi nes the rate at which i nformati on
i s passed.
The baud (or si gnal i ng) rate defi nes the number
of symbol s per second.
Each symbol represents n bi ts, and has M si gnal
states, where M = 2n.
Thi s i s cal l ed M-ary si gnali ng.
The maximum rate of information transfer
through a baseband channel i s gi ven by: Capaci ty=
2 W l og2M bi ts per second; where W = bandwi dth
of modul ati ng baseband si gnal .

3 EQUATION DERIVATIONS & MODULATION
SCHEMES
In order to achi eve an effi ci ent communi cati on i n
wi rel ess channel each part of the communi cati on
l i nk must be careful l y desi gned based on the
properti es of the ti me conti nuous channel. Such an
approach i s di sti nct from one to another. Note that
Rayl ei gh fadi ng i s a smal l -scal e effect. There wil l
be bul k properti es of the envi ronment such as path
l oss and shadowi ng upon whi ch the fadi ng i s
superi mposed. In Rayl ei gh Fadi ng Channel ,
Crucial i n thi s devel opment i s how to deal wi th the
deep fades and the rapi d fl uctuati ons of the
recei ved si gnal power. To reduce the i nfl uence of
the deep fades on the error probabi l i ty, di versi ty
techniques must be used. Coded i nterl eaved
modul ati on can be regarded one such strategy,
where the di versi ty effect ari ses as a resul t of
nearby en-coder output symbol s bei ng subjected to
stati sti call y i ndependent fadi ng. Central i n
achi evi ng thi s i ndependence i s the i nterl eave ,
whi ch spreads the symbol s i n ti me. A hi gher
di versi ty order i s obtai ned i f the encoder output
bi ts, i nstead of symbol s, are i nterl eaved. By al so
usi ng codes of l ower rates, the di versi ty i s
i ncreased even further. To avoi d bandwi dth
expansi on here, the channel symbol constel l ati on
must be expanded accordi ngl y. The resul ti ng
system i s referred to as bi t-i nterl eaved channel
symbol expansi on di versi ty and i s the best l ow-
compl exi ty coded modul ati on scheme presented so
far for the Rayl ei gh fadi ng channel .
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 6, JUNE 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 32
3.1 Condition 1(T vs. R; Fixed L)

To fi nd the transmi ssi on rate, R=R* b/s, that
maxi mi zes the throughput, we di fferenti ate
Equati on (2.1) wi th respect to R to obtai n:
dR
dT
= (K / L) ) ( f + (K / L) R

d
df ) (
dR
d
= (K /
L)
|
|
.
|

\
|
+ ) / (
) (
) (
2
0
R N P
d
df
R f

(3.1)
Next we set the deri vati ve to zero:
) ( f -(P / R N
0
)

d
df ) (
= ) ( f

d
df ) (
= 0 (3.2)
) ( f =

d
df ) (
. (3.3)

We adopt the notati on
*
= for a si gnal -to-noi se
rati o that sati sfi es Equati on (3.3). The
correspondi ng transmi ssi on rate i s
0
*
*
N
P
R

= (3.4)
A suffi ci ent condi ti on for a l ocal l y maxi mum
throughput at R=R* i s:
0
*
2
2
<
=R R
dR
T d
(3.5)
The sol uti on to Equati on (3.3), *, i s the key to
maxi mi zi ng the throughput of a packet data
transmi ssi on. To operate wi th maxi mum
throughput, the system shoul d set the transmi ssi on
rate to R* i n Equati on (3.4). * i s a property of the
functi on, ) ( f , whi ch i s the rel ati onshi p between
packet success rate and si gnal to i nterference rati o.
Thi s functi on i s a property of the transmi ssi on
system i ncl udi ng the modem, codecs, recei ver
structure and antennas. Each system has i ts own
i deal si gnal -to-noi se rati o, * . Dependi ng on the
channel quali ty, refl ected i n the rati o P/No, the
opti mum transmi ssi on rate i s R* i n Equati on (3.4)
[6].
3.2 Condition 2(T vs. L; Fixed R)

Each packet, of l ength L bi ts, i s a combi nati on of a
payl oad (K bi ts) and overhead (L-K bi ts). Because
the packet success rate ) ( f i s a decreasi ng
functi on of L, there i s an opti mum packet l ength,
L*. When L<L*, excessi ve overhead i n each packet
l i mi ts the throughput. When L>L*, packet errors
l i mi t the throughput. When there i s no forward
error correcti on codi ng, whi ch we shal l assume for
the enti rety of thi s chapter, (K=L-C, where C bi ts i s
the l ength of the cycli c redundancy check), there i s
a si mpl e deri vati on of L*. In thi s case,
L
P f )) ( 1 ( ) ( = , (4.1)
Where ) (
e
P i s the bi nary error rate of the
modem. Therefore, i n a system wi thout FEC, the
throughput as a functi on of L i s
T=
L
e
P R
L
C L
)) ( 1 (

(4.2)
To maxi mi ze T wi th respect to L, we consi der L to
be a conti nuous vari abl e and di fferenti ate Equati on
(4.2) to obtai n
) 3 . 4 ( )) ( 1 ( )) ( 1 ln( )) ( 1 (
2
L
e
L
e
P
L
C
R P P
L
C L
R
dL
dT
+

=

Setti ng the deri vati ve equal to zero produces a
quadratic equati on i n L wi th the posi ti ve root:
)) ( 1 ln(
4
2
1
2
1
*
2

e
P
C
C C L

+ = (4.4)
As shown i n Fi gure 4 and 5 (i n whi ch C=16), the
opti mum packet si ze i s a decreasi ng functi on of
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 6, JUNE 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 33
) (
e
P . As the bi nary error rate goes to zero, the
packet error rate al so approaches zero and the
opti mum packet si ze i ncreases wi thout bound.
Because ) (
e
P decreases wi th , L* i ncreases
monotoni cal l y wi th si gnal -to-noi se rati o. Better
channel s support l onger packets. Of course, i n
practi ce L i s an i nteger and the opti mum number
of bi ts i n a packet i s ei ther the greatest i nteger l ess
than L* or the smal l est i nteger greater than L*.
Equati ons (3.3) and (4.4) can be vi ewed as a pai r of
si mul taneous equati ons i n vari abl es L and . Thei r
si mul taneous sol uti on produces the joi ntl y
opti mum packet si ze and Si gnal - to- noi se rati o of
a parti cul ar transmi ssi on system. We wi l l use the
notati on, L** and **, respecti vel y for the joi ntl y
opti mi zed vari abl es[6].
3.3 Modulation Schemes
In communi cati on Engi neeri ng modul ati on i s the
act or process of superi mposi ng the ampl i tude,
frequency, phase, etc., of a wave or si gnal onto
another wave (the carri er wave) or si gnal or onto
an el ectron beam. As i s common to al l di gi tal
communi cati on systems, the desi gn of both the
modul ator and demodul ator must be done
si mul taneousl y. Di gi tal modul ati on schemes are
possi bl e because the transmi tter-recei ver pai r have
pri or knowl edge of how data i s encoded and
represented i n the communi cati ons system. In
di gi tal modul ati on, an anal og carri er si gnal i s
modul ated by a di screte si gnal . Di gi tal modul ati on
methods can be consi dered as di gi tal -to-anal og
conversi on, and the correspondi ng demodul ati on
or detecti on as anal og-to-di gi tal conversi on. A
devi ce that performs modul ati on i s known as a
modul ator and a device that performs the i nverse
operati on of modul ati on i s known as a
demodul ator (someti mes detector or demod). A
devi ce that can do both operati ons i s a modem.
Here, we di scuss about two forms of di gi tal
modul ati on.
Phase shi ft keyi ng, PSK, i s wi del y used these days
wi thi n a whol e raft of radi o communi cati ons
systems. It i s parti cularl y wel l sui ted to the
growi ng area of data communi cati ons. PSK, phase
shi ft keyi ng enabl es data to be carri ed on a radi o
communi cati ons si gnal i n a more effici ent manner
than Frequency Shift Keyi ng, and some other
forms of modul ati on. There are vari ous forms of
PSK- Bi nary PSK and Differenti al PSK are of them.
BPSK i s the si mpl est form of phase shi ft keyi ng . It
uses two phases whi ch are separated by 180and
so can al so be termed 2-PSK. Thi s modul ati on i s
the most robust of al l the PSKs si nce i t takes the
hi ghest l evel of noi se or di storti on.
Differential phase shi ft keyi ng (DPSK) i s a
common form of phase modul ati on that conveys
data by changi ng the phase of the carri er wave. As
menti oned for BPSK there i s an ambi gui ty of phase
i f the constel l ati on i s rotated by some effect i n the
communi cati ons channel through whi ch the si gnal
passes. Thi s probl em can be overcome by usi ng the
data to change rather than set the phase. In a
Rayl ei gh fadi ng channel , the probabi l ity of a bi t
error i s gi ven by: P( ) =
)
`

1
1
2
1
,
) 1 ( 2
1
G +
respecti vel y for these modul ati on
schemes.
Frequency shi ft keyi ng (FSK) i s the most common
form of di gi tal modul ati on i n the hi gh-frequency
radi o spectrum, and has i mportant appl i cati ons i n
tel ephone ci rcui ts. FSK i s a modul ati on scheme
typi cal l y used to send di gi tal i nformati on between
di gi tal equi pment such as tel epri nters and
computers. The data are transmi tted by shi fti ng the
frequency of a conti nuous carri er i n a bi nary
manner to one or the other of two di screte
frequenci es. Coherent FSK and Non-Coherent FSK
are the form of FSK, among vari ous forms. The
probabi l i ty of a bi t error i s gi ven by: P( ) =
)
`

G
G
2
1
2
1
,
G + 2
1
respecti vel y for these
modul ati on schemes. Non-coherent modul ati on
methods do not require a recei ver reference cl ock
si gnal that i s phase synchroni zed wi th the sender
carri er wave. In thi s case, modul ati on symbol s
(rather than bi ts, characters, or data packets) are
asynchronousl y transferred. The opposi te i s
coherent modul ati on.

JOURNAL OF COMPUTING, VOLUME 4, ISSUE 6, JUNE 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 34
4 THROUGHPUT CHARACTERIZATIONS
4.1 Simulation for Condition 1:
Here, we have taken si mul ati on for di fferent
val ues of packet l engths where transmi ssi on rate
vari es wi th throughput. Each graph contai ns four
assumpti ons.
In fi rst fi gure we have noti ced that when the
packet l ength si ze was smal l then the throughput
has reached i ts hi ghest peak wi th hi gher
transmi ssi on rate and al so has fal l en i n a wi de
range. But as soon as the packet l ength has kept
hi gher, then the curve of throughput i s stepper
rather than fl at and the throughput has reached i ts
hi ghest peak at l ower transmi ssi on rate. When we
have i ncreased our packet l ength si ze than before,
then the throughput has reached the maxi mum
peak at a very l ower transmi ssi on rate and al so has
fal l en down qui te qui ckl y. Here, we get maxi mum
throughput at the packet l ength of 50bi ts wi th
108kbps.
In the foll owi ng fi gures we have noticed that these
graphs characteri stic behave l i ke Fi gure 1 onl y the
peak throughput fall en down compared to fi gure
01. The throughput characteri sti cs for Differential
PSK &Coherent FSK al most same .We get l east
peak throughput among al l schemes for Non
Coherent FSK.
4.2 Simulation for Condition 2:
For throughput opti mi zati on for fixed transmi ssi on
rate varyi ng the value of the packet l ength. Each
graph contai ns four assumpti ons where SNR wil l
be changed wi th the val ue of R (Fi gure05-
Fi gure08).
In first graph, peak throughputs are i ncreased wi th
the i ncrease of transmi ssi on rate. But as soon as the
transmi ssi on rate has kept hi gher, then the curve of
throughput stepper rather than fl at and the
throughput has reached i ts hi ghest wi th smal l
packet si ze and has fal l en down i n a short range
respecti vel y. Among four assumpti ons, we get
maxi mum throughput for the transmi ssi on rate of
500kbps (SNR=10).

TABLE 2
MODULATION SCHEMES
Bi nary PSK
Figure 01:Throughput(T) Vs Transmission Rate(R)

Differential PSK
F igure02:Throughput(T) Vs Transmission Rate(R)

Coherent FSK
Figure03:Throughput(T) Vs Transmission Rate(R)

Non coherent FSK

Figure04:Throughput(T) Vs Transmission Rate(R)

JOURNAL OF COMPUTING, VOLUME 4, ISSUE 6, JUNE 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 35
In fi gure 02 & 03 we have noti ced that these graphs
characteri sti c behave li ke Fi gure 01 onl y the peak
throughput decrease compared to fi gure 01. For
opti mi zi ng throughput, the throughput
characteri sti cs for Differenti al PSK &Coherent FSK
al most same .So, we can say that ,the throughput
characteri zi ng nature i s si mi l ar for Bi nary PSK,
Differential PSK and Coherent FSK..
We onl y see the excepti on throughput
characteri zi ng nature for Non Coherent FSK,
where we get l east peak throughput compare to
other al l .
4.3 Observation
Anal yzi ng the above graphs, we can say that we
get maxi mum throughput for Bi nary PSK and l east
throughput for Non Coherent FSK not onl y
condi ti on 1 but al so condi ti on 2.
5 CONCLUSION
In thi s thesi s, we i ntroduce the concept of
maxi mi zi ng the throughput of the wi rel ess system
varyi ng the val ue of packet l ength and
transmi ssi on rate (i nsi de the cel l ul ar system).
When thi s work was started, the goal was to
provi de new i nsi ght i nto the understandi ng of the
data throughput a wi rel ess system for vari ous
schemes. Thi s was not geared towards any system
i n parti cul ar. No system protocol s and/or
parameters were used i n thi s work. Wi rel ess
systems engi neers, i n thei r desi gn of wi rel ess data
systems, shoul d use thi s research as a tool . Some
very i mportant resul ts were obtai ned. We have
l earned that the data throughput depends on
vari abl es, some of whi ch i ncl ude the transmi ssi on
rate, packet l ength the recei ved si gnal power, the
recei ved noi se power spectral densi ty, the
modul ati on techniques used and the channel
condi ti ons.

REFERENCES:
[1] Ri chard O. LaMari re and Arvind Kri shna,
"Maxi mizing Throughput i n a Random Access Radio
System by Opt imal Power Level Choice,"
Communi cat i ons, 1996. I CC ' 96, Confer ence Recor d,

TABLE 3
MODULATION SCHEMES
Bi nary PSK

Figure 05:Throughput(T) Vs Packet Length(L)

Differential PSK
F igure06: Throughput(T) Vs Packet Length(L)

Coherent FSK

Figure07: Throughput(T) Vs Packet Length(L)

Non coherent FSK
Figure08: Throughput(T) Vs Packet Length(L)

JOURNAL OF COMPUTING, VOLUME 4, ISSUE 6, JUNE 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 36
[2] Conver gi ng Technol ogi es for Tomor r ow' s A ppl i cat i ons.
pp. 614 - 620, vol. 1, 1996.
[3] Wireless communi cations i s a rapi dly growing
segment [Cited: 17
th
February, 2012], avai lable at:
ht t p:/ / www.st anfor d.edu/ cl ass/ ee359/
[4] Marvin K Si mon et al, "Di git al communi cati on over
Fadi ng Channel s", Wi l ey- I EEE Pr ess,2004
[5] Theodore S. Rappaport , "Wireless Communi cat ions:
Princi ples and Practi ce", Pr ent i ce H al l , 2002
[6] Peter E. Bausbacher and Jef frey L. Kearns,
"Transmi ssion Parameter Selecti on i n an Adapti ve
Packet-Radio Net work," Tact i cal Communi cat i ons
Confer ence, 1990. Vol.1, pp. 51 - 68, 1990.
[7] Ri chard J. Lavery : Throughput Opti mizati on for
Wireless Dat a Transmi ssion. Master s Thesi s Work,
Pol ytechnic Uni versity on Publi cati on Date: June 2001.
Fazlay Rabby Reza has completed his graduation in
Electronics & Telecommunication Engineering from Daffodil
International University, Dhaka, Bangladesh in 2011.
Md. Shoaibur Rahman, Lecturer of Department of
Electrical and Electronic Engineering, University of Asia
Pacific, Dhaka, Bangladesh.
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 6, JUNE 2012, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 37