Baseband Demodulation/Detection

Slides:



Advertisements
Similar presentations
Digital Communication
Advertisements

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.
1 Multi-user Detection Gwo-Ruey Lee. Wireless Access Tech. Lab. CCU Wireless Access Tech. Lab. 2 Outlines Multiple Access Communication Synchronous CDMA.
Diversity techniques for flat fading channels BER vs. SNR in a flat fading channel Different kinds of diversity techniques Selection diversity performance.
Dr. Uri Mahlab1. 2 Informationsource TransmitterTransmitter Channel ReceiverReceiver Decision Communication system.
Digital Data Transmission ECE 457 Spring Information Representation Communication systems convert information into a form suitable for transmission.
Elements of a Digital Communication System
1 Dr. Uri Mahlab. INTRODUCTION In order to transmit digital information over * bandpass channels, we have to transfer the information to a carrier wave.
Digital Communications I: Modulation and Coding Course Spring Jeffrey N. Denenberg Lecture 3b: Detection and Signal Spaces.
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.
Digital Transmission through the AWGN Channel ECE460 Spring, 2012.
Carrier-Amplitude modulation In baseband digital PAM: (2d - the Euclidean distance between two adjacent points)
4.1 Why Modulate? 이번 발표자료는 연구배경 연구복적 제안시스템 시뮬레이션 향후 연구방향으로 구성되어 있습니다.
Slides by Prof. Brian L. Evans and Dr. Serene Banerjee Dept. of Electrical and Computer Engineering The University of Texas at Austin EE345S Real-Time.
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
Digital Baseband Transmission S Transmission Methods in Telecommunication Systems (5 cr)
Idiots, it’s trade-off!! 풍선효과 Bitrate R Bit error PB Bandwidth W Power
Dept. of EE, NDHU 1 Chapter Three Baseband Demodulation/Detection.
TELECOMMUNICATIONS Dr. Hugh Blanton ENTC 4307/ENTC 5307.
Digital Transmission through the AWGN Channel ECE460 Spring, 2012.
Course Review for Final ECE460 Spring, Common Fourier Transform Pairs 2.
EEE Chapter 6 Matched Filters Huseyin Bilgekul EEE 461 Communication Systems II Department of Electrical and Electronic Engineering Eastern Mediterranean.
1 Dr. Uri Mahlab. 1.א1.א תוכן עניינים : Introduction of Binary Digital Modulation Schemes 2-10 Probability of error Transfer function of the optimum.
1 Chapter 1 Introduction to spread-spectrum communications Part I.
Medicaps Institute of Technology & Management Submitted by :- Prasanna Panse Priyanka Shukla Savita Deshmukh Guided by :- Mr. Anshul Shrotriya Assistant.
Performance of Digital Communications System
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
Unipolar vs. Polar Signaling Signal Space Representation
Geometric Representation of Modulation Signals
Matched Filtering and Digital Pulse Amplitude Modulation (PAM)
EE 3220: Digital Communication
EE 3220: Digital Communication
Digital Communications Chapeter 3. Baseband Demodulation/Detection Signal Processing Lab.
ECE 4710: Lecture #31 1 System Performance  Chapter 7: Performance of Communication Systems Corrupted by Noise  Important Practical Considerations: 
Constellation Diagram
DIGITAL CARRIER MODULATION SCHEMES Dr.Uri Mahlab 1 Dr. Uri Mahlab.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Baseband Receiver Receiver Design: Demodulation Matched Filter Correlator Receiver Detection Max. Likelihood Detector Probability of Error.
EE 3220: Digital Communication Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser Slman bin Abdulaziz.
1 complex envelope of BFSK is nonlinear function of m(t) spectrum evaluation - difficult - performed using actual time averaged measurements PSD of BFSK.
Performance of Digital Communications System
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.
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.
Lecture 1.31 Criteria for optimal reception of radio signals.
CHAPTER 3 SIGNAL SPACE ANALYSIS
SIGNAL SPACE ANALYSIS SISTEM KOMUNIKASI
Chapter 6 Matched Filters
Chapter 6 Matched Filters
Lecture 1.30 Structure of the optimal receiver deterministic signals.
Advanced Wireless Networks
Principios de Comunicaciones EL4005
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.
Digital Communication Systems Lecture-3, Prof. Dr. Habibullah Jamal
Vector Concept of Signals
S Transmission Methods in Telecommunication Systems (5 cr)
EE 6332, Spring, 2017 Wireless Telecommunication
Bandpass Modulation and Demodulation
Malong Wang Ting-change
Presentation transcript:

Baseband Demodulation/Detection Chapter 3 Baseband Demodulation/Detection

Baseband Demodulation/Detection 2

Demodulation and Detection

Why Baseband Demodulation/Detection ? Received pulses are distorted because of the following factors: Intersymbol Interference causes smearing of the transmitted pulses. Addition of channel noise degrades the transmitted pulses. Transmission channel causes further smearing of the transmitted pulses. Demodulation (Detection) is the process of determining the transmitted bits from the distorted waveform. Transmitted Received waveforms as a function of distance waveform 4

Models for Transmitted and Received Signals For binary transmission, the transmitted signal over a symbol interval (0, T) is modeled by The received signal is degraded by: (i) noise n(t) and (ii) impulse response of the channel for i = 1, …, M. Given r(t), the goal of demodulation is to detect if bit 1 or bit 0 was transmitted. In our derivations, we will first use a simplified model for received signal Later, we will see that degradation due to the impulse response of the channel is eliminated by equalization.

Basic Steps in Demodulation

A Vector View of CT Waveforms (1) Orthonormal Waveforms: Two waveforms y1(t) and y2(t) are orthonormal if they satisfy the following two conditions Normalized to have unit energy 2. Two arbitrary signals s1(t) and s2(t) can be represented by linear combinations of two orthonormal basis functions , i.e.

Geometric Representation of Signals

A Vector View of CT Waveforms (2) 1. N-dimensional basis functions: consists of a set {yi(t)}, (1 ≤ i ≤ N), of orthonormal (or orthogonal) waveforms. 2. Given a basis function, any waveform in the represented as a linear combination of the basis functions.

A Vector View of CT Waveforms (3) Given a basis function, any waveform in the represented as a linear combination of the basis functions or, in a more compact form, The coefficient aij are calculated as follows where Kj is the energy present in the basis signal.

Activity 1 Demonstrate that signals si(t), i = 1,2,3, are not orthogonal. Demonstrate that yi(t), i = 1,2, are orthogonal. Express si(t), i = 1,2,3, as a linear combination of the basis functions yi(t), i = 1,2. Demonstrate that yi(t), i = 1,2, are orthogonal. Express si(t), i = 1,2,3, as a linear combination of the basis functions y i(t), i = 1,2. 1111

Activity 1 (a) s1(t), s2(t), and s3(t) are clearly not orthogonal, i.e. the time integrated value over a symbol duration of the product of any two of the three waveforms is not zero, e.g. (b) Using the same method, we can verify this signal form an orthogonal set.

Activity 1 (c) We know that

Activity 1 (d) are obviously orthogonal. (e) Similar to (c), we have

Activity 2 Show that the energy in a signal si(t) is given by

Activity 2

SNR used in Digital Communications In digital communications, SNR is defined as the ratio of the energy (Eb) present in the signal representing a bit to the power spectral density (N0) of noise. In terms of signal power S and the duration T of bit, the bit energy is given by Eb = S × T. In terms of noise power N and bandwidth W, the PSD of noise is given by N0 = N / W. SNR is therefore given by where Rb is the rate of transmission in bits transmitted per second (bps). Bit-error probability is the probability of error in a transmitted bit. ROC curves are plots of Bit-error probability versus SNR.

Detection of binary signal in AWGN

Maximum Likelihood Detector (1) The sampled received signal is given by where ai(T) represents the signal levels obtained after sampling. For bit 1, ai(T) = a1 and for bit 0, ai(T) = a2. The pdf of n0 is Gaussian with zero mean The conditional pdf of z given that bit 1 or bit 0 was transmitted is given by

Maximum Likelihood Detector (2) The conditional pdf of z given that bit 1 or bit 0 was transmitted are referred to as maximum likelihoods. The maximum likelihoods have the following distributions

Maximum Likelihood Detector (1) Maximum Likelihood Ratio Test: is given by where P(s1) and P(s2) are the priori probabilities that s1(t) and s2(t), respectively, are transmitted. H1 and H2 are two possible hypotheses. H1 states that signal s1(t) was transmitted and hypothesis H2 states that signal s2(t) was transmitted. For P(s1) = P(s2), the maximum likelihood ratio test reduces to

Activity 3 Show that the probability of bit error for maximum likelihood ratio test is given by Values of Q(x) are listed in Table B.1 in Appendix B page 1046. 22

Matched Filtering (1)

Matched Filtering (2) Design the Receiving filter h(t) Design a filter that maximizes the SNR at time (t = T) of the sampled signal The instantaneous signal power to noise power is given by where ai(t) is the filtered signal and is the variance of the output noise The information bearing component is given by

Matched Filtering (3) Given that input noise n(t) is AWGN with Sn(f) = N0/2, the PSD of the output noise is given by The output noise power is given by The SNR is given by

Matched Filtering (4) Schwartz Inequality: with the equality valid if f1(x) = kf2*(x). Applying the Schwatz inequality to the SNR gives or,

Matched Filtering (5) The maximum SNR is given by which is possible if

Activity 4 Given that the transmitted signal is shown in the following figure, determine the impulse response of the matched filter. 28

Matched Filtering (6) Correlator Implementation of matched filter: The output of the matched filter is given by The output at t = T is given by which leads to the following correlator implementation for matched filter

Detection of binary signal: Review Matched Filter: Impulse response: Maximum SNR = (a1)2/s20 = 2Es/N0 ML Detector: Probability of Error: The overall goal of the receiver should be to minimize the probability of bit error PB.. In other words, we are interested in maximizing (a1 – a2)2/s20. The filter is designed such that it is matched to the difference of [s1(t) – s2(t)]. Maximum SNR of the matched filter = (a1 – a2)2/s20 = 2(Es1 – Es2)/N0 = 2Ed/N0. Probability of Error:

Activity 5 By defining the cross-correlation coefficient as show that the probability of bit error using a filter matched to [s1(t) – s2(t)] is given by Using the above relationship, show that the probability of bit error is given by

Activity 6 Determine the probability of bit error for a binary communication system, which receives equally likely signals s1(t) and s2(t) shown in the following diagram Assume that the receiving filter is a matched filter and the power spectral density of AWGN is N0 = 10-12 Watt/Hz.

Error Probability Performance of Binary Signal 1. Unipolar signaling In Unipolar signaling, the signal selection to represent bits 1 and 0 is as follows: The receiver is shown by the following diagram.

Unipolar Signaling Unipolar signal forms an orthogonal signal set. When s1(t) plus AWGN being received, the expected value of z(T), given that s1(t) was sent, is When s2(t) plus AWGN being received, a2(T)=0. The optimum decision threshold is: The bit-error performance is:

Bipolar Signaling In bipolar signaling, the signal selection to represent bits 1 and 0 is as follows: The receiver is shown by the following diagram.

Bipolar Signaling Bipolar signal is a set of antipodal signal, e.g. s1(t)=-s2(t). The optimum decision threshold is: The bit-error performance is:

Unipolar vs. Bipolar 37