TSKS01&Digital&Communication Lecture&1

Size: px
Start display at page:

Download "TSKS01&Digital&Communication Lecture&1"

Transcription

1 TSKS01&Digital&Communication&K Formalities TSKS01&Digital&Communication Lecture&1 Introduction,&Signal&&&Systems,&and&Probability&Theory Emil&Björnson Department&of&Electrical&Engineering&(ISY) Division&of&Communication&Systems Information: Lecturer&&&examiner: Tutorials: Examination: Antonios Laboratory&exercises&(1hp): Two&4Khour&sessions&in&HT2 SignKup&on&the&web Written&exam&(5hp): 1&simple&task&(basics)& Min:&50% 2&questions&(5&points&each) Min:&3p 4&problems&(5&points&each) Min:&6p Pass:&14&points&from&questions&&&problems 2015K09K04 TSKS01&Digital&Communication&K Lecture&1 2 Course&Aims Overview&of&a&Communication&Situation After&passing&the&course,&the&student&should&! be&able&to&reliably&perform&standard&calculations&regarding&digital&modulation,& binary&(linear)&codes&for&error&control&and&source&coding. (basics) Source Sender Channel eceiver Destination! be&able&to&account&for&practical&problems&that&arise&in&communication,&and&be& able&to&account&for&possible&solutions&to&those&problems,&and&to&some&extent& be&able&to&perform&calculations&for&those&solutions. (primarily-questions)! be&able&to,&with&some&precision,&analyze&and&compare&various&choices&of& digital&modulation&methods&and&coding&methods&in&terms&of&error&probabilities,& minimum&distances&and&related&concepts. (problems) Source:statistics Stochastic:process Markov:chains Auto7correlation Sampling econstruction D/A7conversion Modulation Channel:coding Source:coding Filtering LTI: or:non:lti Fading Noise Intentional: jamming Sampling econstruktion A/D7conversion Demodulation Channel:decoding Source:decoding Filtering Demands:on:quality Cost:functions Application: Purpose! with&experimental&purpose&be&able&to&evaluate&and&to&some&extent&implement& such&communication&systems&that&are&treated&in&the&course. (laboratory-exercises) 2015K09K04 TSKS01&Digital&Communication&K Lecture& K09K04 TSKS01&Digital&Communication&K Lecture&1 4

2 A&OneKway&Telecommunication&System Digital&Communication:&An&Exponential&Story Packing Error&control Digital to&analog Medium Source Source: encoder Channel: encoder Modulator Overall:IP:traffic Source& coding Channel& coding Digital& modulation Analog: channel Digital&Communication&Devices&are&Everywhere Source:&Cisco&VNI&Global&IP& Traffic&Forecast,& &! PCs,&tablets,&phones,&machineKtoKmachine,&TVs,&etc. Destination Source: decoder Unpacking Channel: decoder Error&correction De7 modulator Analog&to&digital! Total&internet&traffic:& 23%&growth/year! Number&of&devices:& 12%&growth/year How:can:we:sustain:this:exponential:growth? 2015K09K04 TSKS01&Digital&Communication&K Lecture& K09K04 TSKS01&Digital&Communication&K Lecture&1 6 InformationKBearing&Signals Designing&Efficient&Communication&Systems! Example:&Mobile&communication! Analog&electromagnetic&signaling! Bandwidth&! Hz! Sample&principle&in&copper&cables,&optical&fibers,&etc. Nyquist Shannon: Sampling:Theorem! Signal&is&determined&by&2! real&samples/second&(or&! complex&samples)! InformationKbearing&signals! Select&the&samples&in&a&particular&way&" epresent&digital&information! Spectral&efficiency&(SE):&Number&of&bits&transferred&per&sample&[bit/s/Hz]! Performance&metric:&Bit&rate&[bit/s]! Formula:&##Bit#rate#[bit/s] = Bandwidth# Hz 1 Spectral#efficiency#[bit/s/Hz]! How&do&we&increase&the&bit&rate? 1. Use&more&bandwidth 2. Increase&spectral&efficiency Wired:& Use&cable&that&handles& higher&bandwidths Wireless:&Buy&more&spectrum Each&sample&represents&more&bits More&sensitive&to&disturbances Improve&signal&quality Protect&against&bit&errors This:course:primary:deals:with:spectral:efficiency! 2015K09K04 TSKS01&Digital&Communication&K Lecture& K09K04 TSKS01&Digital&Communication&K Lecture&1 8

3 Preliminary&Lecture&Plan HT1:! Introduction&and&repetition& (Lecture-1)! Introduction&to&stochastic&processes (Lecture-2)! Digital&modulation (Lectures-396)! ErrorKcontrol&coding (Lectures-798) HT2:! Practical&aspects (Lectures-9911)! Software&defined&radio&(lab&preparation) (Lecture-12) epetition:&signals&and&systems Signals: Systems: Complex:exponential: Voltages,:currents,:or:other:measurements Manipulate/filter:signals 8(:) System <(:) = >?@AB = cos 2EF: + H sin(2ef:) Unit:step: I(:) #= # J 0, : < 0 #1, : > 0 Unit:impulse: P(:)::: 8 : P : #T: = 8(0) B Property: I : = P U TU 2015K09K04 TSKS01&Digital&Communication&K Lecture& K09K04 TSKS01&Digital&Communication&K Lecture&1 10 Special&Outputs Linear&Systems General&case: Impulse&response:& Step&response:& Energy7free: 8(:) <(:) system Energy'free system:-no-transients,-constant input-" constant output P(:) I(:) Energy7free: system Energy7free: system h(:) W(:) Definition: Let&8 X (:) and&8? : be&input&signals&to&a&onekinput& energykfree&system,&and&let&< X : and&<? : be&the&corresponding& output&signals.&if < : = Y X < X : + Y? <? (:) is&the&output&corresponding&to&the&input 8 : = Y X 8 X : + Y? 8? :, for&any&8 X (:), 8? :,&Y X,&and&Y?,&then&the&system&is&referred&to&as& linear.&a&system&that&is&not&linear&is&referred&to&as&non'linear. Examples: <(:) = 8(: 1) is linear? < : = 8 : is non'linear 2015K09K04 TSKS01&Digital&Communication&K Lecture& K09K04 TSKS01&Digital&Communication&K Lecture&1 12

4 TimeKInvariant&and&LTI&Systems TimeKinvariant&system Definition::Let&8(:) be&the&input&to&an&energykfree&system&and&let& <(:)#be&the&corresponding&output.&if&<(: + U) is&the&output&for&the& input&8(: + U) for&any&8(:),&:,&and&u,&then&the&system&is&referred&to&as& time'invariant.&otherwise&the&system&is&referred&to&as&time'varying. Convolution Definition: The&convolution&of&the&signals&Y(:) and&[(:) is&denoted& by&(y [)(:) and&is&defined&as Y [ : = ] Y U [ : U TU. Examples: <(:) = 8(: 1) is time'invariant < : = cos 2EF: 8(:) is time'varying The&convolution&is&a&commutative&operation:& Y [ : = [ Y :. LTI&system Definition::A&system&that&is&both&linear&and&timeKinvariant&is&referred& to&as&a&linear-time'invariant-(lti)-system. 2015K09K04 TSKS01&Digital&Communication&K Lecture& K09K04 TSKS01&Digital&Communication&K Lecture&1 14 Output&of&LTI&Systems Frequency&Domain 8(:) g(f) Theorem::Let&8(:) be&the&input&to&an&energykfree&lti&system&with& impulse&response&h(:),&then&the&output&of&the&system&is < : = 8 h :. Fourier&transform: F 8(:) = 8 : = S>?@AB T: Exists if 8 : T: < : F Proof::Let&_ Y(:) denote&the&output&for&an&arbitrary&input&a(t),&then < : = _ 8(:) = _ ] 8 U P : U #TU ##### Linear = ] 8 U _ P : U #TU # Time inv ## = ] 8 U h : U TU = 8 h : # 2015K09K04 TSKS01&Digital&Communication&K Lecture&1 15 Inverse&transform: F SX g(f) = g F = >?@AB TF Common-notation Spectrum&of&8(:): g(f) Amplitude&spectrum: g F Phase&spectrum: arg g(f) 2015K09K04 TSKS01&Digital&Communication&K Lecture&1 16 Image&from:&

5 LTI&Systems:&Time&and&Frequency&Domain Probability,&Stochastic&Variable,&and&Events Property::Let&i F = F Y(:) and&! F = F [(:) be&the&fourier& transforms&of&the&signals&y(:) and&[(:),&then F (Y [)(:) = i F! F. Property::The&input&and&output&of&LTI&systems&are&related&as 8(:) g(f) h : _(F) < : = (8 h)(:) j F = g F _(F) Sample&space:#Ω w g w Stochastic&variable Event&i Total&probability: Pr Ω m = 1 Probability&of&event&i: Pr#{i # [0,1] Joint&probability: Pr#{i,! Conditional&probability: Pr i! = st#{u,v st#{v Event&! Measureable&sample&space: Ω m = g w :#for#some#w Ω 2015K09K04 TSKS01&Digital&Communication&K Lecture& K09K04 TSKS01&Digital&Communication&K Lecture&1 18 Probabilities&and&Distributions Example Game&based&on&tossing&two&fair&coins: Two heads +400 Two tails 100& One tail,&one head 200 Probability&distribution&function: y g (8) = Pr#{g 8 [0,1] Probability&density&function&(PDF): Properties: F g (8) # = T T8 y g(8) y g (8)#is&nonKdecreasing, y g (8) 0#and&F g (8) 0# for&all 8, F m (8) T8# = #1, Pr 8 1 < g 8 2 = F m 8 T8. ~ y m 8 = Ω = HH,HT, TH, TT Ω m = 200, 100, , ######8 < 200################# 0.5, ## < , ### < 400 1, ######8 400#################### = X? I X Ñ I X I(8 400) Ñ F m 8 = Ö Ö y g(8) = X? P X Ñ P X P(8 400) Ñ +400, w =,######### g w = Ä 100, w = ÅÅ,########## 200, w {_Å, Å_ 2015K09K04 TSKS01&Digital&Communication&K Lecture& K09K04 TSKS01&Digital&Communication&K Lecture&1 20

6 Expectation&and&Variance Example&cont d Expectation&(mean): Ü g = ] 8F m 8 T8 For&discrete&variables: Ü g = á 8 à Pr{g = 8 à à For&functions&of&a&variable: j = W g Ü j = ] <F â < T< = Ü W(g) = ] W 8 F m 8 T8 Quadratic&mean&(power): Ü g? = ] 8? F m 8 T8 Variance Var g = Ü g Ü g? ##################= Ü g? Ü g? Common&notation: ã m = Ü g,&ã â = Ü j å m? = Var g å m is&called&standard&deviation Ü g = ] F m 8 = X P X P X P(8 400)? Ñ Ñ P P P(8 400) T8 4 ###########= = 25 Ü g? = 200? ? ? = Var g = Ü g? Ü g? = K09K04 TSKS01&Digital&Communication&K Lecture& K09K04 TSKS01&Digital&Communication&K Lecture&1 22 Gaussian Distribution,&è(ã, å? ) Example of the&ì Function Probability&density F m 8 = 1 å 2E =S Sê?ë Probability&distribution&F m 8 = is&complicated Mean:&ã Variance:&å? F m 8 T8 ì 8 = 1 y m 8 = ìkfunction X?@ =Sî T: Can&be&computed&from&table for&è(0,1) 2015K09K04 TSKS01&Digital&Communication&K Lecture&1 23 ì(1.96) # S? 2015K09K04 TSKS01&Digital&Communication&K Lecture&1 24

7 Example of the&ì Function cont d Other Common&Distributions Uniform:distribution: 1 F m 8 = Ä[ Y, #Y 8 < [ ####0, ######elsewhere Mean: Variance: öõú? úsö X? ì(8) #= 10 Sò 8# #4.75 For&8 > 0 we&have:&& (1 8 S? ) For&large&8 we&have:&&&&&&ì 8 X X?@ =Sô?@ =Sô Important:&ì(8) decreases&as&8 increases < ì 8 < X?@ =Sô Exponential distribution: F m 8 = 1 ù #=S /ü #I(8) Binary distribution: F m 8 = P 8 Y + 1 P(8 [) Mean: ù Variance: ù? Mean: #Y + 1 [ Variance: 1 [ Y? 2015K09K04 TSKS01&Digital&Communication&K Lecture& K09K04 TSKS01&Digital&Communication&K Lecture&1 26

TSKS01 Digital Communication Lecture 1

TSKS01 Digital Communication Lecture 1 TSKS01 Digital Communication Lecture 1 Introduction, Repetition, and Noise Modeling Emil Björnson Department of Electrical Engineering (ISY) Division of Communication Systems Emil Björnson Course Director

More information

TSKS01&Digital&Communication Lecture&2

TSKS01&Digital&Communication Lecture&2 Power=Spectral Density (PSD) TSKS01&Digital&Communication Lecture&2 Modeling,&Pulse=Amplitude Modulation,&Signals&as&Vectors Emil&Björnson Department&of&Electrical&Engineering&(ISY) Division&of&Communication&Systems

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

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

Lecture 18: Gaussian Channel

Lecture 18: Gaussian Channel Lecture 18: Gaussian Channel Gaussian channel Gaussian channel capacity Dr. Yao Xie, ECE587, Information Theory, Duke University Mona Lisa in AWGN Mona Lisa Noisy Mona Lisa 100 100 200 200 300 300 400

More information

Automatic Control III (Reglerteknik III) fall Nonlinear systems, Part 3

Automatic Control III (Reglerteknik III) fall Nonlinear systems, Part 3 Automatic Control III (Reglerteknik III) fall 20 4. Nonlinear systems, Part 3 (Chapter 4) Hans Norlander Systems and Control Department of Information Technology Uppsala University OSCILLATIONS AND DESCRIBING

More information

CSE468 Information Conflict

CSE468 Information Conflict CSE468 Information Conflict Lecturer: Dr Carlo Kopp, MIEEE, MAIAA, PEng Lecture 02 Introduction to Information Theory Concepts Reference Sources and Bibliography There is an abundance of websites and publications

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

2A1H Time-Frequency Analysis II

2A1H Time-Frequency Analysis II 2AH Time-Frequency Analysis II Bugs/queries to david.murray@eng.ox.ac.uk HT 209 For any corrections see the course page DW Murray at www.robots.ox.ac.uk/ dwm/courses/2tf. (a) A signal g(t) with period

More information

Lecture 7. Union bound for reducing M-ary to binary hypothesis testing

Lecture 7. Union bound for reducing M-ary to binary hypothesis testing Lecture 7 Agenda for the lecture M-ary hypothesis testing and the MAP rule Union bound for reducing M-ary to binary hypothesis testing Introduction of the channel coding problem 7.1 M-ary hypothesis testing

More information

16.36 Communication Systems Engineering

16.36 Communication Systems Engineering MIT OpenCourseWare http://ocw.mit.edu 16.36 Communication Systems Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.36: Communication

More information

One Lesson of Information Theory

One Lesson of Information Theory Institut für One Lesson of Information Theory Prof. Dr.-Ing. Volker Kühn Institute of Communications Engineering University of Rostock, Germany Email: volker.kuehn@uni-rostock.de http://www.int.uni-rostock.de/

More 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

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

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

Properties of the Autocorrelation Function

Properties of the Autocorrelation Function Properties of the Autocorrelation Function I The autocorrelation function of a (real-valued) random process satisfies the following properties: 1. R X (t, t) 0 2. R X (t, u) =R X (u, t) (symmetry) 3. R

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

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

Systems & Signals 315

Systems & Signals 315 1 / 15 Systems & Signals 315 Lecture 13: Signals and Linear Systems Dr. Herman A. Engelbrecht Stellenbosch University Dept. E & E Engineering 2 Maart 2009 Outline 2 / 15 1 Signal Transmission through a

More information

EE6604 Personal & Mobile Communications. Week 15. OFDM on AWGN and ISI Channels

EE6604 Personal & Mobile Communications. Week 15. OFDM on AWGN and ISI Channels EE6604 Personal & Mobile Communications Week 15 OFDM on AWGN and ISI Channels 1 { x k } x 0 x 1 x x x N- 2 N- 1 IDFT X X X X 0 1 N- 2 N- 1 { X n } insert guard { g X n } g X I n { } D/A ~ si ( t) X g X

More information

Digital Communications: An Overview of Fundamentals

Digital Communications: An Overview of Fundamentals IMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING. COMPACT LECTURE NOTES on COMMUNICATION THEORY. Prof Athanassios Manikas, Spring 2001 Digital Communications:

More information

Channel Coding and Interleaving

Channel Coding and Interleaving Lecture 6 Channel Coding and Interleaving 1 LORA: Future by Lund www.futurebylund.se The network will be free for those who want to try their products, services and solutions in a precommercial stage.

More information

Communication Theory II

Communication Theory II Communication Theory II Lecture 15: Information Theory (cont d) Ahmed Elnakib, PhD Assistant Professor, Mansoura University, Egypt March 29 th, 2015 1 Example: Channel Capacity of BSC o Let then: o For

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

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

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

Information Theory and Coding Techniques

Information Theory and Coding Techniques Information Theory and Coding Techniques Lecture 1.2: Introduction and Course Outlines Information Theory 1 Information Theory and Coding Techniques Prof. Ja-Ling Wu Department of Computer Science and

More information

Chapter 7: Channel coding:convolutional codes

Chapter 7: Channel coding:convolutional codes Chapter 7: : Convolutional codes University of Limoges meghdadi@ensil.unilim.fr Reference : Digital communications by John Proakis; Wireless communication by Andreas Goldsmith Encoder representation Communication

More 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

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

SIGNALS AND SYSTEMS I. RAVI KUMAR

SIGNALS AND SYSTEMS I. RAVI KUMAR Signals and Systems SIGNALS AND SYSTEMS I. RAVI KUMAR Head Department of Electronics and Communication Engineering Sree Visvesvaraya Institute of Technology and Science Mahabubnagar, Andhra Pradesh New

More information

Notes 3: Stochastic channels and noisy coding theorem bound. 1 Model of information communication and noisy channel

Notes 3: Stochastic channels and noisy coding theorem bound. 1 Model of information communication and noisy channel Introduction to Coding Theory CMU: Spring 2010 Notes 3: Stochastic channels and noisy coding theorem bound January 2010 Lecturer: Venkatesan Guruswami Scribe: Venkatesan Guruswami We now turn to the basic

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

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002.

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002. The Johns Hopkins University Department of Electrical and Computer Engineering 505.460 Introduction to Linear Systems Fall 2002 Final exam Name: You are allowed to use: 1. Table 3.1 (page 206) & Table

More information

Various signal sampling and reconstruction methods

Various signal sampling and reconstruction methods Various signal sampling and reconstruction methods Rolands Shavelis, Modris Greitans 14 Dzerbenes str., Riga LV-1006, Latvia Contents Classical uniform sampling and reconstruction Advanced sampling and

More information

Information Theory - Entropy. Figure 3

Information Theory - Entropy. Figure 3 Concept of Information Information Theory - Entropy Figure 3 A typical binary coded digital communication system is shown in Figure 3. What is involved in the transmission of information? - The system

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

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

Copyright license. Exchanging Information with the Stars. The goal. Some challenges

Copyright license. Exchanging Information with the Stars. The goal. Some challenges Copyright license Exchanging Information with the Stars David G Messerschmitt Department of Electrical Engineering and Computer Sciences University of California at Berkeley messer@eecs.berkeley.edu Talk

More information

RADIO SYSTEMS ETIN15. Lecture no: Equalization. Ove Edfors, Department of Electrical and Information Technology

RADIO SYSTEMS ETIN15. Lecture no: Equalization. Ove Edfors, Department of Electrical and Information Technology RADIO SYSTEMS ETIN15 Lecture no: 8 Equalization Ove Edfors, Department of Electrical and Information Technology Ove.Edfors@eit.lth.se Contents Inter-symbol interference Linear equalizers Decision-feedback

More information

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit dwm/courses/2tf

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit   dwm/courses/2tf Time-Frequency Analysis II (HT 20) 2AH 2AH Time-Frequency Analysis II Bugs/queries to david.murray@eng.ox.ac.uk HT 20 For hints and answers visit www.robots.ox.ac.uk/ dwm/courses/2tf David Murray. A periodic

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

Probability and Statistics for Final Year Engineering Students

Probability and Statistics for Final Year Engineering Students Probability and Statistics for Final Year Engineering Students By Yoni Nazarathy, Last Updated: May 24, 2011. Lecture 6p: Spectral Density, Passing Random Processes through LTI Systems, Filtering Terms

More information

Random Processes Why we Care

Random Processes Why we Care Random Processes Why we Care I Random processes describe signals that change randomly over time. I Compare: deterministic signals can be described by a mathematical expression that describes the signal

More information

INFORMATION PROCESSING ABILITY OF BINARY DETECTORS AND BLOCK DECODERS. Michael A. Lexa and Don H. Johnson

INFORMATION PROCESSING ABILITY OF BINARY DETECTORS AND BLOCK DECODERS. Michael A. Lexa and Don H. Johnson INFORMATION PROCESSING ABILITY OF BINARY DETECTORS AND BLOCK DECODERS Michael A. Lexa and Don H. Johnson Rice University Department of Electrical and Computer Engineering Houston, TX 775-892 amlexa@rice.edu,

More information

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

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

Introduction to Convolutional Codes, Part 1

Introduction to Convolutional Codes, Part 1 Introduction to Convolutional Codes, Part 1 Frans M.J. Willems, Eindhoven University of Technology September 29, 2009 Elias, Father of Coding Theory Textbook Encoder Encoder Properties Systematic Codes

More information

Digital Communication Systems ECS 452

Digital Communication Systems ECS 452 Digital Communication Systems ECS 452 Asst. Prof. Dr. Prapun Suksompong prapun@siit.tu.ac.th Discrete Channel Office Hours: BKD 360-7 Monday 4:00-6:00 Wednesday 4:40-6:00 Noise & Interference Elements

More information

Channel Coding I. Exercises SS 2017

Channel Coding I. Exercises SS 2017 Channel Coding I Exercises SS 2017 Lecturer: Dirk Wübben Tutor: Shayan Hassanpour NW1, Room N 2420, Tel.: 0421/218-62387 E-mail: {wuebben, hassanpour}@ant.uni-bremen.de Universität Bremen, FB1 Institut

More information

Communication Theory II

Communication Theory II Communication Theory II Lecture 4: Review on Fourier analysis and probabilty theory Ahmed Elnakib, PhD Assistant Professor, Mansoura University, Egypt Febraury 19 th, 2015 1 Course Website o http://lms.mans.edu.eg/eng/

More information

ECE6604 PERSONAL & MOBILE COMMUNICATIONS. Week 3. Flat Fading Channels Envelope Distribution Autocorrelation of a Random Process

ECE6604 PERSONAL & MOBILE COMMUNICATIONS. Week 3. Flat Fading Channels Envelope Distribution Autocorrelation of a Random Process 1 ECE6604 PERSONAL & MOBILE COMMUNICATIONS Week 3 Flat Fading Channels Envelope Distribution Autocorrelation of a Random Process 2 Multipath-Fading Mechanism local scatterers mobile subscriber base station

More information

Analysis of coding on non-ergodic block-fading channels

Analysis of coding on non-ergodic block-fading channels Analysis of coding on non-ergodic block-fading channels Joseph J. Boutros ENST 46 Rue Barrault, Paris boutros@enst.fr Albert Guillén i Fàbregas Univ. of South Australia Mawson Lakes SA 5095 albert.guillen@unisa.edu.au

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

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

7.1 Sampling and Reconstruction

7.1 Sampling and Reconstruction Haberlesme Sistemlerine Giris (ELE 361) 6 Agustos 2017 TOBB Ekonomi ve Teknoloji Universitesi, Guz 2017-18 Dr. A. Melda Yuksel Turgut & Tolga Girici Lecture Notes Chapter 7 Analog to Digital Conversion

More information

Juan Juan Salon. EH National Bank. Sandwich Shop Nail Design. OSKA Beverly. Chase Bank. Marina Rinaldi. Orogold. Mariposa.

Juan Juan Salon. EH National Bank. Sandwich Shop Nail Design. OSKA Beverly. Chase Bank. Marina Rinaldi. Orogold. Mariposa. ( ) X é X é Q Ó / 8 ( ) Q / ( ) ( ) : ( ) : 44-3-8999 433 4 z 78-19 941, #115 Z 385-194 77-51 76-51 74-7777, 75-5 47-55 74-8141 74-5115 78-3344 73-3 14 81-4 86-784 78-33 551-888 j 48-4 61-35 z/ zz / 138

More information

Question Paper Code : AEC11T02

Question Paper Code : AEC11T02 Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)

More information

Gaussian Basics Random Processes Filtering of Random Processes Signal Space Concepts

Gaussian Basics Random Processes Filtering of Random Processes Signal Space Concepts White Gaussian Noise I Definition: A (real-valued) random process X t is called white Gaussian Noise if I X t is Gaussian for each time instance t I Mean: m X (t) =0 for all t I Autocorrelation function:

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

Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals

Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals Objectives Scope of this lecture: If a Continuous Time (C.T.) signal is to be uniquely represented

More information

Diversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver

Diversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver Diversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver Michael R. Souryal and Huiqing You National Institute of Standards and Technology Advanced Network Technologies Division Gaithersburg,

More information

Projects in Wireless Communication Lecture 1

Projects in Wireless Communication Lecture 1 Projects in Wireless Communication Lecture 1 Fredrik Tufvesson/Fredrik Rusek Department of Electrical and Information Technology Lund University, Sweden Lund, Sept 2018 Outline Introduction to the course

More information

Convex Optimization Lecture 13

Convex Optimization Lecture 13 Convex Optimization Lecture 13 Today: Interior-Point (continued) Central Path method for SDP Feasibility and Phase I Methods From Central Path to Primal/Dual Central'Path'Log'Barrier'Method Init: Feasible&#

More information

Representation of Signals and Systems. Lecturer: David Shiung

Representation of Signals and Systems. Lecturer: David Shiung Representation of Signals and Systems Lecturer: David Shiung 1 Abstract (1/2) Fourier analysis Properties of the Fourier transform Dirac delta function Fourier transform of periodic signals Fourier-transform

More information

Problem Sheet 1 Examples of Random Processes

Problem Sheet 1 Examples of Random Processes RANDOM'PROCESSES'AND'TIME'SERIES'ANALYSIS.'PART'II:'RANDOM'PROCESSES' '''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''Problem'Sheets' Problem Sheet 1 Examples of Random Processes 1. Give

More information

ELECTRONICS & COMMUNICATIONS DIGITAL COMMUNICATIONS

ELECTRONICS & COMMUNICATIONS DIGITAL COMMUNICATIONS EC 32 (CR) Total No. of Questions :09] [Total No. of Pages : 02 III/IV B.Tech. DEGREE EXAMINATIONS, APRIL/MAY- 207 Second Semester ELECTRONICS & COMMUNICATIONS DIGITAL COMMUNICATIONS Time: Three Hours

More 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

Principles of Communications

Principles of Communications Principles of Communications Weiyao Lin Shanghai Jiao Tong University Chapter 10: Information Theory Textbook: Chapter 12 Communication Systems Engineering: Ch 6.1, Ch 9.1~ 9. 92 2009/2010 Meixia Tao @

More 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

Gaussian channel. Information theory 2013, lecture 6. Jens Sjölund. 8 May Jens Sjölund (IMT, LiU) Gaussian channel 1 / 26

Gaussian channel. Information theory 2013, lecture 6. Jens Sjölund. 8 May Jens Sjölund (IMT, LiU) Gaussian channel 1 / 26 Gaussian channel Information theory 2013, lecture 6 Jens Sjölund 8 May 2013 Jens Sjölund (IMT, LiU) Gaussian channel 1 / 26 Outline 1 Definitions 2 The coding theorem for Gaussian channel 3 Bandlimited

More information

CS6304 / Analog and Digital Communication UNIT IV - SOURCE AND ERROR CONTROL CODING PART A 1. What is the use of error control coding? The main use of error control coding is to reduce the overall probability

More information

Computer Vision & Digital Image Processing

Computer Vision & Digital Image Processing Computer Vision & Digital Image Processing Image Restoration and Reconstruction I Dr. D. J. Jackson Lecture 11-1 Image restoration Restoration is an objective process that attempts to recover an image

More information

Neural Coding: Integrate-and-Fire Models of Single and Multi-Neuron Responses

Neural Coding: Integrate-and-Fire Models of Single and Multi-Neuron Responses Neural Coding: Integrate-and-Fire Models of Single and Multi-Neuron Responses Jonathan Pillow HHMI and NYU http://www.cns.nyu.edu/~pillow Oct 5, Course lecture: Computational Modeling of Neuronal Systems

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

SIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land

SIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land SIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land Ingmar Land, SIPCom8-1: Information Theory and Coding (2005 Spring) p.1 Overview Basic Concepts of Channel Coding Block Codes I:

More information

Chapter 12 Variable Phase Interpolation

Chapter 12 Variable Phase Interpolation Chapter 12 Variable Phase Interpolation Contents Slide 1 Reason for Variable Phase Interpolation Slide 2 Another Need for Interpolation Slide 3 Ideal Impulse Sampling Slide 4 The Sampling Theorem Slide

More information

1 Understanding Sampling

1 Understanding Sampling 1 Understanding Sampling Summary. In Part I, we consider the analysis of discrete-time signals. In Chapter 1, we consider how discretizing a signal affects the signal s Fourier transform. We derive the

More information

18.2 Continuous Alphabet (discrete-time, memoryless) Channel

18.2 Continuous Alphabet (discrete-time, memoryless) Channel 0-704: Information Processing and Learning Spring 0 Lecture 8: Gaussian channel, Parallel channels and Rate-distortion theory Lecturer: Aarti Singh Scribe: Danai Koutra Disclaimer: These notes have not

More information

Q. 1 Q. 25 carry one mark each.

Q. 1 Q. 25 carry one mark each. GATE 5 SET- ELECTRONICS AND COMMUNICATION ENGINEERING - EC Q. Q. 5 carry one mark each. Q. The bilateral Laplace transform of a function is if a t b f() t = otherwise (A) a b s (B) s e ( a b) s (C) e as

More information

Spectral Analysis - Introduction

Spectral Analysis - Introduction Spectral Analysis - Introduction Initial Code Introduction Summer Semester 011/01 Lukas Vacha In previous lectures we studied stationary time series in terms of quantities that are functions of time. The

More information

Pulse Shaping and ISI (Proakis: chapter 10.1, 10.3) EEE3012 Spring 2018

Pulse Shaping and ISI (Proakis: chapter 10.1, 10.3) EEE3012 Spring 2018 Pulse Shaping and ISI (Proakis: chapter 10.1, 10.3) EEE3012 Spring 2018 Digital Communication System Introduction Bandlimited channels distort signals the result is smeared pulses intersymol interference

More information

Algorithms for Uncertainty Quantification

Algorithms for Uncertainty Quantification Algorithms for Uncertainty Quantification Tobias Neckel, Ionuț-Gabriel Farcaș Lehrstuhl Informatik V Summer Semester 2017 Lecture 2: Repetition of probability theory and statistics Example: coin flip Example

More information

Principles of Communications

Principles of Communications Principles of Communications Weiyao Lin, PhD Shanghai Jiao Tong University Chapter 4: Analog-to-Digital Conversion Textbook: 7.1 7.4 2010/2011 Meixia Tao @ SJTU 1 Outline Analog signal Sampling Quantization

More information

for valid PSD. PART B (Answer all five units, 5 X 10 = 50 Marks) UNIT I

for valid PSD. PART B (Answer all five units, 5 X 10 = 50 Marks) UNIT I Code: 15A04304 R15 B.Tech II Year I Semester (R15) Regular Examinations November/December 016 PROBABILITY THEY & STOCHASTIC PROCESSES (Electronics and Communication Engineering) Time: 3 hours Max. Marks:

More information

Chapter 5 Frequency Domain Analysis of Systems

Chapter 5 Frequency Domain Analysis of Systems Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this

More information

Communication Theory II

Communication Theory II Communication Theory II Lecture 24: Error Correction Techniques Ahmed Elnakib, PhD Assistant Professor, Mansoura University, Egypt May 14 th, 2015 1 Error Correction Techniques olinear Block Code Cyclic

More information

ETIKA V PROFESII PSYCHOLÓGA

ETIKA V PROFESII PSYCHOLÓGA P r a ž s k á v y s o k á š k o l a p s y c h o s o c i á l n í c h s t u d i í ETIKA V PROFESII PSYCHOLÓGA N a t á l i a S l o b o d n í k o v á v e d ú c i p r á c e : P h D r. M a r t i n S t r o u

More information

Signals and Spectra - Review

Signals and Spectra - Review Signals and Spectra - Review SIGNALS DETERMINISTIC No uncertainty w.r.t. the value of a signal at any time Modeled by mathematical epressions RANDOM some degree of uncertainty before the signal occurs

More information

Digital communication system. Shannon s separation principle

Digital communication system. Shannon s separation principle Digital communication system Representation of the source signal by a stream of (binary) symbols Adaptation to the properties of the transmission channel information source source coder channel coder modulation

More information

Digital Communication Systems ECS 452

Digital Communication Systems ECS 452 Digital Communication Systems ECS 452 Asst. Prof. Dr. Prapun Suksompong prapun@siit.tu.ac.th 3 Discrete Memoryless Channel (DMC) Office Hours: BKD, 6th floor of Sirindhralai building Tuesday 4:20-5:20

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

MATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups.

MATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups. MATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups. Binary codes Let us assume that a message to be transmitted is in binary form. That is, it is a word in the alphabet

More information

Unit 3. Digital encoding

Unit 3. Digital encoding Unit 3. Digital encoding Digital Electronic Circuits (Circuitos Electrónicos Digitales) E.T.S.I. Informática Universidad de Sevilla 9/2012 Jorge Juan 2010, 2011, 2012 You are free to

More information

NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS

NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS page 1 of 5 (+ appendix) NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS Contact during examination: Name: Magne H. Johnsen Tel.: 73 59 26 78/930 25 534

More information

NAME... Soc. Sec. #... Remote Location... (if on campus write campus) FINAL EXAM EE568 KUMAR. Sp ' 00

NAME... Soc. Sec. #... Remote Location... (if on campus write campus) FINAL EXAM EE568 KUMAR. Sp ' 00 NAME... Soc. Sec. #... Remote Location... (if on campus write campus) FINAL EXAM EE568 KUMAR Sp ' 00 May 3 OPEN BOOK exam (students are permitted to bring in textbooks, handwritten notes, lecture notes

More information

Lecture 15. Theory of random processes Part III: Poisson random processes. Harrison H. Barrett University of Arizona

Lecture 15. Theory of random processes Part III: Poisson random processes. Harrison H. Barrett University of Arizona Lecture 15 Theory of random processes Part III: Poisson random processes Harrison H. Barrett University of Arizona 1 OUTLINE Poisson and independence Poisson and rarity; binomial selection Poisson point

More information

Lecture 28 Continuous-Time Fourier Transform 2

Lecture 28 Continuous-Time Fourier Transform 2 Lecture 28 Continuous-Time Fourier Transform 2 Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/6/14 1 Limit of the Fourier Series Rewrite (11.9) and (11.10) as As, the fundamental

More information

Lecture 4 Capacity of Wireless Channels

Lecture 4 Capacity of Wireless Channels Lecture 4 Capacity of Wireless Channels I-Hsiang Wang ihwang@ntu.edu.tw 3/0, 014 What we have learned So far: looked at specific schemes and techniques Lecture : point-to-point wireless channel - Diversity:

More information

Introduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved.

Introduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved. Introduction to Wireless & Mobile Systems Chapter 4 Channel Coding and Error Control 1 Outline Introduction Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Information

More information