+ All Categories
Home > Documents > Digital Video Processing

Digital Video Processing

Date post: 06-Mar-2016
Category:
Upload: mirza
View: 6 times
Download: 0 times
Share this document with a friend
Description:
Digital Video Processing

of 30

Transcript
  • Slides by Prof. Brian L. Evans and Dr. Serene Banerjee

    Dept. of Electrical and Computer Engineering The University of Texas at Austin

    EE345S Real-Time Digital Signal Processing Lab Spring 2006

    Lecture 13

    Matched Filtering and DigitalPulse Amplitude Modulation (PAM)

  • 13 - 2

    Outline PAM Matched Filtering PAM System Transmit Bits Intersymbol Interference (ISI)

    Bit error probability for binary signals Bit error probability for M-ary (multilevel) signals

    Eye Diagram

  • 13 - 3

    Pulse Amplitude Modulation (PAM) Amplitude of periodic pulse train is varied with a

    sampled message signal m Digital PAM: coded pulses of the sampled and quantized

    message signal are transmitted (next slide) Analog PAM: periodic pulse train with period Ts is the

    carrier (below)

    t

    TsT T+Ts 2Ts

    p(t)

    m(t) s(t) = p(t) m(t)

    Pulse shape is rectangular pulse

    Ts is symbol period

  • 13 - 4

    Pulse Amplitude Modulation (PAM) Transmission on communication channels is analog One way to transmit digital information is called

    2-level digital PAM

    b t

    )(1 tx

    A

    1 bit

    Additive NoiseChannel

    input output

    x(t) y(t)b

    )(0 tx

    -A

    0 bit

    t

    receive 0 bit

    receive1 bit

    )(0 ty

    b

    -A

    b t

    )(1 ty

    AHow does the

    receiver decide which bit was sent?

  • 13 - 5

    Matched Filter Detection of pulse in presence of additive noise

    Receiver knows what pulse shape it is looking forChannel memory ignored (assumed compensated by other

    means, e.g. channel equalizer in receiver)

    Additive white Gaussian noise (AWGN) with zero mean and variance N0 /2

    g(t)Pulse signal

    w(t)

    x(t) h(t) y(t)t = T

    y(T)

    Matched filter

    )()( )(*)()(*)()(

    0 tntgthtwthtgty

    +=+=

    T is pulse period

  • 13 - 6

    power averagepower ousinstantane

    )}({|)(|

    SNR pulsepeak is where,max

    2

    20

    ==

    tnETg

    Matched Filter Derivation Design of matched filter

    Maximize signal power i.e. power of at t = TMinimize noise i.e. power of

    Combine design criteria

    g(t)Pulse signal

    w(t)

    x(t) h(t) y(t)t = T

    y(T)

    Matched filter

    )(*)()( thtwtn =)(*)()(0 thtgtg =

  • 13 - 7

    Power Spectra Deterministic signal x(t)

    w/ Fourier transform X(f)Power spectrum is square of

    absolute value of magnitude response (phase is ignored)

    Multiplication in Fourier domain is convolution in time domain

    Conjugation in Fourier domain is reversal and conjugation in time

    Autocorrelation of x(t)

    Maximum value at Rx(0)Rx() is even symmetric, i.e.

    Rx() = Rx(-) )( )()()( *2 fXfXfXfPx ==

    { } )(*)( )( )( ** = xxFfXfX

    )(*)()( * = xxRx

    t

    1x(t)

    0 Ts

    Rx()

    -Ts Ts

    Ts

  • 13 - 8

    Power Spectra Power spectrum for signal x(t) is

    Autocorrelation of random signal n(t)

    For zero-mean Gaussian n(t) with variance 2

    Estimate noise powerspectrum in Matlab

    { } 22* )( )( )( )( )( ==+= fPtntnER nn

    { } )( )( xx RFfP =

    N = 16384; % number of samplesgaussianNoise = randn(N,1);plot( abs(fft(gaussianNoise)) .^ 2 );

    noise floor

    { }

    +=+= dttntntntnERn )( )( )( )( )( ** { } )(*)( )( )( )( )( )( *** ===

    nndttntntntnERn

  • 13 - 92 2 2

    0 | )( )(| |)(|

    = dfefGfHTg Tfj pi

    Matched Filter Derivation

    Noise

    Signal

    == dffHNdffStnE N 202 |)(|2 )(} )( {

    f2

    0N

    Noise power spectrum SW(f)

    )()( )(0 fGfHfG =

    = dfefGfHtg tfj )( )( )( 2 0 pi

    20 |)(|2

    )( )()( fHNfSfSfS HWN ==

    g(t)Pulse signal w(t)

    x(t) h(t) y(t)t = T

    y(T)

    Matched filter

    )(*)()(0 thtgtg =

    )(*)()( thtwtn =AWGN Matched

    filter

  • 13 - 10

    =

    dffHN

    dfefGfH Tfj

    20

    2 2

    |)(|2

    | )( )(| pi

    Matched Filter Derivation Find h(t) that maximizes pulse peak SNR

    Schwartzs inequalityFor vectors:

    For functions:

    lower bound reached iff

    |||| ||||cos |||| |||| | | *

    babababa

    TT

    =

    Rkxkx = )( )( 21

    -

    22

    -

    21

    2*

    2-

    1 )( )( )( )( dxxdxxdxxx

    a

    b

  • 13 - 11)( )( Hence,

    inequality s' Schwartzby )( )(

    whenoccurs which , |)(| 2

    |)(| 2 |)(|

    2

    | )( )(

    |)(| |)(| | )( )( )()( and )()(Let

    *

    2 *

    2

    0max

    2

    020

    2 2

    222 2

    2 *21

    tTgkthkefGkfH

    dffGN

    dffGNdffHN

    dfefGfH|

    dffGdffHdfefGfH|efGffHf

    opt

    Tfjopt

    -

    Tfj

    -

    Tfj

    Tfj

    =

    =

    =

    =

    ==

    pi

    pi

    pi

    pi

    Matched Filter Derivation

  • 13 - 12

    Matched Filter Given transmitter pulse shape g(t) of duration T,

    matched filter is given by hopt(t) = k g*(T-t) for all kDuration and shape of impulse response of the optimal filter is

    determined by pulse shape g(t) hopt(t) is scaled, time-reversed, and shifted version of g(t)

    Optimal filter maximizes peak pulse SNR

    Does not depend on pulse shape g(t) Proportional to signal energy (energy per bit) EbInversely proportional to power spectral density of noise

    SNR2|)(| 2 |)(| 20

    2

    0

    2

    0max ====

    NEdttg

    NdffG

    Nb

  • 13 - 13

    t=kT T

    Matched Filter for Rectangular Pulse Matched filter for causal rectangular pulse has an

    impulse response that is a causal rectangular pulse Convolve input with rectangular pulse of duration

    T sec and sample result at T sec is same as toFirst, integrate for T secSecond, sample at symbol period T secThird, reset integration for next time period

    Integrate and dump circuit

    Sample and dump

    h(t) = ___

  • 13 - 14

    Transmit One Bit Analog transmission over communication channels Two-level digital PAM over channel that has

    memory but does not add noise

    h t

    )(th

    1

    b t

    )(1 tx

    A

    1 bit

    b

    )(0 tx

    -A

    0 bit

    Model channel as LTI system with impulse response

    h(t)

    CommunicationChannel

    input output

    x(t) y(t)t

    )(0 ty

    -A Th

    receive 0 bit

    th+bh

    Assume that Th < Tb

    t

    )(1 ty receive1 bit

    h+bh

    A Th

  • 13 - 15

    Transmit Two Bits (Interference) Transmitting two bits (pulses) back-to-back

    will cause overlap (interference) at the receiver

    Sample y(t) at Tb, 2 Tb, , andthreshold with threshold of zero

    How do we prevent intersymbolinterference (ISI) at the receiver?

    h t

    )(th

    1

    Assume that Th < Tb

    tb

    )(tx

    A

    1 bit 0 bit

    2b

    * =

    )(ty

    -A Th

    tb

    1 bit 0 bit

    h+b

    Intersymbolinterference

  • 13 - 16

    Transmit Two Bits (No Interference) Prevent intersymbol interference by waiting Th

    seconds between pulses (called a guard period)

    Disadvantages?

    h t

    )(th

    1

    Assume that Th < Tb

    * =

    tb

    )(tx

    A

    1 bit 0 bit

    h+bt

    )(ty

    -A Thb

    1 bit 0 bit

    h+b

    h

  • 13 - 17

    =k

    bk Tktgats ) ( )(

    Digital 2-level PAM System

    Transmitted signal Requires synchronization of clocks between

    transmitter and receiver

    Transmitter Channel Receiver

    bi

    Clock Tb

    PAM g(t) h(t) c(t)1

    0

    ak{-A,A} s(t) x(t) y(t) y(ti)

    AWGNw(t)

    Decision

    Maker

    Threshold

    Sample att=iTb

    bits

    Clock Tb

    pulse shaper

    matched filter

    =

    1

    00 ln4 p

    pATN

    bopt

  • 13 - 18

    ( ) )( )( )( )()(*)()( where)()()(

    ,

    iikk

    bkbiii

    kbk

    tnTkipaiTtpaty

    tctwtntnkTtpaty

    ++=

    =+=

    =k

    bk Tktats ) ()(

    Digital PAM Receiver Why is g(t) a pulse and not an impulse?

    Otherwise, s(t) would require infinite bandwidth

    Since we cannot send an signal of infinite bandwidth, we limit its bandwidth by using a pulse shaping filter

    Neglecting noise, would like y(t) = g(t) * h(t) * c(t)to be a pulse, i.e. y(t) = p(t) , to eliminate ISI

    actual value(note that ti = i Tb)

    intersymbolinterference (ISI) noise

    p(t) is centered at origin

  • 13 - 19

    ) 2

    (rect 21

    )(

    ||,0,

    21

    )(

    Wf

    WfP

    Wf

    WfWWfP

    =

    >

  • 13 - 20

  • 13 - 21

    Bit Error Probability for 2-PAM Tb is bit period (bit rate is fb = 1/Tb)

    v(t) is AWGN with zero mean and variance 2 Lowpass filtering a Gaussian random process

    produces another Gaussian random processMean scaled by H(0)Variance scaled by twice lowpass filters bandwidth

    Matched filters bandwidth is fb

    h(t)s(t)

    Sample att = nTbMatched

    filterv(t)

    r(t) r(t) rn =k

    bk Tktgats ) ( )(

    )()()( tvtstr +=r(t) = h(t) * r(t)

  • 13 - 22

    Bit Error Probability for 2-PAM Binary waveform (rectangular pulse shape) is A

    over nth bit period nTb < t < (n+1)Tb Matched filtering by integrate and dump

    Set gain of matched filter to be 1/TbIntegrate received signal over period, scale, sample

    n

    Tn

    nTb

    Tn

    nTbn

    vA

    dttvT

    A

    dttrT

    r

    b

    b

    b

    b

    +=

    +=

    =

    +

    +

    )(1

    )(1

    )1(

    )1(

    0-

    Anr

    )( nr rPn

    AProbability density function (PDF)

    See Slide 13-13

  • 13 - 23

    >=>=>+==

    AvPAvPvAPAnTsP nnnb )( )0())(|error(

    0 /A

    /nv

    Bit Error Probability for 2-PAM Probability of error given that the transmitted

    pulse has an amplitude of A

    Random variableis Gaussian with

    zero mean andvariance of one

    ==

    >==

    pi

    AQdveAvPAnTsPv

    A

    n

    21))(|error( 2

    2

    nv

    Q function on next slide

    PDF for N(0, 1)

  • 13 - 24

    Q Function Q function

    Complementary errorfunction erfc

    Relationship

    =

    x

    y dyexQ 2/221)(pi

    =

    x

    t dtexerfc 22)(pi

    =

    221)( xerfcxQ

    Erfc[x] in Mathematicaerfc(x) in Matlab

  • 13 - 25

    ( )2

    2

    SNR where,

    21

    21

    ))(|error()())(|error()( error)(

    A

    Q

    AQ

    AQ

    AQAnTsPAPAnTsPAPP bb

    ==

    =

    =

    +

    =

    =+==

    Bit Error Probability for 2-PAM Probability of error given that the transmitted pulse

    has an amplitude of A

    Assume that 0 and 1 are equally likely bits

    Probablity of errordecreases exponentially with SNR

    )/())(|error( AQAnTsP b ==

    pi

    pi

    21)( )(

    22

    eQx

    exerfc

    x

    , positive largefor x

  • 13 - 26

    PAM Symbol Error Probability Average signal power

    GT() is square root of theraised cosine spectrum

    Normalization by Tsym willbe removed in lecture 15 slides

    M-level PAM amplitudes

    Assuming each symbol is equally likely

    sym

    nT

    sym

    nSignal T

    aEdGT

    aEP }{|)(| 21}{ 222

    ==

    pi

    [ ]sym

    M

    i

    M

    ii

    symSignal T

    dMidMT

    lT

    P3

    )1( )12(21 12

    22

    1

    2

    1

    2=

    =

    =

    ==

    2, ,0 , ,1

    2 ),12( MMiidli ......+==

    2-PAM

    d

    -d

    4-PAMConstellations with decision boundaries

    d

    -d

    3 d

    -3 d

  • 13 - 27

    symNoise T

    NdNPsym

    sym2

    2

    21

    02/

    2/

    0==

    pi

    )()( symRnsym nTvanTx +=

    PAM Symbol Error Probability Noise power and SNR

    Assume ideal channel,i.e. one without ISI

    Consider M-2 inner levels in constellationError if and only if

    where Probablity of error is

    Consider two outer levels in constellation

    dnTv symR >|)(|

    =>

    dQdnTvP symR 2)|)((|

    2/02 N=

    =>

    dQdnTvP symR ))((

    two-sided power spectral density of AWGN

    channel noise filtered by receiver and sampled

    0

    22

    3)1(2

    SNRNdM

    PP

    Noise

    Signal

    ==

  • 13 - 28

    =

    +

    =

    dQM

    MdQM

    dQM

    MPe)1(2

    2 22

    PAM Symbol Error Probability Assuming that each symbol is equally likely,

    symbol error probability for M-level PAM

    Symbol error probability in terms of SNR

    ( )13

    SNR since SNR1

    3

    12 2222

    1

    2 ==

    = MdPP

    MQ

    MMP

    Noise

    Signale

    M-2 interior points 2 exterior points

  • 13 - 29

    Eye Diagram PAM receiver analysis and troubleshooting

    The more open the eye, the better the reception

    M=2

    t - Tsym

    Sampling instant

    Interval over which it can be sampled

    Slope indicates sensitivity to timing error

    Distortion overzero crossing

    Margin over noise

    t + Tsymt

  • 13 - 30

    Eye Diagram for 4-PAM

    3d

    d

    -d

    -3d


Recommended