Scribd
Upload
334 views19 pages

Lectuer 4 Channelization

The document discusses three channelization protocols: Frequency-Division Multiple Access (FDMA), Time-Division Multiple Access (TDMA), and Code-Division Multiple Access (CDMA). It provides figures and examples to explain how each protocol divides up a communication channel between different stations using frequency, time, or code.

Uploaded by

Saidulu I
Copyright
© © All Rights Reserved
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
334 views19 pages

Lectuer 4 Channelization

The document discusses three channelization protocols: Frequency-Division Multiple Access (FDMA), Time-Division Multiple Access (TDMA), and Code-Division Multiple Access (CDMA). It provides figures and examples to explain how each protocol divides up a communication channel between different stations using frequency, time, or code.

Uploaded by

Saidulu I
Copyright
© © All Rights Reserved
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/ 19

12-3 CHANNELIZATION

Channelization is a multiple-access method in which


the available bandwidth of a link is shared in time,
frequency, or through code, between different stations.
In this section, we discuss three channelization
protocols.

Topics discussed in this section:


Frequency-Division Multiple Access (FDMA)
Time-Division Multiple Access (TDMA)
Code-Division Multiple Access (CDMA)

12.1
Figure 12.21 Frequency-division multiple access (FDMA)

12.2
Note

In FDMA, the available bandwidth


of the common channel is divided into
bands that are separated by guard
bands.

12.3
Figure 12.22 Time-division multiple access (TDMA)

12.4
Note

In TDMA, the bandwidth is just one


channel that is timeshared between
different stations.

12.5
Note

In CDMA, one channel carries all


transmissions simultaneously.

12.6
Figure 12.23 Simple idea of communication with code

12.7
Figure 12.24 Chip sequences

12.8
Figure 12.25 Data representation in CDMA

12.9
Figure 12.26 Sharing channel in CDMA

12.10
Figure 13.16 CDMA multiplexer
Figure 13.17 CDMA demultiplexer
Figure 12.27 Digital signal created by four stations in CDMA

12.13
Figure 12.29 General rule and examples of creating Walsh tables

12.14
Note

The number of sequences in a Walsh


table needs to be N = 2m.

12.15
Example 12.6

Find the chips for a network with


a. Two stations b. Four stations

Solution
We can use the rows of W2 and W4 in Figure 12.29:
a. For a two-station network, we have
[+1 +1] and [+1 −1].

b. For a four-station network we have


[+1 +1 +1 +1], [+1 −1 +1 −1],
[+1 +1 −1 −1], and [+1 −1 −1 +1].

12.16
Example 12.7

What is the number of sequences if we have 90 stations in


our network?

Solution
The number of sequences needs to be 2m. We need to
choose m = 7 and N = 27 or 128. We can then use 90
of the sequences as the chips.

12.17
Example 12.8

Prove that a receiving station can get the data sent by a


specific sender if it multiplies the entire data on the
channel by the sender’s chip code and then divides it by
the number of stations.

Solution
Let us prove this for the first station, using our previous
four-station example. We can say that the data on the
channel
D = (d1 ⋅ c1 + d2 ⋅ c2 + d3 ⋅ c3 + d4 ⋅ c4).
The receiver which wants to get the data sent by station 1
multiplies these data by c1.
12.18
Example 12.8 (continued)

When we divide the result by N, we get d1 .

12.19

You might also like