Error rate due to noise In this section, an expression for the probability of error will be derived The analysis technique, will be demonstrated on a binary.

Slides:



Advertisements
Similar presentations
Detection Chia-Hsin Cheng. Wireless Access Tech. Lab. CCU Wireless Access Tech. Lab. 2 Outlines Detection Theory Simple Binary Hypothesis Tests Bayes.
Advertisements

Digital Communication
Coherent phase shift keying In coherent phase shift keying different phase modulation schemes will be covered i.e. binary PSK, quadrature phase shift keying.
1 Helsinki University of Technology,Communications Laboratory, Timo O. Korhonen Data Communication, Lecture6 Digital Baseband Transmission.
1. INTRODUCTION In order to transmit digital information over * bandpass channels, we have to transfer the information to a carrier wave of.appropriate.
S Digital Communication Systems Bandpass modulation II.
Noise on Analog Systems
Diversity techniques for flat fading channels BER vs. SNR in a flat fading channel Different kinds of diversity techniques Selection diversity performance.
Digital Data Transmission ECE 457 Spring Information Representation Communication systems convert information into a form suitable for transmission.
3F4 Optimal Transmit and Receive Filtering Dr. I. J. Wassell.
1 Dr. Uri Mahlab. INTRODUCTION In order to transmit digital information over * bandpass channels, we have to transfer the information to a carrier wave.
E&CE 418: Tutorial-6 Instructor: Prof. Xuemin (Sherman) Shen
Digital communication - vector approach Dr. Uri Mahlab 1 Digital Communication Vector Space concept.
Matched Filters By: Andy Wang.
1 Digital Communication Systems Lecture-3, Prof. Dr. Habibullah Jamal Under Graduate, Spring 2008.
Communication Systems
Random Processes and LSI Systems What happedns when a random signal is processed by an LSI system? This is illustrated below, where x(n) and y(n) are random.
EE513 Audio Signals and Systems Statistical Pattern Classification Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Modulation, Demodulation and Coding Course
Lecture II Introduction to Digital Communications Following Lecture III next week: 4. … Matched Filtering ( … continued from L2) (ch. 2 – part 0 “ Notes.
Digital Communication I: Modulation and Coding Course
Dept. of EE, NDHU 1 Chapter Three Baseband Demodulation/Detection.
CHAPTER 6 PASS-BAND DATA TRANSMISSION
POWER CONTROL IN COGNITIVE RADIO SYSTEMS BASED ON SPECTRUM SENSING SIDE INFORMATION Karama Hamdi, Wei Zhang, and Khaled Ben Letaief The Hong Kong University.
TELECOMMUNICATIONS Dr. Hugh Blanton ENTC 4307/ENTC 5307.
Baseband Demodulation/Detection
1 Dr. Uri Mahlab. 1.א1.א תוכן עניינים : Introduction of Binary Digital Modulation Schemes 2-10 Probability of error Transfer function of the optimum.
EE 551/451, Fall, 2006 Communication Systems Zhu Han Department of Electrical and Computer Engineering Class 14 Oct. 5 th, 2006.
Performance of Digital Communications System
1 Chapter 9 Detection of Spread-Spectrum Signals.
Analysis of Optimal and Suboptimal Discrete-Time Digital Communications Receivers Clemson University SURE Program 2005 Justin Ingersoll, Prof. Michael.
Chapter 4: Baseband Pulse Transmission Digital Communication Systems 2012 R.Sokullu1/46 CHAPTER 4 BASEBAND PULSE TRANSMISSION.
Real-Time Signal-To-Noise Ratio Estimation Techniques for Use in Turbo Decoding Javier Schlömann and Dr. Noneaker.
CHAPTER 5 SIGNAL SPACE ANALYSIS
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Mean, Variance, Moments and.
EE 3220: Digital Communication
Dept. of EE, NDHU 1 Chapter One Signals and Spectra.
ECE 4710: Lecture #31 1 System Performance  Chapter 7: Performance of Communication Systems Corrupted by Noise  Important Practical Considerations: 
Baseband Receiver Receiver Design: Demodulation Matched Filter Correlator Receiver Detection Max. Likelihood Detector Probability of Error.
Noise and Data Errors Nominal Observation for “1” Nominal Observation for “0” Probability density for “0” with Noise Probability density for “1” with Noise.
1 Review of Probability and Random Processes. 2 Importance of Random Processes Random variables and processes talk about quantities and signals which.
Performance of Digital Communications System
WAVELET NOISE REMOVAL FROM BASEBAND DIGITAL SIGNALS IN BANDLIMITED CHANNELS Dr. Robert Barsanti SSST March 2010, University of Texas At Tyler.
Digital Communications I: Modulation and Coding Course Spring Jeffrey N. Denenberg Lecture 3c: Signal Detection in AWGN.
SungkyunKwan Univ Communication Systems Chapter. 7 Baseband pulse Transmission by Cho Yeon Gon.
Institute for Experimental Mathematics Ellernstrasse Essen - Germany DATA COMMUNICATION introduction A.J. Han Vinck May 10, 2003.
Copyright 1998, S.D. Personick. All Rights Reserved. Telecommunications Networking I Lectures 4&5 Quantifying the Performance of Communication Systems.
Section 9.4 – Solving Differential Equations Symbolically Separation of Variables.
Báo cáo đồ án Thông Tin Số (CT386) Nhóm 2: 1.Cao Kim Loan Lâm Quốc Sự Bộ môn Điện Tử Viễn Thông GVHD : TS.Lương Vinh Quốc Danh.
Slides by Prof. Brian L. Evans and Dr. Serene Banerjee Dept. of Electrical and Computer Engineering The University of Texas at Austin EE445S Real-Time.
TRANSMISI BASE-BAND oleh :Budi Prasetya
Lecture 1.31 Criteria for optimal reception of radio signals.
The Viterbi Decoding Algorithm
Telecommunications Networking I
Advanced Wireless Networks
Lecture 1.30 Structure of the optimal receiver deterministic signals.
Advanced Wireless Networks
Quantization and Encoding
Lecture 1.8. INTERSYMBOL INTERFERENCE
INTERSYMBOL INTERFERENCE (ISI)
Digital Communication Systems Lecture-3, Prof. Dr. Habibullah Jamal
EE513 Audio Signals and Systems
5.2 Least-Squares Fit to a Straight Line
S Transmission Methods in Telecommunication Systems (5 cr)
EE 6332, Spring, 2017 Wireless Telecommunication
INTERSYMBOL INTERFERENCE (ISI)
Chapter 7 Error Probabilities for Binary Signalling
Malong Wang Ting-change
Continuous Random Variables: Basics
Presentation transcript:

Error rate due to noise In this section, an expression for the probability of error will be derived The analysis technique, will be demonstrated on a binary PCM based on polar NRZ signaling The channel noise is modeled as additive white Gaussian noise 𝑤(𝑡) of zero mean and power spectral density 𝑁 0 2

Bit error rate The receiver of the communication system can be modeled as shown below The signaling interval will be 0≤𝑡≤ 𝑇 𝑏 , where 𝑇 𝑏 is the bit duration x(t) y(t) Y

Bit error rate The received signal can be given by 𝑥 𝑡 = +𝐴+𝑤 𝑡 , 𝑠𝑦𝑚𝑏𝑜𝑙 1 𝑤𝑎𝑠 𝑠𝑒𝑛𝑡 −𝐴+𝑤 𝑡 , 𝑠𝑦𝑚𝑏𝑜𝑙 0 𝑤𝑎𝑠 𝑠𝑒𝑛𝑡 It is assumed that the receiver has acquired knowledge of the starting and ending times of each transmitted pulse The receiver has a prior knowledge of the pulse shape, but not the pulse polarity

Receiver model The structure of the receiver used to perform this decision making process is shown below

Possible errors When the receiver detects a bit there are two possible kinds of error Symbol 1 is chosen when a 0 was actually transmitted; we refer to this error as an error of the first kind Symbol 0 is chosen when a 1 was actually transmitted; we refer to this error as an error of the second kind

Average probability of error calculations To determine the average probability of error, each of the above two situations will be considered separately If symbol 0 was sent then, the received signal is 𝑥 𝑡 =−𝐴+𝑤 𝑡 , 0≤𝑡≤ 𝑇 𝑏

Average probability of error calculations The matched filter output will be given by 𝑦= 1 𝑇 𝑏 0 𝑇 𝑏 𝑥 𝑡 𝑑𝑡 𝑦=−𝐴+ 1 𝑇 𝑏 0 𝑇 𝑏 𝑥 𝑡 𝑑𝑡 =−A The matched filter output represents a random variable 𝑌

Average probability of error calculations This random variable is a Gaussian distributed variable with a mean of −𝐴 The variance of 𝑌 is 𝜎2 𝑌 = 𝑁 0 2 𝑇 𝑏 The conditional probability density function the random variable 𝑌, given that symbol 0 was sent, is therefore 𝑓 𝑌 𝑦 0 = 1 𝜋 𝑁 0 / 𝑇 𝑏 𝑒 − 𝑦+𝐴 2 𝑁 0 𝑇 𝑏

Average probability of error calculations The probability density function is plotted as shown below To compute the conditional probability, 𝑝 10 , of error that symbol 0 was sent, we need to find the area between 𝜆 and ∞

In mathematical notations 𝑝 10 =𝑃 𝑦>𝜆 𝑠𝑦𝑚𝑏𝑜𝑙 0 𝑤𝑎𝑠 𝑠𝑒𝑛𝑡 𝑝 10 = 𝜆 ∞ 𝑓 𝑦 𝑦 0 𝑑𝑦 𝑝 10 = 1 𝜋 𝑁 0 / 𝑇 𝑏 𝜆 ∞ 𝑒 − 𝑦+𝐴 2 𝑁 0 / 𝑇 𝑏 𝑑𝑦

The integral erfc⁡(𝑧)= 2 𝜋 𝜆 ∞ 𝑒 −𝑧2 𝑑𝑧 Is known as the complementary error function which can be solved by numerical integration methods

By letting 𝑧= 𝑦+𝐴 𝑁 0 / 𝑇 𝑏 , 𝑑𝑦= 𝑁 0 / 𝑇 𝑏 𝑑𝑧, 𝑝10 became 𝑝 10 = 1 𝜋 𝐴+𝜆 𝑁 0 / 𝑇 𝑏 ∞ 𝑒 −𝑧2 𝑑𝑧 𝑝 10 = 1 2 𝑒𝑟𝑓𝑐 𝐴+𝜆 𝑁 0 / 𝑇 𝑏

By using the same procedure, if symbol 1 is transmitted, then the conditional probability density function of Y, given that symbol 1 was sent is given 𝑓 𝑌 𝑦 1 = 1 𝜋 𝑁 0 / 𝑇 𝑏 𝑒 − 𝑦−𝐴 2 𝑁 0 𝑇 𝑏 Which is plotted in the next slide

The probability density function 𝑓(𝑌|1) is plotted as shown below

The probability of error that symbol 1 is sent and received bit is mistakenly read as 0 is given by 𝑝 01 = 𝜆 ∞ 𝑓 𝑦 𝑦 1 𝑑𝑦 𝑝 10 = 1 𝜋 𝑁 0 / 𝑇 𝑏 𝜆 ∞ 𝑒 − 𝑦−𝐴 2 𝑁 0 / 𝑇 𝑏 𝑑𝑦

Expression for the average probability of error 𝑝 10 = 1 2 𝑒𝑟𝑓𝑐 𝐴−𝜆 𝑁 0 / 𝑇 𝑏 The average probability of error 𝑃 𝑒 is given by 𝑃 𝑒 = 𝑃 0 𝑃 10 + 𝑃 1 𝑃 01 𝑃 𝑒 = 𝑃 0 2 𝑒𝑟𝑓𝑐 𝐴+𝜆 𝑁 0 / 𝑇 𝑏 + 𝑃 1 2 𝑒𝑟𝑓𝑐 𝐴−𝜆 𝑁 0 / 𝑇 𝑏

In order to find the value of 𝜆 which minimizes the average probability of error we need to derive 𝑃 𝑒 with respect to 𝜆 and then equate to zero as 𝜕 𝑃 𝑒 𝜕𝜆 =0 From math's point of view (Leibniz’s rule) 𝜕erfc⁡(𝑢) 𝜕𝑢 =− 1 𝜋 𝑒 −𝑢2

Optimum value of the threshold 𝜆 value If we apply the previous rule to 𝑃 𝑒 , then we may have the following equations 𝜕 𝑃 𝑒 𝜕𝜆 =− 1 𝜋 𝑁 0 𝑇 𝑏 𝑝 0 2 𝑒 − ( 𝐴+𝜆) 2 𝑁 0 𝑇 𝑏 + 1 𝜋 𝑁 0 𝑇 𝑏 𝑝 1 2 𝑒 − ( 𝐴−𝜆) 2 𝑁 0 𝑇 𝑏 =0 By solving the previous equation we may have 𝑝 0 𝑝 1 = 𝑒 − ( 𝐴−𝜆) 2 𝑁 0 𝑇 𝑏 𝑒 − ( 𝐴+𝜆) 2 𝑁 0 𝑇 𝑏 = 𝑓 𝑦 (𝑦|1) 𝑓 𝑦 (𝑦|0)

From the previous equation, we may have the following expression for the optimum threshold point 𝜆 𝑜𝑝𝑡 = 𝑁 0 4𝑇 𝑏 𝑙𝑛 𝑝 0 𝑝 1 If both symbols 0 and 1 occurs equally in the bit stream, then 𝑝 0 = 𝑝 1 = 1 2 , then 𝜆 𝑜𝑝𝑡 =0

𝑃 𝑒 = 1 2 𝑒𝑟𝑓𝑐 𝐴 𝑁 0 / 𝑇 𝑏 = 1 2 𝑒𝑟𝑓𝑐 𝐴 2 𝑁 0 / 𝑇 𝑏 = 1 2 𝑒𝑟𝑓𝑐 𝐴 2 𝑇 𝑏 𝑁 0 = 1 2 𝑒𝑟𝑓𝑐 𝐸 𝑏 𝑁 0

Average probability of error vs 𝐸 𝑏 𝑁 0 A plot of the average probability of error as a function of the signal to noise energy is shown below

As it can be seen from the previous figure, the average probability of error decreases exponential as the signal to noise energy is increased For large values of the signal to noise energy the complementary error function can be approximated as

Example1 Solution

Example1 solution

Example 2

Example 2 solution The average probability of error is given by 𝑃 𝑒 = 1 2 erfc 𝐸 𝑏 𝑁 0 where 𝐸 𝑏 = 𝐴 2 𝑇 𝑏 , We can rewrite 𝑃 𝑒 = 1 2 erfc 𝐴 2 𝑇 𝑏 𝑁 0 = 1 2 erfc 2 𝐴 2 2 𝑁 0 𝑇 𝑏 = 1 2 erfc 2 𝐴 𝜎 , where 𝜎= 𝑁 0 2 𝑇 𝑏

Example 2 solution

Example 2 Solution

Example 2 solution

Example 2 solution

Example 2 solution

Example 3

Example 3 solution Signaling with NRZ pulses represents an example of antipodal signaling, we can use 𝑃 𝑒 = 1 2 𝑒𝑟𝑓𝑐 𝐸 𝑏 𝑁 0 1× 10 −3 = 1 2 𝑒𝑟𝑓𝑐 𝐴 2 ( 1 56000 ) 10 −6

Example 3 solution Using the erfc⁡(𝑥) table we find 𝐴 2 1 56000 10 −6 =2.18 𝐴 2 =0.266 With 3-dB power loss the power at the transmitting end of the cable would be twice the power at the receiving terminal, this means that 𝑃 𝑡𝑥 =2 𝑃 𝑟𝑥 =0.532 𝑤𝑎𝑡𝑡