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

Similar documents
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.

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

A First Course in Digital Communications

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

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

8 PAM BER/SER Monte Carlo Simulation

Summary II: Modulation and Demodulation

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

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

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

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.

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

Signal Design for Band-Limited Channels

that efficiently utilizes the total available channel bandwidth W.

392D: Coding for the AWGN Channel Wednesday, January 24, 2007 Stanford, Winter 2007 Handout #6. Problem Set 2 Solutions

Square Root Raised Cosine Filter

Modulation & Coding for the Gaussian Channel

Application of Matched Filter

EE 661: Modulation Theory Solutions to Homework 6

2016 Spring: The Final Exam of Digital Communications

Computing Probability of Symbol Error

EE Introduction to Digital Communications Homework 8 Solutions

CHANNEL CAPACITY CALCULATIONS FOR M ARY N DIMENSIONAL SIGNAL SETS

Chapter 2 Random Processes

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

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

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

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

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

Channel capacity. Outline : 1. Source entropy 2. Discrete memoryless channel 3. Mutual information 4. Channel capacity 5.

Performance of small signal sets

Chapter 6. Random Processes

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

Digital Transmission Methods S

SIGNAL SPACE CONCEPTS

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

EE4304 C-term 2007: Lecture 17 Supplemental Slides

Solutions to Selected Problems

Digital Modulation 1

Decision-Point Signal to Noise Ratio (SNR)

Power Spectral Density of Digital Modulation Schemes

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

Chapter 9 Fundamental Limits in Information Theory

Communication Theory Summary of Important Definitions and Results

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

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

Digital Communications

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 ]

E303: Communication Systems

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

Lecture 15: Thu Feb 28, 2019

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

Basic Principles of Video Coding

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

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

PSK bit mappings with good minimax error probability

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

Electrical Engineering Written PhD Qualifier Exam Spring 2014

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.

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

7 The Waveform Channel

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

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

Principles of Communications

Lesson 28 Working with Special Triangles

Optimum Soft Decision Decoding of Linear Block Codes

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

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

EE4440 HW#8 Solution

Performance Analysis of Spread Spectrum CDMA systems

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

Carrier frequency estimation. ELEC-E5410 Signal processing for communications

Revision of Lecture 5

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

Revision of Lecture 4

Digital Modulation 2

EE5713 : Advanced Digital Communications

Analysis of Receiver Quantization in Wireless Communication Systems

Trellis Coded Modulation

Contents Equalization 148

EE456 Digital Communications

E4702 HW#4-5 solutions by Anmo Kim

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

Analog Electronics 2 ICS905

EE4061 Communication Systems

Lecture 12. Block Diagram

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

Mapper & De-Mapper System Document

Lecture 2. Fading Channel

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

Direct-Sequence Spread-Spectrum

Digital Communications

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

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

COMMUNICATION OVER THE NONCOHERENT CHANNEL

Digital Signal Processing

5 Analog carrier modulation with noise

Expectation propagation for symbol detection in large-scale MIMO communications

The Detection Efficiency of ARTM CPM in Aeronautical Telemetry

Transcription:

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 = 4.4934. Thus, π ft =4.4934 = f = 0.7151 T and the value of ρ is 0.17. 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

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

(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

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

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 )

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

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

(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

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 =44.935 10 10 If the data rate is 10 Kbps, then the bit interval is T =10 4 and therefore, the signal amplitude is A = 44.935 10 10 10 4 =6.7034 10 3 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 =6.703 10 respectively.

Problem 5.6 : (a) The number of bits per symbol is k = 4800 R = 4800 400 = 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 =1 1 1 1 ) [ ]) 3kEb Q M (M 1) =5 10 6 = E b =9.768 (b) If the bit rate of transmission is 9600 bps, then k = 9600 400 =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 = 1 3 10 5 = E b =5.3688 (c) If the bit rate of transmission is 1900 bps, then k = 1900 400 =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 = 659.89

(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) 9.89 14.04 8.19 As it is observed there is an increase in transmitted power of approximately 3 db per additional bit per symbol.

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