mobile computing cdma

Upload: luke-kenny

Post on 04-Apr-2018

219 views

Category:

Documents


0 download

TRANSCRIPT

  • 7/30/2019 mobile computing cdma

    1/25

    Oxford University Press 2007. All rights reserved. 1

    Wireless Medium Access Control and

    CDMA-based Communication

    Lesson 01

    Modulation Methods for Medium-access

  • 7/30/2019 mobile computing cdma

    2/25

    Oxford University Press 2007. All rights reserved. 2

    Number of signal sources access to

    wireless medium simultaneously

    Simultaneously transmitted Signals

    (actually electromagnetic radiation) mayinterference with each other, when they

    travel through a medium

    Network has to receive signals from each

    radio carrier distinctly

  • 7/30/2019 mobile computing cdma

    3/25

    Oxford University Press 2007. All rights reserved. 3

    Modulation with radio carrier frequency

    (ies)

    Voice-data or data signals propagate

    through the medium after modulation

    Wireless station accesses a medium by

    modulation of radio carrier(s) with thesignal symbols

  • 7/30/2019 mobile computing cdma

    4/25

    Oxford University Press 2007. All rights reserved. 4

    Symbols

    Digitized form of the analog signals

    Symbolbit(s) prepared for transmission

    after encoding of data bits and insertion

    of the error control and other bits

  • 7/30/2019 mobile computing cdma

    5/25

    Oxford University Press 2007. All rights reserved. 5

    Instantaneous value of signal amplitude,

    s(t) at an instant t

    s(t) = S s0sin (2 c/c t + t0)

    s(t) = S s0 sin (2 fc t + t0)

    where S is the symbol to be transmitted, 1 or

    0

  • 7/30/2019 mobile computing cdma

    6/25

    Oxford University Press 2007. All rights reserved. 6

    Amplitude shifted keying (ASK)

    modulation

    s0 = A0whenSymbol = 0 (1)

    s0 = A1 when

    Symbol = 1 (2)

  • 7/30/2019 mobile computing cdma

    7/25

  • 7/30/2019 mobile computing cdma

    8/25

    Oxford University Press 2007. All rights reserved. 8

    BFSK (binary frequency shift keying) of

    fc when S = 1

    s0(t) = s0/2 . sin (2 fc t + t0) when

    S = 0

    s1(t) = s0/2 . sin (2 (fc+ fm) t + t0)

    when S = 1 Bandwidth > f c

    Harmonics of (fc+ 2 fm), (fc+ 3 fm) , (fc+

    4 fm) present

  • 7/30/2019 mobile computing cdma

    9/25

    Oxford University Press 2007. All rights reserved. 9

    GMSK (Gaussian Minimum shift keying)

    DSP based Gaussian low pass filter

    Bandwidth is 2 .fmplus guard band

  • 7/30/2019 mobile computing cdma

    10/25

    Oxford University Press 2007. All rights reserved. 10

    QPSK

    One of the four possible distinct

    sequences (00, 01, 10, or 11) transmittedusing a specific phase angle of the radio

    carrier frequency

    Symbols (00, 01, 10, or 11) represent a

    sequence

    Each symbol actually a sequence of 2bits

  • 7/30/2019 mobile computing cdma

    11/25

    Oxford University Press 2007. All rights reserved. 11

    OQPSK

    Each alternate symbol is in the next

    quadrature

    90 are added to the phase angle, the

    second symbol shifts to the nextquadrature during transmission

  • 7/30/2019 mobile computing cdma

    12/25

    Oxford University Press 2007. All rights reserved. 12

    OQPSK

    An OQPSK receiver subtracts the phase

    angle by 90 and, therefore, receives thesignal in the original quadrature and,

    therefore, also the original second symbol,

    and so on

  • 7/30/2019 mobile computing cdma

    13/25

    Oxford University Press 2007. All rights reserved. 13

    Advantage of OQPSK

    In-phase and quadrature signals overlap,

    because now they are in the same phasequadrant

    Thus, the number of sharp transitions inthe signals reduces to half of its original

    value

  • 7/30/2019 mobile computing cdma

    14/25

    Oxford University Press 2007. All rights reserved. 14

    OQPSK

    Transmitted envelope smoother as

    compared to one transmitted throughQPSK

    Utilization-efficiency of the bandwidthallotted to a mobile service improves

  • 7/30/2019 mobile computing cdma

    15/25

    Oxford University Press 2007. All rights reserved. 15

    /4-QPSK

    A form of QPSK modulation in which the

    signal phase shifts by 45 after every twosymbols

  • 7/30/2019 mobile computing cdma

    16/25

    Oxford University Press 2007. All rights reserved. 16

    Advantage of/4-QPSK

    There are no sharp transitions of in the

    phase angle

    The number of sharp transitions of the

    signals halves

  • 7/30/2019 mobile computing cdma

    17/25

    Oxford University Press 2007. All rights reserved. 17

    /4-QPSK

    Lesser sharp transitions imply a lower

    number of significant higher harmonics,lesser bandwidth requirement per channel,

    and increased utilization of the allotted

    bandwidth to a wireless service provider

    Bandwidth utilization-efficiency improves

  • 7/30/2019 mobile computing cdma

    18/25

    Oxford University Press 2007. All rights reserved. 18

    Example

    Symbol sequence 10 00 11 01 to be

    transmitted after QPSK modulation

    After each successive time interval of T,

    the phase angles of the transmitted signal

    s(t), which are 3/4, 3/4, /4, +/4become 3/4, /2, 0, /2 in /4-QPSK

  • 7/30/2019 mobile computing cdma

    19/25

    Oxford University Press 2007. All rights reserved. 19

    Example

    The /4-QPSK demodulator at the

    receiving end subtracts /4 after eachsuccessive bit pair, the original QPSK

    angles

    3/ 4, 3 / 4, /4, + /4 found and thebits are recovered as 10 00 11 01

  • 7/30/2019 mobile computing cdma

    20/25

    Oxford University Press 2007. All rights reserved. 20

    Four-bit per symbol 16-QAM method

    Each symbol actually a sequence of 4 bits

    Four symbol sequences representing a 16bits grouped and transmitted by phaseshift keying

    One of the 16 possible distinct sequencestransmits by a specific phase angle of theradio carrier frequency at a specific

    amplitude (one of the three values ofamplitude s0)

  • 7/30/2019 mobile computing cdma

    21/25

    Oxford University Press 2007. All rights reserved. 21

    64-QAM

    Two most significant bits for QPSK while

    reserving the remaining 4 for the 16-QAMsignals

    64-QAM thus transmits 6 symbols (bits) in

    a sequence

    When the bits are transmitted after 64-

    QAM, the spectrum bandwidthrequirement reduces greatly

  • 7/30/2019 mobile computing cdma

    22/25

    Oxford University Press 2007. All rights reserved. 22

    64-QAM Example

    For example, assume that a 64-QAM

    modulated signal is generated andtransmitted at 19.2 ksymbol/s

    One of the 64 possible distinct sequences

    is transmitted at a specific phase angle,

    frequency, and amplitude

    Six symbols represent a sequence

  • 7/30/2019 mobile computing cdma

    23/25

    Oxford University Press 2007. All rights reserved. 23

    64-QAM

    The bit transmission rate is 6 19.2

    ksymbol/s = 115.2 kbps when 64-QAM istransmitted at 19.2 ksymbol/s

    Each symbol actually a sequence of 6 bits

    The bandwidth requirement, in this case,

    is thus reduced by a factor of 1/6

  • 7/30/2019 mobile computing cdma

    24/25

    Oxford University Press 2007. All rights reserved. 24

    Summary

    Modulation methods, ASK, FSK, GMSK

    QPSK for each symbol representing a pairof bits

    OQPSK

    /4 QPSK

    16 QAM for each symbol representing a

    set of 4 bits 64 QAM 16 QAM for each symbolrepresenting a set of 4 bits

  • 7/30/2019 mobile computing cdma

    25/25

    Oxford University Press 2007. All rights reserved. 25

    End of Lesson 01

    Modulation Methods for Medium-access