Digital Modems. Lecture 2

Similar documents
Communication with AWGN Interference

be a second-order and mean-value-zero vector-valued process, i.e., for t E

Chapter 7 Channel Capacity and Coding

Chapter 7 Channel Capacity and Coding

Composite Hypotheses testing

Signal space Review on vector space Linear independence Metric space and norm Inner product

Consider the following passband digital communication system model. c t. modulator. t r a n s m i t t e r. signal decoder.

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Error Probability for M Signals

Assuming that the transmission delay is negligible, we have

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

IRO0140 Advanced space time-frequency signal processing

Feb 14: Spatial analysis of data fields

The Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD

Digital Signal Processing

), it produces a response (output function g (x)

14 The Postulates of Quantum mechanics

Numerical Heat and Mass Transfer

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

An Application of Fuzzy Hypotheses Testing in Radar Detection

Differential Phase Shift Keying (DPSK)

Convergence of random processes

U-Pb Geochronology Practical: Background

Lecture 21: Numerical methods for pricing American type derivatives

APPENDIX A Some Linear Algebra

Lecture 3: Shannon s Theorem

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

Statistical analysis using matlab. HY 439 Presented by: George Fortetsanakis

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Georgia Tech PHYS 6124 Mathematical Methods of Physics I

Lecture 12: Discrete Laplacian

Appendix B: Resampling Algorithms

Bernoulli Numbers and Polynomials

COMPARING NOISE REMOVAL IN THE WAVELET AND FOURIER DOMAINS

Lecture 2: Prelude to the big shrink

Conjugacy and the Exponential Family

On Finite Rank Perturbation of Diagonalizable Operators

The Feynman path integral

Hidden Markov Models & The Multivariate Gaussian (10/26/04)

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

12. The Hamilton-Jacobi Equation Michael Fowler

Lecture Notes on Linear Regression

Complex Numbers, Signals, and Circuits

Research Article Green s Theorem for Sign Data

Estimation: Part 2. Chapter GREG estimation

Statistical Evaluation of WATFLOOD

CS 468 Lecture 16: Isometry Invariance and Spectral Techniques

5.04, Principles of Inorganic Chemistry II MIT Department of Chemistry Lecture 32: Vibrational Spectroscopy and the IR

w ). Then use the Cauchy-Schwartz inequality ( v w v w ).] = in R 4. Can you find a vector u 4 in R 4 such that the

Econ Statistical Properties of the OLS estimator. Sanjaya DeSilva

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

1 Matrix representations of canonical matrices

ON THE BURGERS EQUATION WITH A STOCHASTIC STEPPING STONE NOISY TERM

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Some modelling aspects for the Matlab implementation of MMA

Lecture 4 Hypothesis Testing

Lecture 14 (03/27/18). Channels. Decoding. Preview of the Capacity Theorem.

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /

Multi-dimensional Central Limit Theorem

THEOREMS OF QUANTUM MECHANICS

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method

Linear Approximation with Regularization and Moving Least Squares

Entropy of Markov Information Sources and Capacity of Discrete Input Constrained Channels (from Immink, Coding Techniques for Digital Recorders)

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

ANSWERS CHAPTER 9. TIO 9.2: If the values are the same, the difference is 0, therefore the null hypothesis cannot be rejected.

However, since P is a symmetric idempotent matrix, of P are either 0 or 1 [Eigen-values

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

6. Stochastic processes (2)

Chapter 2 - The Simple Linear Regression Model S =0. e i is a random error. S β2 β. This is a minimization problem. Solution is a calculus exercise.

Primer on High-Order Moment Estimators

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA

Report on Image warping

e i is a random error

Continuous Time Markov Chains

Google PageRank with Stochastic Matrix

6. Stochastic processes (2)

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

Applied Stochastic Processes

Homework Assignment 3 Due in class, Thursday October 15

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010

Pulse Coded Modulation

Homework & Solution. Contributors. Prof. Lee, Hyun Min. Particle Physics Winter School. Park, Ye

The Order Relation and Trace Inequalities for. Hermitian Operators

Bayesian decision theory. Nuno Vasconcelos ECE Department, UCSD

Transform Coding. Transform Coding Principle

Average Decision Threshold of CA CFAR and excision CFAR Detectors in the Presence of Strong Pulse Jamming 1

Density matrix. c α (t)φ α (q)

Lecture 6: Introduction to Linear Regression

EGR 544 Communication Theory

Multi-dimensional Central Limit Argument

Module 9. Lecture 6. Duality in Assignment Problems

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Performing Modulation Scheme of Chaos Shift Keying with Hyperchaotic Chen System

Chapter 6. Wideband channels. Slides for Wireless Communications Edfors, Molisch, Tufvesson

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

Transcription:

Dgtal Modems Lecture

Revew We have shown that both Bayes and eyman/pearson crtera are based on the Lkelhood Rato Test (LRT) Λ ( r ) < > η Λ r s called observaton transformaton or suffcent statstc The crtera dffer on the choce of threshold η Bayes crteron s used for mnmum probablty of error detectors (e.g., communcaton systems) eyman crteron s used for mnmum false alarm probablty (e.g., radar) Categorzaton of problems: Smple hypotheses (the noseless sgnal s perfectly known) Composte hypotheses (there are unknown parameters n the sgnal) The parameters have a statstcal descrpton The parameters do not have a statstcal descrpton

Dscrete representaton of contnuous-tme sgnals Up tll now, we have consdered optmal detectors for problems nvolvng dscrete-tme sgnals (vectors) In realty, a contnuous-tme sgnal (waveform) s transmtted What s the optmal detector n ths case? It turns out that the optmal detector s stll based on dscretetme processng, by transformng the problem from contnuous to dscrete tme

Dscrete representaton of contnuous-tme sgnals s() t φ s s s 3 s φ nt () φ 3 φ n n 3 n φ r s n r s n = + r s n φ 3

Determnstc sgnals () Let s t be a (complex) determnstc sgnal and be an orthonormal bass,.e., * (), () () () φ t φ t = φ t φ t dt = δ j j j It can be shown that x t can be wrtten as A bass s called complete when t holds { φ( t), φ( t),, φ ( t) } The most common orthonormal bass s t e j π nt T φ n =, t, T () = φ (), = (), φ () s t s t s s t t = T lm s() t s () φ t dt = = [ ]

Determnstc sgnals Orthonormal expanson Equvalent realzatons., φ t s s( t)., φ ( t) s s( t)., φ t., φ ( t ) s s s t Correlator s( t) Matched flter * φ t ( ) * φ T t T dt t = T s s

Comments { } s Snce the coeffcents can be used to reconstruct the orgnal sgnal s( t), we say that ths dscretzaton procedure s nformaton lossless. Recall that the samplng theorem states the same thng. Exercse: State the samplng theorem as an orthonormal sgnal expanson. What s the orthonormal bass? In general, a contnuous tme sgnal s of nfnte dmensonalty, and therefore requres an nfnte number of coeffcents to descrbe t, whch s clearly not practcal!! In communcatons, we employ contnuous tme sgnals of fnte dmensons, so that ther dscrete tme representaton s also of fnte dmenson

Examples BPSK: =± cos( π ), [, ], = { () } s t A f t t T f k T Usng φ t = cos π ft, φ t = φ3 t =. = the BPSK sgnal can be wrtten as st = ± Aφ t BPSK s one-dmensonal wth M-PSK: s t = Acos π f t+ θ, m=,,, M, t, T Rewrtng the sgnal as we can choose () M-PSK s two-dmensonal wth s = ± A () [ ] { s, s } = Acos ( θ ), Asn( θ ) m st = Acos( θm) cos( π ft ) Asn ( θm) sn( π ft ) ( t) = cos( f t), ( t) = sn( f t) φ t { φ π φ π } { m m } A A φ ( t ) φ ( t )

Examples BFSK: Frequences, are chosen such that Choose () = cos( π ), =,, [, ] s t ft t T BFSK s two-dmensonal wth T f f ( ft) ( ) ( t) = cos( ft), ( t) = cos( f t) { s, s } = {, } or { s, s } = {,} { φ π φ π } φ ( t ) cos π cos π f t dt = MFSK: M-dmensonal sgnal (show t) φ () t FSK s an example of an orthogonal transmsson scheme

Examples φ ( t ) M-QAM: A, A I Q () = cos( π ) + sn( π ), [, ] s t A f t A f t t T : n-phase/quadrature symbols M-QAM s two-dmensonal I Q φ () t OFDM: M: number of orthogonal sub-carrers OFDM s an M-dmensonal sgnal DS-CDMA: M () M: number of users M As ( t) s t = (,, ) [ ] st = A cos π ft+ A sn π ft, t, T, f = πkt = = I k Q k k M { ()} = s t : P sequences ( s ) t, sj t = δj DS-CDMA s an M-dmensonal sgnal wth φ ( t) = s( t), =,. M

Stochastc sgnals Just lke determnstc sgnal, stochastc sgnals can also be represented by an nfnte sum of weghted orthogonal bass functons ( ; ) = φ, = (, ), φ ntu n u t n u ntu t = However, coeffcents n = n u are random Snce the sgnal s random we assume convergence of the seres n the Mean Square Error (MSE) sense,.e, lm E ntu ( ; ) n( u) φ( t) = =

Karhunen-Loeve theorem Let nt be a stochastc process wth autocorrelaton Rnn t, t. nt Sdscan be expanded on the orthonormal bass φ t that s a { } soluton of the followng system of ntegral equatons: T * (, ) φ = λφ R t t t dt t nn Each soluton φ t s called egenfuncton of R t, t and λ s the correspondng egenvalue { φ } { n } For that choce of t, coeffcents are uncorrelated nn

Comments T E n t dt λ cφ t are also vald egenfunctons Dfferent egenvalues λ λ j correspond to dfferent egenfunctons φ t φ t Each egenvenlue wth multplcty greater than one s assocated wth a set of egenfunctons of the same multplcty that can also be chosen to be orthonormal (Gram-Schmdt procedure) { } E n () = = = { } = λ j * Mercer s theorem: Rn t, t = = λφ t φ t For nt Gaussan, the K-L coeffcents { n } are also Gaussan and therefore ndependent (snce they are uncorrelated)

Example : Band-lmted process Gaussan process nt wth strctly band-lmted power spectrum observed n the tme perod [, T] { } The solutons φ t to the K-L ntegral equaton are called prolate spherodal functons The number of essentally non-zero egenvalues s equal to BT S ( f ) Rnn ( τ ) nn B B

Example : Whte nose nt R ( τ ) = σδτ Gaussan process wth autocorellaton nn It can be shown that the K-L ntegral equatons are satsfed by any orthonormal set of functons { } E E { j} = = n λ σ nn * =, j { φ () t }

Applcaton to the contnuoustme detecton problem The receved sgnal s r t = s t + n t; u, t, T st () s an -dmensonal sgnal ntu ( ; ) s whte nose (nfnte dmensonal sgnal) r t s nfnte-dmensonal (due to the presence of nose) () { ()} = () Let φ t be the set of bass functon for { } φ t can be (arbtrarly) extended to = so that t represents a bass for Therefore, we end up wth [ ] ntu ( ; ) s( t) { { φ ()}, { ()} } t φ t = = + = φ + φ r t s t n t = = = rφ = r = s + n ( s n ) φ () t nφ () t = + + = = + () t

Applcaton to the contnuoustme detecton problem ote that snce are ndependent of, only coeffcents r = s + n provde nformaton about the transmtted sgnal { r } = { n } { } = n = + { } { } = = The set s called suffcent statstc Thus, we have establshed the followng equvalence () = () + ( ; ), [, ] { } = { + } r t s t n t u t T r s n = = The problem s now formulated as a dscrete-tme problem, so that we can use the optmal detecton crtera (Bayes, eyman)