Detection Theory Chapter 12 Model Change Detection Xiang Gao January 18, 2011.

Slides:



Advertisements
Similar presentations
Copyright (c) 2004 Brooks/Cole, a division of Thomson Learning, Inc. Chapter 6 Point Estimation.
Advertisements

1. INTRODUCTION In order to transmit digital information over * bandpass channels, we have to transfer the information to a carrier wave of.appropriate.
Sampling: Final and Initial Sample Size Determination
Estimation  Samples are collected to estimate characteristics of the population of particular interest. Parameter – numerical characteristic of the population.
Probability & Statistical Inference Lecture 7 MSc in Computing (Data Analytics)
Statistical Inference Chapter 12/13. COMP 5340/6340 Statistical Inference2 Statistical Inference Given a sample of observations from a population, the.
AGC DSP AGC DSP Professor A G Constantinides© Estimation Theory We seek to determine from a set of data, a set of parameters such that their values would.
Descriptive statistics Experiment  Data  Sample Statistics Experiment  Data  Sample Statistics Sample mean Sample mean Sample variance Sample variance.
IEEM 3201 Two-Sample Estimation: Paired Observation, Difference.
Chapter Topics Confidence Interval Estimation for the Mean (s Known)
Narrowband Interference Detection in MB-OFDM UWB Shih-Chang Chen Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan.
Chapter 5. Operations on Multiple R. V.'s 1 Chapter 5. Operations on Multiple Random Variables 0. Introduction 1. Expected Value of a Function of Random.
E&CE 418: Tutorial-6 Instructor: Prof. Xuemin (Sherman) Shen
Copyright © 2014 by McGraw-Hill Higher Education. All rights reserved.
Lecture 7 1 Statistics Statistics: 1. Model 2. Estimation 3. Hypothesis test.
Collaborative Signal Processing CS 691 – Wireless Sensor Networks Mohammad Ali Salahuddin 04/22/03.
1 Confidence Intervals for Means. 2 When the sample size n< 30 case1-1. the underlying distribution is normal with known variance case1-2. the underlying.
Multiantenna-Assisted Spectrum Sensing for Cognitive Radio
Data Selection In Ad-Hoc Wireless Sensor Networks Olawoye Oyeyele 11/24/2003.
An algorithm for dynamic spectrum allocation in shadowing environment and with communication constraints Konstantinos Koufos Helsinki University of Technology.
Infrasound detector for Apatity group Asming V.E., Kola Regional Seismological Center, Apatity, Russia.
Error Analysis Accuracy Closeness to the true value Measurement Accuracy – determines the closeness of the measured value to the true value Instrument.
POWER CONTROL IN COGNITIVE RADIO SYSTEMS BASED ON SPECTRUM SENSING SIDE INFORMATION Karama Hamdi, Wei Zhang, and Khaled Ben Letaief The Hong Kong University.
880.P20 Winter 2006 Richard Kass 1 Hypothesis Testing The goal of hypothesis testing is to set up a procedure(s) to allow us to decide if a model is acceptable.
Multiuser Detection (MUD) Combined with array signal processing in current wireless communication environments Wed. 박사 3학기 구 정 회.
Automatic Gain Control Response Delay and Acquisition in Direct- Sequence Packet Radio Communications Sure 2007 Stephanie Gramc Dr. Noneaker.
Wireless Information Transmission System Lab. Institute of Communications Engineering National Sun Yat-sen University 2011 Summer Training Course ESTIMATION.
1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006.
Lab 3b: Distribution of the mean
Statistical Methods II&III: Confidence Intervals ChE 477 (UO Lab) Lecture 5 Larry Baxter, William Hecker, & Ron Terry Brigham Young University.
CHAPTER 9 Estimation from Sample Data
1 Chapter 9 Detection of Spread-Spectrum Signals.
CHAPTER SEVEN ESTIMATION. 7.1 A Point Estimate: A point estimate of some population parameter is a single value of a statistic (parameter space). For.
"Classical" Inference. Two simple inference scenarios Question 1: Are we in world A or world B?
The final exam solutions. Part I, #1, Central limit theorem Let X1,X2, …, Xn be a sequence of i.i.d. random variables each having mean μ and variance.
Statistics 300: Elementary Statistics Sections 7-2, 7-3, 7-4, 7-5.
ECE 4710: Lecture #31 1 System Performance  Chapter 7: Performance of Communication Systems Corrupted by Noise  Important Practical Considerations: 
Understanding Basic Statistics
Chapter 20 Classification and Estimation Classification – Feature selection Good feature have four characteristics: –Discrimination. Features.
Statistics for Business and Economics 8 th Edition Chapter 7 Estimation: Single Population Copyright © 2013 Pearson Education, Inc. Publishing as Prentice.
Sampling Theory and Some Important Sampling Distributions.
M.Sc. in Economics Econometrics Module I Topic 4: Maximum Likelihood Estimation Carol Newman.
Chapter 9: One- and Two-Sample Estimation Problems: 9.1 Introduction: · Suppose we have a population with some unknown parameter(s). Example: Normal( ,
1 On the Channel Capacity of Wireless Fading Channels C. D. Charalambous and S. Z. Denic School of Information Technology and Engineering, University of.
EE 551/451, Fall, 2006 Communication Systems Zhu Han Department of Electrical and Computer Engineering Class 15 Oct. 10 th, 2006.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Music Transcription through Statistical Analysis Group 3 Austin Assavavallop, William Feater, Greg Heim, Philipp Pfieffenberger, Wamba Yves Design Phase.
Performance of Digital Communications System
Digital Communications I: Modulation and Coding Course Spring Jeffrey N. Denenberg Lecture 3c: Signal Detection in AWGN.
Outline Random variables –Histogram, Mean, Variances, Moments, Correlation, types, multiple random variables Random functions –Correlation, stationarity,
Copyright © 2015, 2012, and 2009 Pearson Education, Inc. 1 Chapter Confidence Intervals 6.
Chapter Confidence Intervals 1 of 31 6  2012 Pearson Education, Inc. All rights reserved.
Presentation : “ Maximum Likelihood Estimation” Presented By : Jesu Kiran Spurgen Date :
Detection in Non-Gaussian Noise JA Ritcey University of Washington January 2008.
Locating a Shift in the Mean of a Time Series Melvin J. Hinich Applied Research Laboratories University of Texas at Austin
Lecture 1.31 Criteria for optimal reception of radio signals.
Detection theory 1. Definition of the problematic
A 2 veto for Continuous Wave Searches
Monthly utility bills factor into local cost of living measures
Maximum Likelihood Estimation
Elementary Statistics: Picturing The World
Elementary Statistics: Picturing The World
Introduction to Probability & Statistics The Central Limit Theorem
Hypothesis Tests Regarding a Parameter
Confidence Intervals for the Mean (σ Known)
Estimating the Value of a Parameter Using Confidence Intervals
Chapter 9: One- and Two-Sample Estimation Problems:
Chapter Outline Inferences About the Difference Between Two Population Means: s 1 and s 2 Known.
Detection Theory Chapter 12 Model Change Detection
Maximum Likelihood Estimation (MLE)
Presentation transcript:

Detection Theory Chapter 12 Model Change Detection Xiang Gao January 18, 2011

Examples of Model Change Detection So far, we have studied detection of a signal in noise Model change detection – Detection of system parameters change in time or space In this chapter we study detection of – DC level change – Noise variance change Examples in wireless communication – Synchronization – Detection of user presence

Outline Basic problem – Known DC level jump at known time – Known variance jump at known time – NP approach Extension to basic problem – Unknown DC levels and known jump time – Known DC levels and unknown jump time – GLRT approach Multiple change times GLRT approach Dynamic programming for parameters estimation to reduce the computation Problems

Basic Problem (No Unknown Parameters)

Example 1: Known DC Level and Jump Time A = 1 A = 4 Jump time and DC levels before and after jump are known

Example 1: Known DC Level and Jump Time Neyman-Pearson (NP) test Detect the jump and control the amount of false alarm Data PDF NP detector decides H1

Example 1: Known DC Level and Jump Time Test statistic – Average deviation of data change over assumed jump interval – Data before jump are irrelavant Detection performance Delay time in detecting a jump

Example 2: Known Variance Jump at Known Time Variance = 1Variance = 4 Energy detector?

Example 2: Known Variance Jump at Known Time NP detecor decides H1

Example 2: Known Variance Jump at Known Time Finally, we can get test statistic – It is an energy detector – Same as detecting a Gaussian random signal in WGN (Chapter 5)

Extensions to Basic Problem (Unknown Parameters Present)

Example 3: Unknown DC Levels, Known Jump Time Assume n0 is known but DC levels before the jump A1 and after the jump A2 are unknown GLRT detector decides H1 if Average over all the data samples Average over data samples before jump Average over data samples after jump

Example 3: Unknown DC Levels, Known Jump Time After some simplification, we decide H1 if PDF of test statistic

Example 4: Known DC Levels, Unknown Jump Time Now the case is: A0 and ΔA are known, but n0 is unknown This is classical synchronization problem GLRT detector decides H1 if Test statistic is maximized over all possible values of n0 Same as Example 1

Final Case: Unknown DC Levels, Unknown Jump Time DC levels as well as jump time are unknown GLRT decides H1 if MLE of DC levels:

Multiple Change Times

Parameter’s value changes more than once in data record For example: DC levels change multiple times in WGN A = 1 A = 4 A = 2 A = 6

Multiple Change Times No unknown paramters – Same as Example 1 Unknown parameters – DC levels unknown, change times known Same as Example 3 – Change times unknown Computational explosion with the number of change times

Example 5: Unknown DC Levels, Unknown Jump Times We have signal embedded in WGN GLRT can be used if we can determine the MLE of change times Focus on estimation of DC levels and change times Joint MLE of To minimize

Example 5: Unknown DC Levels, Unknwon Jump Times Dynamic programming Not all combinations of n0, n1, n2 need to be evaluated Reduce computational complexity Effectively eliminate many possible ”paths” Recursion for the minimum

Problems