Digital Transmission Methods S
|
|
- Gerard Nickolas Sanders
- 5 years ago
- Views:
Transcription
1 Digital ransmission ethods S-7.5 Second Exercise Session Hypothesis esting Decision aking Gram-Schmidt method Detection.K.K. Communication Laboratory 5//6
2 Exercise We assume that under hypothesis H the source output is a constant voltage m. Under hypothesis H the source output is zero. Voltage is corrupted by additive noise. he output is sampled with N samples for each second. Each noise sample is modelled as zero mean Gaussian random variable with variance. he samples are assumed to be independent and identically distributed. It is known by Bayesian theory that the optimal test in such case is a likelihood ratio test compared to a decision threshold. a. Define the sufficient statistic of the test. b. What is the distribution of the sufficient statistic under the two hypotheses? c. Calculate the detection and the false alarm probability of the optimal test. d. What is the total error probability?
3 Exercise Sol. Simple binary hypothesis tests Only possible source outputs Hypotheses he transition mechanism generates points according to known conditional PDFs Observation space is one dimensional in binary hypothesis tests A cost is assigned for each possible event 4 possible events H generated and H chosen H generated and H chosen False alarm probability H generated and H chosen Detection probability H generated and H chosen iss probability
4 Exercise Sol. (contd) he source output under the hypotheses is : he probability density of a single sample r i under the hypotheses is : r i : the i th random variable R i : the value of the i th sample he joint pdf of the N samples is : What is implied? R R, R,, R, R i N
5 Exercise Sol. (contd) Construct the likelihood ratio test of the hypotheses : he common terms are cancelled: Bayesian threshold dependent on a priori prob. & decision costs he calculations are brought to the log-domain : Equivalently : ln Finally : Decision threshold ln ln
6 Exercise Sol. (contd) a. he sufficient statistic of the test adds the N collected amplitudes and compares the sum with the decision threshold. If the sum is lower than the decision threshold, hypothesis H is favoured. Otherwise the voltage m is assumed to be present. b. Under hypothesis H the sufficient statistic is the sum of N independent Gaussian random variables with zero mean and variance. As a result the sufficient statistic follows normal distribution with zero mean and variance N. Under hypothesis H the sufficient statistic is the sum of N independent Gaussian random variables with mean equal to m and variance. he sufficient statistic follows normal distribution with mean equal to Nm and variance N. HIN!! he sum of independent Gaussian random variables is also a Gaussian Random variable with mean the sum of individual means and variance equal to the sum of individual variances For m = and = we plot the PDF of the sufficient statistic under both the hypotheses and for different amount of samples
7 Exercise Sol. (contd).5 N = Samples.5 N = 4 Samples.45.4 Sufficient Statistic PDF under H Sufficient Statistic PDF under H.45.4 Sufficient Statistic PDF under H Sufficient Statistic PDF under H Sufficient Statistic PDF Sufficient Statistic PDF Observation Space L Observation Space L As the number of samples increases the mean separation of the two distributions increases too As the number of samples increases the variance of both distributions increases. he probability of decision error is reduced as the number of samples increases How to calculate the probability of decision error?
8 Exercise Sol. (contd) c. False alarm probability : Decide that the voltage is present when it is actually absent Q z z exp x exp z z erfc dx erfc z x dx Q z c. Detection probability : Decide that the voltage is present when it is actually present d. he probability of decision error is written below : N = Samples P F =.4 P D =.76 N = 4 Samples P F =.6 P D =.84
9 Exercise Consider a DS-SS system where the following Walsh-Hadamard codes of length N = 4 are used for orthogonalization.. Assume BPSK modulation scheme and symbol energy equal to Eb. he noise in the receiver is modelled as Gaussian random variable with zero mean and variance equal to Compare the performance of the following two schemes: Case : For bit + the firts code is used and for bit the second code is used Case : Only the first code with antipodal signalling is used both for bits and
10 Exercise Sol. One can see that the two waveforms are orthogonal to each other. his means that for the performance of the two schemes we expect a result similar to the one by comparison of BFSK and BPSK. Case : Orthogonal signalling H : A A A A H : A A A A he joint pdf of the 4 samples is : R A R A R3 A R4 A H : exp exp exp exp H R A R A R3 A : exp exp exp R 4 A exp he likelihood ratio of the two hypotheses is :
11 Exercise Sol. Finally : H R4 R3 ln H 4A he distribution of the test statistic under the hypotheses is : For equally probable hypotheses the probability of error is : H : ~ N A, H : ~ N A, e e H e H e H he probability of error under hypothesis H is : L A A e e H exp dl Q Under antipodal signalling we do not have the terms of the likelihood ratio cancelled. he sufficient statistic of the test contains all the 4 random variables, R,R,R 3 and R 4 After some manipulation the sufficient statistic is found to be : Why the lower integration limit equals?
12 Exercise Sol. H A R R R R ln H he distribution of the test statistic under the hypotheses becomes : H : ~ N A, 4 H : ~ N A, 4 By following the same procedure as previously : L A 4A e e H exp dl Q 4 4
13 Exercise 3 A digital transmission system in an AWGN channel is power limited but not bandwidth limited. he receiver power is pw and the one-sided noise power spectral density is - W/Hz. Using orthogonal signalling where the number of symbols is an integer power of two: a. Determine the minimum to transmit bps if the BER requirement equals -6 b. Calculate how many times must the signal bandwidth be increased from the value in a. when the bit rate is doubled but the BER requirement remains unchanged.
14 Exercise 3 Sol. For orthogonal signalling the upper bound for the BEP is : E Prx Prx log ( ) BEP Q Q Q No NoRs NoRb For the input values : Prx NoR b BEP Q 7 log ( ) For different values of : 4 BEP Q log ( ) Q BEP Q log ( ) Q BEP Q log ( ) 4Q
15 Exercise 3 Sol. (contd) When the bit rate is doubled we can determine the required -value in the same way : 4 8 BEP Q 5log ( ) 4Q BEP Q 5log ( ) 8Q BEP Q 5log ( ) 6Q BEP Q 5log ( ) 3Q he required bandwidth is proportional to the number of symbol values. hus the increase of the bandwidth is 64/8 = 8-fold.
16 Exercise 4 Using the Gram-Schmidt procedure find an orthogonal basis functions set for the three signals depicted in the following figure: s (t) s (t) s 3 (t) 3 t t 3 t -4 Express the three signals with respect to the orthogonal basis functions set.
17 Exercise 4 Sol. Gram-Schmidt orthogonalization procedure permits to: Represent each of energy signals as a linear combination of N orthonormal basis functions where N i N j ij j s t s t, t i,,, where Orhtogonalization Algorithm: Define the first basis function as: Define the other basis functions as: In practice: he energy of the first signal is: herefore the first basis function is: i,,, sij si t j t dt, j,,, N E s t t E t i and gi t, i,3, N i g dt 4 t t dt s t, if t E, otherwise t j, i t dt, if i j if i j where git sit sij jt i j
18 Calculate: s s t t dt 4 dt 4 Apply the formula: 4, t g t s t s t, otherwise Similarly: Exercise 4 Sol. (contd) t, if t, otherwise 3 3 and 3 3 s s t t dt dt 3 3 s s t t dt 3 dt 3 3, t3 g3 t s3 t s3 t s3 t, otherwise 3t, if t3, otherwise he signals can be represented as: s t t s t t t s t t t t 3 3 Remark: he sum of the squares of the coefficients equals the signal energy
19 Exercise 5 Consider the following signal set: E cos fcti t si t 4 otherwise a. What is the dimensionality of the signal set? b. Find an orthogonal basis functions set for the above signal set. c. Using the formula: N j s t s t, i,,3, 4 i ij j c. find the coefficients sij i,,3, 4 c. Sketch the signal set within the orthogonal basis functions space. f c n c
20 Break the cosine into sums: Exercise 5 Sol. E E E si t cos fcti cos fct cos i sin fct sin i, t Linear combination of orthogonal function!! he orthonormal functions are: t cos fct t sin fct Let s calculate s(t): t E E E c c c s t cos f t cos f t cos sin f t sin E E cos c sin c s t f t f t s t E cos fct E sin fct s s
21 Exercise 5 Sol. (contd) he signal coordinates in the basis functions orthogonal system are: s s 3 t t : E, E s t :, E : E, E s4 t : E, s 4 (t) s 3 (t) (t) s (t) s (t) (t)
22 Exercise 6 hree messages m, m, m3 are to be transmitted over an AWGN channel with power spectral density he messages are: s t t otherwise N t st s3t t otherwise a. What is the dimensionality of the signal space? b. Find an appropriate basis for the signal space. c. Draw the signal constellation for this problem d. Derive and sketch the optimal decision regions R, R, R3 e. Which of the three messages is more vulnerable to errors and why? P error m transmitted, i,,3, is larger? In other words which of i
23 Exercise 6 Sol. a. he dimensionality of the signal space is N= since s 3 (t) is antipodal to s (t) b. A simple set of othogonal functions can be time-shifted rectangular pulses (t) t) / / c. he signal coordinates in the basis functions system are: s s s 3 :, :, :, s3 s s
24 x x x 3 x 3 P m P m P m P m P m P m P m P m x x x x x x x x x x Exercise 6 Sol.. (contd( contd) d. he borders of the decision areas are calclated as: 3,,,,,,,, 3 x 3 x 3 x 3 x P m P m P m P m P m P m P m P m x x x x x x x x x xm xm xm xm 3 3,,,,,,,, x! x! xm xm xm xm x x x 3 x 3 P m P m P m P m P m P m P m P m x x x x x x x x x 3,,,,,,,, x! x xm xm xm xm s3 s s Equiprobable alphabet set and same signals energy
25 Exercise 6 Sol.. (contd( contd) e. Symbol error probability calculation for m, P e m P c m P x x m Pe m exp " " Pe m exp " " Pe m exp x t t dt Note : Q x Q x " " dt dx Pe m Q Q Q N N N Q z z exp x exp z z erfc dx erfc z x dx Q z
26 e. For symbol m the error probability is:!, P e m P c m P x x x m Exercise 6 Sol.. (contd( contd) x y Pe m exp dx exp dy " " 4" 4" " Pe m exp exp " 4" t u " dt " " du Pe m Q Q Q Q Q N N N N N y x x ~ N,"
27 Exercise 7 Consider a set of signal waveforms s m t, m, t all of which have the same energy E. he signal waveforms are separated in frequency: Es c sm t cos f t % f t, m,,,, t a. For which frequencies df the above signal set is orthogonal? b. Assume that Sm(t) are orthogonal and define a new set of waveforms as: s# t s t s t, m, t m m k k Show that the signal waveforms have equal energy given by: E# c. Show that the signals are now correlated with correlation coefficient: $ mn s# m t s# n t dt E# E
28 Exercise 7 Sol. he frequency separation df determines the degree to which we can disciminate among the possible transmitted signals. Es cos cos & s t s t dt f t m% f t f t n% f t dt mn m n c c Es Es sin m n % f & mn cos m n% f t dt cos 4 fct m n% f t dt m n % f f c We look for neighboring frequency separation m-n= he signal waveforms are orthogonal when the separation between neighboring frequencies is a multiple of / he minimum frequency separation for rthogonality between neighboring frequencies is: df = /
29 he energy of the signal waveform Exercise 7 Sol. (contd) s t m# is E# sm# t dt sm t sk t dt sm t dt sk t sn t dt sm t sk t dt k k n k E E# E E E E E he multiple is if kn Less energy Less dimensions he correlation coefficient is given by: $ $ $ s# ts# tdt s t s t s t s t dt E# E# mn m n m k n l k l s ts tdt s t s tdt s t s tdt s t s tdt E# l k k l mn m n m l n k k l mn E E E E E E # # Evaluate both results for =
30 Appendix In binary Bayesian hypotheses testing problems it is decided that hypothesis is present in a way to minimize the Bayesian risk: R C p Pr say H H is true C p Pr say H H is true C p Pr say H H is true C p Pr say H H is true Given the observation vector, show that the division of the observation space minimizing the Bayesian risk is the following test: say H say H if if r r (!' ( ' p ( R r p r H H r H R H ' p C C p C C Assume that under hypothesis H the generated signal is absent and the received signal is: x t where w(t) stands for one dimensional Gaussian noise with zero mean and variance. Under hypothesis H the generated signal is present and the received signal is: w t x t w t s t where s(t) stands for constant DC level A. For equal probable hypothesis assume unity amplitude and noise variance and evaluate the error probability with respect to the value of the decision threshold. For which value of the decision threshold the error probability becomes minimal?
31 Appendix Simple binary hypothesis tests Only possible source outputs according to a known PDF In general the generated hypothesis is N-dimensional he transition mechanism generates points according to known conditional PDFs he received points have N coordinates 4 possible events H generated and H chosen H generated and H chosen H generated and H chosen H generated and H chosen A cost is assigned for each possible event he mean value of the cost on average must be as small as possible (Bayes Criterion) Problem Formulation: How to use the a priori knowledge for hypotheses generation and probabilistic transition mechanism in order to divide optimally the observation space.
32 Appendix Write an expression for the mean value of the cost including the decision regions and the transition probabilities: Use that: End up with: fixed cost Note!! C>C & C>C he terms inside the integral are positive Choose Z in a way to minimize the integral
33 Appendix o minimize the integral the observation space points that make it positive must be assigned to Z. Say H when: r H R ) r HR P C C p H P C C p H Equivalently: pr H R H H P C C ) p R H P C C r H For one dimensional binary hypothesis testing the observation space is linear Pr Prdet P P Pr say H H is true PPr say H H istrue e P P Pr false alarm P miss e Pe P Pr false alarm P ection & & A Pe erfc erfc " "
ECE 564/645 - Digital Communications, Spring 2018 Homework #2 Due: March 19 (In Lecture)
ECE 564/645 - Digital Communications, Spring 018 Homework # Due: March 19 (In Lecture) 1. Consider a binary communication system over a 1-dimensional vector channel where message m 1 is sent by signaling
More informationSummary: SER formulation. Binary antipodal constellation. Generic binary constellation. Constellation gain. 2D constellations
TUTORIAL ON DIGITAL MODULATIONS Part 8a: Error probability A [2011-01-07] 07] Roberto Garello, Politecnico di Torino Free download (for personal use only) at: www.tlc.polito.it/garello 1 Part 8a: Error
More informationChapter 2 Signal Processing at Receivers: Detection Theory
Chapter Signal Processing at Receivers: Detection Theory As an application of the statistical hypothesis testing, signal detection plays a key role in signal processing at receivers of wireless communication
More informationEE4304 C-term 2007: Lecture 17 Supplemental Slides
EE434 C-term 27: Lecture 17 Supplemental Slides D. Richard Brown III Worcester Polytechnic Institute, Department of Electrical and Computer Engineering February 5, 27 Geometric Representation: Optimal
More informationA Simple Example Binary Hypothesis Testing Optimal Receiver Frontend M-ary Signal Sets Message Sequences. possible signals has been transmitted.
Introduction I We have focused on the problem of deciding which of two possible signals has been transmitted. I Binary Signal Sets I We will generalize the design of optimum (MPE) receivers to signal sets
More informationUTA EE5362 PhD Diagnosis Exam (Spring 2011)
EE5362 Spring 2 PhD Diagnosis Exam ID: UTA EE5362 PhD Diagnosis Exam (Spring 2) Instructions: Verify that your exam contains pages (including the cover shee. Some space is provided for you to show your
More informationDigital Modulation 1
Digital Modulation 1 Lecture Notes Ingmar Land and Bernard H. Fleury Navigation and Communications () Department of Electronic Systems Aalborg University, DK Version: February 5, 27 i Contents I Basic
More informationEE456 Digital Communications
EE456 Digital Communications Professor Ha Nguyen September 5 EE456 Digital Communications Block Diagram of Binary Communication Systems m ( t { b k } b k = s( t b = s ( t k m ˆ ( t { bˆ } k r( t Bits in
More informationA First Course in Digital Communications
A First Course in Digital Communications Ha H. Nguyen and E. Shwedyk February 9 A First Course in Digital Communications 1/46 Introduction There are benefits to be gained when M-ary (M = 4 signaling methods
More informationDetection theory 101 ELEC-E5410 Signal Processing for Communications
Detection theory 101 ELEC-E5410 Signal Processing for Communications Binary hypothesis testing Null hypothesis H 0 : e.g. noise only Alternative hypothesis H 1 : signal + noise p(x;h 0 ) γ p(x;h 1 ) Trade-off
More informationDetection and Estimation Theory
ESE 524 Detection and Estimation Theory Joseph A. O Sullivan Samuel C. Sachs Professor Electronic Systems and Signals Research Laboratory Electrical and Systems Engineering Washington University 2 Urbauer
More informationThis examination consists of 10 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS
THE UNIVERSITY OF BRITISH COLUMBIA Department of Electrical and Computer Engineering EECE 564 Detection and Estimation of Signals in Noise Final Examination 08 December 2009 This examination consists of
More informationPrinciples of Communications
Principles of Communications Chapter V: Representation and Transmission of Baseband Digital Signal Yongchao Wang Email: ychwang@mail.xidian.edu.cn Xidian University State Key Lab. on ISN November 18, 2012
More informationEE 574 Detection and Estimation Theory Lecture Presentation 8
Lecture Presentation 8 Aykut HOCANIN Dept. of Electrical and Electronic Engineering 1/14 Chapter 3: Representation of Random Processes 3.2 Deterministic Functions:Orthogonal Representations For a finite-energy
More informationA Hilbert Space for Random Processes
Gaussian Basics Random Processes Filtering of Random Processes Signal Space Concepts A Hilbert Space for Random Processes I A vector space for random processes X t that is analogous to L 2 (a, b) is of
More informationDigital Band-pass Modulation PROF. MICHAEL TSAI 2011/11/10
Digital Band-pass Modulation PROF. MICHAEL TSAI 211/11/1 Band-pass Signal Representation a t g t General form: 2πf c t + φ t g t = a t cos 2πf c t + φ t Envelope Phase Envelope is always non-negative,
More informationLecture 7. Union bound for reducing M-ary to binary hypothesis testing
Lecture 7 Agenda for the lecture M-ary hypothesis testing and the MAP rule Union bound for reducing M-ary to binary hypothesis testing Introduction of the channel coding problem 7.1 M-ary hypothesis testing
More information392D: Coding for the AWGN Channel Wednesday, January 24, 2007 Stanford, Winter 2007 Handout #6. Problem Set 2 Solutions
392D: Coding for the AWGN Channel Wednesday, January 24, 2007 Stanford, Winter 2007 Handout #6 Problem Set 2 Solutions Problem 2.1 (Cartesian-product constellations) (a) Show that if A is a K-fold Cartesian
More informationPerformance of small signal sets
42 Chapter 5 Performance of small signal sets In this chapter, we show how to estimate the performance of small-to-moderate-sized signal constellations on the discrete-time AWGN channel. With equiprobable
More informationE&CE 358, Winter 2016: Solution #2. Prof. X. Shen
E&CE 358, Winter 16: Solution # Prof. X. Shen Email: xshen@bbcr.uwaterloo.ca Prof. X. Shen E&CE 358, Winter 16 ( 1:3-:5 PM: Solution # Problem 1 Problem 1 The signal g(t = e t, t T is corrupted by additive
More informationDetection Theory. Chapter 3. Statistical Decision Theory I. Isael Diaz Oct 26th 2010
Detection Theory Chapter 3. Statistical Decision Theory I. Isael Diaz Oct 26th 2010 Outline Neyman-Pearson Theorem Detector Performance Irrelevant Data Minimum Probability of Error Bayes Risk Multiple
More informationModulation & Coding for the Gaussian Channel
Modulation & Coding for the Gaussian Channel Trivandrum School on Communication, Coding & Networking January 27 30, 2017 Lakshmi Prasad Natarajan Dept. of Electrical Engineering Indian Institute of Technology
More informationEE4512 Analog and Digital Communications Chapter 4. Chapter 4 Receiver Design
Chapter 4 Receiver Design Chapter 4 Receiver Design Probability of Bit Error Pages 124-149 149 Probability of Bit Error The low pass filtered and sampled PAM signal results in an expression for the probability
More informationComputing Probability of Symbol Error
Computing Probability of Symbol Error I When decision boundaries intersect at right angles, then it is possible to compute the error probability exactly in closed form. I The result will be in terms of
More informationa) Find the compact (i.e. smallest) basis set required to ensure sufficient statistics.
Digital Modulation and Coding Tutorial-1 1. Consider the signal set shown below in Fig.1 a) Find the compact (i.e. smallest) basis set required to ensure sufficient statistics. b) What is the minimum Euclidean
More informationCHANNEL CAPACITY CALCULATIONS FOR M ARY N DIMENSIONAL SIGNAL SETS
THE UNIVERSITY OF SOUTH AUSTRALIA SCHOOL OF ELECTRONIC ENGINEERING CHANNEL CAPACITY CALCULATIONS FOR M ARY N DIMENSIONAL SIGNAL SETS Philip Edward McIllree, B.Eng. A thesis submitted in fulfilment of the
More informationOne Lesson of Information Theory
Institut für One Lesson of Information Theory Prof. Dr.-Ing. Volker Kühn Institute of Communications Engineering University of Rostock, Germany Email: volker.kuehn@uni-rostock.de http://www.int.uni-rostock.de/
More informationUniversity of Siena. Multimedia Security. Watermark extraction. Mauro Barni University of Siena. M. Barni, University of Siena
Multimedia Security Mauro Barni University of Siena : summary Optimum decoding/detection Additive SS watermarks Decoding/detection of QIM watermarks The dilemma of de-synchronization attacks Geometric
More informationDetection theory. H 0 : x[n] = w[n]
Detection Theory Detection theory A the last topic of the course, we will briefly consider detection theory. The methods are based on estimation theory and attempt to answer questions such as Is a signal
More informationEE5713 : Advanced Digital Communications
EE5713 : Advanced Digital Communications Week 12, 13: Inter Symbol Interference (ISI) Nyquist Criteria for ISI Pulse Shaping and Raised-Cosine Filter Eye Pattern Equalization (On Board) 20-May-15 Muhammad
More informationList Decoding: Geometrical Aspects and Performance Bounds
List Decoding: Geometrical Aspects and Performance Bounds Maja Lončar Department of Information Technology Lund University, Sweden Summer Academy: Progress in Mathematics for Communication Systems Bremen,
More informationInformation Sources. Professor A. Manikas. Imperial College London. EE303 - Communication Systems An Overview of Fundamentals
Information Sources Professor A. Manikas Imperial College London EE303 - Communication Systems An Overview of Fundamentals Prof. A. Manikas (Imperial College) EE303: Information Sources 24 Oct. 2011 1
More informationEs e j4φ +4N n. 16 KE s /N 0. σ 2ˆφ4 1 γ s. p(φ e )= exp 1 ( 2πσ φ b cos N 2 φ e 0
Problem 6.15 : he received signal-plus-noise vector at the output of the matched filter may be represented as (see (5-2-63) for example) : r n = E s e j(θn φ) + N n where θ n =0,π/2,π,3π/2 for QPSK, and
More information8 PAM BER/SER Monte Carlo Simulation
xercise.1 8 PAM BR/SR Monte Carlo Simulation - Simulate a 8 level PAM communication system and calculate bit and symbol error ratios (BR/SR). - Plot the calculated and simulated SR and BR curves. - Plot
More informationSummary II: Modulation and Demodulation
Summary II: Modulation and Demodulation Instructor : Jun Chen Department of Electrical and Computer Engineering, McMaster University Room: ITB A1, ext. 0163 Email: junchen@mail.ece.mcmaster.ca Website:
More informationThis examination consists of 11 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS
THE UNIVERSITY OF BRITISH COLUMBIA Department of Electrical and Computer Engineering EECE 564 Detection and Estimation of Signals in Noise Final Examination 6 December 2006 This examination consists of
More informationIntroduction to Detection Theory
Introduction to Detection Theory Detection Theory (a.k.a. decision theory or hypothesis testing) is concerned with situations where we need to make a decision on whether an event (out of M possible events)
More informationAuthor: R. Garello. Tutorial on digital modulations - Part 3 2
TUTORIAL ON DIGITAL MODULATIONS Part 3: The signal space. [20- -03] Roberto Garello, Politecnico di Torino Free download (for personal use only) at: www.tlc.polito.it/garello Author: Roberto GARELLO, Ph.D.
More informationEE 121: Introduction to Digital Communication Systems. 1. Consider the following discrete-time communication system. There are two equallly likely
EE 11: Introduction to Digital Communication Systems Midterm Solutions 1. Consider the following discrete-time communication system. There are two equallly likely messages to be transmitted, and they are
More informationOptimum Soft Decision Decoding of Linear Block Codes
Optimum Soft Decision Decoding of Linear Block Codes {m i } Channel encoder C=(C n-1,,c 0 ) BPSK S(t) (n,k,d) linear modulator block code Optimal receiver AWGN Assume that [n,k,d] linear block code C is
More informationChapter 2. Binary and M-ary Hypothesis Testing 2.1 Introduction (Levy 2.1)
Chapter 2. Binary and M-ary Hypothesis Testing 2.1 Introduction (Levy 2.1) Detection problems can usually be casted as binary or M-ary hypothesis testing problems. Applications: This chapter: Simple hypothesis
More informationECE 564/645 - Digital Communications, Spring 2018 Midterm Exam #1 March 22nd, 7:00-9:00pm Marston 220
ECE 564/645 - Digital Communications, Spring 08 Midterm Exam # March nd, 7:00-9:00pm Marston 0 Overview The exam consists of four problems for 0 points (ECE 564) or 5 points (ECE 645). The points for each
More informationECE531 Lecture 6: Detection of Discrete-Time Signals with Random Parameters
ECE531 Lecture 6: Detection of Discrete-Time Signals with Random Parameters D. Richard Brown III Worcester Polytechnic Institute 26-February-2009 Worcester Polytechnic Institute D. Richard Brown III 26-February-2009
More informationPower Spectral Density of Digital Modulation Schemes
Digital Communication, Continuation Course Power Spectral Density of Digital Modulation Schemes Mikael Olofsson Emil Björnson Department of Electrical Engineering ISY) Linköping University, SE-581 83 Linköping,
More informationProblem Set 7 Due March, 22
EE16: Probability and Random Processes SP 07 Problem Set 7 Due March, Lecturer: Jean C. Walrand GSI: Daniel Preda, Assane Gueye Problem 7.1. Let u and v be independent, standard normal random variables
More informationPrinciples of Communications
Principles of Communications Weiyao Lin Shanghai Jiao Tong University Chapter 10: Information Theory Textbook: Chapter 12 Communication Systems Engineering: Ch 6.1, Ch 9.1~ 9. 92 2009/2010 Meixia Tao @
More informationLecture 5b: Line Codes
Lecture 5b: Line Codes Dr. Mohammed Hawa Electrical Engineering Department University of Jordan EE421: Communications I Digitization Sampling (discrete analog signal). Quantization (quantized discrete
More informationDetecting Parametric Signals in Noise Having Exactly Known Pdf/Pmf
Detecting Parametric Signals in Noise Having Exactly Known Pdf/Pmf Reading: Ch. 5 in Kay-II. (Part of) Ch. III.B in Poor. EE 527, Detection and Estimation Theory, # 5c Detecting Parametric Signals in Noise
More informationEE6604 Personal & Mobile Communications. Week 13. Multi-antenna Techniques
EE6604 Personal & Mobile Communications Week 13 Multi-antenna Techniques 1 Diversity Methods Diversity combats fading by providing the receiver with multiple uncorrelated replicas of the same information
More informationBASICS OF DETECTION AND ESTIMATION THEORY
BASICS OF DETECTION AND ESTIMATION THEORY 83050E/158 In this chapter we discuss how the transmitted symbols are detected optimally from a noisy received signal (observation). Based on these results, optimal
More informationX b s t w t t dt b E ( ) t dt
Consider the following correlator receiver architecture: T dt X si () t S xt () * () t Wt () T dt X Suppose s (t) is sent, then * () t t T T T X s t w t t dt E t t dt w t dt E W t t T T T X s t w t t dt
More informationELECTRONICS & COMMUNICATIONS DIGITAL COMMUNICATIONS
EC 32 (CR) Total No. of Questions :09] [Total No. of Pages : 02 III/IV B.Tech. DEGREE EXAMINATIONS, APRIL/MAY- 207 Second Semester ELECTRONICS & COMMUNICATIONS DIGITAL COMMUNICATIONS Time: Three Hours
More informationChapter 7: Channel coding:convolutional codes
Chapter 7: : Convolutional codes University of Limoges meghdadi@ensil.unilim.fr Reference : Digital communications by John Proakis; Wireless communication by Andreas Goldsmith Encoder representation Communication
More informationDetection and Estimation Theory
ESE 524 Detection and Estimation Theory Joseph A. O Sullivan Samuel C. Sachs Professor Electronic Systems and Signals Research Laboratory Electrical and Systems Engineering Washington University 2 Urbauer
More informationProblem Set 2. MAS 622J/1.126J: Pattern Recognition and Analysis. Due: 5:00 p.m. on September 30
Problem Set 2 MAS 622J/1.126J: Pattern Recognition and Analysis Due: 5:00 p.m. on September 30 [Note: All instructions to plot data or write a program should be carried out using Matlab. In order to maintain
More informationLecture 5: Likelihood ratio tests, Neyman-Pearson detectors, ROC curves, and sufficient statistics. 1 Executive summary
ECE 830 Spring 207 Instructor: R. Willett Lecture 5: Likelihood ratio tests, Neyman-Pearson detectors, ROC curves, and sufficient statistics Executive summary In the last lecture we saw that the likelihood
More informationProblem 7.7 : We assume that P (x i )=1/3, i =1, 2, 3. Then P (y 1 )= 1 ((1 p)+p) = P (y j )=1/3, j=2, 3. Hence : and similarly.
(b) We note that the above capacity is the same to the capacity of the binary symmetric channel. Indeed, if we considerthe grouping of the output symbols into a = {y 1,y 2 } and b = {y 3,y 4 } we get a
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More informationThe Performance of Quaternary Amplitude Modulation with Quaternary Spreading in the Presence of Interfering Signals
Clemson University TigerPrints All Theses Theses 1-015 The Performance of Quaternary Amplitude Modulation with Quaternary Spreading in the Presence of Interfering Signals Allison Manhard Clemson University,
More informationExample: Bipolar NRZ (non-return-to-zero) signaling
Baseand Data Transmission Data are sent without using a carrier signal Example: Bipolar NRZ (non-return-to-zero signaling is represented y is represented y T A -A T : it duration is represented y BT. Passand
More informationDETECTION theory deals primarily with techniques for
ADVANCED SIGNAL PROCESSING SE Optimum Detection of Deterministic and Random Signals Stefan Tertinek Graz University of Technology turtle@sbox.tugraz.at Abstract This paper introduces various methods for
More informationParameter Estimation
1 / 44 Parameter Estimation Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay October 25, 2012 Motivation System Model used to Derive
More informationSTOCHASTIC PROCESSES, DETECTION AND ESTIMATION Course Notes
STOCHASTIC PROCESSES, DETECTION AND ESTIMATION 6.432 Course Notes Alan S. Willsky, Gregory W. Wornell, and Jeffrey H. Shapiro Department of Electrical Engineering and Computer Science Massachusetts Institute
More informationECE531 Lecture 2b: Bayesian Hypothesis Testing
ECE531 Lecture 2b: Bayesian Hypothesis Testing D. Richard Brown III Worcester Polytechnic Institute 29-January-2009 Worcester Polytechnic Institute D. Richard Brown III 29-January-2009 1 / 39 Minimizing
More informationData Detection for Controlled ISI. h(nt) = 1 for n=0,1 and zero otherwise.
Data Detection for Controlled ISI *Symbol by symbol suboptimum detection For the duobinary signal pulse h(nt) = 1 for n=0,1 and zero otherwise. The samples at the output of the receiving filter(demodulator)
More information2. What are the tradeoffs among different measures of error (e.g. probability of false alarm, probability of miss, etc.)?
ECE 830 / CS 76 Spring 06 Instructors: R. Willett & R. Nowak Lecture 3: Likelihood ratio tests, Neyman-Pearson detectors, ROC curves, and sufficient statistics Executive summary In the last lecture we
More informationElectrical Engineering Written PhD Qualifier Exam Spring 2014
Electrical Engineering Written PhD Qualifier Exam Spring 2014 Friday, February 7 th 2014 Please do not write your name on this page or any other page you submit with your work. Instead use the student
More informationIntroduction to Statistical Inference
Structural Health Monitoring Using Statistical Pattern Recognition Introduction to Statistical Inference Presented by Charles R. Farrar, Ph.D., P.E. Outline Introduce statistical decision making for Structural
More informationDIGITAL COMMUNICATIONS. IAGlover and P M Grant. Prentice Hall 1997 PROBLEM SOLUTIONS CHAPTER 6
DIGITAL COMMUNICATIONS IAGlover and P M Grant Prentice Hall 997 PROBLEM SOLUTIONS CHAPTER 6 6. P e erf V σ erf. 5 +. 5 0.705 [ erf (. 009)] [ 0. 999 979 ]. 0 0 5 The optimum DC level is zero. For equiprobable
More informationChannel Coding I. Exercises SS 2017
Channel Coding I Exercises SS 2017 Lecturer: Dirk Wübben Tutor: Shayan Hassanpour NW1, Room N 2420, Tel.: 0421/218-62387 E-mail: {wuebben, hassanpour}@ant.uni-bremen.de Universität Bremen, FB1 Institut
More informationELEC546 Review of Information Theory
ELEC546 Review of Information Theory Vincent Lau 1/1/004 1 Review of Information Theory Entropy: Measure of uncertainty of a random variable X. The entropy of X, H(X), is given by: If X is a discrete random
More informationCHAPTER 14. Based on the info about the scattering function we know that the multipath spread is T m =1ms, and the Doppler spread is B d =0.2 Hz.
CHAPTER 4 Problem 4. : Based on the info about the scattering function we know that the multipath spread is T m =ms, and the Doppler spread is B d =. Hz. (a) (i) T m = 3 sec (ii) B d =. Hz (iii) ( t) c
More informationECE Homework Set 2
1 Solve these problems after Lecture #4: Homework Set 2 1. Two dice are tossed; let X be the sum of the numbers appearing. a. Graph the CDF, FX(x), and the pdf, fx(x). b. Use the CDF to find: Pr(7 X 9).
More information3.2 Complex Sinusoids and Frequency Response of LTI Systems
3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex
More informationBasic Principles of Video Coding
Basic Principles of Video Coding Introduction Categories of Video Coding Schemes Information Theory Overview of Video Coding Techniques Predictive coding Transform coding Quantization Entropy coding Motion
More informationMATHEMATICAL TOOLS FOR DIGITAL TRANSMISSION ANALYSIS
ch03.qxd 1/9/03 09:14 AM Page 35 CHAPTER 3 MATHEMATICAL TOOLS FOR DIGITAL TRANSMISSION ANALYSIS 3.1 INTRODUCTION The study of digital wireless transmission is in large measure the study of (a) the conversion
More informationUniversity of Cambridge Engineering Part IIB Module 3F3: Signal and Pattern Processing Handout 2:. The Multivariate Gaussian & Decision Boundaries
University of Cambridge Engineering Part IIB Module 3F3: Signal and Pattern Processing Handout :. The Multivariate Gaussian & Decision Boundaries..15.1.5 1 8 6 6 8 1 Mark Gales mjfg@eng.cam.ac.uk Lent
More informations o (t) = S(f)H(f; t)e j2πft df,
Sample Problems for Midterm. The sample problems for the fourth and fifth quizzes as well as Example on Slide 8-37 and Example on Slides 8-39 4) will also be a key part of the second midterm.. For a causal)
More informationρ = sin(2π ft) 2π ft To find the minimum value of the correlation, we set the derivative of ρ with respect to f equal to zero.
Problem 5.1 : The correlation of the two signals in binary FSK is: ρ = sin(π ft) π ft To find the minimum value of the correlation, we set the derivative of ρ with respect to f equal to zero. Thus: ϑρ
More informationCoding for Digital Communication and Beyond Fall 2013 Anant Sahai MT 1
EECS 121 Coding for Digital Communication and Beyond Fall 2013 Anant Sahai MT 1 PRINT your student ID: PRINT AND SIGN your name:, (last) (first) (signature) PRINT your Unix account login: ee121- Prob.
More informationChannel capacity. Outline : 1. Source entropy 2. Discrete memoryless channel 3. Mutual information 4. Channel capacity 5.
Channel capacity Outline : 1. Source entropy 2. Discrete memoryless channel 3. Mutual information 4. Channel capacity 5. Exercices Exercise session 11 : Channel capacity 1 1. Source entropy Given X a memoryless
More informationDecentralized Detection In Wireless Sensor Networks
Decentralized Detection In Wireless Sensor Networks Milad Kharratzadeh Department of Electrical & Computer Engineering McGill University Montreal, Canada April 2011 Statistical Detection and Estimation
More informationPerformance Analysis of Spread Spectrum CDMA systems
1 Performance Analysis of Spread Spectrum CDMA systems 16:33:546 Wireless Communication Technologies Spring 5 Instructor: Dr. Narayan Mandayam Summary by Liang Xiao lxiao@winlab.rutgers.edu WINLAB, Department
More informationThese outputs can be written in a more convenient form: with y(i) = Hc m (i) n(i) y(i) = (y(i); ; y K (i)) T ; c m (i) = (c m (i); ; c m K(i)) T and n
Binary Codes for synchronous DS-CDMA Stefan Bruck, Ulrich Sorger Institute for Network- and Signal Theory Darmstadt University of Technology Merckstr. 25, 6428 Darmstadt, Germany Tel.: 49 65 629, Fax:
More informationω 0 = 2π/T 0 is called the fundamental angular frequency and ω 2 = 2ω 0 is called the
he ime-frequency Concept []. Review of Fourier Series Consider the following set of time functions {3A sin t, A sin t}. We can represent these functions in different ways by plotting the amplitude versus
More informationCoding Theory and Applications. Linear Codes. Enes Pasalic University of Primorska Koper, 2013
Coding Theory and Applications Linear Codes Enes Pasalic University of Primorska Koper, 2013 2 Contents 1 Preface 5 2 Shannon theory and coding 7 3 Coding theory 31 4 Decoding of linear codes and MacWilliams
More informationCommunication Theory Summary of Important Definitions and Results
Signal and system theory Convolution of signals x(t) h(t) = y(t): Fourier Transform: Communication Theory Summary of Important Definitions and Results X(ω) = X(ω) = y(t) = X(ω) = j x(t) e jωt dt, 0 Properties
More informationPerformance of Coherent Binary Phase-Shift Keying (BPSK) with Costas-Loop Tracking in the Presence of Interference
TMO Progress Report 4-139 November 15, 1999 Performance of Coherent Binary Phase-Shift Keying (BPSK) with Costas-Loop Tracking in the Presence of Interference M. K. Simon 1 The bit-error probability performance
More informationThe peculiarities of the model: - it is allowed to use by attacker only noisy version of SG C w (n), - CO can be known exactly for attacker.
Lecture 6. SG based on noisy channels [4]. CO Detection of SG The peculiarities of the model: - it is alloed to use by attacker only noisy version of SG C (n), - CO can be knon exactly for attacker. Practical
More informationExpectation propagation for symbol detection in large-scale MIMO communications
Expectation propagation for symbol detection in large-scale MIMO communications Pablo M. Olmos olmos@tsc.uc3m.es Joint work with Javier Céspedes (UC3M) Matilde Sánchez-Fernández (UC3M) and Fernando Pérez-Cruz
More information2. SPECTRAL ANALYSIS APPLIED TO STOCHASTIC PROCESSES
2. SPECTRAL ANALYSIS APPLIED TO STOCHASTIC PROCESSES 2.0 THEOREM OF WIENER- KHINTCHINE An important technique in the study of deterministic signals consists in using harmonic functions to gain the spectral
More informationUpper Bounds for the Average Error Probability of a Time-Hopping Wideband System
Upper Bounds for the Average Error Probability of a Time-Hopping Wideband System Aravind Kailas UMTS Systems Performance Team QUALCOMM Inc San Diego, CA 911 Email: akailas@qualcommcom John A Gubner Department
More informationDirect-Sequence Spread-Spectrum
Chapter 3 Direct-Sequence Spread-Spectrum In this chapter we consider direct-sequence spread-spectrum systems. Unlike frequency-hopping, a direct-sequence signal occupies the entire bandwidth continuously.
More informationResidual Versus Suppressed-Carrier Coherent Communications
TDA Progress Report -7 November 5, 996 Residual Versus Suppressed-Carrier Coherent Communications M. K. Simon and S. Million Communications and Systems Research Section This article addresses the issue
More informationBayesian Decision Theory
Bayesian Decision Theory Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Fall 2017 CS 551, Fall 2017 c 2017, Selim Aksoy (Bilkent University) 1 / 46 Bayesian
More informationChannel Coding I. Exercises SS 2017
Channel Coding I Exercises SS 2017 Lecturer: Dirk Wübben Tutor: Shayan Hassanpour NW1, Room N 2420, Tel.: 0421/218-62387 E-mail: {wuebben, hassanpour}@ant.uni-bremen.de Universität Bremen, FB1 Institut
More informationPATTERN RECOGNITION AND MACHINE LEARNING
PATTERN RECOGNITION AND MACHINE LEARNING Slide Set 3: Detection Theory January 2018 Heikki Huttunen heikki.huttunen@tut.fi Department of Signal Processing Tampere University of Technology Detection theory
More informationCS6304 / Analog and Digital Communication UNIT IV - SOURCE AND ERROR CONTROL CODING PART A 1. What is the use of error control coding? The main use of error control coding is to reduce the overall probability
More informationSolutions to Selected Problems
Solutions to Selected Problems from Madhow: Fundamentals of Digital Communication and from Johannesson & Zigangirov: Fundamentals of Convolutional Coding Saif K. Mohammed Department of Electrical Engineering
More informationINFORMATION PROCESSING ABILITY OF BINARY DETECTORS AND BLOCK DECODERS. Michael A. Lexa and Don H. Johnson
INFORMATION PROCESSING ABILITY OF BINARY DETECTORS AND BLOCK DECODERS Michael A. Lexa and Don H. Johnson Rice University Department of Electrical and Computer Engineering Houston, TX 775-892 amlexa@rice.edu,
More information