1 / 32

Matched Filtering and Digital Pulse Amplitude Modulation (PAM)

Matched Filtering and Digital Pulse Amplitude Modulation (PAM). Outline. Transmitting one bit at a time Matched filtering PAM system Intersymbol interference Communication performance Bit error probability for binary signals Symbol error probability for M -ary (multilevel) signals

ion
Download Presentation

Matched Filtering and Digital Pulse Amplitude Modulation (PAM)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Matched Filtering and DigitalPulse Amplitude Modulation (PAM)

  2. Outline • Transmitting one bit at a time • Matched filtering • PAM system • Intersymbol interference • Communication performance Bit error probability for binary signals Symbol error probability for M-ary (multilevel) signals • Eye diagram Part I Part II

  3. ‘0’ bit input output Additive NoiseChannel Tb x(t) y(t) t -A A Tb t ‘1’ bit Transmitting One Bit • Transmission on communication channels is analog • One way to transmit digital information is called2-level digital pulse amplitude modulation (PAM) receive ‘0’ bit Tb t -A receive‘1’ bit How does the receiver decide which bit was sent? A Tb t

  4. receive ‘0’ bit input output Th Th+Tb LTIChannel t x(t) y(t) -A Th receive‘1’ bit A A Th ‘0’ bit Tb t Tb t Th Th+Tb ‘1’ bit -A Transmitting One Bit • Two-level digital pulse amplitude modulation over channel that has memory but does not add noise t Model channel as LTI system with impulse responsec(t) 1 Th t Assume that Th < Tb

  5. 1 Th t Transmitting 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? * = A Th+Tb 2Tb t Tb Tb t -A Th Assume that Th < Tb ‘0’ bit ‘1’ bit ‘0’ bit ‘1’ bit Intersymbol interference

  6. Th+Tb t Tb -A Th ‘0’ bit ‘1’ bit Preventing ISI at Receiver • Option #1: wait Th seconds between pulses in transmitter (called guard period or guard interval) Disadvantages? • Option #2: use channel equalizer in receiver FIR filter designed via training sequences sent by transmitter Design goal: cascade of channel memory and channel equalizer should give all-pass frequency response * = 1 A Th+Tb Th Th Tb t t Assume that Th < Tb ‘0’ bit ‘1’ bit

  7. Digital 2-level PAM System ak{-A,A} s(t) x(t) y(t) y(ti) • Transmitted signal • Requires synchronization of clocksbetween transmitter and receiver bi 1 Decision Maker h(t) PAM g(t) c(t) 0 bits Sample at t=iTb bits w(t) pulse shaper matched filter Clock Tb Thresholdl AWGN ClockTb N(0, N0/2) Transmitter Channel Receiver p0 is the probability bit ‘0’ sent

  8. g(t) y(T) x(t) y(t) h(t) t = T Pulse signal Matched filter w(t) Matched Filter • Detection of pulse in presence of additive noise Receiver knows what pulse shape it is looking for Channel memory ignored (assumed compensated by other means, e.g. channel equalizer in receiver) T is the symbol period Additive white Gaussian noise (AWGN) with zero mean and variance N0 /2

  9. g(t) y(T) x(t) y(t) h(t) t = T Pulse signal Matched filter w(t) Matched Filter Derivation • Design of matched filter Maximize signal power i.e. power of at t = T Minimize noise i.e. power of • Combine design criteria T is the symbol period

  10. Deterministic signal x(t)w/Fourier transformX(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 & conjugation in time Autocorrelation ofx(t) Maximum value (when it exists) is at Rx(0) Rx(t) is even symmetric,i.e. Rx(t) = Rx(-t) x(t) 1 0 Ts t Rx(t) Ts -Ts Ts t Power Spectra

  11. Power Spectra • Two-sided random signal n(t) Fourier transform may not exist, but power spectrum exists For zero-mean Gaussian random processn(t)with variances2 • Estimate noise powerspectrum in Matlab approximate noise floor N = 16384; % finite no. of samplesgaussianNoise = randn(N,1);plot( abs(fft(gaussianNoise)) .^ 2 );

  12. g(t) y(T) x(t) y(t) h(t) t = T Pulse signal Matched filter w(t) Matched Filter Derivation Noise power spectrum SW(f) • Noise • Signal f Matchedfilter AWGN T is the symbol period

  13. Matched Filter Derivation • Find h(t) that maximizes pulse peak SNR h • Schwartz’s inequality For vectors: For functions:upper bound reached iff a  b

  14. Matched Filter Derivation T is the symbol period

  15. Matched Filter • Impulse response is hopt(t) = kg*(T - t) Symbol period T, transmitter pulse shape g(t)and gain k Scaled, conjugated, time-reversed, and shifted version of g(t) Duration and shape determined by pulse shape g(t) • Maximizes peak pulse SNR Does not depend on pulse shape g(t) Proportional to signal energy (energy per bit) Eb Inversely proportional to power spectral density of noise

  16. Matched Filter for Rectangular Pulse • Matched filter for causal rectangular pulse shape Impulse response is causal rectangular pulse of same duration • Convolve input with rectangular pulse of duration T sec and sample result at T sec is same as First, integrate for T sec Second, sample at symbol period T sec Third, reset integration for next time period • Integrate and dump circuit Sample and dump T t=nT h(t) = ___

  17. Digital 2-level PAM System ak{-A,A} s(t) x(t) y(t) y(ti) • Transmitted signal • Requires synchronization of clocksbetween transmitter and receiver bi 1 Decision Maker h(t) PAM g(t) c(t) 0 bits Sample at t=iTb bits w(t) pulse shaper matched filter Clock Tb Thresholdl AWGN ClockTb N(0, N0/2) Transmitter Channel Receiver p0 is the probability bit ‘0’ sent

  18. Digital 2-level PAM System • Why is g(t) a pulse and not an impulse? Otherwise, s(t) would require infinite bandwidth We limit its bandwidth by using a pulse shaping filter • Neglecting noise, would like y(t) = g(t) * c(t) * h(t) to be a pulse, i.e. y(t) = mp(t) , to eliminate ISI p(t) is centered at origin actual value(note that ti = i Tb) intersymbolinterference (ISI) noise

  19. Eliminating ISI in PAM • One choice for P(f) is arectangular pulse W is the bandwidth of thesystem Inverse Fourier transformof a rectangular pulse isis a sinc function • This is called the Ideal Nyquist Channel • It is not realizable because pulse shape is not causal and is infinite in duration

  20. Eliminating ISI in PAM • Another choice for P(f) is a raised cosine spectrum • Roll-off factor gives bandwidth in excessof bandwidth W for ideal Nyquist channel • Raised cosine pulsehas zero ISI whensampled correctly • Let g(t) and h(t) be square root raised cosine pulses ideal Nyquist channel impulse response dampening adjusted by rolloff factor a

  21. s(t) r(t) r(t) rn h(t) Sample at Matched filter t = nTb w(t) Bit Error Probability for 2-PAM • Tbis bit period (bit rate is fb = 1/Tb) w(t) is AWGN with zero mean and variance 2 • Lowpass filtering a Gaussian random process produces another Gaussian random process Mean scaled by H(0) Variance scaled by twice lowpass filter’s bandwidth • Matched filter’s bandwidth is ½ fb r(t) = h(t) * r(t)

  22. Bit Error Probability for 2-PAM • Noise power at matched filter output Filtered noise T = Tsym Noise power s2d(t1–t2)

  23. - 0 Bit Error Probability for 2-PAM • Symbol amplitudes of +A and -A • Rectangular pulse shape with amplitude 1 • Bit duration (Tb) of 1 second • Matched filtering with gain of one (see slide 14-15) Integrate received signal over nth bit periodand sample Probability density function (PDF)

  24. 0 Bit Error Probability for 2-PAM • Probability of error given thattransmitted pulse has amplitude –A • Random variable is Gaussian withzero mean andvariance of one Tb = 1 PDF for N(0, 1) Q function on next slide

  25. Q Function • Q function • Complementary error function erfc • Relationship Erfc[x] in Mathematica erfc(x) in Matlab

  26. Bit Error Probability for 2-PAM • Probability of error given thattransmitted pulse has amplitude A • Assume that 0 and 1 are equally likely bits • Probability of error exponentiallydecreases with SNR (see slide 8-16) Tb = 1

  27. PAM Symbol Error Probability • Set symbol time (Tsym) to 1 second • Average transmitted signal power GT(w) square root raised cosine spectrum • M-level PAM symbol amplitudes • With each symbol equally likely 3 d d d -d d 3 d 2-PAM 4-PAM Constellation points with receiver decision boundaries

  28. Noise power and SNR Assume ideal channel,i.e. one without ISI Consider M-2 inner levels in constellation Error only if where Probability of error is Consider two outer levels in constellation PAM Symbol Error Probability two-sided power spectral density of AWGN channel noise after matched filtering and sampling

  29. 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 M-2 interior points 2 exterior points

  30. Visualizing ISI • Eye diagram is empirical measure of signal quality • Intersymbol interference (ISI): Raised cosine filter has zeroISI when correctly sampled

  31. Eye Diagram for 2-PAM • Useful for PAM transmitter and receiver analysis and troubleshooting • The more open the eye, the better the reception Sampling instant M=2 Margin over noise Distortion overzero crossing Slope indicates sensitivity to timing error Interval over which it can be sampled t - Tsym t t + Tsym

  32. 3d d -d -3d Eye Diagram for 4-PAM Due to startup transients. Fix is to discard first few symbols equal to number of symbol periods in pulse shape.

More Related