Chapter 10. Timing Recovery. March 12, 2008
|
|
- Bernice Cooper
- 6 years ago
- Views:
Transcription
1 Chapter 10 Timing Recovery March 12, 2008
2 b[n] coder bit/ symbol transmit filter, pt(t) Modulator Channel, c(t) noise interference form other users LNA/ AGC Demodulator receive/matched filter, p R(t) sampler Equalizer slicer/ decoder ˆb[n] Carrier recovery Timing recovery
3 10.1 Non-Data Aided Timing Recovery Methods
4 Fundamental results In a data modem, the demodulated received signal is given by y(t) = n= s[n]c BB (t nt b )
5 Fundamental results In a data modem, the demodulated received signal is given by y(t) = n= s[n]c BB (t nt b ) The key point: the ensemble mean square ρ(t) = E[ y(t) 2 ] = σ 2 s is periodic with period of T b. n= c BB (t nt b ) 2
6 Fundamental results In a data modem, the demodulated received signal is given by y(t) = n= s[n]c BB (t nt b ) The key point: the ensemble mean square ρ(t) = E[ y(t) 2 ] = σ 2 s n= c BB (t nt b ) 2 is periodic with period of T b. When c BB (t) is a bandlimited pulse within the range 1 T b f 1 T b, one finds that ( ) 2π ρ(t) = ρ ρ 1 cos t + ρ 1 T b where ρ 0 = σ2 s T b C ) BB(f ) 2 df, ρ 1 = σ2 s T b C BB(f )CBB (f 1Tb df.
7 The timing recovery cost function 1.5 ρ(τ) = ρ ρ 1 cos ( ) 2π τ + ρ 1 T b 1 ρ(τ) τ/t b
8 The optimum timing phase When p(t) be a Nyquist pulse, and p s(t) = X n= P s(f ) = 1 T b p(nt b )δ(t nt b ) = δ(t) X n= P f n! = 1 T b
9 The optimum timing phase When p(t) be a Nyquist pulse, and p s(t) = X n= P s(f ) = 1 T b p(nt b )δ(t nt b ) = δ(t) X n= P f n! = 1 T b When P(f ) has an excess bandwidth of less than 100%, we get!! P s(f ) = 1 P(f ) + P f 1 T b T b, for 0 f 1/T b
10 The optimum timing phase When p(t) be a Nyquist pulse, and p s(t) = X n= P s(f ) = 1 T b p(nt b )δ(t nt b ) = δ(t) X n= P f n! = 1 T b When P(f ) has an excess bandwidth of less than 100%, we get!! P s(f ) = 1 P(f ) + P f 1 T b T b, for 0 f 1/T b 1 P s (f) 0.8 AMPLITUDE (1/T b )P(f 1/T b ) (1/T b )P(f) ft b
11 The optimum timing phase (continued) Now, let us introduce a delay in the sampling time:
12 The optimum timing phase (continued) Now, let us introduce a delay in the sampling time: X p s(t, τ) = p(τ + nt b )δ(t τ nt b ) and n= P s(f, τ) = 1 ««P(f ) + P f 1Tb e j2πτ/t b T b
13 The optimum timing phase (continued) Now, let us introduce a delay in the sampling time: X p s(t, τ) = p(τ + nt b )δ(t τ nt b ) and n= P s(f, τ) = 1 ««P(f ) + P f 1Tb e j2πτ/t b T b τ = 0.2T b AMPLITUDE τ = 0.3T b 0.2 τ = 0.5T b ft b
14 Improving the cost function
15 10.2 Non-Data Aided Timing Recovery Algorithms
16 Early-late gate timing recovery ρ(τ) τ τ + δτ ρ (τ + δτ) ρ (τ δτ) τ δτ τ opt T b 2 τ opt τ opt + T b 2 τ τ opt T b 4 τ opt + T b 4 τ[n + 1] = τ[n] + µ (ρ (τ[n] + δτ) ρ (τ[n] δτ))
17 Early-late gate timing recovery ρ(τ) τ τ + δτ ρ (τ + δτ) ρ (τ δτ) τ δτ τ opt T b 2 τ opt τ opt + T b 2 τ τ opt T b 4 τ opt + T b 4 τ[n + 1] = τ[n] + µ (ρ (τ[n] + δτ) ρ (τ[n] δτ)) LMS-like version of this is τ[n + 1] = τ[n] + µ y (τ[n] + δτ + nt b ) 2 y (τ[n] δτ + nt b ) 2
18 MATLAB Script TR ELG.m: Early-late gate timing recovery Tb=0.0001; L=100; M1=20; Ts=Tb/L; fs=1/ts; fc=100000; delta c=0; N=8*L; phi c=0.5; sigma v=0; alpha=0.5; c=1; b=sign(randn(10000,1)); M=input( QAM size (4, 16, 64, 256) = ); if M==4 s=b(1:2:end)+i*b(2:2:end); elseif M==16 s=2*b(1:4:end)+b(2:4:end)+i*(2*b(3:4:end)+b(4:4:end)); elseif M==64 s=4*b(1:6:end)+2*b(2:6:end)+b(3:6:end)+... j*(4*b(4:6:end)+2*b(5:6:end)+b(6:6:end)); elseif M==256 s=8*b(1:8:end)+4*b(2:8:end)+2*b(3:8:end)+b(4:8:end)+... j*(8*b(5:8:end)+4*b(6:8:end)+2*b(7:8:end)+b(8:8:end)); else print( Error! M should be 4, 16, 64 or 256 ); end pt=sr cos p(n,l,alpha); xbbt=conv(expander(s,l),pt); t=[0:length(xbbt)-1] *Ts; xt=real(exp(i*2*pi*fc*t).*xbbt); xr=conv(c,xt); xr=xr+sigma v*randn(size(xr)); t=[0:length(xr)-1] *Ts; y=exp(-i*(2*pi*(fc-delta c)*t-phi c)).*xr; pr=pt; y=conv(y,pr); %%%%%%%%%%%%%%%%%%%%%%%% % TIMING RECOVER: Early-late Gating % %%%%%%%%%%%%%%%%%%%%%%%% beta=0; mu0=0.01; dtau=12; mu=mu0*(l/4)/dtau; Ly=length(y); tau=0.3*ones(1,round(ly/l)); kk=1; yp=0; ym=0; start=5*l+1 for k=start:l:length(tau)*l tautb=round(tau(kk)*l); yp=sqrt(1-betaˆ2)*y(k+tautb+dtau)-beta*yp; ym=sqrt(1-betaˆ2)*y(k+tautb-dtau)-beta*ym; tau(kk+1)=tau(kk)+mu*(abs(yp)ˆ2-abs(ym)ˆ2); kk=kk+1; end figure, plot(tau(1:kk), k ) xlabel( Iteration Number, n ), ylabel( tau[n] )
19 Early-late gate timing recovery (continued) β = δτ = 25 δτ = 18 δτ = 12 δτ = τ[n] Number of iterations, n
20 Early-late gate timing recovery (continued) β = τ[n] Number of iterations, n
21 Gradient-based algorithm τ[n + 1] = τ[n] + µ ρ(τ) τ
22 Gradient-based algorithm τ[n + 1] = τ[n] + µ ρ(τ) τ ρ(τ) τ y (τ[n] + δτ + nt b) 2 y (τ[n] δτ + nt b ) 2 2δτ
23 Gradient-based algorithm τ[n + 1] = τ[n] + µ ρ(τ) τ ρ(τ) τ y (τ[n] + δτ + nt b) 2 y (τ[n] δτ + nt b ) 2 2δτ When δτ = T b /2 (a case of interest), the following alternative form is obtained τ[n + 1] = τ[n] + µr{y 0 (τ[n] + nt b )y 1 (τ[n] + nt b + T b /2)}
24 Gradient-based algorithm τ[n + 1] = τ[n] + µ ρ(τ) τ ρ(τ) τ y (τ[n] + δτ + nt b) 2 y (τ[n] δτ + nt b ) 2 2δτ When δτ = T b /2 (a case of interest), the following alternative form is obtained τ[n + 1] = τ[n] + µr{y 0 (τ[n] + nt b )y 1 (τ[n] + nt b + T b /2)} Modified timing recovery loop for the realization of the recursion (10.35). for k=start:l:length(tau)*l tautb=round(tau(kk)*l); y0=sqrt(1-betaˆ2)*y(k+tautb)-beta*y0; y1=sqrt(1-betaˆ2)*y(k+tautb+l/2)-beta*y1; tau(kk+1)=tau(kk)+mu*real(y0*y1 ); kk=kk+1; end
25 Gradient-based algorithm (continued) τ[n] Number of iterations, n
26 Tone extraction algorithm y[n] 2 H(z) v[n] z Sample at the peaks of v[n]
27 Tone extraction algorithm (continued) Magnitude Normalized Frequency, f/f s
28 Tone extraction algorithm (continued) Magnitude Normalized Frequency, f/f s
29 Tone extraction algorithm (continued) z L/4
30 10.3 Data Aided Timing Recovery Methods
31 Mueller and Muller s method c BB (τ) c BB (τ T b ) c BB (τ + T b ) Seeks for the value of τ that minimizes the cost function η(τ) = R{c BB (τ + T b ) c BB (τ T b )}
32 Mueller and Muller s method c BB (τ) c BB (τ T b ) c BB (τ + T b ) Seeks for the value of τ that minimizes the cost function η(τ) = R{c BB (τ + T b ) c BB (τ T b )} The following update equation can be used to achieve this: τ[n+1] = τ[n]+µr {y(nt b + τ[n])ŝ [n 1] y((n 1)T b + τ[n])ŝ [n]}
33 Mueller and Muller s method (continued) Muller and Muller s timing recovery method. mu=0.01; Ly=length(y); kk=1; yp=0; ym=0; start=5*l+1; tau=0.3*ones(1,floor((ly-start)/l)); for k=start:l:length(tau)*l-l tautb=round(tau(kk)*l); sk=slicer(y(k+tautb),m); skm1=slicer(y(k+tautb-l),m); tau(kk+1)=tau(kk)+mu*real(y(k+tautb)*skm1 -y(k+tautb-l)*sk ); kk=kk+1; end figure, plot(tau(1:kk-1)) xlabel( Iteration Number, n ), ylabel( tau[n] )
34 Mueller and Muller s method (continued) τ[n] Number of iterations, n
35 Decision directed method τ is adjusted by minimizing where e[n] = s[n] y(nt b + τ). ξ = E[ e[n] 2 ]
36 Decision directed method τ is adjusted by minimizing where e[n] = s[n] y(nt b + τ). ξ = E[ e[n] 2 ] ˆξ τ = e[n] e [n] τ = 2R + e [n] e[n] τ { e [n] y(nt b + τ) τ { = 2R }. e [n] e[n] τ }
37 Decision directed method τ is adjusted by minimizing where e[n] = s[n] y(nt b + τ). ˆξ τ = e[n] e [n] τ = 2R ξ = E[ e[n] 2 ] + e [n] e[n] τ { e [n] y(nt b + τ) τ Moreover, we use the approximation to obtain y[n] τ { = 2R }. e [n] e[n] τ = y(nt b + τ + δτ) y(nt b + τ δτ). 2δτ τ[n + 1] = τ[n] µ ˆξ τ = τ[n] + µr {e [n](y(nt b + τ[n] + δτ) y(nt b + τ[n] δτ))}. }
38 Decision directed method (continued) Decision directed timing recovery method. mu=0.05; Ly=length(y); kk=1; start=5*l+1; tau=0.3*ones(1,floor((ly-start)/l)); for k=start:l:length(tau)*l-l tautb=round(tau(kk)*l); sk=slicer(y(k+tautb),m); tau(kk+1)=tau(kk)+mu*real((sk-y(k+tautb))... *(y(k+tautb+dtau)-y(k+tautb-dtau)) ); kk=kk+1; end figure, plot(tau(1:kk-1)) xlabel( Iteration Number, n ), ylabel( tau[n] )
39 Decision directed method (continued) τ[n] Iteration Number, n
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 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 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 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 informationEE4601 Communication Systems
EE4601 Communication Systems Week 13 Linear Zero Forcing Equalization 0 c 2012, Georgia Institute of Technology (lect13 1) Equalization The cascade of the transmit filter g(t), channel c(t), receiver filter
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 informationPrinciples 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 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 informationFBMC/OQAM transceivers for 5G mobile communication systems. François Rottenberg
FBMC/OQAM transceivers for 5G mobile communication systems François Rottenberg Modulation Wikipedia definition: Process of varying one or more properties of a periodic waveform, called the carrier signal,
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 informationMobile Communications (KECE425) Lecture Note Prof. Young-Chai Ko
Mobile Communications (KECE425) Lecture Note 20 5-19-2014 Prof Young-Chai Ko Summary Complexity issues of diversity systems ADC and Nyquist sampling theorem Transmit diversity Channel is known at the transmitter
More informationAdaptiveFilters. GJRE-F Classification : FOR Code:
Global Journal of Researches in Engineering: F Electrical and Electronics Engineering Volume 14 Issue 7 Version 1.0 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals
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 informationCoding 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 informationELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization
ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)
More 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 informationPulse 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 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 informationGEORGIA 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 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 informationADAPTIVE EQUALIZATION AT MULTI-GHZ DATARATES
ADAPTIVE EQUALIZATION AT MULTI-GHZ DATARATES Department of Electrical Engineering Indian Institute of Technology, Madras 1st February 2007 Outline Introduction. Approaches to electronic mitigation - ADC
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 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 informationTiming Recovery at Low SNR Cramer-Rao bound, and outperforming the PLL
T F T I G E O R G A I N S T I T U T E O H E O F E A L P R O G R ESS S A N D 1 8 8 5 S E R V L O G Y I C E E C H N O Timing Recovery at Low SNR Cramer-Rao bound, and outperforming the PLL Aravind R. Nayak
More informationCarrier 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 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 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 informationPrinciples 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 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 informationTiming errors in distributed space-time communications
Timing errors in distributed space-time communications Emanuele Viterbo Dipartimento di Elettronica Politecnico di Torino Torino, Italy viterbo@polito.it Yi Hong Institute for Telecom. Research University
More informationMapper & 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 informationWeiyao 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 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 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 informationDigital 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 informationIterative Timing Recovery
Iterative Timing Recovery John R. Barry School of Electrical and Computer Engineering, Georgia Tech Atlanta, Georgia U.S.A. barry@ece.gatech.edu 0 Outline Timing Recovery Tutorial Problem statement TED:
More informationEE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet
EE538 Final Exam Fall 005 3:0 pm -5:0 pm PHYS 3 Dec. 17, 005 Cover Sheet Test Duration: 10 minutes. Open Book but Closed Notes. Calculators ARE allowed!! This test contains five problems. Each of the five
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 informationSolutions 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 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 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 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 informationLecture 1 From Continuous-Time to Discrete-Time
Lecture From Continuous-Time to Discrete-Time Outline. Continuous and Discrete-Time Signals and Systems................. What is a signal?................................2 What is a system?.............................
More informationConsider 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 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 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 informationFigure 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 informationDecision-Point Signal to Noise Ratio (SNR)
Decision-Point Signal to Noise Ratio (SNR) Receiver Decision ^ SNR E E e y z Matched Filter Bound error signal at input to decision device Performance upper-bound on ISI channels Achieved on memoryless
More 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 informationPerformance Analysis of Spread Spectrum CDMA systems
1 Performance Analysis of Spread Spectrum CDMA systems 16:33:546 Wireless Communication Technologies Spring 5 Instructor: Dr. Narayan Mandayam Summary by Liang Xiao lxiao@winlab.rutgers.edu WINLAB, Department
More informationAdaptive Filtering Part II
Adaptive Filtering Part II In previous Lecture we saw that: Setting the gradient of cost function equal to zero, we obtain the optimum values of filter coefficients: (Wiener-Hopf equation) Adaptive Filtering,
More informationTECHNICAL RESEARCH REPORT
TECHNICAL RESEARCH REPORT On the True Cramer-Rao Lower Bound for the DA Joint Estimation of Carrier Phase and Timing Offsets by Y. Jiang, F.W. Sun and John S. Baras CSHCN T.R. 000-14 (ISR T.R. 000-36)
More informationPulse-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 informationETSF15 Analog/Digital. Stefan Höst
ETSF15 Analog/Digital Stefan Höst Physical layer Analog vs digital Sampling, quantisation, reconstruction Modulation Represent digital data in a continuous world Disturbances Noise and distortion Synchronization
More informationE2.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 informationLECTURE 16 AND 17. Digital signaling on frequency selective fading channels. Notes Prepared by: Abhishek Sood
ECE559:WIRELESS COMMUNICATION TECHNOLOGIES LECTURE 16 AND 17 Digital signaling on frequency selective fading channels 1 OUTLINE Notes Prepared by: Abhishek Sood In section 2 we discuss the receiver design
More informationA Family of Nyquist Filters Based on Generalized Raised-Cosine Spectra
Proc. Biennial Symp. Commun. (Kingston, Ont.), pp. 3-35, June 99 A Family of Nyquist Filters Based on Generalized Raised-Cosine Spectra Nader Sheikholeslami Peter Kabal Department of Electrical Engineering
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.
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 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 informationCHAPTER 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 informationAdaptive Linear Filtering Using Interior Point. Optimization Techniques. Lecturer: Tom Luo
Adaptive Linear Filtering Using Interior Point Optimization Techniques Lecturer: Tom Luo Overview A. Interior Point Least Squares (IPLS) Filtering Introduction to IPLS Recursive update of IPLS Convergence/transient
More informationDiscrete-Time Signals and Systems. Efficient Computation of the DFT: FFT Algorithms. Analog-to-Digital Conversion. Sampling Process.
iscrete-time Signals and Systems Efficient Computation of the FT: FFT Algorithms r. eepa Kundur University of Toronto Reference: Sections 6.1, 6., 6.4, 6.5 of John G. Proakis and imitris G. Manolakis,
More information7.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 informationChapter 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 informationSample Problems for the 9th Quiz
Sample Problems for the 9th Quiz. Draw the line coded signal waveform of the below line code for 0000. (a Unipolar nonreturn-to-zero (NRZ signaling (b Polar nonreturn-to-zero (NRZ signaling (c Unipolar
More informationDecision Weighted Adaptive Algorithms with Applications to Wireless Channel Estimation
Decision Weighted Adaptive Algorithms with Applications to Wireless Channel Estimation Shane Martin Haas April 12, 1999 Thesis Defense for the Degree of Master of Science in Electrical Engineering Department
More informationAdaptive Filters. un [ ] yn [ ] w. yn n wun k. - Adaptive filter (FIR): yn n n w nun k. (1) Identification. Unknown System + (2) Inverse modeling
Adaptive Filters - Statistical digital signal processing: in many problems of interest, the signals exhibit some inherent variability plus additive noise we use probabilistic laws to model the statistical
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 information2.161 Signal Processing: Continuous and Discrete
MIT OpenCourseWare http://ocw.mit.edu 2.6 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. MASSACHUSETTS
More informationE&CE 358, Winter 2016: Solution #2. Prof. X. Shen
E&CE 358, Winter 16: Solution # Prof. X. Shen Email: xshen@bbcr.uwaterloo.ca Prof. X. Shen E&CE 358, Winter 16 ( 1:3-:5 PM: Solution # Problem 1 Problem 1 The signal g(t = e t, t T is corrupted by additive
More informationEE401: 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 information1 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 informationECS332: Midterm Examination (Set I) Seat
Sirindhorn International Institute of Technology Thammasat University at Rangsit School of Information, Computer and Communication Technology ECS33: Midterm Examination (Set I) COURSE : ECS33 (Principles
More informationELEC E7210: Communication Theory. Lecture 4: Equalization
ELEC E7210: Communication Theory Lecture 4: Equalization Equalization Delay sprea ISI irreucible error floor if the symbol time is on the same orer as the rms elay sprea. DF: Equalization a receiver signal
More informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 11 Adaptive Filtering 14/03/04 http://www.ee.unlv.edu/~b1morris/ee482/
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 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 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 informationELEG 635 Digital Communication Theory. Lecture 9
ELEG 635 Digital Cmmunicatin Thery Lecture 9 10501 Agenda Optimal receiver fr PSK Effects f fading n BER perfrmance Tw ray mdel Pulse shaping Rectangle Raised csine Rt raised csine Receivers and pulse
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 informationChapter 1 Fundamental Concepts
Chapter 1 Fundamental Concepts Signals A signal is a pattern of variation of a physical quantity as a function of time, space, distance, position, temperature, pressure, etc. These quantities are usually
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 informationFigure 1 A linear, time-invariant circuit. It s important to us that the circuit is both linear and time-invariant. To see why, let s us the notation
Convolution In this section we consider the problem of determining the response of a linear, time-invariant circuit to an arbitrary input, x(t). This situation is illustrated in Figure 1 where x(t) is
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 informationSummary: 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ω (rad/s)
1. (a) From the figure we see that the signal has energy content in frequencies up to about 15rad/s. According to the sampling theorem, we must therefore sample with at least twice that frequency: 3rad/s
More informationPhysical Layer and Coding
Physical Layer and Coding Muriel Médard Professor EECS Overview A variety of physical media: copper, free space, optical fiber Unified way of addressing signals at the input and the output of these media:
More information5. 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 informationChapter 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 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 informationParameter Estimation
1 / 44 Parameter Estimation Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay October 25, 2012 Motivation System Model used to Derive
More informationProjects 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 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 informationThe PPM Poisson Channel: Finite-Length Bounds and Code Design
August 21, 2014 The PPM Poisson Channel: Finite-Length Bounds and Code Design Flavio Zabini DEI - University of Bologna and Institute for Communications and Navigation German Aerospace Center (DLR) Balazs
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 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 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 informationChapter 10 Applications in Communications
Chapter 10 Applications in Communications School of Information Science and Engineering, SDU. 1/ 47 Introduction Some methods for digitizing analog waveforms: Pulse-code modulation (PCM) Differential PCM
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 informationModule 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