matched filter design and explaination, Study notes of Digital Communication Systems

derivation of matched filter is explained very nicely to help understand the topic

Typology: Study notes

2016/2017

Uploaded on 05/11/2017

JOBITA
JOBITA 🇮🇳

1 document

1 / 39

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
D.1
Baseband Data Transmission I
After this lecture, you will be able to
describe the components of a digital transmission system
Information source, transmitter, channel, receiver and
destination
calculate the signaling rate and bit rate of a system
design the matched filter of a receiver
derive the condition for maximum signal-to-noise ratio at
the receiver
determine the error rate
Error rate versus received signal energy per bit per hertz
of thermal noise
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27

Partial preview of the text

Download matched filter design and explaination and more Study notes Digital Communication Systems in PDF only on Docsity!

Baseband Data Transmission I

After this lecture, you will be able to

  • describe the components of a digital transmission system
    • Information source, transmitter, channel, receiver and

destination

  • calculate the signaling rate and bit rate of a system– design the matched filter of a receiver
    • derive the condition for maximum signal-to-noise ratio at

the receiver

  • determine the error rate
    • Error rate versus received signal energy per bit per hertz

of thermal noise

Reference

Reference

  • Chapter 4.1 - 4.3, S. Haykin,

Communication Systems, Wiley.

D.

Introduction (1)

  • Sampling and quantizing

Digits

Quantizationnoise

t

Introduction (2)

  • encoding

Digits 0 2 3 4 5 6 7 8

Binary code 000 001 010 011 100 101 110 111

Return-to-zero

Introduction (4)

Channel

  • medium used to transmit the signal from transmitter to the

receiver

  • Attenuation and delay distortions– Noise

Receiver

  • performs the reverse function of the transmitter
    • determine the symbol from the received signal

Example: 1 or 0 for a binary system

Destination

  • the person or device for which the message is intended.

D.

Signaling Rate

Digital message

  • An ordered sequence of symbols

drawn from an alphabet of

finite size

μ

  • Example

Binary source:

μ

=2 for alphabet 0,1 where 0 and 1 are

symbols ¾

A 4 level signal has 4 symbols in its alphabet such as

Signaling Rate

  • The symbols are suitably shaped by a shaping filter into a sequence

of signal-elements. Each signal-element has the same duration of

T

second and is transmitted immediately one after another, so that thesignal-element rate (signaling rate) is 1/

T

elements per second

(bauds).

Bit Rate

Bit Rate

  • The bit rate is the product of signaling rate and no of

bit/symbol.

  • Example
    • A 4-level PAM with a signaling rate = 2400 bauds/s.• Bit rate (Data rate) =2400 X log

2 (4) = 4800 bits/s (bps)

D.

Matched Filter (1)

  • A basic problem that often arises in the study of

communication systems is that of detecting a pulsetransmitted over a channel that is corrupted by channel noise

t

t

Square pulse

Signal at the receiving end

D.

Matched Filter (3)

  • The purpose of the circuit is to design an impulse response

h

t )

of the filter such that the output signal-to-noise ratio

is

maximized. Let

g

f ) and

h

f ) denoted the Fourier Transform of

g

t ) and

h

t

∞ ∫ ∞−

df ft

j f G f H t g

exp( ) ( ) ( ) ( 0

The signal power =

2

2

0

exp( ) ( ) ( ) (

∞ ∫ ∞−

df ft

j f G f H t g

Signal Power

Matched Filter (4)

Noise Power

  • Since

w

t ) is white with a power spectral density

, the

spectral density function of Noise is

  • The noise power =

0 N

2

0

f

H

N

f

S

N

df

f H N t n E

2

0

2

)]

[

∞ ∫ ∞−

D.

Matched Filter (6)

  • Our problem is to find, for a given

G

f ), the particular form of the

transfer function

H

f ) of the filter that makes

η

at maximum.

Schwarz’s inequality

:

If

∞ <

∞ ∫ ∞−

dx

x

2

1

) ( φ

and

∞ <

∞ ∫ ∞−

dx

x

2

2

) (

φ

,

2

2

1

) (

) (

∞ ∫ ∞−

dx x

x

φ

φ

dx

x

∞ ∫ ∞−

2

1

) (

φ

dx

x

∞ ∫ ∞−

2

2

) (

φ

This equality holds, if and only if, we have

) (

) (

  • 2

1

x

k

x

φ

φ

=

where

k

is an arbitrary constant, and *

denotes complex

conjugation.

Matched Filter (7)

Applying the schwarz’s inequality to the numerator ofequation (1), we have

2

)

2

exp( )

(

)

(

df

fT

j

f

G f

H

df

f

H

2 )

(

df

f

G

2 )

(

……(2)(Note:

1

2

=

fT j e

π

)

Matched Filter (9)

N

otice that the S/N ratio does not depend on the transfer function H(f) of the filter but only on the signal energy.The optimum value of H(f) is then obtained as

)

2

exp( )

(

)

(

fT

j

f

kG

f

H

π

=

Matched Filter (10)

Taking the inverse Fourier transform of

H

(

f ) we have

h

(

t )=

k

df

t T f j f G

)]

(

2

exp[ )

(

∞ ∫ ∞−

π

and

)

(

)

(

f

G

f

G

=

for real signal

) (

t

g

h

(

t )=

k

df

t T f j f G

)]

(

2

exp[ )

(

∞ ∫ ∞−

π

h

(

t )=

kg

(

T

t )

…..(4)

Equation (4) shown that the impulse response of the filter isthe time-reversed and delayed version of the input signal g

(

t )

. ”Matched with the input signal”