EE401: Advanced Communication Theory
|
|
- Bethany Sutton
- 5 years ago
- Views:
Transcription
1 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 Concepts v.17 1 / 27
2 Table of Contents 1 Introduction 2 Communication Channels: Continuous and Discrete Continuous Channels Discrete Channels 3 Communication Systems - Block Diagrams 4 Digital Modulators/Demodulators 5 Appendices A: Comm Systems: Basic Performance Criteria B: Additive Noise Additive White Gaussian Noise (AWGN) Bandlimited AWGN "I" and "Q" Noise Components Tail function (or Q-function) for Gaussian Signals C: Tail Function Graph D: Fourier Transform Tables Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v.17 2 / 27
3 Introduction Introduction With reference to the following block structure of a Dig. Comm. System (DCS), this topic is concerned with the basics of both continuous and discrete communication channels. Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v.17 3 / 27
4 Introduction Just as with sources, communication channels are either discrete channels, or continuous channels 1 wireless channels (in this case the whole DCS is known as a Wireless DCS) 2 wireline channels (in this case the whole DCS is known as a Wireline DCS) Note that a continuous channel is converted into (becomes) a discrete channel when a digital modulator is used to feed the channel and a digital demodulator provides the channel output. Examples of channels - with reference to DCS shown in previous page, discrete channels: input: A2 - output: Â2 (alphabet: levels of quantiser - Volts) input: B2 - output: B2 (alphabet: binary digits or binary codewords) continuous channels: input: A1 - output: Â1, (Volts) - continuous channel (baseband) input: T, - output: T (Volts) - continuous channel (baseband), input: T1 - output: T1 (Volts) - continuous channel (bandpass). Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v.17 4 / 27
5 Communication Channels Continuous Channels Continuous Channels A continuous communication channel (which can be regarded as an analogue channel) is described by an input ensemble (s(t), pdf s (s)) and PSD s (f ) an output ensemble, (r(t), pdf r (r)) the channel noise (AWGN) n i (t) and β, the channel bandwidth B and channel capacity C. Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v.17 5 / 27
6 Communication Channels Discrete Channels Discrete Channels A discrete communication channel has a discrete input and a discrete output where the symbols applied to the channel input for transmission are drawn from a finite alphabet, described by an input ensemble (X, p) while the symbols appearing at the channel output are also drawn from a finite alphabet, which is described by an output ensemble (Y, q) the channel transition probability matrix F. Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v.17 6 / 27
7 Communication Channels Discrete Channels In many situations the input and output alphabets X and Y are identical but in the general case these are different. Instead of using X and Y, it is common practice to use the symbols H and D and thus define the two alphabets and the associated probabilities as {}}{{}}{{}}{ input: H = {H 1, H 2,..., H M } p = [ Pr(H 1 ), Pr(H 2 ),..., Pr(H M )] T p 1 p 2 p M {}}{{}}{{}}{ output: D = {D 1, D 2,..., D K } q = [ Pr(D 1 ), Pr(D 2 ),..., Pr(D K )] T where p m abbreviates the probability Pr(H m ) that the symbol H m may appear at the input while q k abbreviates the probability Pr(D k ) that the symbol D k may appear at the output of the channel. q 1 q 2 q K Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v.17 7 / 27
8 Communication Channels Discrete Channels The probabilistic relationship between input symbols H and output symbols D is described by the so-called channel transition probability matrix F, which is defined as follows: Pr(D 1 H 1 ), Pr(D 1 H 2 ),..., Pr(D 1 H M ) F = Pr(D 2 H 1 ), Pr(D 2 H 2 ),..., Pr(D 2 H M )...,...,...,... (1) Pr(D K H 1 ), Pr(D K H 2 ),..., Pr(D K H M ) Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v.17 8 / 27
9 Communication Channels Discrete Channels Pr(D k H m ) denotes the probability that symbol D k D will appear at the channel output, given that H m H was applied to the input. The input ensemble ( H, p ), the output ensemble ( D, q ) and the matrix F fully describe the functional properties of the channel. The following expression describes the relationship between q and p q = F.p (2) Note that in a noiseless channel D = H (3) q = p i.e the matrix F is an identity matrix F = I M (4) Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v.17 9 / 27
10 Communication Channels Discrete Channels Joint transition Probability Matrix The joint probabilistic relationship between input channel symbols H = {H 1, H 2,..., H M } and output channel symbols D = {D 1, D 2,..., D M }, is described by the so-called joint-probability matrix, T Pr(H 1, D 1 ), Pr(H 1, D 2 ),..., Pr(H 1, D K ) J Pr(H 2, D 1 ), Pr(H 2, D 2 ),..., Pr(H 2, D K )...,...,...,... Pr(H M, D 1 ), Pr(H M, D 2 ),..., Pr(H M, D K ) J is related to the forward transition probabilities of a channel with the following expression (compact form of Bayes Theorem): p J = F. 0 p = F.diag(p) (6) } {{ p M } diag(p) Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27 (5)
11 Communication Channels Discrete Channels Note: This is equivalent to a new (joint) source having alphabet {(H 1, D1), (H 1, D 2 ),..., (H M, D K )} and ensemble (joint ensemble) defined as follows = (H D, J) = (H 1, D 1 ), Pr(H 1, D 1 ) (H 1, D 2 ), Pr(H 1, D 2 )... (H m, D k ), Pr(H m, D k )... (H M, D K ), Pr(H M, D K ) (H m, D k ), Pr(H m, D k ), mk : 1 m M, 1 k K }{{} =J km (7) Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
12 Communication Systems - Block Diagrams Block Structure of a Digital Comm System Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
13 Communication Systems - Block Diagrams Block Structure of a Spread Spectrum Comm System SSS: CDMA: Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
14 Digital Modulators/Demodulators Digital Modulators/Demodulators A digital modulator is described by M different channel symbols. These channel symbols are ENERGY SIGNALS of duration T cs. Digital Modulator: Digital Demodulator: Note: It is common practice to ignore the up/down conversion and to work in baseband. Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
15 Digital Modulators/Demodulators If M = 2 Binary Digital Modulator Binary Comm. System If M > 2 M-ary Digital Modulator M-ary Comm. System Note: A continuous channel is converted into (becomes) a discrete channel when a digital modulator is used to feed the channel and a digital demodulator provides the channel output. Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
16 Digital Modulators/Demodulators Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
17 Digital Modulators/Demodulators In this topic we will focus on the following block of a digital communication system (β = 1 is assumed): This is the heart of a communication system and some elements of detection/decision theory will be employed for its investigation. Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
18 Appendices A: Comm Systems: Basic Performance Criteria Appendices - A: Basic Performance Criteria SNR in = Power of signal at T {(βs(t)) Power of noise at T = E 2} E {n(t) 2 } = β2 P s N 0 B }{{} P n p e = BER at point B (9) SNR out = (8) Power of signal at  Power of noise at  = f{p }{{ e} (10) } denotes: a function of p e Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
19 Appendices B: Additive Noise B: Additive Noise types of channel signals s(t), r(t), n(t): bandpass n i (t) = AWGN: allpass Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
20 Appendices B: Additive Noise n i (t) it is a random all-pass signal its Power Spectral Density is "White" i.e. "flat". That is, PSD ni (f ) = N 0 2 (11) its amplitude probability density ( function is Gaussian ) its Autocorrelation function i.e. FT 1 {PSD(f )} is: R ni n i (τ) = N 0 2 δ(τ) (12) Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
21 Appendices B: Additive Noise Bandlimited AWGN n(t) it is a random Band-Pass signal of bandwidth B (equal to the channel bandwidth) its Power Spectral Density is "bandmimited White". That is, PSD ni (f ) = N 0 2 Its power is: ( { } { }) f + Fc f Fc rect + rect B B (13) P n = σ 2 n = PSD ni (f ).df = N 0 2 B 2 P n = N 0 B (14) Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
22 Appendices B: Additive Noise more on n(t): its amplitude probability density function is Gaussian It is also known as bandlimited-awgn It can be written as follows: where pdf n = N(0, σ 2 n = N 0 B) (15) n(t) = n c (t) cos(2πf c t) n s (t) sin(2πf c t) (16) = } nc 2 (t) + ns 2 (t) cos(2πf c t + φ n (t)) {{} (17) r n (t) n c (t) and n s (t) are random signals - with pdf=gaussian distribution r n (t) is a random signal - with pdf=rayleigh distribution φ n (t) is a random signal - with pdf=uniform distribution: [0, 2π]) N.B.: all the above are low pass signals & appear at Rx s o/p Equ. 16 is known as Quadrature Noise Representation. Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
23 Appendices B: Additive Noise "I" and "Q" Noise Components n c (t) (i.e. "I") and n s (t) (i.e. "Q") their Power Spectral Densities are: their power are: { } f PSD nc (f ) = PSD ns (f ) = N 0 rect B P nc = σ 2 n c = PSD nc (f ).df = N 0 B (18) P nc = P ns = P n = N 0 B (19) Amplitude probability density functions: Gaussian, are uncorrelated i.e. E {n c (t).n s (t)} = 0 pdf nc = pdf ns = N(0, N 0 B) (20) Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
24 Appendices B: Additive Noise Tail function (or Q-function) for Gaussian Signals Probablity and Probability-Density-Function (pdf) Consider a random signal x(t) with a known amplitude probability density function pdf x (x) - not necessarily Gaussian. Then the probability that the amplitude of x(t) is greater than A Volts (say) is given as follows: Pr(x(t) > A) = A pdf x (x).dx (21) e.g. if A = 3V Pr(x(t) > 3V ) = 3 pdf x (x).dx = highlighted area Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
25 Appendices B: Additive Noise Gaussian pdf and Tail function If pdf x (x) = Gaussian of mean µ x and standard deviation σ x (notation used: pdf x (x) = N(µ x, σ 2 x ), then the above area is defined as the Tail-function (or Q-function) e.g. Pr(x(t) > A) = A pdf x (x).dx T{ A µ x σ x } (22) if pdf x (x) = N(1, 4) - i.e. µ x = 0, σ x = 2 - and A = 3V then Pr(x(t) > 3V ) = 3 pdf x (x).dx T{ 3 1 if pdf x (x) = N(0, 1) and A = 3V then Pr(x(t) > 3V ) = 3 pdf x (x).dx T{3} The Tail function graph is given in the next page 2 }=T{1} Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
26 Appendices C: Tail Function Graph Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
27 Appendices D: Fourier Transform Tables Fourier Transform Tables Description Function Transformation 1 Definition g(t) G (f ) = g(t).e j2πft dt 2 Scaling g ( ) t T T.G (ft ) 3 Time shift g(t T ) G (f ).e j2πft 4 Frequency shift g(t).e j2πft G (f F ) 5 Complex conjugate g (t) G ( f ) 6 Temporal derivative d n dt g(t) n (j2πf )n.g (f ) 7 Spectral derivative ( j2πt) n.g(t) d n df G (f ) n 8 Reciprocity G (t) g( f ) 9 Linearity A.g(t) + B.h(t) A.G (f ) + B.H(f ) 10 Multiplication g(t).h(t) G (f ) H(f ) 11 Convolution g(t) h(t) G (f ).H(f ) 12 Delta function δ(t) 1 13 Constant 1 δ(f ) { 1 if t < 1 14 Rectangular function rect{t} 2 sinc{f } sin(πf ) 0 otherwise πf 15 Sinc function sinc(t) rect{f } { 1 t > 0 16 Unit step function u(t) 0 t < 0 17 Signum function sgn(t) 18 decaying exp (two-sided) 19 decaying exp (one-sided) { 1 t > 0 1 t < δ(f ) j 2πf j πf e t 2 1+(2πf ) 2 e t.u(t) 1 j2πf 1+(2πf ) 2 20 Gaussian function e πt2 e πf 2 { 1 t if 0 t 1 21 Lambda function Λ{t} sinc 1 + t if 1 t 0 2 {f } 22 Repeated function rept {g(t)} = g(t) rept {δ(t)} 1 T comb 1T {G (f )} 23 Sampled function combt {g(t)} = g(t).rept {δ(t)} 1 T rep 1 {G (f )} T Prof. A. Manikas (Imperial College) EE.401: Introductory Concepts v / 27
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 informationInformation Sources. Professor A. Manikas. Imperial College London. EE303 - Communication Systems An Overview of Fundamentals
Information Sources Professor A. Manikas Imperial College London EE303 - Communication Systems An Overview of Fundamentals Prof. A. Manikas (Imperial College) EE303: Information Sources 24 Oct. 2011 1
More informationDigital 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 informationE303: Communication Systems
E303: Communication Systems Professor A. Manikas Chair of Communications and Array Processing Imperial College London An Overview of Fundamentals: PN-codes/signals & Spread Spectrum (Part B) Prof. A. Manikas
More informationLecture 8 ELE 301: Signals and Systems
Lecture 8 ELE 30: Signals and Systems Prof. Paul Cuff Princeton University Fall 20-2 Cuff (Lecture 7) ELE 30: Signals and Systems Fall 20-2 / 37 Properties of the Fourier Transform Properties of the Fourier
More informationSignals and Systems: Part 2
Signals and Systems: Part 2 The Fourier transform in 2πf Some important Fourier transforms Some important Fourier transform theorems Convolution and Modulation Ideal filters Fourier transform definitions
More informationECE6604 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 informationENSC327 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 informationThis 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 information5 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 informationEE4061 Communication Systems
EE4061 Communication Systems Week 11 Intersymbol Interference Nyquist Pulse Shaping 0 c 2015, Georgia Institute of Technology (lect10 1) Intersymbol Interference (ISI) Tx filter channel Rx filter a δ(t-nt)
More informationLecture 7 ELE 301: Signals and Systems
Lecture 7 ELE 30: Signals and Systems Prof. Paul Cuff Princeton University Fall 20-2 Cuff (Lecture 7) ELE 30: Signals and Systems Fall 20-2 / 22 Introduction to Fourier Transforms Fourier transform as
More informationDigital 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 informationThis 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 informationE303: 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 informationEE5713 : 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 informationSummary of Fourier Transform Properties
Summary of Fourier ransform Properties Frank R. Kschischang he Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of oronto January 7, 207 Definition and Some echnicalities
More informationENSC327 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 informationFourier Series and Transform KEEE343 Communication Theory Lecture #7, March 24, Prof. Young-Chai Ko
Fourier Series and Transform KEEE343 Communication Theory Lecture #7, March 24, 20 Prof. Young-Chai Ko koyc@korea.ac.kr Summary Fourier transform Properties Fourier transform of special function Fourier
More information7 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 informationEE4512 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= 4. e t/a dt (2) = 4ae t/a. = 4a a = 1 4. (4) + a 2 e +j2πft 2
ECE 341: Probability and Random Processes for Engineers, Spring 2012 Homework 13 - Last homework Name: Assigned: 04.18.2012 Due: 04.25.2012 Problem 1. Let X(t) be the input to a linear time-invariant filter.
More informationSignal 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 informationIntroduction to Fourier Transforms. Lecture 7 ELE 301: Signals and Systems. Fourier Series. Rect Example
Introduction to Fourier ransforms Lecture 7 ELE 3: Signals and Systems Fourier transform as a limit of the Fourier series Inverse Fourier transform: he Fourier integral theorem Prof. Paul Cuff Princeton
More informationKevin 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 informationLecture Notes 7 Stationary Random Processes. Strict-Sense and Wide-Sense Stationarity. Autocorrelation Function of a Stationary Process
Lecture Notes 7 Stationary Random Processes Strict-Sense and Wide-Sense Stationarity Autocorrelation Function of a Stationary Process Power Spectral Density Continuity and Integration of Random Processes
More informationMATHEMATICAL 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 informationAnalog 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 informationExample: 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 informationLecture 7: Wireless Channels and Diversity Advanced Digital Communications (EQ2410) 1
Wireless : Wireless Advanced Digital Communications (EQ2410) 1 Thursday, Feb. 11, 2016 10:00-12:00, B24 1 Textbook: U. Madhow, Fundamentals of Digital Communications, 2008 1 / 15 Wireless Lecture 1-6 Equalization
More informationModule 4. Signal Representation and Baseband Processing. Version 2 ECE IIT, Kharagpur
Module Signal Representation and Baseband Processing Version ECE II, Kharagpur Lesson 8 Response of Linear System to Random Processes Version ECE II, Kharagpur After reading this lesson, you will learn
More informationPrinciples 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 informationCommunications and Signal Processing Spring 2017 MSE Exam
Communications and Signal Processing Spring 2017 MSE Exam Please obtain your Test ID from the following table. You must write your Test ID and name on each of the pages of this exam. A page with missing
More informationA 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 informationChapter 5 Random Variables and Processes
Chapter 5 Random Variables and Processes Wireless Information Transmission System Lab. Institute of Communications Engineering National Sun Yat-sen University Table of Contents 5.1 Introduction 5. Probability
More informationFundamentals of Noise
Fundamentals of Noise V.Vasudevan, Department of Electrical Engineering, Indian Institute of Technology Madras Noise in resistors Random voltage fluctuations across a resistor Mean square value in a frequency
More informationEE401: Advanced Communication Theory
EE401: Advanced Communication Theory Professor A. Manikas Chair of Communications and Array Processing Imperial College London Multi-Antenna Wireless Communications Part-B: SIMO, MISO and MIMO Prof. A.
More informationthat 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 informationCommunication 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 information2.1 Introduction 2.22 The Fourier Transform 2.3 Properties of The Fourier Transform 2.4 The Inverse Relationship between Time and Frequency 2.
Chapter2 Fourier Theory and Communication Signals Wireless Information Transmission System Lab. Institute of Communications Engineering g National Sun Yat-sen University Contents 2.1 Introduction 2.22
More informationFourier Analysis and Power Spectral Density
Chapter 4 Fourier Analysis and Power Spectral Density 4. Fourier Series and ransforms Recall Fourier series for periodic functions for x(t + ) = x(t), where x(t) = 2 a + a = 2 a n = 2 b n = 2 n= a n cos
More informationELEC546 Review of Information Theory
ELEC546 Review of Information Theory Vincent Lau 1/1/004 1 Review of Information Theory Entropy: Measure of uncertainty of a random variable X. The entropy of X, H(X), is given by: If X is a discrete random
More informationDigital 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 information2 Frequency-Domain Analysis
2 requency-domain Analysis Electrical engineers live in the two worlds, so to speak, of time and frequency. requency-domain analysis is an extremely valuable tool to the communications engineer, more so
More informationTSKS01 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 information2A1H 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 informationLecture 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 informationCommunication Systems Lecture 21, 22. Dong In Kim School of Information & Comm. Eng. Sungkyunkwan University
Communication Systems Lecture 1, Dong In Kim School of Information & Comm. Eng. Sungkyunkwan University 1 Outline Linear Systems with WSS Inputs Noise White noise, Gaussian noise, White Gaussian noise
More informationDigital Communications
Digital Communications Chapter 5 Carrier and Symbol Synchronization Po-Ning Chen, Professor Institute of Communications Engineering National Chiao-Tung University, Taiwan Digital Communications Ver 218.7.26
More informationChapter Review of of Random Processes
Chapter.. Review of of Random Proesses Random Variables and Error Funtions Conepts of Random Proesses 3 Wide-sense Stationary Proesses and Transmission over LTI 4 White Gaussian Noise Proesses @G.Gong
More informationa) 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 informationDigital 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 information2.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 informationNORWEGIAN 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 informationEE 637 Final April 30, Spring Each problem is worth 20 points for a total score of 100 points
EE 637 Final April 30, Spring 2018 Name: Instructions: This is a 120 minute exam containing five problems. Each problem is worth 20 points for a total score of 100 points You may only use your brain and
More informationSquare 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 informationData Detection for Controlled ISI. h(nt) = 1 for n=0,1 and zero otherwise.
Data Detection for Controlled ISI *Symbol by symbol suboptimum detection For the duobinary signal pulse h(nt) = 1 for n=0,1 and zero otherwise. The samples at the output of the receiving filter(demodulator)
More informationReview 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 informationGood Luck. EE 637 Final May 4, Spring Name: Instructions: This is a 120 minute exam containing five problems.
EE 637 Final May 4, Spring 200 Name: Instructions: This is a 20 minute exam containing five problems. Each problem is worth 20 points for a total score of 00 points You may only use your brain and a pencil
More informationLOPE3202: Communication Systems 10/18/2017 2
By Lecturer Ahmed Wael Academic Year 2017-2018 LOPE3202: Communication Systems 10/18/2017 We need tools to build any communication system. Mathematics is our premium tool to do work with signals and systems.
More informationRevision 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 informationSignal Processing Signal and System Classifications. Chapter 13
Chapter 3 Signal Processing 3.. Signal and System Classifications In general, electrical signals can represent either current or voltage, and may be classified into two main categories: energy signals
More informationLecture 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 informationLecture 15: Thu Feb 28, 2019
Lecture 15: Thu Feb 28, 2019 Announce: HW5 posted Lecture: The AWGN waveform channel Projecting temporally AWGN leads to spatially AWGN sufficiency of projection: irrelevancy theorem in waveform AWGN:
More informationReview of Doppler Spread The response to exp[2πift] is ĥ(f, t) exp[2πift]. ĥ(f, t) = β j exp[ 2πifτ j (t)] = exp[2πid j t 2πifτ o j ]
Review of Doppler Spread The response to exp[2πift] is ĥ(f, t) exp[2πift]. ĥ(f, t) = β exp[ 2πifτ (t)] = exp[2πid t 2πifτ o ] Define D = max D min D ; The fading at f is ĥ(f, t) = 1 T coh = 2D exp[2πi(d
More informationFourier Analysis and Sampling
Chapter Fourier Analysis and Sampling Fourier analysis refers to a collection of tools that can be applied to express a function in terms of complex sinusoids, called basis elements, of different frequencies.
More information2016 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 informationUCSD 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 informationII - Baseband pulse transmission
II - Baseband pulse transmission 1 Introduction We discuss how to transmit digital data symbols, which have to be converted into material form before they are sent or stored. In the sequel, we associate
More informationChapter 2 Signal Processing at Receivers: Detection Theory
Chapter Signal Processing at Receivers: Detection Theory As an application of the statistical hypothesis testing, signal detection plays a key role in signal processing at receivers of wireless communication
More informationFINAL EXAM: 3:30-5:30pm
ECE 30: Probabilistic Methods in Electrical and Computer Engineering Spring 016 Instructor: Prof. A. R. Reibman FINAL EXAM: 3:30-5:30pm Spring 016, MWF 1:30-1:0pm (May 6, 016) This is a closed book exam.
More informationSignals and Systems. Lecture 14 DR TANIA STATHAKI READER (ASSOCIATE PROFESSOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON
Signals and Systems Lecture 14 DR TAIA STATHAKI READER (ASSOCIATE PROFESSOR) I SIGAL PROCESSIG IMPERIAL COLLEGE LODO Introduction. Time sampling theorem resume. We wish to perform spectral analysis using
More informationDirect-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 informations 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 informationDetecting Parametric Signals in Noise Having Exactly Known Pdf/Pmf
Detecting Parametric Signals in Noise Having Exactly Known Pdf/Pmf Reading: Ch. 5 in Kay-II. (Part of) Ch. III.B in Poor. EE 527, Detection and Estimation Theory, # 5c Detecting Parametric Signals in Noise
More informationContinuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4
Continuous Time Signal Analysis: the Fourier Transform Lathi Chapter 4 Topics Aperiodic signal representation by the Fourier integral (CTFT) Continuous-time Fourier transform Transforms of some useful
More informationLine 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 informationRevision 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 informationECE6604 PERSONAL & MOBILE COMMUNICATIONS. Week 4. Envelope Correlation Space-time Correlation
ECE6604 PERSONAL & MOBILE COMMUNICATIONS Week 4 Envelope Correlation Space-time Correlation 1 Autocorrelation of a Bandpass Random Process Consider again the received band-pass random process r(t) = g
More informationRandom 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 information8.1 Circuit Parameters
8.1 Circuit Parameters definition of decibels using decibels transfer functions impulse response rise time analysis Gaussian amplifier transfer function RC circuit transfer function analog-to-digital conversion
More informationDigital Modulation 2
Digital Modulation 2 Lecture Notes Ingmar Land and Bernard H. Fleury Department of Electronic Systems Aalborg University Version: November 15, 2006 i Contents 1 Continuous-Phase Modulation 1 1.1 General
More informationEs 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 informationDigital 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 informationThe Discrete Fourier Transform. Signal Processing PSYCH 711/712 Lecture 3
The Discrete Fourier Transform Signal Processing PSYCH 711/712 Lecture 3 DFT Properties symmetry linearity shifting scaling Symmetry x(n) -1.0-0.5 0.0 0.5 1.0 X(m) -10-5 0 5 10 0 5 10 15 0 5 10 15 n m
More informationSummary 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 informationENEE 420 FALL 2007 COMMUNICATIONS SYSTEMS SAMPLING
c 2008 by Armand M. Maowsi 1 ENEE 420 FALL 2007 COMMUNICATIONS SYSTEMS SAMPLING In these notes we discuss the sampling process and properties of some of its mathematical description. This culminates in
More informationEE456 Digital Communications
EE456 Digital Communications Professor Ha Nguyen September 5 EE456 Digital Communications Block Diagram of Binary Communication Systems m ( t { b k } b k = s( t b = s ( t k m ˆ ( t { bˆ } k r( t Bits in
More information2A1H 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 informationFundamentals of the Discrete Fourier Transform
Seminar presentation at the Politecnico di Milano, Como, November 12, 2012 Fundamentals of the Discrete Fourier Transform Michael G. Sideris sideris@ucalgary.ca Department of Geomatics Engineering University
More informationECE 630: Statistical Communication Theory
ECE 630: Statistical Communication Theory Dr. B.-P. Paris Dept. Electrical and Comp. Engineering George Mason University Last updated: April 6, 2017 2017, B.-P. Paris ECE 630: Statistical Communication
More informationEE6604 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 information8 PAM BER/SER Monte Carlo Simulation
xercise.1 8 PAM BR/SR Monte Carlo Simulation - Simulate a 8 level PAM communication system and calculate bit and symbol error ratios (BR/SR). - Plot the calculated and simulated SR and BR curves. - Plot
More informationThe Hilbert Transform
The Hilbert Transform Frank R. Kschischang The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto October 22, 2006; updated March 0, 205 Definition The Hilbert
More information8: Correlation. E1.10 Fourier Series and Transforms ( ) Fourier Transform - Correlation: 8 1 / 11. 8: Correlation
E. Fourier Series and Transforms (25-5585) - Correlation: 8 / The cross-correlation between two signals u(t) and v(t) is w(t) = u(t) v(t) u (τ)v(τ +t)dτ = u (τ t)v(τ)dτ [sub: τ τ t] The complex conjugate,
More informationCommunication Signals (Haykin Sec. 2.4 and Ziemer Sec Sec. 2.4) KECE321 Communication Systems I
Communication Signals (Haykin Sec..4 and iemer Sec...4-Sec..4) KECE3 Communication Systems I Lecture #3, March, 0 Prof. Young-Chai Ko 년 3 월 일일요일 Review Signal classification Phasor signal and spectra Representation
More informationThis is a Gaussian probability centered around m = 0 (the most probable and mean position is the origin) and the mean square displacement m 2 = n,or
Physics 7b: Statistical Mechanics Brownian Motion Brownian motion is the motion of a particle due to the buffeting by the molecules in a gas or liquid. The particle must be small enough that the effects
More informationOn Coding for Orthogonal Frequency Division Multiplexing Systems
On Coding for Orthogonal Frequency Division Multiplexing Systems Alan Clark Department of Electrical and Computer Engineering A thesis presented for the degree of Doctor of Philosophy University of Canterbury
More informationRandom Processes Handout IV
RP-IV.1 Random Processes Handout IV CALCULATION OF MEAN AND AUTOCORRELATION FUNCTIONS FOR WSS RPS IN LTI SYSTEMS In the last classes, we calculated R Y (τ) using an intermediate function f(τ) (h h)(τ)
More informationModulation & 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