Chapter 13

Multiple Access
McGraw-Hill The McGraw-Hill Companies, Inc., 2004

Figure 13.1

Multiple-access protocols

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

13.1 Random Access

MA CSMA

CSMA/CD
CSMA/CA

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.2

Evolution of random-access methods

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.3 ALOHA network

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.4

Procedure for ALOHA protocol

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.5

Collision in CSMA

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.6

Persistence strategies

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

13.7

CSMA/CD procedure

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.8

CSMA/CA procedure

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

13.2 Control Access

Reservation

Polling Token Passing

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.9

Reservation access method

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.10

Select

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.11

Poll

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.12 Token-passing network

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.13 Token-passing procedure

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

13.3 Channelization
FDMA

TDMA

CDMA

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Note: In FDMA, the bandwidth is divided into channels.

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

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

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Note: In CDMA, one channel carries all transmissions simultaneously.

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Multi-Access Radio Techniques

Courtesy of Petri Possi, UMTS World

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.14

Chip sequences

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.15

Encoding rules

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.16

CDMA multiplexer

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.17

CDMA demultiplexer

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.18 W1 and W2N

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

Figure 13.19

Sequence generation

McGraw-Hill

The McGraw-Hill Companies, Inc., 2004

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

Solution
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 = [+1, +1, -1, -1] . [+1, +1, -1, -1] = 1 + 1 + 1 + 1 = 4 If two sequences are different, the inner product is 0. B . C = [+1, -1, +1, -1] . [+1, +1, -1, -1] = 1 - 1 - 1 + 1 = 0
McGraw-Hill The McGraw-Hill Companies, Inc., 2004

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

Solution
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 ) = [+1, +1, -1, -1] . [-1, -1, +1, +1] = - 1 - 1 - 1 - 1 = -4 The inner product of a code with the complement of another code is 0. B . (-C ) = [+1, -1, +1, -1] . [-1, -1, +1, +1] = -1 + 1 + 1 - 1 = 0
McGraw-Hill The McGraw-Hill Companies, Inc., 2004