0% found this document useful (0 votes)
81 views34 pages

Tech2301: Data Communications: Vinay Kumar Shukla

This document discusses different techniques for data communication and multiplexing. It describes three main types of multiplexing: frequency-division multiplexing (FDM), time-division multiplexing (TDM), and statistical multiplexing. FDM divides the available bandwidth into distinct frequency channels. TDM divides the transmission medium into time slots and assigns each signal a time slot. Statistical multiplexing transmits data on demand rather than using fixed time slots, allowing more efficient use of the channel. The document provides details on how each technique works and examples of their applications.

Uploaded by

Vinay Shukla
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
81 views34 pages

Tech2301: Data Communications: Vinay Kumar Shukla

This document discusses different techniques for data communication and multiplexing. It describes three main types of multiplexing: frequency-division multiplexing (FDM), time-division multiplexing (TDM), and statistical multiplexing. FDM divides the available bandwidth into distinct frequency channels. TDM divides the transmission medium into time slots and assigns each signal a time slot. Statistical multiplexing transmits data on demand rather than using fixed time slots, allowing more efficient use of the channel. The document provides details on how each technique works and examples of their applications.

Uploaded by

Vinay Shukla
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 34

Tech2301: Data Communications

Vinay Kumar Shukla


http://www.a so!t.in

"ultiple#in$

%e ha e looke& at e!!icient techni'ues !or utili(in$ a &ata link un&er hea y loa&. )n&er the simplest con&itions a me&ium can only carry one si$nal at any moment in time

*or multiple si$nals to share one me&ium the me&ium must somehow +e &i i&e& $i in$ each si$nal a portion o! the +an&wi&th.

,owe er- two communicatin$ stations will not utili(e the !ull capacity o! a &ata link.
*or e!!iciency- it shoul& +e possi+le to share that capacity This is multiplexing

. common application o! multiple#in$ is in lon$/haul communications


Trunks use& are hi$h/capacity !i+er- coa#ial- or microwa e links Can carry lar$e num+ers o! oice an& &ata transmissions simultaneously usin$ multiple#in$. 2

Cont 0

"ultiple sources +ut only one link The multiplexer is connecte& to the demultiplexer +y a sin$le &ata link The ")1 com+ines &ata !rom these 2n3 input lines an& transmits them throu$h the hi$h capacity &ata link The D4")1 &eli ers to the appropriate output lines
3

Cont 0

%i&esprea& use o! multiple#in$ can +e e#plaine& as !ollows:


Transmission ser ices is ery e#pensi e

5ease& lines- packet switche& network networks

"ultiple#in$ an& compression techni'ues sa e +usiness money The hi$her the &ata rate- the more cost/e!!ecti e the transmission !acility

*or a $i en application an& o er a $i en &istance- the cost per k+ps &eclines with an increase in the &ata rate o! the transmission !acility Similarly- the cost o! transmission an& recei in$ e'uipment- per k+ps&eclines with increasin$ &ata rate.

"ost in&i i&ual &ata/communicatin$ &e ices re'uire relati ely mo&est &ata/ rate support
4

Cont 0

"ultiple#in$ techni'ues can +e cate$ori(e& into the !ollowin$ three types: Frequency-division multiplexing (FDM)
*re'uency spectrum is &i i&e& into se eral lo$ical channels$i in$- each user e#clusi e possession o! a particular !re'uency +an&. 6t is most popular an& is use& e#tensi ely in ra&io an& TV transmission. 4ach user perio&ically $ets the entire +an&wi&th !or short +urst o! time. 6t is also calle& synchronous TD"Commonly use& !or multiple#in$ &i$iti(e& oice stream. This is also calle& asynchronous TD"- which simply impro es 5 on the e!!iciency o! synchronous TD".

Time-division Multiplexing (TDM)


Statistical TDM

*re'uency/Di ision "ultiple#in$ 7*D"8

Sen&s si$nals in se eral &istinct !re'uency ran$es Carry multiple i&eo channels in a sin$le ca+le

6ma$ine the cost o! strin$in$ a wire !or each channel to peoples homes

4ach si$nal is mo&ulate& onto a &i!!erent carrier an& carrier !re'uencies are separate& +y guard bands 9an&wi&th o! the transmission me&ium e#cee&s re'uire& +an&wi&th o! all the si$nals. )se& in ra&io an& ca+le TV

Cont 0

%hen channels are ery close to one other- it lea&s to inter/channel cross talk
Channels must +e separate& +y strips o! unuse& +an&wi&th to pre ent inter/channel cross talk These unuse& channels +etween each successi e channel are known as guard bands The ran$e o! !re'uencies ha e to +e non/o erlappin$

Cont 0

9asic approach:
Di i&e the a aila+le +an&wi&th o! a sin$le physical me&ium into a num+er o! smaller- in&epen&ent !re'uency channels.

)sin$ mo&ulation- in&epen&ent messa$e si$nals are translate& into &i!!erent !re'uency +an&s The carriers use& to mo&ulate the in&i i&ual messa$e si$nals are calle& sub-carriers, shown as f1, f2, ..., fn .nalo$ si$nalin$ is use& to transmit the analo$ si$nals 9roa&cast ra&io an& tele ision- ca+le tele ision *D" is the ol&est multiple#in$ techni'ue.

Cont 0

. multiple#or accepts inputs an& assi$ns !re'uencies to each &e ice


The assi$nment is !or non/o erlappin$ !re'uency ran$es on a me&ium. .ll si$nals are transmitte& at the same time usin$ &i!!erent !re'uencies The multiple#or is attache& to a hi$h/spee& communication line

6n&i i&ual !re'uencies will a&& up to $reater +an&wi&ths- the line must +e a+le to han&le them.

.t the recei in$ en&:

The &emultiple#or on a hi$h/spee& separates the multiple#e& si$nals

6t is more suscepti+le to noise +ecause it per!orms analo$ si$nalin$ 9

Cont 0

10

Cont 0

*re'uency &istri+ute& to &i!!erent users

11

Cont 0

*re'uency &i ision multiple#e& circuit

12

Cont 0

:ro+lem with *D" is that is it cannot utilize the full capacity of the cable. ;emem+er:

*re'uency +an&s &o not o erlap

There must +e a consi&era+le $ap +etween the !re'uency +an&s in or&er to ensure that the si$nals !rom +an& &o not a!!ect the si$nals in another +an&

*D" carries analo$ si$nals althou$h mo&ulate& &i$ital si$nals can also +e carrie& usin$ this techni'ue

13

%a elen$th/Di ision "ultiple#in$ 7TD"8


Same as *D" +ut applie& to !i+ers The &i!!erence is the that the operatin$ !re'uencies are much hi$her- i.e. in the optical ran$e <reat potential !or !i+er me&ia since the +an&wi&th is so hu$e with &i!!erent ener$y +an&s are passe& throu$h a &i!!raction $ratin$ prism. 6t &oes this +y:

Com+inin$ at the lon$ &istance link Split at the &estination

.& anta$es: hi$h relia+ility an& ery hi$h capacity

14

Cont 0

"ultiple#in$ an& &emultiple#in$ si$nals +y usin$ a prism. *i+er spectrum

:ower s !re'uency

15

Cont 0

%D" multiple#es multiple &ata streams onto a sin$le !i+er optic line Di!!erent wa elen$th lasers 7lam+&a8 transmits the multiple si$nals 4ach si$nal carrie& on the on the !i+er can +e transmitte& at a &i!!erent rate !rom the other si$nals Dense %D" com+ines as many as 30- =0 or >0 channels in one !i+er

Costly e'uipments Channels more wi&ely space& 5ow costs

Coarse %D" com+ines only a !ew lam+&as



16

Time Di ision "ultiple#in$

Sharin$ o! the si$nal is accomplishe& +y &i i&in$ a aila+le transmission time on me&ium amon$ users

Time is +ein$ &i i&e& "ay+e in a roun& ro+in !ashion Computer communication Telecommunications Synchronous TD" Statistical TD" or asynchronous

Di$ital si$nalin$ is use& e#clusi ely


6t comes into two +asic !orms:


17

Cont 0

18

Cont 0

5ike *D"- TD" sa es money +y allowin$ more than one telephone call to use a ca+le at the same time.

Since this is synchronous the clocks ha e to +e synchroni(e& +e!ore transmission This way each recei in$ time slot know to which terminal the &ata +elon$s to
19

Cont 0

6nstea& o! &i i&in$ the ca+le into !re'uency +an&s- it splits the ca+le usa$e into time slots

4ach user is $i en a time slot in which to sen& a :C" si$nal

TD" can transmit &i!!erent rates

a hierarchy o! &ata streams at

20

Cont 0

)se& !or &i$ital si$nals or analo$ si$nals carryin$ &i$itals &ata Data rate o! transmission me&ia e#cee& &ata rate o! si$nals )ses a !rame

?um+er o! +its an& +ytes to !orm one particular unit at which to sen& it o er Slow &e ice will sen& lower num+er o! +its &urin$ his time ,i$h spee& &e ice will sen& lar$er num+er o! +its Slots normally come perio&ically
21

@ne slot !or each slice o! time


@ne or more slots !or each &e ice A channel

Cont 0

Time slots are transmitte& whether source has &ata or not


:ro+lem with TD" The recei er &oes not know the +its comin$- e#cept once it recei es the !rame it will !orwar& it to the appropriate &e ice Suppose Si is sen&in$ to ;i- &urin$ the turn o! Si it happens to ha e nothin$ to sen&- it is not possi+le !or SB to use that particular time slot to sen& its !rame The slot will ha e to +e transmitte& empty.

22

Summary o! Synchronous TD"


Sen&er an& recei er ha e to a$ree on the len$th o! time slot The multiple#or accepts input !rom attache& &e ices in a roun&/ro+in !ashion an& transmit the &ata T/1 an& 6SD? telephone lines are common e#amples o! synchronous time &i ision multiple#in$ 6! one &e ice $enerates &ata at a !aster rate than other &e ices

The multiple#or must sample the incomin$ &ata stream more o!ten or +u!!er the incomin$ stream

6! a &e ice has nothin$ to sen& the multiple#or must still insert a piece o! &ata an& multiple# the stream.
23

,y+ri& "ultiple#in$ Schemes


9oth *D" an& TD" can +e com+ine& The a aila+le channel is +roken up into !re'uency +an&s 6n each +an&- multiple channels are accommo&ate& throu$h TD" 4#ample is like the cell phone communications

24

Statistical Di ision "ultiple#in$


This is also known as asynchronous TD" .s well as TD"- +ut on &eman& rather than !i#e&

.&&resses the pro+lem o! the ori$inal TD" "ultiple#or cannot sen& an empty slot rather i! a &e ice has nothin$ an& an& another one &oes then it will allow the one with !rames to sen& to transmit at that particular time. )tili(es the channel more e!!iciently

Capa+ility o! resche&ulin$ the link on per/packet +asis :ackets !rom &i!!erent sources interlea e& on the link The pro+lem now comes at the &emultiple#or si&e

There is no relationship that Si uses a Ti slot !or it to +e recei e& +y ;i .s a result you ha e to ha e an a&&ress o! the recei in$ host in 25 the packet

Cont 0

.llows connection o! more no&es to the circuit than the capacity o! the circuit

:ossi+le +ecause with +usty &ata there are still i&le times nee& to +e utili(e& to make the e!!icient ;ate o! utili(ation may increase

%orks on the premise that not all no&es will transmit at !ull capacity at all times "ust transmit a terminal 6D

Destination 6D

"ay re'uire stora$e

26

Cont 0

27

Cont 0

9u!!er packets that are conten&in$ !or the link :acket 'ueue may +e processe& *6*@- +ut not necessarily

@ther schemes may apply as well- e#ample hi$h priority 'ueue6! all sen&ers &eci&e to sen& at the same time Con$estion occurs .s a result there may +e &ata loss

9u!!er o er!low is calle& congestion


. statistical multiple#or transmits only the &ata !rom acti e workstations

6! a workstation is not acti e- no space is waste& on the multiple#e& stream


28

Cont 0

. statistical multiple#or accepts the incomin$ &ata streams an& creates a !rame containin$ only the &ata to +e transmitte& To i&enti!y each piece o! &ata- an a&&ress is i&enti!ie&. 6n this case the si(e is !i#e&

29

Cont 0

6! the &ata si(e is o! aria+le si(e- a len$th is inclu&e&

30

a& anta$es

*D"

Simple Cheap :opular Di$ital si$nals "ultiple#in$ hierarchy

TD"

.t &i!!erent places you may re'uire &i!!erent &ata rates

STD"

"ore e!!icient +an&wi&th use *rame can contain control in!ormation :acket can +e o! aryin$ si(es
31

.& anta$es

%D"

Very hi$h capacity Scala+le 5ow noise sensiti ity

32

Disa& anta$es

*D"

Suscepti+le to noise %aste& +an&wi&th 5imite& !re'uency ran$e %aste& +an&wi&th "ore comple# an& e#pensi e "ore costly than *D" an& TD"

TD"

STD"

%D"

33

Cuestions

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy