DCSP-5: Noise Jianfeng Feng Department of Computer Science Warwick Univ., UK

Slides:



Advertisements
Similar presentations
Histogram Processing The histogram of a digital image with gray levels in the range [0, L-1] is a discrete function h(rk) = nk where rk is the kth gray.
Advertisements

K-Means Clustering Algorithm Mining Lab
DCSP-3: Fourier Transform (continuous time) Jianfeng Feng
DCSP-8: Minimal length coding II, Hamming distance, Encryption Jianfeng Feng
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-6: Signal Transmission + information theory 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-20 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-2: Fourier Transform I
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-1: Introduction Jianfeng Feng. DCSP-1: Introduction Jianfeng Feng Office: CS313
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
The Normal Distribution
DREAM PLAN IDEA IMPLEMENTATION Introduction to Image Processing Dr. Kourosh Kiani
Continuous Random Variables Chapter 5 Nutan S. Mishra Department of Mathematics and Statistics University of South Alabama.
Entropy and Information Theory

DEPARTMENT OF HEALTH SCIENCE AND TECHNOLOGY STOCHASTIC SIGNALS AND PROCESSES Lecture 1 WELCOME.
DCSP-15 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-13 Jianfeng Feng Department of Computer Science Warwick Univ., UK
Probability Theory Part 2: Random Variables. Random Variables  The Notion of a Random Variable The outcome is not always a number Assign a numerical.
Copyright © 2008 Pearson Education, Inc. Chapter 11 Probability and Calculus Copyright © 2008 Pearson Education, Inc.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2010 Shreekanth Mandayam ECE Department Rowan University.
Ya Bao Fundamentals of Communications theory1 Random signals and Processes ref: F. G. Stremler, Introduction to Communication Systems 3/e Probability All.
Sep 20, 2005CS477: Analog and Digital Communications1 Random variables, Random processes Analog and Digital Communications Autumn
DCSP-5: Noise Jianfeng Feng Department of Computer Science Warwick Univ., UK
Numerical Analysis - Simulation -
DCSP-4: Modem Jianfeng Feng Department of Computer Science Warwick Univ., UK
TELECOMMUNICATIONS Dr. Hugh Blanton ENTC 4307/ENTC 5307.
Computer Science, Software Engineering & Robotics Workshop, FGCU, April 27-28, 2012 Fault Prediction with Particle Filters by David Hatfield mentors: Dr.
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
Intensity Transformations (Histogram Processing)
8.1 Continuous Probability Distribution. Discrete Vs. Continuous Last chapter we dealt mostly with discrete data (number of things happening that usually.
NETW 505: Random Signals & Noise Course Instructor: Tallal Elshabrawy Instructor Office: C3.321 Lecture Time & Loc.: Sun. 2 nd Slot H9, Mon. 4 th Slot.
S. Mandayam/ CompArch2/ECE Dept./Rowan University Computer Architecture II: Specialized /02 Fall 2001 John L. Schmalzel Shreekanth Mandayam.
TELECOMMUNICATIONS Dr. Hugh Blanton ENTC 4307/ENTC 5307.
Random Variables A random variable is a rule that assigns exactly one value to each point in a sample space for an experiment. A random variable can be.
Chapter 31 Conditional Probability & Conditional Expectation Conditional distributions Computing expectations by conditioning Computing probabilities by.
1 Review of Probability and Random Processes. 2 Importance of Random Processes Random variables and processes talk about quantities and signals which.
亚洲的位置和范围 吉林省白城市洮北区教师进修学校 郑春艳. Q 宠宝贝神奇之旅 —— 亚洲 Q 宠快递 你在网上拍的一套物理实验器材到了。 Q 宠宝贝打电话给你: 你好,我是快递员,有你的邮件,你的收货地址上面 写的是学校地址,现在学校放假了,能把你家的具体 位置告诉我吗? 请向快递员描述自己家的详细位置!
1/39 Seasonal Prediction of Asian Monsoon: Predictability Issues and Limitations Arun Kumar Climate Prediction Center
Dept. Computer Science, Korea Univ. Intelligent Information System Lab. 1 In-Jeong Chung Intelligent Information System lab. Department.
Statistics -Continuous probability distribution 2013/11/18.
Chapter 6 Random Processes
Identify the random variable of interest
Department of Computer Science Warwick Univ., UK
اختر أي شخصية واجعلها تطير!
Statistics Lecture 13.
Statistics Lecture 12.
Chapter 7 The Normal Distribution and Its Applications
Experiments, Outcomes, Events and Random Variables: A Revisit
Electrical Communications Systems ECE Spring 2019
Introduction to Probability: Solutions for Quizzes 4 and 5
Probabilistic Surrogate Models
Presentation transcript:

DCSP-5: Noise Jianfeng Feng Department of Computer Science Warwick Univ., UK

Assignment

Question 8 load handel for i=1:73113 noise(i)=cos(100*i*0.1); end x=y+noise'; sound(x)

Noise in communication systems: probability and random signals I = imread('peppers.png'); imshow(I); noise = 1*randn(size(I)); Noisy = imadd(I,im2uint8(noise)); imshow(Noisy);

Noise in communication systems: probability and random signals Noise is a random signal. By this we mean that we cannot predict its value. We can only make statements about the probability of it taking a particular value, or range of values.

The Probability density function (pdf) p(x) of a random signal, or random variable x is defined to be the probability that the random variable x takes a value between x 0 and x 0 + x. We write this as follows: p(x 0 ) x =P(x 0 <x< x 0 + x)

The probability that the random variable will take a value lying between x 1 and x 2 is then the integral of the pdf over the interval [x 1 x 2 ]:

From the rules of integration: P(x_1<x<x_2)=P(x_2)-P(x_1)

Continuous distribution. An example of a continuous distribution is the Normal, or Gaussian distribution: where m=, is the mean and standard variation value of p(x). The constant term ensures that the distribution is normalized.

Continuous distribution. This expression is important as many actually occurring noise source can be described by it, i.e. white noise or coloured noise.

Generating f(x) from matlab

How would this be used? If we want to know the probability of, say, the noise signal, n(t), having the value [-v_1, v_1], we would evaluate: P(v_1)-P(-v_1)

The distribution function P(x) is usually written in terms of as a function of the error function erf(x). The complementary error function erfc is defined by erfc(x)=1- erf(x)

Discrete distribution. Probability density functions need not be continuous. If a random variable can only take discrete value, its PDF takes the forms of lines. An example of a discrete distribution is the Poisson distribution

We cannot predicate value a random variable may take on a particular occasion. We can introduce measures that summarise what we expect to happen on average. The two most important measures are the mean (or expectation )and the standard deviation. The mean of a random variable x is defined to be

Expectation EX =

In the examples above we have assumed that the mean of the Gaussian distribution to be 0, the mean of the Poisson distribution is found to be. The mean of a distribution is, in common sense, the average value.

The variance is defined to be The square root of the variance is called standard deviation.

The standard deviation is a measure of the spread of the probability distribution around the mean. A small standard deviation means the distribution are close to the mean. A large value indicates a wide range of possible outcomes. The Gaussian distribution contains the standard deviation within its definition.

In many cases the noise present in communication signals can be modelled as a zero-mean, Gaussian random variable. This means that its amplitude at a particular time has a PDF given by Eq. above. The statement that noise is zero mean says that, on average, the noise signal takes the values zero.

We have already seen that the signal to noise ratio is an important quantity in determining the performance of a communication channel. The noise power referred to in the definition is the mean noise power. It can therefore be rewritten as SNR= 10 log 10 ( S / 2 )

If only thermal noise is considered, we have =kT m B where T is the Boltzman's constant (k=1.38 x J/K) T m is the temperature and B is the receiver bandwidth.

Correlation or covariance Cov(X,Y) = E(X-EX)(Y-EY) correlation is normalized covariance Positive correlation Negative correlation No correlation

Stochastic process A stochastic process is a collection of random variables x(t), for each fixed t, it is a random variable For example, when x(t) is a Gaussian variable, it is called a Gaussian process A special Gaussian process is called

white noise n(t) White noise is a random process with a flat power spectrum. In other words, the signal contains equal power within a fixed bandwidth at any center frequency. White noise draws its name from white light in which the power spectral density of the light is distributed over the visible band in such a way that the eye's three color receptors are approximately equally stimulated.

White noise vs. colour noise The most noisy noise is a white noise since its autocorrelation is zero, i.e. corr(n(t), n(s))=0 when t > s Otherwise, we called it colour noise since we can predict some outcome of n(t), given n(s)

load handel plot(y) size(y) x=randn(73113,1); plot(abs(fft(z))) z=y+.1*x; plot(abs(fft(z))) hold on plot(abs(fft(y)),'r') plot(abs(fft(.1*x)),'g')

Why do we love Gaussian?

+ =

X+Y (two Gaussian) = another Gaussian + =