8 PAM BER/SER Monte Carlo Simulation

Size: px
Start display at page:

Download "8 PAM BER/SER Monte Carlo Simulation"

Transcription

1 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 the theoretical SR and BR curves. - Calculate the average energy. - Plot the constellation and histogram of samples.

2 xercise.1 8 PAM BR/SR Monte Carlo Simulation Uniform random number generator Block Diagram I Gray-encode symbols S Modulator X Gaussian Noise + Y Gray-decoder Detector S_hat I_hat Compare symbols (I = I_hat)? Symbol rror Ratio Compare bits Bit rror Ratio

3 8 PAM System Signal constellation Gray encoding Symbols Bits in symbol -7d -5d -3d -1d 0 1d 3d 5d 7d Amplitude d : scaling Gray encoding: Slide 65 (Lecture_3_007_Hypothesisesting_SignalSpace.pdf)

4 Average transmitted signal energy = = M k k av dt t t s M 1 0 ) ( ) ( 1 φ S 0 (t) S 1 (t) S (t) S 3 (t) S 4 (t) S 5 (t) S 6 (t) S 7 (t) PAM System Derivation of standard deviation t t ( ) ) ( ) ( 8 1 d dt t t s k k av = = = = = φ 1 ) ( function Basis t φ t

5 8 PAM System Derivation of standard deviation ransmitted average energy per bit av av _ bit = = log M 3 av Average bit SNR SNR 1d 7d av _ bit av bit = = = = N0 3N0 3 σ σ Standard deviation used in the simulation σ = 7d SNR bit Note that some books use different notation av _ bit b b SNR = = = = bit N N No 0 0 bno

6 8 PAM System heoretical symbol error probability SP = (*(M-1)/M)*qfunc(sqrt((6*log(M)/(M^-1))*SNR_bit_abs)); M = Symbol error probabilities. 8 PAM theoretical simulation 10-1 Symbol rror Probability b/no [db] SP: Slide 63 (Lecture_3_007_Hypothesisesting_SignalSpace.pdf)

7 8 PAM System heoretical bit error probability approximation for low BP : BP = (1/log M) SP 10 0 Bit error probabilities. 8 PAM theoretical simulation 10-1 Bit rror Probability b/no [db] BP: Slide 68 (Lecture_3_007_Hypothesisesting_SignalSpace.pdf)

8 8 PAM System Matlab exercise -Download the file from the course web page and open with an editor SP 1 : transform SNR [db] to SNR [abs] SP : complete standard deviation for 8 PAM SP 3: generate N integer random numbers in the interval [0,7] and verify the distribution with a histogram Histogram of symbols

9 8 PAM System Matlab SP 4 : Add noise to symbols, use randn() SP 5: Calculate the symbol error ratio SP 6: Calculate the bit error ratio SP 7: Repeat the simulation for different SNR SP 8: Plot using the code in the file. Observe: - symbol error probabilities and compare to theoretical results - bit error probabilities and compare to theoretical results - constellation - histogram of the samples SP 9: Observe the average energy SP 10:Optional. Modulate using pammod() from the Communications oolbox

10 xercise BPSK / QPSK BR/SR Simulation -Simulate a communication system using BPSK/QPSK modulation and calculate bit and symbol error ratios. - Set BPSK modulation. - Plot the calculated and simulated SR and BR curves. - Plot the theoretical SR and BR curves. - Change modulation to QPSK - Plot the calculated and simulated SR and BR curves. - Plot the theoretical SR and BR curves. - Introduce a rotation in the channel and equalize the channel.

11 xercise BPSK / QPSK BR/SR Simulation Uniform random number generator Block Diagram I Gray-encode symbols S Modulator X Gaussian Noise + Y Gray-decoder Detector S_hat I_hat Compare symbols (I = I_hat)? Symbol rror Probability Compare bits Bit rror Probability

12 BPSK ransmitted average energy per bit av _ bit = av _ s SNR bit SNR b av _ bit av _ s bit = = = = = No N0 N0 σ σ heoretical Bit rror Probability for BPSK P = Q ( ) b SNR bit σ = SNR bit Symbol rror Probability = Bit rror Probability in BPSK (1bit=1symbol) P = Q ( ) s SNR bit

13 QPSK ransmitted average energy per bit av _ s av _ bit = = log M SNR bit SNR b av _ s av _ bit av _ s bit = = = = = No N0 N0 σ 4σ P = Q ( ) b SNR bit M = 4 heoretical Bit rror Probability for BPSK = QPSK σ = 4 SNR bit Approximation of heoretical Symbol rror Probability for M >= 4 P s = Q SNR bit sin π M

14 BPSK/QPSK Matlab exercise -Download the file from the course web page and open with an editor SP 1 : Set modulation to BPSK SP : Gray-encode symbols, use bingray() SP 3: Demodulate PSK by using pskdemod() SP 4: Plot using the code in the file. Observe: - symbol error probabilities and compare to theoretical results - bit error probabilities and compare to theoretical results SP 5: Change modulation to QPSK SP 6: Introduce a rotation in the channel SP 7: qualize the channel

15 BPSK/QPSK Matlab exercise SP 8 : Plot using the code in the file. Observe: - he symbols rotated - he symbols rotated + noise - he symbols after the equalizer

16 Bit rror Probability 10 0 Symbol/Bit error probabilities. BPSK BPSK SR theoretical SR simulation BR theoretical BR simulation Bit rror Probability Symbol/Bit error probabilities. QPSK QPSK SR theoretical SR simulation BR theoretical BR simulation b/no [db] 1.5 Rotated Signal Constellation with Noise QPSK b/no [db] Signal Constellation after qualization 1.5 QPSK imag 0 imag real real

17 xercise 3 System using Biorthogonal Signals -Simulate a communication system using biorthogonal waveforms and calculate bit and symbol error ratios. -Plot the calculated and simulated SR and BR curves. -Modify the simulator to use orthogonal waveforms. -Plot the calculated and simulated SR and BR curves.

18 xercise 3 System using Biorthogonal Signals S 0 (t) / S 1 (t) t / S (t) t / t S 3 (t) / t Symbols Signal constellation S 1 (t) 1 [ 0 1] S (t) 3 S 0 (t) 0 [-1 0] [ 1 0] S 3 (t) [ 0-1]

19 System using Biorthogonal Signals Average transmitted signal energy av _ s = ransmitted average energy per bit av _ s av _ bit = = log M SNR bit SNR b av _ s av _ bit av _ s bit = = = = = No N0 N0 σ 4σ σ = 4b / No

20 System using Biorthogonal Signals - Detector Signal constellation 1 Y Decision Areas 3 y Received symbol y1 0 Y1 Possible approach to make decisions if (y1 > abs(y), S = 0; elseif (y > abs(y1), S = 1; elseif (y1 <-abs(y), S = 3; else S = ;

21 Biorthogonal Signals Matlab exercise ask : Download the file from the course web page and open with an editor his code simulates biorthogonal signals and is ready to run. Compare the Symbol and Bit error probabilities obtained here to the results obtained in the QPSK exercise. SR / BR Symbol and bit error probabilities. Biorthogonal waveforms M = 4 SR BR Symbol/Bit rror Probability b/no [db]

22 Orthogonal. Signals Matlab exercise ask : he code provided simulates biorthogonal signals. Modify the code to simulate the orthogonal signals shown below (M = ). S 0 (t) / t / S 1 (t) t S 1 (t) Y [ 0 1] SP 1: Set M = S 0 (t) SP : Change standard deviation SP 3: Set modulation 0 [ 1 0] Y1 SP 4: Set the decision areas Signal constellation

23 Orthogonal. Signals Matlab exercise SP 5: Observe symbol and bit error rates SP 6: Plot theoretical bit error probabilities, for orthogonal and biorthogonal cases. Observe 3dB difference Symbol and bit error probabilities Symbol/Bit rror Probability SR BR BR heoretical Orthogonal BR heoretical Biorthogonal b/no [db]

24 xercise 4 Power Spectrum Density Consider a four-phase PSK represented by the following equivalent low pass signal: where n ( ) n ( ) u t = I g t n I takes one of the four possible values: 1 ( 1 j) n ± ± with equal probability. a. Determine and sketch the power spectrum density of u ( t) when: ( ) g t A 0 t = 0 otherwise b. Repeat a. when ( ) g t πt Asin 0 t = 0 otherwise c. Compare the spectra obtained in a. and b. in terms of the 3dB bandwidth and the bandwidth to the first spectral zero.

25 xercise 4 a). In PAM the I n coefficients are real but in PSK this is not the case since the signal space is not uni-dimensional. ( ) g t A 0 t = 0 otherwise ( ) ( π ft) ( π ft) F sin( π ftf ( f ) = A ) G( f A e π ft πf he power spectrum density is calculated as: 1 Φ uu ( f ) = G( f ) sin sin G f = A Φ f = A ( ) ( π ft) ( π ft) uu G sin(π ) jπ f Normalized Power spectrum density 10 0 Spectrum for Rectangular pulse Normalized frequency f b First Zero at 1/

26 xercise 4 b). ( ) g t πt Asin 0 t = 0 otherwise F G( f ) ( πf ) A cos = π 1 4 f e jπf he power spectrum density is calculated: ( ) ( ) 1 A Φ uu f = G f = First Zero at 1.5/ cos ( πf ) ( ) 1 4 f Normalized Power spectrum density 10 0 Spectrum for Sinusoid pulse Normalized frequency f b

27 xercise 4 c). he power spectrum for the rectangular pulse has narrower mainlobe but higher sidelobes Normalized Power spectrum density 10 0 Spectrum for Rectangular and sinusoid pulse Rectangular Sinusoid Normalized frequency f b he sinusoid pulse demands 50% more bandwidth compared to the rectangular pulse rectangular: sinusoid: ( π f 3 db ) ( π f 3 db ) ( π f ) sin cos ( 1 4 f ) = f 3 db = = f 3 db =

28 xercise 4 o determine the power spectrum density we used the Fourier transform of a proposed signal. But the Fourier transform is available only for deterministic signals. With random message signals we can not find the Fourier transform. Nevertheless we can determine the autocorrelation function of these signals from their statistical information. hen we find the power spectrum density from the Fourier transform of the autocorrelation function: Φ uu { ( )} ( f ) = I ψ τ Where ψ(τ) is the autocorrelation function * ψ ( τ ) = u ( t) u ( t + τ ) dt In Matlab we use xcorr(x) (crosscorrelation of vector x with itself)

29 xercise 4 ASK : Simulate a communication system for the given problem using Matlab and determine the Power Spectrum Density when g(t) is a rectangular and sinusoidal pulse.

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

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

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

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

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

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

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

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

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

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University ENSC327 Communications Systems 2: Fourier Representations Jie Liang School of Engineering Science Simon Fraser University 1 Outline Chap 2.1 2.5: Signal Classifications Fourier Transform Dirac Delta Function

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

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

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

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

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

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

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

Coding theory: Applications

Coding theory: Applications INF 244 a) Textbook: Lin and Costello b) Lectures (Tu+Th 12.15-14) covering roughly Chapters 1,9-12, and 14-18 c) Weekly exercises: For your convenience d) Mandatory problem: Programming project (counts

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

EE4512 Analog and Digital Communications Chapter 4. Chapter 4 Receiver Design

EE4512 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 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

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

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

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

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

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

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

EE303: Communication Systems

EE303: Communication Systems EE303: Communication Systems Professor A. Manikas Chair of Communications and Array Processing Imperial College London Introductory Concepts Prof. A. Manikas (Imperial College) EE303: Introductory Concepts

More information

UTA EE5362 PhD Diagnosis Exam (Spring 2011)

UTA 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 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

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

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

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

Signal space representations of communication signals, optimal detection and error probability

Signal space representations of communication signals, optimal detection and error probability Presentation Signal space representations of communication signals, optimal etection an error proaility Jac Romme Feruari 5 Outline Representation of anpass signal Discrete Time equivalent moel Signal

More information

Figure 1.1 (a) Model of a communication system, and (b) signal processing functions.

Figure 1.1 (a) Model of a communication system, and (b) signal processing functions. . Introduction to Signals and Operations Model of a Communication System [] Figure. (a) Model of a communication system, and (b) signal processing functions. Classification of Signals. Continuous-time

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

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

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

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

2. SPECTRAL ANALYSIS APPLIED TO STOCHASTIC PROCESSES

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

Summary: ISI. No ISI condition in time. II Nyquist theorem. Ideal low pass filter. Raised cosine filters. TX filters

Summary: ISI. No ISI condition in time. II Nyquist theorem. Ideal low pass filter. Raised cosine filters. TX filters UORIAL ON DIGIAL MODULAIONS Part 7: Intersymbol interference [last modified: 200--23] Roberto Garello, Politecnico di orino Free download at: www.tlc.polito.it/garello (personal use only) Part 7: Intersymbol

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

Lecture 5b: Line Codes

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

Solutions Communications Technology II WS 2010/2011

Solutions Communications Technology II WS 2010/2011 Solutions Communications Technology II WS 010/011 Yidong Lang, Henning Schepker NW1, Room N350, Tel.: 041/18-6393 E-mail: lang/ schepker@ant.uni-bremen.de Universität Bremen, FB1 Institut für Telekommunikation

More information

Solutions to Problems in Chapter 4

Solutions to Problems in Chapter 4 Solutions to Problems in Chapter 4 Problems with Solutions Problem 4. Fourier Series of the Output Voltage of an Ideal Full-Wave Diode Bridge Rectifier he nonlinear circuit in Figure 4. is a full-wave

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

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

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

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2) E.5 Signals & Linear Systems Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & ) 1. Sketch each of the following continuous-time signals, specify if the signal is periodic/non-periodic,

More information

EE 435. Lecture 32. Spectral Performance Windowing

EE 435. Lecture 32. Spectral Performance Windowing EE 435 Lecture 32 Spectral Performance Windowing . Review from last lecture. Distortion Analysis T 0 T S THEOREM?: If N P is an integer and x(t) is band limited to f MAX, then 2 Am Χ mnp 1 0 m h N and

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

A Design of High-Rate Space-Frequency Codes for MIMO-OFDM Systems

A Design of High-Rate Space-Frequency Codes for MIMO-OFDM Systems A Design of High-Rate Space-Frequency Codes for MIMO-OFDM Systems Wei Zhang, Xiang-Gen Xia and P. C. Ching xxia@ee.udel.edu EE Dept., The Chinese University of Hong Kong ECE Dept., University of Delaware

More information

3.2 Complex Sinusoids and Frequency Response of LTI Systems

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

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

PCM Reference Chapter 12.1, Communication Systems, Carlson. PCM.1

PCM Reference Chapter 12.1, Communication Systems, Carlson. PCM.1 PCM Reference Chapter 1.1, Communication Systems, Carlson. PCM.1 Pulse-code modulation (PCM) Pulse modulations use discrete time samples of analog signals the transmission is composed of analog information

More information

EE401: Advanced Communication Theory

EE401: Advanced Communication Theory EE401: Advanced Communication Theory Professor A. Manikas Chair of Communications and Array Processing Imperial College London Introductory Concepts Prof. A. Manikas (Imperial College) EE.401: Introductory

More information

ω 0 = 2π/T 0 is called the fundamental angular frequency and ω 2 = 2ω 0 is called the

ω 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 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

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

Expectation propagation for signal detection in flat-fading channels

Expectation propagation for signal detection in flat-fading channels Expectation propagation for signal detection in flat-fading channels Yuan Qi MIT Media Lab Cambridge, MA, 02139 USA yuanqi@media.mit.edu Thomas Minka CMU Statistics Department Pittsburgh, PA 15213 USA

More information

ENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University

ENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University ENSC37 Communications Systems : Fourier Representations School o Engineering Science Simon Fraser University Outline Chap..5: Signal Classiications Fourier Transorm Dirac Delta Function Unit Impulse Fourier

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

Lecture 7 Random Signal Analysis

Lecture 7 Random Signal Analysis Lecture 7 Random Signal Analysis 7. Introduction to Probability 7. Amplitude Distributions 7.3 Uniform, Gaussian, and Other Distributions 7.4 Power and Power Density Spectra 7.5 Properties of the Power

More information

Revision of Lecture 4

Revision of Lecture 4 Revision of Lecture 4 We have discussed all basic components of MODEM Pulse shaping Tx/Rx filter pair Modulator/demodulator Bits map symbols Discussions assume ideal channel, and for dispersive channel

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

ML Detection with Blind Linear Prediction for Differential Space-Time Block Code Systems

ML Detection with Blind Linear Prediction for Differential Space-Time Block Code Systems ML Detection with Blind Prediction for Differential SpaceTime Block Code Systems Seree Wanichpakdeedecha, Kazuhiko Fukawa, Hiroshi Suzuki, Satoshi Suyama Tokyo Institute of Technology 11, Ookayama, Meguroku,

More information

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some

More information

ECS 332: Principles of Communications 2012/1. HW 4 Due: Sep 7

ECS 332: Principles of Communications 2012/1. HW 4 Due: Sep 7 ECS 332: Principles of Communications 2012/1 HW 4 Due: Sep 7 Lecturer: Prapun Suksompong, Ph.D. Instructions (a) ONE part of a question will be graded (5 pt). Of course, you do not know which part will

More information

SHOCK AND VIBRATION RESPONSE SPECTRA COURSE Unit 6B. Notes on the Fourier Transform Magnitude

SHOCK AND VIBRATION RESPONSE SPECTRA COURSE Unit 6B. Notes on the Fourier Transform Magnitude SHOCK AND VIBRATION RESPONSE SPECTRA COURSE Unit 6B. Notes on the Fourier Transform Magnitude By Tom Irvine Introduction Fourier transforms, which were introduced in Unit 6A, have a number of potential

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

Distortion Analysis T

Distortion Analysis T EE 435 Lecture 32 Spectral Performance Windowing Spectral Performance of Data Converters - Time Quantization - Amplitude Quantization Quantization Noise . Review from last lecture. Distortion Analysis

More information

Lecture 27 Frequency Response 2

Lecture 27 Frequency Response 2 Lecture 27 Frequency Response 2 Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/6/12 1 Application of Ideal Filters Suppose we can generate a square wave with a fundamental period

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

Digital Communications: A Discrete-Time Approach M. Rice. Errata. Page xiii, first paragraph, bare witness should be bear witness

Digital Communications: A Discrete-Time Approach M. Rice. Errata. Page xiii, first paragraph, bare witness should be bear witness Digital Communications: A Discrete-Time Approach M. Rice Errata Foreword Page xiii, first paragraph, bare witness should be bear witness Page xxi, last paragraph, You know who you. should be You know who

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

Line Codes and Pulse Shaping Review. Intersymbol interference (ISI) Pulse shaping to reduce ISI Embracing ISI

Line Codes and Pulse Shaping Review. Intersymbol interference (ISI) Pulse shaping to reduce ISI Embracing ISI Line Codes and Pulse Shaping Review Line codes Pulse width and polarity Power spectral density Intersymbol interference (ISI) Pulse shaping to reduce ISI Embracing ISI Line Code Examples (review) on-off

More information

2.1 Basic Concepts Basic operations on signals Classication of signals

2.1 Basic Concepts Basic operations on signals Classication of signals Haberle³me Sistemlerine Giri³ (ELE 361) 9 Eylül 2017 TOBB Ekonomi ve Teknoloji Üniversitesi, Güz 2017-18 Dr. A. Melda Yüksel Turgut & Tolga Girici Lecture Notes Chapter 2 Signals and Linear Systems 2.1

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

Wireless Communications Lecture 10

Wireless Communications Lecture 10 Wireless Communications Lecture 1 [SNR per symbol and SNR per bit] SNR = P R N B = E s N BT s = E b N BT b For BPSK: T b = T s, E b = E s, and T s = 1/B. Raised cosine pulse shaper for other pulses. T

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

Review of Fourier Transform

Review of Fourier Transform Review of Fourier Transform Fourier series works for periodic signals only. What s about aperiodic signals? This is very large & important class of signals Aperiodic signal can be considered as periodic

More information

Central to this is two linear transformations: the Fourier Transform and the Laplace Transform. Both will be considered in later lectures.

Central to this is two linear transformations: the Fourier Transform and the Laplace Transform. Both will be considered in later lectures. In this second lecture, I will be considering signals from the frequency perspective. This is a complementary view of signals, that in the frequency domain, and is fundamental to the subject of signal

More information

ADVERSARY ANALYSIS OF COCKROACH NETWORK UNDER RAYLEIGH FADING CHANNEL: PROBABILITY OF ERROR AND ADVERSARY DETECTION. A Dissertation by.

ADVERSARY ANALYSIS OF COCKROACH NETWORK UNDER RAYLEIGH FADING CHANNEL: PROBABILITY OF ERROR AND ADVERSARY DETECTION. A Dissertation by. ADVERSARY ANALYSIS OF COCKROACH NETWORK UNDER RAYLEIGH FADING CHANNEL: PROBABILITY OF ERROR AND ADVERSARY DETECTION A Dissertation by Tze Chien Wong Master of Science, Wichita State University, 2008 Bachelor

More information

UCSD ECE 153 Handout #46 Prof. Young-Han Kim Thursday, June 5, Solutions to Homework Set #8 (Prepared by TA Fatemeh Arbabjolfaei)

UCSD ECE 153 Handout #46 Prof. Young-Han Kim Thursday, June 5, Solutions to Homework Set #8 (Prepared by TA Fatemeh Arbabjolfaei) UCSD ECE 53 Handout #46 Prof. Young-Han Kim Thursday, June 5, 04 Solutions to Homework Set #8 (Prepared by TA Fatemeh Arbabjolfaei). Discrete-time Wiener process. Let Z n, n 0 be a discrete time white

More information

Pulse-Code Modulation (PCM) :

Pulse-Code Modulation (PCM) : PCM & DPCM & DM 1 Pulse-Code Modulation (PCM) : In PCM each sample of the signal is quantized to one of the amplitude levels, where B is the number of bits used to represent each sample. The rate from

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

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

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

EEL3135: Homework #3 Solutions

EEL3135: Homework #3 Solutions EEL335: Homework #3 Solutions Problem : (a) Compute the CTFT for the following signal: xt () cos( πt) cos( 3t) + cos( 4πt). First, we use the trigonometric identity (easy to show by using the inverse Euler

More information

EE (082) Ch. II: Intro. to Signals Lecture 2 Dr. Wajih Abu-Al-Saud

EE (082) Ch. II: Intro. to Signals Lecture 2 Dr. Wajih Abu-Al-Saud Classification of Signals Some important classifications of signals Analog vs. Digital signals: as stated in the previous lecture, a signal with a magnitude that may take any real value in a specific range

More information

Message-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras

Message-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras Message-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras e-mail: hari_jethanandani@yahoo.com Abstract Low-density parity-check (LDPC) codes are discussed

More information

MATHEMATICAL TOOLS FOR DIGITAL TRANSMISSION ANALYSIS

MATHEMATICAL 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 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

Communication Theory II

Communication Theory II Communication Theory II Lecture 8: Stochastic Processes Ahmed Elnakib, PhD Assistant Professor, Mansoura University, Egypt March 5 th, 2015 1 o Stochastic processes What is a stochastic process? Types:

More information

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 41 Pulse Code Modulation (PCM) So, if you remember we have been talking

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