APPLICATION OF A WAVELET-BASED RECEIVER FOR THE COHERENT DETECTION OF FSK SIGNALS
Download
1 / 27

Overview - PowerPoint PPT Presentation


  • 113 Views
  • Uploaded on

APPLICATION OF A WAVELET-BASED RECEIVER FOR THE COHERENT DETECTION OF FSK SIGNALS Dr. Robert Barsanti, Charles Lehman SSST March 2008, University of New Orleans. Overview. Introduction FSK Signals Wavelet Domain Filtering Wavelet Domain Correlation Receiver Simulations and Results Summary.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Overview' - damon-hansen


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

APPLICATION OF A WAVELET-BASED RECEIVER FOR THE COHERENT DETECTION OF FSK SIGNALS Dr. Robert Barsanti, Charles LehmanSSST March 2008, University of New Orleans


Overview
Overview DETECTION OF FSK SIGNALS

  • Introduction

  • FSK Signals

  • Wavelet Domain Filtering

  • Wavelet Domain Correlation Receiver

  • Simulations and Results

  • Summary


Fsk signals
FSK Signals DETECTION OF FSK SIGNALS

In binary frequency shift keying modulation, the binary information is transmitted using signals at two different frequencies. These signals can be represented as

The symbol A represents the signal amplitude, and T is the bit duration. It is easy to show that the bit energy is given by


Fsk signal
FSK Signal DETECTION OF FSK SIGNALS

This figure shows an example of a binary FSK signal. Notice that the transmitted signal case a constant envelope and abrupt phase changes at the beginning of each signal interval.


Fsk probability of bit error
FSK Probability of Bit Error DETECTION OF FSK SIGNALS

  • Assuming the received signal at the input to the correlator is corrupted with Gaussian noise of zero mean and variance No/2. The probability of bit error can be computed to be [5]

  • It can be seen that the probability does not depend on the detailed signal and noise characteristics, but only upon the signal to noise ratio per bit (SNR) [6].


The classical cross correlation receiver for two transmitted signals
The Classical Cross Correlation Receiver for two transmitted signals

Detector

(choose largest)

X

Output

Symbol

ri

So

X

Sample at t = T

S1


Noise removal

Signal signals

TRANSFORMATION

Noisy Signal

Noise

Noise Removal

  • Separate the signal from the noise



Wavelet based filtering
Wavelet Based Filtering signals

THREE STEP DENOISING

1. PERFORM DWT

2. THRESHOLD COEFFICIENTS

3. PERFORM INVERSE DWT


Wavelet filtering of an fsk signal
Wavelet Filtering of an FSK Signal signals

DWT of a noise free FSK signal.

DWT of noisy FSK signal.


Wavelet domain correlation
Wavelet Domain Correlation signals

  • transform prototype signal into the wavelet domain and pre-stored DWT coefficients

  • transform received signal into the wavelet domain via the DWT,

  • apply a non-linear threshold to the DWT coefficients (to remove noise),

  • correlate the noise free DWT coefficients of the signal, and the pre-stored

  • DWT coefficients of the prototype signal.


The wavelet domain correlation wdc receiver
The Wavelet Domain Correlation (WDC) Receiver signals

Bank of

Cross-Correlation

Receivers

Detector

(choose largest)

Wavelet

De-noise

r i

DWT

Output Symbol

So

DWT

S1

DWT


Simulation
Simulation signals

  • FSK signals were generated using 128 samples per symbol

  • Monte Carlo Runs at each SNR with different instance of AWGN

  • 10 SNR’s between -6 and +10 dB

  • Symmlet 8 wavelet & soft threshold

  • Threshold set to σ/10.

  • Only 32 coefficients retained




Results
Results signals

  • Both the WDC and classical TDC provided similar results.

  • The WDC provides improvement in processing speed since only

  • 32 vice 128 coefficients were used in the correlations.


Summary
Summary signals

  • Receiver for FSK signals in the presence of AWGN.

  • Uses the cross- correlation between DWT coefficients

  • Procedure is enhanced by using standard wavelet noise removal techniques

  • Simulations of the performance of the proposed algorithm were presented.


Wavelets
Wavelets signals

Some S8 Symmlets at Various Scales and Locations

9

8

7

6

5

Scale j

4

3

2

1

0

0

0.2

0.4

0.6

0.8

1

time index k

1. Can be defined by a wavelet function (Morlet & Mexican hat)

2. Can be defined by an FIR Filter Function (Haar, D4, S8)


Effectiveness of wavelet analysis
EFFECTIVENESS OF WAVELET ANALYSIS signals

  • Wavelets are adjustable and adaptable by virtue of large number of possible wavelet bases.

  • DWT well suited to digital implementation. ~O (N)

  • Ideally suited for analysis non-stationary signals [ Strang, 1996]

  • Has been shown to be a viable denoising technique for transients [Donoho, 1995]

  • Has been shown to be a viable detection technique for transients [Carter, 1994]

  • Has been shown to be a viable TDOA technique for transients [Wu, 1997]


Wavelet implementation
Wavelet Implementation signals

Response

LPF HPF

HP

Filter

Details

X(n)

LP

Filter

Frequency

Averages

F/2

Pair of Half Band Quadrature Mirror Filters (QMF)

[Vetterli, 1995]


Signal reconstruction
Signal Reconstruction signals

Two Channel Perfect Reconstruction QMF Bank

Analysis + Synthesis = LTI system


Wavelet implementation mallat 1989
Wavelet Implementation [Mallat, 1989] signals

2

LPLPLP

J = 4

2

2

LP

LP

LP

2

HP

LPLPHP

J = 3

2

LPHP

J = 2

HP

2

HP

HP

J = 1

2J samples

LP

HP

LPHP

LPLPHP

LPLPLP



Calculating a threshold
Calculating a Threshold signals

Let the DWT coefficient be a series of noisy observations y(n)

then the following parameter estimation problem exists:

y(n) = f(n) +s z(n), n = 1,2,….

z ~N(0,1) and s = noise std.

s is estimated from the data by analysis of the coefficients

at the lowest scale.

s = E/0.6475 where E is the absolute median deviation

[Kenny]


Thresholding techniques
Thresholding Techniques signals

* Hard Thresholding (keep or kill)

* Soft Thresholding (reduce all by Threshold)

The Threshold Value is determined as a multiple

of the noise standard deviation,

eg., T = ms where typically 2< m <5



ad