ρ = 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.

Size: px
Start display at page:

Download "ρ = 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."

Transcription

1 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: ϑρ ϑ f =0=cos(π ft)πt π ft sin(π ft) (π ft) πt and therefore : π ft =tan(π ft) Solving numerically (or graphically) the equation x = tan(x), we obtain x = Thus, π ft = = f = T and the value of ρ is We know that the probability of error can be expressed in terms of the distance d 1 between the signal points, as : P e = Q d 1 where the distance between the two signal points is : d 1 =E b(1 ρ) and therefore : P e = Q Eb (1 ρ) = Q [ 1.17Eb ] Problem 5.13 : (a) It is straightforward to see that : Set I : Four level PAM Set II : Orthogonal Set III : Biorthogonal

2 1 (b) The transmitted waveforms in the first set have energy : A or 1 9A. Hence for the first set the average energy is : E 1 = 1 ( 1 4 A + 1 ) 9A =.5A All the waveforms in the second and third sets have the same energy : 1 A.Hence : E = E 3 = A / (c) The average probability of a symbol error for M-PAM is (5--45) : ( ) (M 1) P 4,PAM = M Q 6E av = 3 (M 1)N Q A 0

3 (d) For coherent detection, a union bound can be given by (5--5) : ) P 4,orth < (M 1) Q ( E s / =3Q A while for non-coherent detection : P 4,orth,nc (M 1) P,nc =3 1 e Es/ = 3 e A /4 (e) It is not possible to use non-coherent detection for a biorthogonal signal set : e.g. without phase knowledge, we cannot distinguish between the signals u 1 (t) andu 3 (t) (oru (t)/u 4 (t)). (f) The bit rate to bandwidth ratio for M-PAM is given by (5--85) : ( ) R =log M =log 4=4 W 1 For orthogonal signals we can use the expression given by (5--86) or notice that we use a symbol interval 4 times larger than the one used in set I, resulting in a bit rate 4 times smaller : ( R W ) = log M M =1 Finally, the biorthogonal set has double the bandwidth efficiency of the orthogonal set : ( ) R = W Hence, set I is the most bandwidth efficient (at the expense of larger average power), but set III will also be satisfactory. 3

4 Problem 5.14 : The following graph shows the decision regions for the four signals : B U C A D U 1 A = U1 > + U B = U1 < U C = U > + U1 D = U < U1 C B W A D W 1 æ As we see, using the transformation W 1 = U 1 + U,W = U 1 U alters the decision regions to : (W 1 > 0,W > 0 s 1 (t); W 1 > 0,W < 0 s (t); etc.). Assuming that s 1 (t) was transmitted, the outputs of the matched filters will be : U 1 =E + N 1r U = N r where N 1r,N r are uncorrelated (Prob. 5.7) Gaussian-distributed terms with zero mean and variance E. Then : W 1 =E +(N 1r + N r ) W =E +(N 1r N r ) will be Gaussian distributed with means : E [W 1 ]=E [W ]=E, and variances : E [W 1 ]= E [W ]=4E. Since U 1,U are independent, it is straightforward to prove that W 1,W are independent, too. Hence, the probability that a correct decision is made, assuming that s 1 (t) was transmitted is : P c s1 = P [W 1 > 0] P [W > 0] = (P [W 1 > 0]) = (1 P [W 1 < 0]) = ( 1 Q ( )) E 4EN0 = ( 1 Q ( E )) = ( 1 Q ( Eb )) where E b = E/ is the transmitted energy per bit. Then : ( ( )) ( )[ Eb Eb P e s1 =1 P c s1 =1 1 Q =Q 1 1 ( )] Q Eb

5 This is the exact symbol error probability for the 4-PSK signal, which is expected since the vector space representations of the 4-biorthogonal and 4-PSK signals are identical. Problem 5.15 : (a) The output of the matched filter can be expressed as : y(t) =Re [ v(t)e jπfct] where v(t) is the lowpass equivalent of the output : v(t) = t 0 { t 0 s 0 (τ)h(t τ)dτ = Ae (t τ)/t dτ = AT ( 1 e ) t/t, 0 t T T 0 Ae (t τ)/t dτ = AT (e 1)e t/t, T t } (b) Asketchofv(t) is given in the following figure : v(t) 0 T t (c) y(t) =v(t)cosπf c t, where f c >> 1/T. Hence the maximum value of y corresponds to the maximum value of v, or y max = y(t )=v max = v(t )=AT (1 e 1 ). (d) Working with lowpass equivalent signals, the noise term at the sampling instant will be : v N (T )= T 0 z(τ)h(t τ)dτ The mean is : E [v N (T )] = T 0 E [z(τ)] h(t τ)dτ =0, and the second moment : E [ v N (T ) ] = E [ T 0 z(τ)h(t τ)dτ T 0 z (w)h(t w)dw ] = N T 0 0 h (T τ)dτ = T (1 e )

6 The variance of the real-valued noise component can be obtained using the relationship Re[N] = 1 (N + N )toobtain:σ Nr = 1 E [ v N (T ) ] = 1 T (1 e ) (e) The SNR is defined as : γ = v max E [ v N (T ) ] = A T e 1 e +1 (the same result is obtained if we consider the real bandpass signal, when the energy term has the additional factor 1/ compared to the lowpass energy term, and the noise term is σ Nr = 1 E [ v N (T ) ] ) (f) If we have a filter matched to s 0 (t), then the output of the noise-free matched filter will be : v max = v(t )= and the noise term will have second moment : giving an SNR of : T 0 s o (t) =A T E [ v N (T ) ] = E [ T 0 z(τ)s 0(T τ)dτ T 0 z (w)s 0 (T w)dw ] = T 0 s 0(T τ)dτ = A T γ = v max E [ v N (T ) ] = A T Compared with the result we obtained in (e), using a sub-optimum filter, the loss in SNR is equal to : ( ) 1 e 1 1 e+1)( =0.95 or approximately 0.35 db

7 Problem 5.16 : (a) Consider the QAM constellation of Fig. P5-16. Using the Pythagorean theorem we can find the radius of the inner circle as: a + a = A = a = 1 A The radius of the outer circle can be found using the cosine rule. Since b is the third side of a triangle with a and A the two other sides and angle between then equal to θ =75 o, we obtain: b = a + A aa cos 75 o = b = 1+ 3 A

8 (b) If we denote by r the radius of the circle, then using the cosine theorem we obtain: A = r + r r cos 45 o = r = A (c) The average transmitted power of the PSK constellation is: P PSK =8 1 8 A = P PSK = A whereas the average transmitted power of the QAM constellation: P QAM = 1 ( 4 A 8 +4(1 + ) [ ] 3) +(1+ 3) A = P 4 QAM = 8 The relative power advantage of the PSK constellation over the QAM constellation is: gain = P PSK P QAM = 8 ( + (1 + 3) )( =1.597 db ) A

9 Problem 5.18 : For binary phase modulation, the error probability is [ ] Eb A T P = Q = Q With P =10 6 we find from tables that A T =4.74 = A T = If the data rate is 10 Kbps, then the bit interval is T =10 4 and therefore, the signal amplitude is A = = Similarly we find that when the rate is 10 5 bps and 10 6 bps, the required amplitude of the signal is A =.1 10 and A = respectively.

10 Problem 5.6 : (a) The number of bits per symbol is k = 4800 R = = Thus, a 4-QAM constellation is used for transmission. The probability of error for an M-ary QAM system with M = k,is With P M =10 5 and k =weobtain [ ] Eb Q ( ( P M = ) [ ]) 3kEb Q M (M 1) = = E b =9.768 (b) If the bit rate of transmission is 9600 bps, then k = =4 In this case a 16-QAM constellation is used and the probability of error is ( P M =1 1 ( 1 1 ) Q 4 [ ]) 3 4 Eb 15 Thus, [ ] 3 Eb Q 15 = = E b = (c) If the bit rate of transmission is 1900 bps, then k = =8 In this case a 56-QAM constellation is used and the probability of error is ( P M =1 1 ( 1 1 ) Q 16 [ ]) 3 8 Eb 55 With P M =10 5 we obtain E b =

11 (d) The following table gives the SNR per bit and the corresponding number of bits per symbol for the constellations used in parts a)-c). k 4 8 SNR (db) As it is observed there is an increase in transmitted power of approximately 3 db per additional bit per symbol.

12 Problem 5.8 : For 4-phase PSK (M = 4) we have the following realtionship between the symbol rate 1/T,the required bandwith W and the bit rate R = k 1/T = log M T (see 5--84): W = R log M R = Wlog M =W = 00 kbits/sec For binary FSK (M = ) the required frequency separation is 1/T (assuming coherent receiver) and (see 5--86): W = M log M R R = Wlog M M = W = 100 kbits/sec Finally, for 4-frequency non-coherent FSK, the required frequency separation is 1/T, so the symbol rate is half that of binary coherent FSK, but since we have two bits/symbol, the bit ate is tha same as in binary FSK : R = W = 100 kbits/sec

Problem 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.

Problem 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 information

CHAPTER 5. e h(t) = F 1 [H(f)] = F 1 F 1 j2πft

CHAPTER 5. e h(t) = F 1 [H(f)] = F 1 F 1 j2πft CHAPER 5 Problem 5. : (a) aking the inverse Fourier transform of H(f), we obtain : [ ] [ ] e h(t) F [H(f)] F F jπf jπf jπf ( ) t sgn(t) sgn(t )Π where sgn(x) is the signum signal ( if x>, - if x

More information

A First Course in Digital Communications

A 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 information

Es e j4φ +4N n. 16 KE s /N 0. σ 2ˆφ4 1 γ s. p(φ e )= exp 1 ( 2πσ φ b cos N 2 φ e 0

Es 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 information

Digital Band-pass Modulation PROF. MICHAEL TSAI 2011/11/10

Digital 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 information

8 PAM BER/SER Monte Carlo Simulation

8 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 information

Summary II: Modulation and Demodulation

Summary 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 information

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING Final Examination - Fall 2015 EE 4601: Communication Systems

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING Final Examination - Fall 2015 EE 4601: Communication Systems GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING Final Examination - Fall 2015 EE 4601: Communication Systems Aids Allowed: 2 8 1/2 X11 crib sheets, calculator DATE: Tuesday

More information

Consider a 2-D constellation, suppose that basis signals =cosine and sine. Each constellation symbol corresponds to a vector with two real components

Consider a 2-D constellation, suppose that basis signals =cosine and sine. Each constellation symbol corresponds to a vector with two real components TUTORIAL ON DIGITAL MODULATIONS Part 3: 4-PSK [2--26] Roberto Garello, Politecnico di Torino Free download (for personal use only) at: www.tlc.polito.it/garello Quadrature modulation Consider a 2-D constellation,

More information

Summary: SER formulation. Binary antipodal constellation. Generic binary constellation. Constellation gain. 2D constellations

Summary: 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 information

CHAPTER 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 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 information

a) Find the compact (i.e. smallest) basis set required to ensure sufficient statistics.

a) 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 information

Signal Design for Band-Limited Channels

Signal Design for Band-Limited Channels Wireless Information Transmission System Lab. Signal Design for Band-Limited Channels Institute of Communications Engineering National Sun Yat-sen University Introduction We consider the problem of signal

More information

that efficiently utilizes the total available channel bandwidth W.

that efficiently utilizes the total available channel bandwidth W. Signal Design for Band-Limited Channels Wireless Information Transmission System Lab. Institute of Communications Engineering g National Sun Yat-sen University Introduction We consider the problem of signal

More information

392D: 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 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 information

Square Root Raised Cosine Filter

Square Root Raised Cosine Filter Wireless Information Transmission System Lab. Square Root Raised Cosine Filter Institute of Communications Engineering National Sun Yat-sen University Introduction We consider the problem of signal design

More information

Modulation & Coding for the Gaussian Channel

Modulation & 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 information

Application of Matched Filter

Application of Matched Filter Application of Matched Filter Lecture No. 12 Dr. Aoife Moloney School of Electronics and Communications Dublin Institute of Technology Overview This lecture will look at the following: Matched filter vs

More information

EE 661: Modulation Theory Solutions to Homework 6

EE 661: Modulation Theory Solutions to Homework 6 EE 66: Modulation Theory Solutions to Homework 6. Solution to problem. a) Binary PAM: Since 2W = 4 KHz and β = 0.5, the minimum T is the solution to (+β)/(2t ) = W = 2 0 3 Hz. Thus, we have the maximum

More information

2016 Spring: The Final Exam of Digital Communications

2016 Spring: The Final Exam of Digital Communications 2016 Spring: The Final Exam of Digital Communications The total number of points is 131. 1. Image of Transmitter Transmitter L 1 θ v 1 As shown in the figure above, a car is receiving a signal from a remote

More information

Computing Probability of Symbol Error

Computing 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 information

EE Introduction to Digital Communications Homework 8 Solutions

EE Introduction to Digital Communications Homework 8 Solutions EE 2 - Introduction to Digital Communications Homework 8 Solutions May 7, 2008. (a) he error probability is P e = Q( SNR). 0 0 0 2 0 4 0 6 P e 0 8 0 0 0 2 0 4 0 6 0 5 0 5 20 25 30 35 40 SNR (db) (b) SNR

More information

CHANNEL CAPACITY CALCULATIONS FOR M ARY N DIMENSIONAL SIGNAL SETS

CHANNEL 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 information

Chapter 2 Random Processes

Chapter 2 Random Processes Chapter 2 Random Processes 21 Introduction We saw in Section 111 on page 10 that many systems are best studied using the concept of random variables where the outcome of a random experiment was associated

More information

This examination consists of 11 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS

This 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 information

Kevin Buckley a i. communication. information source. modulator. encoder. channel. encoder. information. demodulator decoder. C k.

Kevin Buckley a i. communication. information source. modulator. encoder. channel. encoder. information. demodulator decoder. C k. Kevin Buckley - -4 ECE877 Information Theory & Coding for Digital Communications Villanova University ECE Department Prof. Kevin M. Buckley Lecture Set Review of Digital Communications, Introduction to

More information

s o (t) = S(f)H(f; t)e j2πft df,

s 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

ECE 564/645 - Digital Communications, Spring 2018 Homework #2 Due: March 19 (In Lecture)

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 information

E&CE 358, Winter 2016: Solution #2. Prof. X. Shen

E&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 information

Channel 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. 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 information

Performance of small signal sets

Performance 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 information

Chapter 6. Random Processes

Chapter 6. Random Processes Chapter 6 Random Processes Random Process A random process is a time-varying function that assigns the outcome of a random experiment to each time instant: X(t). For a fixed (sample path): a random process

More information

X b s t w t t dt b E ( ) t dt

X 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 information

Digital Transmission Methods S

Digital Transmission Methods S Digital ransmission ethods S-7.5 Second Exercise Session Hypothesis esting Decision aking Gram-Schmidt method Detection.K.K. Communication Laboratory 5//6 Konstantinos.koufos@tkk.fi Exercise We assume

More information

SIGNAL SPACE CONCEPTS

SIGNAL SPACE CONCEPTS SIGNAL SPACE CONCEPTS TLT-5406/0 In this section we familiarize ourselves with the representation of discrete-time and continuous-time communication signals using the concepts of vector spaces. These concepts

More information

A Simple Example Binary Hypothesis Testing Optimal Receiver Frontend M-ary Signal Sets Message Sequences. possible signals has been transmitted.

A 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 information

EE4304 C-term 2007: Lecture 17 Supplemental Slides

EE4304 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 information

Solutions to Selected Problems

Solutions 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 information

Digital Modulation 1

Digital 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 information

Decision-Point Signal to Noise Ratio (SNR)

Decision-Point Signal to Noise Ratio (SNR) Decision-Point Signal to Noise Ratio (SNR) Receiver Decision ^ SNR E E e y z Matched Filter Bound error signal at input to decision device Performance upper-bound on ISI channels Achieved on memoryless

More information

Power Spectral Density of Digital Modulation Schemes

Power 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 information

Principles of Communications Lecture 8: Baseband Communication Systems. Chih-Wei Liu 劉志尉 National Chiao Tung University

Principles of Communications Lecture 8: Baseband Communication Systems. Chih-Wei Liu 劉志尉 National Chiao Tung University Principles of Communications Lecture 8: Baseband Communication Systems Chih-Wei Liu 劉志尉 National Chiao Tung University cwliu@twins.ee.nctu.edu.tw Outlines Introduction Line codes Effects of filtering Pulse

More information

Chapter 9 Fundamental Limits in Information Theory

Chapter 9 Fundamental Limits in Information Theory Chapter 9 Fundamental Limits in Information Theory Information Theory is the fundamental theory behind information manipulation, including data compression and data transmission. 9.1 Introduction o For

More information

Communication Theory Summary of Important Definitions and Results

Communication 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 information

The Performance of Quaternary Amplitude Modulation with Quaternary Spreading in the Presence of Interfering Signals

The 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 information

Example: Bipolar NRZ (non-return-to-zero) signaling

Example: 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 information

Digital Communications

Digital Communications Digital Communications Chapter 9 Digital Communications Through Band-Limited Channels Po-Ning Chen, Professor Institute of Communications Engineering National Chiao-Tung University, Taiwan Digital Communications:

More information

Review of Doppler Spread The response to exp[2πift] is ĥ(f, t) exp[2πift]. ĥ(f, t) = β j exp[ 2πifτ j (t)] = exp[2πid j t 2πifτ o j ]

Review of Doppler Spread The response to exp[2πift] is ĥ(f, t) exp[2πift]. ĥ(f, t) = β j exp[ 2πifτ j (t)] = exp[2πid j t 2πifτ o j ] Review of Doppler Spread The response to exp[2πift] is ĥ(f, t) exp[2πift]. ĥ(f, t) = β exp[ 2πifτ (t)] = exp[2πid t 2πifτ o ] Define D = max D min D ; The fading at f is ĥ(f, t) = 1 T coh = 2D exp[2πi(d

More information

E303: Communication Systems

E303: Communication Systems E303: Communication Systems Professor A. Manikas Chair of Communications and Array Processing Imperial College London Principles of PCM Prof. A. Manikas (Imperial College) E303: Principles of PCM v.17

More information

Impact of channel-state information on coded transmission over fading channels with diversity reception

Impact of channel-state information on coded transmission over fading channels with diversity reception Impact of channel-state information on coded transmission over fading channels with diversity reception Giorgio Taricco Ezio Biglieri Giuseppe Caire September 4, 1998 Abstract We study the synergy between

More information

Lecture 15: Thu Feb 28, 2019

Lecture 15: Thu Feb 28, 2019 Lecture 15: Thu Feb 28, 2019 Announce: HW5 posted Lecture: The AWGN waveform channel Projecting temporally AWGN leads to spatially AWGN sufficiency of projection: irrelevancy theorem in waveform AWGN:

More information

Weiyao Lin. Shanghai Jiao Tong University. Chapter 5: Digital Transmission through Baseband slchannels Textbook: Ch

Weiyao Lin. Shanghai Jiao Tong University. Chapter 5: Digital Transmission through Baseband slchannels Textbook: Ch Principles of Communications Weiyao Lin Shanghai Jiao Tong University Chapter 5: Digital Transmission through Baseband slchannels Textbook: Ch 10.1-10.5 2009/2010 Meixia Tao @ SJTU 1 Topics to be Covered

More information

Basic Principles of Video Coding

Basic 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 information

1. Band-pass modulations. 2. 2D signal set. 3. Basis signals p(t)cos(2πf 0 t) e p(t)sin(2πf 0 t) 4. Costellation = m signals, equidistant on a circle

1. Band-pass modulations. 2. 2D signal set. 3. Basis signals p(t)cos(2πf 0 t) e p(t)sin(2πf 0 t) 4. Costellation = m signals, equidistant on a circle TUTORIAL ON DIGITAL MODULATIONS Part 14: m-psk [last modified: 2010-11-25] Roerto Garello, Politecnico di Torino Free download at: www.tlc.polito.it/garello (personal use only) 1 m-psk modulations 1. Band-pass

More information

Capacity Bounds for Power- and Band-Limited Wireless Infrared Channels Corrupted by Gaussian Noise

Capacity Bounds for Power- and Band-Limited Wireless Infrared Channels Corrupted by Gaussian Noise 40th Annual Allerton Conference on Communications, Control, and Computing, U.Illinois at Urbana-Champaign, Oct. 2-4, 2002, Allerton House, Monticello, USA. Capacity Bounds for Power- and Band-Limited Wireless

More information

PSK bit mappings with good minimax error probability

PSK bit mappings with good minimax error probability PSK bit mappings with good minimax error probability Erik Agrell Department of Signals and Systems Chalmers University of Technology 4196 Göteborg, Sweden Email: agrell@chalmers.se Erik G. Ström Department

More information

Computation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems

Computation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems Computation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems Department of Electrical Engineering, College of Engineering, Basrah University Basrah Iraq,

More information

Electrical Engineering Written PhD Qualifier Exam Spring 2014

Electrical 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 information

5. Pilot Aided Modulations. In flat fading, if we have a good channel estimate of the complex gain gt, ( ) then we can perform coherent detection.

5. Pilot Aided Modulations. In flat fading, if we have a good channel estimate of the complex gain gt, ( ) then we can perform coherent detection. 5. Pilot Aided Modulations In flat fading, if we have a good channel estimate of the complex gain gt, ( ) then we can perform coherent detection. Obtaining a good estimate is difficult. As we have seen,

More information

Rapport technique #INRS-EMT Exact Expression for the BER of Rectangular QAM with Arbitrary Constellation Mapping

Rapport technique #INRS-EMT Exact Expression for the BER of Rectangular QAM with Arbitrary Constellation Mapping Rapport technique #INRS-EMT-010-0604 Exact Expression for the BER of Rectangular QAM with Arbitrary Constellation Mapping Leszek Szczeciński, Cristian González, Sonia Aïssa Institut National de la Recherche

More information

7 The Waveform Channel

7 The Waveform Channel 7 The Waveform Channel The waveform transmitted by the digital demodulator will be corrupted by the channel before it reaches the digital demodulator in the receiver. One important part of the channel

More information

Generalize from CPFSK to continuous phase modulation (CPM) by allowing: non-rectangular frequency pulses frequency pulses with durations LT, L > 1

Generalize from CPFSK to continuous phase modulation (CPM) by allowing: non-rectangular frequency pulses frequency pulses with durations LT, L > 1 8.3 Generalize to CPM [P4.3.3] 8.3-8.3. CPM Signals Generalize from CPFSK to continuous phase modulation (CPM) by allowing: non-rectangular frequency pulses frequency pulses with durations LT, L > o Example:

More information

CHAPTER 9. x(t)e j2πft dt y(t)e j2πft dt = K exp( j2πft 0 )X(f) T 2 1 sin. πt β f. sin. 2 rect 2T. 1, f a 0, o.w

CHAPTER 9. x(t)e j2πft dt y(t)e j2πft dt = K exp( j2πft 0 )X(f) T 2 1 sin. πt β f. sin. 2 rect 2T. 1, f a 0, o.w CHAPER 9 Problem 9. : We want y(t) =Kx(t t 0 ). hen : herefore : X(f) = x(t)e jπft dt Y (f) = y(t)e jπft dt = K exp( jπft 0 )X(f) { A(f)e jθ(f) = Ke jπft 0 Note that nπ, n odd, results in a sign inversion

More information

Principles of Communications

Principles 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 information

Lesson 28 Working with Special Triangles

Lesson 28 Working with Special Triangles Lesson 28 Working with Special Triangles Pre-Calculus 3/3/14 Pre-Calculus 1 Review Where We ve Been We have a new understanding of angles as we have now placed angles in a circle on a coordinate plane

More information

Optimum Soft Decision Decoding of Linear Block Codes

Optimum 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 information

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)

More information

MODULATION AND CODING FOR QUANTIZED CHANNELS. Xiaoying Shao and Harm S. Cronie

MODULATION AND CODING FOR QUANTIZED CHANNELS. Xiaoying Shao and Harm S. Cronie MODULATION AND CODING FOR QUANTIZED CHANNELS Xiaoying Shao and Harm S. Cronie x.shao@ewi.utwente.nl, h.s.cronie@ewi.utwente.nl University of Twente, Faculty of EEMCS, Signals and Systems Group P.O. box

More information

EE4440 HW#8 Solution

EE4440 HW#8 Solution EE HW#8 Solution April 3,. What frequency must be used for basis symbols φ = sin(ω c t) and φ = cos(ω c t) with a symbol period of /(96Hz) to contain 6 cycles of the sin and cos? Solution: The frequency

More information

Performance Analysis of Spread Spectrum CDMA systems

Performance 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 information

Adaptive Space-Time Shift Keying Based Multiple-Input Multiple-Output Systems

Adaptive Space-Time Shift Keying Based Multiple-Input Multiple-Output Systems ACSTSK Adaptive Space-Time Shift Keying Based Multiple-Input Multiple-Output Systems Professor Sheng Chen Electronics and Computer Science University of Southampton Southampton SO7 BJ, UK E-mail: sqc@ecs.soton.ac.uk

More information

Carrier frequency estimation. ELEC-E5410 Signal processing for communications

Carrier frequency estimation. ELEC-E5410 Signal processing for communications Carrier frequency estimation ELEC-E54 Signal processing for communications Contents. Basic system assumptions. Data-aided DA: Maximum-lielihood ML estimation of carrier frequency 3. Data-aided: Practical

More information

Revision of Lecture 5

Revision of Lecture 5 Revision of Lecture 5 Information transferring across channels Channel characteristics and binary symmetric channel Average mutual information Average mutual information tells us what happens to information

More information

UCSD ECE153 Handout #40 Prof. Young-Han Kim Thursday, May 29, Homework Set #8 Due: Thursday, June 5, 2011

UCSD ECE153 Handout #40 Prof. Young-Han Kim Thursday, May 29, Homework Set #8 Due: Thursday, June 5, 2011 UCSD ECE53 Handout #40 Prof. Young-Han Kim Thursday, May 9, 04 Homework Set #8 Due: Thursday, June 5, 0. Discrete-time Wiener process. Let Z n, n 0 be a discrete time white Gaussian noise (WGN) process,

More information

Revision of Lecture 4

Revision of Lecture 4 Revision of Lecture 4 We have completed studying digital sources from information theory viewpoint We have learnt all fundamental principles for source coding, provided by information theory Practical

More information

Digital Modulation 2

Digital Modulation 2 Digital Modulation 2 Lecture Notes Ingmar Land and Bernard H. Fleury Department of Electronic Systems Aalborg University Version: November 15, 2006 i Contents 1 Continuous-Phase Modulation 1 1.1 General

More information

EE5713 : Advanced Digital Communications

EE5713 : 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 information

Analysis of Receiver Quantization in Wireless Communication Systems

Analysis of Receiver Quantization in Wireless Communication Systems Analysis of Receiver Quantization in Wireless Communication Systems Theory and Implementation Gareth B. Middleton Committee: Dr. Behnaam Aazhang Dr. Ashutosh Sabharwal Dr. Joseph Cavallaro 18 April 2007

More information

Trellis Coded Modulation

Trellis Coded Modulation Trellis Coded Modulation Trellis coded modulation (TCM) is a marriage between codes that live on trellises and signal designs We have already seen that trellises are the preferred way to view convolutional

More information

Contents Equalization 148

Contents Equalization 148 Contents 3 Equalization 48 3. Intersymbol Interference and Receivers for Successive Message ransmission........ 50 3.. ransmission of Successive Messages.......................... 50 3.. Bandlimited Channels..................................

More information

EE456 Digital Communications

EE456 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 information

E4702 HW#4-5 solutions by Anmo Kim

E4702 HW#4-5 solutions by Anmo Kim E70 HW#-5 solutions by Anmo Kim (ak63@columbia.edu). (P3.7) Midtread type uniform quantizer (figure 3.0(a) in Haykin) Gaussian-distributed random variable with zero mean and unit variance is applied to

More information

Digital Baseband Systems. Reference: Digital Communications John G. Proakis

Digital Baseband Systems. Reference: Digital Communications John G. Proakis Digital Baseband Systems Reference: Digital Communications John G. Proais Baseband Pulse Transmission Baseband digital signals - signals whose spectrum extend down to or near zero frequency. Model of the

More information

Analog Electronics 2 ICS905

Analog Electronics 2 ICS905 Analog Electronics 2 ICS905 G. Rodriguez-Guisantes Dépt. COMELEC http://perso.telecom-paristech.fr/ rodrigez/ens/cycle_master/ November 2016 2/ 67 Schedule Radio channel characteristics ; Analysis and

More information

EE4061 Communication Systems

EE4061 Communication Systems EE4061 Communication Systems Week 11 Intersymbol Interference Nyquist Pulse Shaping 0 c 2015, Georgia Institute of Technology (lect10 1) Intersymbol Interference (ISI) Tx filter channel Rx filter a δ(t-nt)

More information

Lecture 12. Block Diagram

Lecture 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 information

ECE 564/645 - Digital Communications, Spring 2018 Midterm Exam #1 March 22nd, 7:00-9:00pm Marston 220

ECE 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 information

Mapper & De-Mapper System Document

Mapper & De-Mapper System Document Mapper & De-Mapper System Document Mapper / De-Mapper Table of Contents. High Level System and Function Block. Mapper description 2. Demodulator Function block 2. Decoder block 2.. De-Mapper 2..2 Implementation

More information

Lecture 2. Fading Channel

Lecture 2. Fading Channel 1 Lecture 2. Fading Channel Characteristics of Fading Channels Modeling of Fading Channels Discrete-time Input/Output Model 2 Radio Propagation in Free Space Speed: c = 299,792,458 m/s Isotropic Received

More information

Module 4. Signal Representation and Baseband Processing. Version 2 ECE IIT, Kharagpur

Module 4. Signal Representation and Baseband Processing. Version 2 ECE IIT, Kharagpur Module Signal Representation and Baseband Processing Version ECE II, Kharagpur Lesson 8 Response of Linear System to Random Processes Version ECE II, Kharagpur After reading this lesson, you will learn

More information

Direct-Sequence Spread-Spectrum

Direct-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 information

Digital Communications

Digital Communications Digital Communications Chapter 5 Carrier and Symbol Synchronization Po-Ning Chen, Professor Institute of Communications Engineering National Chiao-Tung University, Taiwan Digital Communications Ver 218.7.26

More information

Supplementary Figure 1: Scheme of the RFT. (a) At first, we separate two quadratures of the field (denoted by and ); (b) then, each quadrature

Supplementary Figure 1: Scheme of the RFT. (a) At first, we separate two quadratures of the field (denoted by and ); (b) then, each quadrature Supplementary Figure 1: Scheme of the RFT. (a At first, we separate two quadratures of the field (denoted by and ; (b then, each quadrature undergoes a nonlinear transformation, which results in the sine

More information

3.9 Diversity Equalization Multiple Received Signals and the RAKE Infinite-length MMSE Equalization Structures

3.9 Diversity Equalization Multiple Received Signals and the RAKE Infinite-length MMSE Equalization Structures Contents 3 Equalization 57 3. Intersymbol Interference and Receivers for Successive Message ransmission........ 59 3.. ransmission of Successive Messages.......................... 59 3.. Bandlimited Channels..................................

More information

COMMUNICATION OVER THE NONCOHERENT CHANNEL

COMMUNICATION OVER THE NONCOHERENT CHANNEL COMMUNICATION OVER THE NONCOHERENT CHANNEL by Rza Nuriyev A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Electrical Engineering: Systems) in

More information

Digital Signal Processing

Digital Signal Processing COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #3 Wednesday, September 10, 2003 1.4 Quantization Digital systems can only represent sample amplitudes with a finite set of prescribed values,

More information

5 Analog carrier modulation with noise

5 Analog carrier modulation with noise 5 Analog carrier modulation with noise 5. Noisy receiver model Assume that the modulated signal x(t) is passed through an additive White Gaussian noise channel. A noisy receiver model is illustrated in

More information

Expectation propagation for symbol detection in large-scale MIMO communications

Expectation 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 information

The Detection Efficiency of ARTM CPM in Aeronautical Telemetry

The Detection Efficiency of ARTM CPM in Aeronautical Telemetry Brigham Young University BYU ScholarsArchive All Faculty Publications 2005-02-27 The Detection Efficiency of ARTM CPM in Aeronautical Telemetry Michael D. Rice mdr@byu.edu Erik Perrins Follow this and

More information