28
McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004 Chapter 13 Multiple Access

Ch 13

Embed Size (px)

DESCRIPTION

tmh slides

Citation preview

Page 1: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Chapter 13

MultipleAccess

Page 2: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.1 Multiple-access protocols

Page 3: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

13.1 Random Access13.1 Random Access

MA

CSMA

CSMA/CD

CSMA/CA

Page 4: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.2 Evolution of random-access methods

Page 5: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.3 ALOHA network

Page 6: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.4 Procedure for ALOHA protocol

Page 7: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.5 Collision in CSMA

Page 8: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.6 Persistence strategies

Page 9: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

13.7 CSMA/CD procedure

Page 10: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.8 CSMA/CA procedure

Page 11: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

13.2 Control Access13.2 Control Access

Reservation

Polling

Token Passing

Page 12: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.9 Reservation access method

Page 13: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.10 Select

Page 14: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.11 Poll

Page 15: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.12 Token-passing network

Page 16: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.13 Token-passing procedure

Page 17: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

13.3 Channelization13.3 Channelization

FDMA

TDMA

CDMA

Page 18: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

In FDMA, the bandwidth is divided into channels.

NoteNote::

Page 19: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

In TDMA, the bandwidth is just one channel that is timeshared.

NoteNote::

Page 20: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

In CDMA, one channel carries all transmissions simultaneously.

NoteNote::

Page 21: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.14 Chip sequences

Page 22: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.15 Encoding rules

Page 23: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.16 CDMA multiplexer

Page 24: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.17 CDMA demultiplexer

Page 25: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.18 W1 and W2N

Page 26: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Figure 13.19 Sequence generation

Page 27: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Example 1Example 1

Check to see if the second property about orthogonal codes holds for our CDMA example.

SolutionSolution

The inner product of each code by itself is N. This is shown for code C; you can prove for yourself that it holds true for the other codes.

C . C =

If two sequences are different, the inner product is 0.

B . C =

Page 28: Ch 13

McGraw-Hill ©The McGraw-Hill Companies, Inc., 2004

Example 2Example 2

Check to see if the third property about orthogonal codes holds for our CDMA example.

SolutionSolution

The inner product of each code by its complement is N. This is shown for code C; you can prove for yourself that it holds true for the other codes. C . (C ) =

The inner product of a code with the complement of another code is 0.

B . (C ) =