DCSP-20 Jianfeng Feng Department of Computer Science Warwick Univ., UK

Slides:



Advertisements
Similar presentations
PID Control Loops Guy Zebrick.
Advertisements

Factor each trinomial:
Bayesian Learning & Estimation Theory
Slide 1 Insert your own content. Slide 2 Insert your own content.
1 Evaluating the Security Threat of Instruction Corruptions in Firewalls Shuo Chen, Jun Xu, Ravishankar K. Iyer, Keith Whisnant Center of Reliable and.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Interference.
1 Establishment of Regulatory Framework April 2006.
Combining Like Terms. Only combine terms that are exactly the same!! Whats the same mean? –If numbers have a variable, then you can combine only ones.
E status report Alexandre Camsonne Hall A Jefferson Laboratory Hall A collaboration meeting December 13 th 2007.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Multiplying monomials & binomials You will have 20 seconds to answer the following 15 questions. There will be a chime signaling when the questions change.
0 - 0.
ALGEBRAIC EXPRESSIONS
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
CS4026 Formal Models of Computation Running Haskell Programs – power.
DCSP-10 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-17 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-2: Fourier Transform I Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-12 Jianfeng Feng
DCSP-13 Jianfeng Feng
DCSP-5: Noise Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-14 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-8: Minimal length coding I Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-17: Matched Filter Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-21 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-4: Modem Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-7: Information Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-1: Introduction Jianfeng Feng. DCSP-1: Introduction Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-13 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-22 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-3: Fourier Transform Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-11 Jianfeng Feng
DSPRevision I
DCSP-12 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-16 Jianfeng Feng Department of Computer Science Warwick Univ., UK
Online Event-driven Subsequence Matching over Financial Data Streams Huanmei Wu,Betty Salzberg, Donghui Zhang Northeastern University, College of Computer.
Chris Morgan, MATH G160 January 30, 2012 Lecture 9 Chapter 4.1: Combinations 1.
Secure Time Synchronization Service for Sensor Networks S. Ganeriwal, R. Kumar, M. B. Sirvastava Presented by: Kaiqi Xiong 11/28/2005 Computer Science.
Group 4 : Christopher Thorpe Jonghyun Kim ELEG-652 Principles of Parallel Computer Architectures Instructor : Dr. Gao Mentor : Joseph Data : 12/9/05.
Digital Filter Banks The digital filter bank is set of bandpass filters with either a common input or a summed output An M-band analysis filter bank is.
Why Do We Need a (Plan) Portability API? Gerd Breiter Frank Leymann Thomas Spatzier.
Sistemas Digitais I LESI - 2º ano Lesson 3 - Boolean Algebra U NIVERSIDADE DO M INHO E SCOLA DE E NGENHARIA Prof. João Miguel Fernandes
Fine-grained Spectrum Adaptation in WiFi Networks
25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Shortest Violation Traces in Model Checking Based on Petri Net Unfoldings and SAT Victor Khomenko University of Newcastle upon Tyne Supported by IST project.
EX 6B THE RELATIONSHIP BETWEEN ARITHMETIC SEQUENCES AND FIRST ORDER DIFFERENCE EQUATIONS.
Heat Transfer/Heat Exchanger
Properties of Exponents
MA.912.G.4.7: Apply the inequality theorems: triangle inequality, inequality in one triangle, and the Hinge Theorem. Which of the following statements.
Addition 1’s to 20.
Probabilistic Tracking and Recognition of Non-rigid Hand Motion
Test B, 100 Subtraction Facts
Fakultät für informatik informatik 12 technische universität dortmund Lab 3: Scheduling Solution - Session 10 - Heiko Falk TU Dortmund Informatik 12 Germany.
An Algorithm for Constructing Parsimonious Hybridization Networks with Multiple Phylogenetic Trees Yufeng Wu Dept. of Computer Science & Engineering University.
Week 1.
Bottoms Up Factoring. Start with the X-box 3-9 Product Sum
X-box Factoring. X- Box 3-9 Product Sum Factor the x-box way Example: Factor 3x 2 -13x (3)(-10)= x 2x 3x 2 x-5 3x +2.
Clickstream Models & Sybil Detection Gang Wang ( 王刚 ) UC Santa Barbara
Compiler Construction
DCSP-15 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-4: Modem Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-8: Minimal length coding I Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-15: Matched Filter Jianfeng Feng Department of Computer Science Warwick Univ., UK
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
Presentation transcript:

DCSP-20 Jianfeng Feng Department of Computer Science Warwick Univ., UK

Filters Stop or allow to pass for certain signals as we have talked before Detect certain signals such as radar etc

Matched filters 0,0,0.0,0,0, 0,0,0,1,1,-1,1,-1, 0,0,0,0,0, 0,0,0,0,0, 0 At time 1

Matched filters 0,0,0.0,0,0, 0,0,0,1,1,-1,1,-1, 0,0,0,0,0, 0,0,0,0,0, 0 At time 2

Matched filters 0,0,0.0,0,0, 0,0,0,1,1,-1,1,-1, 0,0,0,0,0, 0,0,0,0,0, 0 At time 3

Matched filters X=( 0,0,0.0,0,0, 0,0,0,1,1,-1,1,-1, 0,0,0,0,0, 0,0,0,0,0, 0 …) To develop a filter to detect the arriving of the signal (1,1,-1,1,-1).

y(n)= a(0) x(n)+ a(1) x(n-1)+…+ a(N) x(n-N) find a = ( a(0),a(1),a(2),a(3),a(4) ) ???? X=( 0,0,0.0, 0, 0, 0, 0, 0, 1, 1, -1, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0,0,0, 0 …) at time zero, a tank or a flight is appeared and detected by a radar.

y(-9) = a(0) x(-9)+ a(1) x(-10)+ a(2) x(-11) + a(3) x(-12) +a(4) x(-13) = 0 y(-8) = a(0) x(-8)+ a(1) x(-9) + a(2) x(-10) +a(3) x(-11) +a(4) x(-12) = 0 … y(-4) = a(0) x(-4)+ a(1) x(-5) + a(2) x(-6) +a(3) x(-7) +a(4) x(-8) = a(0) y(-3) = a(0) x(-3)+ a(1) x(-4) + a(2) x(-5) +a(3) x(- 6) +a(4) x(-7) = a(0)+a(1) y(-2) = a(0) x(-2)+ a(1) x(-3) + a(2) x(-4) +a(3) x(-5) +a(4) x(-6) = -a(0)+a(1)+a(2) y(-1) = a(0) x(-1)+ a(1) x(-2) + a(2) x(-3) +a(3) x(-4) +a(4) x(-5) = a(0)-a(1)+a(2)+a(3) y(0) = a(0) x(0)+ a(1) x(-1) + a(2) x(-2) +a(3) x(-3) +a(4) x(-4) = -a(0)+a(1)-a(2)+a(3)+a(4) y(1 ) = a(0) x(1)+ a(1) x(0) + a(2) x(-1) +a(3) x(-2) +a(4) x(-3) = -a(1)+a(2)-a(3)+a(4) …..

We have The equality is true if and only if a (i) = x (-i)

Matched Filter A filter is called a matched filter for sequence x if Advantage: easy to implement and efficient Disadvantage: we know the exact signal we want to detect before hand. Also known as Linear correlation detector

t6 t5 t4 t3 t2 t1 time

Question: Could you develop a matched filter to detect it?

Correlation

r xx (0) r xx (1) X(1)X(8)X(9)X(10)X(11)X(12)X(3)X(4)X(5)X(6)X(7)X(2) X(1)X(8)X(9)X(10)X(11)X(12)X(3)X(4)X(5)X(6)X(7)X(2) X(1)X(8)X(9)X(10)X(11)X(12)X(3)X(4)X(5)X(6)X(7)X(2) X(1)X(8)X(9)X(10)X(11)X(12)X(3)X(4)X(5)X(6)X(7)X(2)

Correlation between two sequences

r xy (0) r xy (1) X(1)X(8)X(9)X(10)X(11)X(12)X(3)X(4)X(5)X(6)X(7)X(2) y(1)y(8)y(9)y(10)y(11)y(12)y(3)y(4)y(5)y(6)y(7)y(2) X(1)X(8)X(9)X(10)X(11)X(12)X(3)X(4)X(5)X(6)X(7)X(2) y(1)y(8)y(9)y(10)y(11)y(12)y(3)y(4)y(5)y(6)y(7)y(2)

Correlation measures the difference between two objects

D(X,Y)= 2 – 2 r XY (0) if we assume that ||X|| = || Y || =1.