WI-LAN Inc. v. Alcatel-Lucent USA Inc. et al

Filing 167

OPENING CLAIM CONSTRUCTION BRIEF filed by WI-LAN Inc.. (Attachments: # 1 Affidavit DECLARATION OF JEFFREY T. HAN IN SUPPORT OF WI-LANS OPENING CLAIM CONSTRUCTION BRIEF, # 2 Exhibit A-U.S. Patent No. 6,088,326, # 3 Exhibit B-U.S. Patent No. 6,195,327, # 4 Exhibit C-U.S. Patent No. 6,222,819, # 5 Exhibit D-U.S. Patent No. 6,381,211, # 6 Exhibit E-copy of The IEEE Standard Dictionary of Electrical and Electronics Terms (6th ed. 1996), # 7 Exhibit F-copy of Alan Freedman, The ComputerGlossary (7th ed. 1995), # 8 Exhibit G-copy of Harry Newton, Newtons Telecom Dictionary (11th ed. 1996), # 9 Exhibit H-copy of Ramjee Prasad, CDMA for Wireless Personal Communications (1996), # 10 Exhibit I-copy of Theodore S. Rappaport,Wireless Communications (1996), # 11 Exhibit J-copy of Shing-Fong Su, The UMTS Air-Interface in RF Engineering (2007), # 12 Exhibit K-copy of 3GPP TS 25.211,v.6.10.0 (Release 6), # 13 Exhibit L-copy of Jean Conan & Rolando Oliver, Hardware and Software Implementation of the Viterbi Decoding Algorithm for Convolutional Codes, in MIMI 76: Proceedings of the International Symposium on Mini and Micro Computers (M.H. Hamza ed., 1977), # 14 Exhibit M-Definition of Overlay, OxfordDictionaries Online, http://oxforddictionaries.com/definition/overlay?q=overlay, # 15 Exhibit N-copy of the Manual of Patent Examining Procedure (6th ed. rev. 3, July 1997))(Weaver, David)

EXHIBIT H

DEFS0011193

CDMA for Wireless
Personal Communications

DEFS0011194

Library of Congress Cataloging-in-Publication Data
Prasad, Ramjee.
CDMA for wireless personal communications I Ramjee Prasad.
p.
em.
Includes bibliographical references and index.
ISBN 0-89006-571-3 (alk. paper)
1. Code division multiple access. 2. Wireless personal communications.
I. Title.
1996
TK5103.45.P73
95-53774
621.3845-dc20
CIP

.
British Library Cataloguing in Publication Data
Prasad, Ramjee
CDMA for wireless personal communications
1. Code division multiple access 2. Wireless communication systems
I. Title
621.3'82

the

who motivate

I dedit

ISBN 0-89006-571-3

All rights reserved. Printed and bound in the United States of America. No part of
this book may be repr()Q\lced6t utilized in any form or by any means, electronic or
mechanical; including photocopying, recording, or by any information storage and
retrieval system, without permission in writing from the publisher.
All terms mentioned in this book that are known to be trademarks or service marks
have been appropriately capitalized. Artech House cannot attest to the accuracy of
this information. Use of a term in this book should not be regarded as affecting the
validity of any trademark or service mark.

International Standard Book Number: 0-89006-571-3
Library of Congress Catalog Card Number: 96-53774
1098765432

DEFS0011195

20

2.3 CONTENTIONLESS (SCHEDULING) MULTIPLE ACCESS PROTOCOLS

tirr
ov

The contentionless MA protocols avoid the situation in which multiple users try to
access the same channel at the same time by scheduling the transmissions of all users.
The users transmit in an orderly scheduled manner so every transmission will be a
successful one. The scheduling can take two forms:
1. Fixed assignment scheduling. With these types of protocols, the available channel
capacity is divided among the users such that each user is allocated a fixed part of the
capacity, independent of its activity. The division can be done in time or frequency.
The time division results in the TDMA protocol, where transmission time is divided
into frames and each user is assigned a fixed part of each frame, not overlapping with
parts assigned to other users. The frequency division results in the FDMA protocol
where the channel bandwidth is divided into nonoverlapping frequency bands and
each user is assigned a fixed band.
2. Demand assignment scheduling. A user is only allowed to transmit if it is active (if it
has something to transmit). Thus the active (or ready) users transmit in an orderly
scheduled manner. Within the demand assignment scheduling we can distinguish
between centralized control and distributed control. With centralized control a single
entity schedules the transmissions. An example of such a protocol is the roll-call
polling protocol. With distributed control all users are involved in the scheduling
process and such a protocol is the token-passing protocol.

Fi:

W
sic
er
g€
T
sl,
H
sl

2.3.1 Fixed Assignment
With the fixed assignment multiple access protocols, the channel capacity is divided
among the users in a static fashion; each user is allocated part of the channel capacity
whether it has something to transmit or not. The allocation can take part in time or
frequency, which results in the TDMA protocol and the FDMA protocol, respectively.

e:
T
k

F
Time Division Multiple Access
In the basic TDMA protocol, the (transmission) time axis is divided into frames of equal
duration, and each frame is divided into the same number of time slots. All time slots
have equal duration. Each slot position within a frame is allocated to a different user and
this allocation stays the same over the sequence of frames. This means that a particular
user may transmit during one particular slot in every frame. During this slot it has the
whole channel bandwidth at its disposal. Figure 2.2 shows the allocation in a basic
TDMA frame with four time slots per frame. The shaded areas in this figure depict the
guard times in each time slot in which transmission by a user is prohibited. These guard

V
fi

a
u

DEFS0011196

n

s
t
u

21

LS

times are necessary to prevent transmissions of different (spatially distributed) users from
overlapping due to transmission delay differences.

to
ers.

r

time

mel
'the
ICY·

ded
vith
icol
and

if it
erly
rish
Igle
call
ling

ded
city
~ or

Frame 1

Figure 2.2

Frame 2

Frame and slot structure with basic TDMA.

With the basic TDMA protocol every user is allocated the same capacity, namely, one
slot per frame. Thus the amount oftraffic that can be transmitted within one slot must be
enough to accommodate the user which generates most traffic. But this means that users
generating much less traffic waste a lot of capacity. For this reason more generalized
TDMA protocols have been developed that allow users to be allocated more than one
slot per frame and also allow for the slots within one frame to be of different duration.
However capacity is still wasted if a user has nothing to transmit in its allocated time
slot.
Despite this capacity-wasting property, TDMA has been and still is used
extensively because of its relative simplicity. The only real problem encountered with
TDMA is that of achieving the necessary synchronization of all users so that each user
knows when and for how long it can transmit.
Frequency Division Multiple Access

lual
lots
and
liar
the

asic
the
lard

With FDMA, the bandwidth of the communication channel is divided into a number of
frequency bands with guard bands between them to achieve frequency separation of
adjacent bands. Each user is allocated a particular frequency band for its own private
use. Thus with FDMA, a user can use part of the transmission channel all the time.
FDMA has the same capacity-wasting properties as TDMA, because if a user has
nothing to transmit, its frequency band cannot be used by other users. It also gives a
slightly inferior performance with respect to packet delay. FDMA does, however, have
the advantage of being even simpler than TDMA because no synchronization of the
users is necessary.

DEFS0011197