TTT4110 Information and Signal Theory Solution to exam



Similar documents
TTT4120 Digital Signal Processing Suggested Solution to Exam Fall 2008

Solutions to Exam in Speech Signal Processing EN2300

UNIVERSITY OF CALIFORNIA, SAN DIEGO Electrical & Computer Engineering Department ECE Fall 2010 Linear Systems Fundamentals

Design of Efficient Digital Interpolation Filters for Integer Upsampling. Daniel B. Turek

min ǫ = E{e 2 [n]}. (11.2)

Digital Signal Processing IIR Filter Design via Impulse Invariance

Sampling Theorem Notes. Recall: That a time sampled signal is like taking a snap shot or picture of signal periodically.

Probability and Random Variables. Generation of random variables (r.v.)

Coding and decoding with convolutional codes. The Viterbi Algor

Power Spectral Density

Signal Detection C H A P T E R SIGNAL DETECTION AS HYPOTHESIS TESTING

Electronic Communications Committee (ECC) within the European Conference of Postal and Telecommunications Administrations (CEPT)

5 Signal Design for Bandlimited Channels

Controller Design in Frequency Domain

First, we show how to use known design specifications to determine filter order and 3dB cut-off

Sampling and Interpolation. Yao Wang Polytechnic University, Brooklyn, NY11201

Em bedded DSP : I ntroduction to Digital Filters

T = 1 f. Phase. Measure of relative position in time within a single period of a signal For a periodic signal f(t), phase is fractional part t p

ANALYZER BASICS WHAT IS AN FFT SPECTRUM ANALYZER? 2-1

Implementation of Digital Signal Processing: Some Background on GFSK Modulation

Design of FIR Filters

Analysis/resynthesis with the short time Fourier transform

Example/ an analog signal f ( t) ) is sample by f s = 5000 Hz draw the sampling signal spectrum. Calculate min. sampling frequency.

Lab 1. The Fourier Transform

RANDOM VIBRATION AN OVERVIEW by Barry Controls, Hopkinton, MA

Lecture 5: Variants of the LMS algorithm

TCOM 370 NOTES 99-4 BANDWIDTH, FREQUENCY RESPONSE, AND CAPACITY OF COMMUNICATION LINKS

Appendix D Digital Modulation and GMSK

Non-Data Aided Carrier Offset Compensation for SDR Implementation

Chapter 3 RANDOM VARIATE GENERATION

1 Multi-channel frequency division multiplex frequency modulation (FDM-FM) emissions

SGN-1158 Introduction to Signal Processing Test. Solutions

The Calculation of G rms

Motorola Digital Signal Processors

Taking the Mystery out of the Infamous Formula, "SNR = 6.02N dB," and Why You Should Care. by Walt Kester

Basics of Floating-Point Quantization

Frequency Response of FIR Filters

NRZ Bandwidth - HF Cutoff vs. SNR

Adaptive Equalization of binary encoded signals Using LMS Algorithm

Introduction to IQ-demodulation of RF-data

UNIVERSITY OF CALIFORNIA, SAN DIEGO Electrical & Computer Engineering Department ECE Fall 2009 Linear Systems Fundamentals

Automatic Detection of Emergency Vehicles for Hearing Impaired Drivers

Voice---is analog in character and moves in the form of waves. 3-important wave-characteristics:

Short-time FFT, Multi-taper analysis & Filtering in SPM12

14: FM Radio Receiver

Lecture 5 Least-squares

AN Application Note: FCC Regulations for ISM Band Devices: MHz. FCC Regulations for ISM Band Devices: MHz

Digital Modulation. David Tipper. Department of Information Science and Telecommunications University of Pittsburgh. Typical Communication System

Auto-Tuning Using Fourier Coefficients

Luigi Piroddi Active Noise Control course notes (January 2015)

Enhancing the SNR of the Fiber Optic Rotation Sensor using the LMS Algorithm

Digital Transmission of Analog Data: PCM and Delta Modulation

5. Continuous Random Variables

4 Sums of Random Variables

Advanced Signal Processing and Digital Noise Reduction

G. GRAPHING FUNCTIONS

Signal Detection. Outline. Detection Theory. Example Applications of Detection Theory

Time series analysis Matlab tutorial. Joachim Gross

L9: Cepstral analysis

Combining the ADS1202 with an FPGA Digital Filter for Current Measurement in Motor Control Applications

Digital Baseband Modulation

BJT Amplifier Circuits

INSURANCE RISK THEORY (Problems)

Chapter 20 Quasi-Resonant Converters

Supporting Information

The Effect of Network Cabling on Bit Error Rate Performance. By Paul Kish NORDX/CDT

Chapter 4 - Lecture 1 Probability Density Functions and Cumul. Distribution Functions

Chapter 8 - Power Density Spectrum

Spectrum Level and Band Level

Beta Distribution. Paul Johnson and Matt Beverlin June 10, 2013

Agilent Creating Multi-tone Signals With the N7509A Waveform Generation Toolbox. Application Note

Lecture 18: The Time-Bandwidth Product

SIGNAL PROCESSING & SIMULATION NEWSLETTER

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok

Lecture 8: Signal Detection and Noise Assumption

Estimating the Degree of Activity of jumps in High Frequency Financial Data. joint with Yacine Aït-Sahalia

Dithering in Analog-to-digital Conversion

SR2000 FREQUENCY MONITOR

(Refer Slide Time: 01:11-01:27)

Sophomore Physics Laboratory (PH005/105)

Jitter Measurements in Serial Data Signals

Understand the effects of clock jitter and phase noise on sampled systems A s higher resolution data converters that can

3 Signals and Systems: Part II

The Bivariate Normal Distribution

BER Performance Analysis of SSB-QPSK over AWGN and Rayleigh Channel

Biostatistics: DESCRIPTIVE STATISTICS: 2, VARIABILITY

The Algorithms of Speech Recognition, Programming and Simulating in MATLAB

Statistics 100A Homework 8 Solutions

Department of Electrical and Computer Engineering Ben-Gurion University of the Negev. LAB 1 - Introduction to USRP

SECTION 6 DIGITAL FILTERS

Portfolio Distribution Modelling and Computation. Harry Zheng Department of Mathematics Imperial College

AN-756 APPLICATION NOTE One Technology Way P.O. Box 9106 Norwood, MA Tel: 781/ Fax: 781/

Representation of functions as power series

The Z transform (3) 1

Lecture 8. Confidence intervals and the central limit theorem

Clutter Filter Design for Ultrasound Color Flow Imaging

4F7 Adaptive Filters (and Spectrum Estimation) Least Mean Square (LMS) Algorithm Sumeetpal Singh Engineering Department sss40@eng.cam.ac.

Introduction to the Z-transform

Chapter 6 Bandwidth Utilization: Multiplexing and Spreading 6.1

Analysis of Immunity by RF Wireless Communication Signals

Transcription:

Norwegian University of Science and Technology Department of Electronics and Telecommunications TTT4 Information and Signal Theory Solution to exam Problem I (a The frequency response is found by taking the Fourier-transform: [ ] H(jΩ = e αt e jωt dt = α jω e(α jωt = jω α (b The digital filter is obtained by sampling the analog filter: h d (n = h(nt = e αnt u(nt The frequency response of the digital filter is given by: H d (e ω = e αnt e jωn = n= e (αt jω n = n= eαt jω We have used the formula for a geometric series, and we have also assumed that Re(α <. (c We sketch the magnitude of the frequency response when α = and T = /. The magnitude squared is found by: H d (e ω = The magnitude is therefore: H d (e ω = e / jω e / jω e /+jω = + e e / cos(ω H d (e jω = + e e / cos(ω The magnitude of the analog filter is given by: H(jΩ = By inserting α = we obtain: (jω α ( jω α = H(jΩ = Ω + Ω + α

The graphs of the frequency responses of the digital and analog filters are given below..6.4..8 H d (e jω.6.4..8.5.5.5 3 3.5 ω.9.8.7.6 H(jΩ.5.4.3.. 3 4 5 6 7 8 9 Ω (d We now truncate the impulse response to make it into a FIR filter. We choose the length of the filter to be N=4. The frequency response of the truncated filter is given by: H F IR (e jω = 4 n= The magnitude response squared is given by: e /n e jωn = e( / jω 5 e / jω H F IR (e jω = e( / jω 5 e / jω e( /+jω 5 e /+jω = e 5/ cos(5ω + e 5 e / cos(ω + e

The magnitude response is given by: H F IR (e jω = e 5/ cos(5ω + e 5 e / cos(ω + e.5 H FIR (e jω.5.5.5.5.5 3 3.5 ω By comparing the sketches of the frequency response of the IIR filter and the truncated FIR filter we see that they are somewhat similar, but not quite the same. The truncated filter has some ripples which is not present for the IIR filter. Note that truncating the filter can be obtained by multiplying the IIR filter by a rectangular pulse, with the duration of the rectangular pulse being equal to the length of the truncated filter. In the frequency domain this operation is equivalent to folding the frequency response of the IIR filter with a sinc function. This will result in a different frequency response of the truncated filter compared to the IIR filter. By increasing the length of the FIR filter, the frequency response gets more similar to the frequency response of the IIR-filter. Problem II (a The unit sample response is found by applying a unit sample δ(n on the input: h(n = αh(n + βδ(n We see that the filter is causal since it is only dependent on previous input values. We try to find a couple of values of the unit sample response by applying the iterative method: h( = β h( = αβ h( = α β We now see that the unit sample response is given by: h(n = α n βu(n We have used the unit step function u(n to indicate that h(n = for n <. 3

(b We find the frequency response by taking the Fourier transform of h(n. ( n H(e jω = βα n e jωn = β αe jω β = αe jω n= n= (c x(n is an autoregressive process (AR of first order density S XX (ω is found by: S XX (ω = H(e jω S EE (ω = β αe jω ( AR(. The power spectral β αe jω σ E = σ E β α cos(ω + α (d The variance σx can be found directly from the difference equation: {( ( } σx = E{x(nx (n} = E αx(n + βe(n α x (n + β e (n = α σx + β σe Since x(n cannot depend on e(n. Solving for σ X we get: σ X = σ E β α We have assumed the general case here that α and β might be complex. (e There are several ways to prove that the filter given by y(n = ax(n + bx(n is a whitening filter. One procedure is to solve directly from the difference equations. We insert the difference equation for x(n into the difference equation for y(n: ( y(n = ax(n + bx(n = a αx(n + βe(n + bx(n We see that in order for the output y(n to be equal to e(n these two equations need to be solved for the filter parameters: aβ = aα = b Which gives the solution a = β and b = α β. We have proved that for these filter parameters the output y(n is equal to e(n, which is Gaussian, white noise. (f If we assume that y(n is quantized and then de-quantized, then we can write the de-quantized signal as: y q (n = β x(n α x(n + q(n β Where q(n is the quantization noise modeled as white noise. We have used the parameters a = β and b = α β which was found in (e. x(n can be solved for: x(n = βy q (n + αx(n q(n From this equation we see a reasonable reconstruction scheme: ˆx(n is the estimated value of x(n. ˆx(n = βy q (n + αˆx(n 4

(g We are going to choose the filter parameters such that the inputs to the quantizer have equal variances. The output of the whitening filter is written as before: y(n = ax(n + bx(n We insert x(n = αx(n + βe(n into the above equation to obtain: y(n = aαx(n + aβe(n + bx(n ( y(n = aα + b x(n + aβe(n Next we calculate the variance σy. Note that e(n is zero mean, and because of this both x(n and y(n are also zero mean. This means that σy = E{y(ny (n}. We further assume that all the signals are real signals, and therefore the variance is given by σy = E{y(ny(n} : {( ( } σy = E (aα + bx(n + aβe(n (aα + bx(n + aβe(n = ( aα + b σx + α β σe In order for the filter to be a whitening filter, y(n ( should only consist of a scaled version of the white noise term e(n. From y(n = aα + b x(n + aβe(n we get the equation: aα + b = Which means that b = aα. We have the additional condition that y(n should have the same variance as x(n, σ Y = σ X. From (d we have that σ X = σ E β /( α. This gives us the equation: σ E β α = a β σ E Solving for the filter parameters we get a = α b = α α and by using b = aα we also get We now want to compare the quantization noise when quantizing x(n directly to the case when we quantize y(n. The variance of the signals on the input to the quantizers are the same, and the signals have the same pdf. The only difference is that x(n is a correlated signal, while y(n is uncorrelated/white. The quantization noise variance on the output of the de-quantizer can be denoted by σ q and it is same for both cases. But when we are using a whitening filter we have to use a reconstruction filter at the receiver. Which means that the quantization noise passes through this filter. We have to find this reconstruction filter first. Using the filter parameters we just found we express y(n as: y(n = x(n α x(n α α 5

Which suggests that we reconstruct the signal by: ˆx(n = α y q (n + αˆx(n To find the quantization noise on the output of this filter which we denote by z(n we assume that only the quantization noise is applied at the input of the filter. We then get this difference equation for the noise: z(n = α q(n + αẑ(n We now find the variance of this noise: σz = E{z(nz(n} = E{( α q(n + αẑ(n = ( α σq + α σz ( } α q(n + αẑ(n With the result that σ Z = σ q. This means that the noise variance when quantizing x(n directly gives the same same quantization noise variance as when quantizing the white signal y(n. (h Even though the quantization noise variance is the same for both cases, this does not mean that the noise spectra are the same. When quantizing x(n directly the quantization noise is white and the spectrum is given by: S qq (ω = σ q To find the noise spectrum for the other case we first take the Fourier transform of z(n: { } F {z(n} = F α q(n + αẑ(n = α Q(e jω + αz(e jω e jω α Z(e jω = αe jω Q(ejω We have used the difference equation for z(n which we found in (g. From this we find the spectral density: { } S ZZ (ω = E Z(e jω Z (e jω ( α σq ( α σq = = ( αe ( jω αe jω α cos(ω + α We see that S ZZ (ω has the exact same spectral shape as S XX (ω. While the quantization noise when quantizing x(n directly is white. Problem III (a A probability density function (pdf f X (x has to satisfy f X(xdx =. If the pdf is symmetric around x = then we need only to integrate half of the interval and multiply by, i.e f X (xdx =. This is the case for our pdf : [ f X (xdx = Ae αx dx = A ] α e αx = A/α 6

Since the integral of the pdf from x = to should be equal to, we get the equation: A/α = Which leads to A = α/. We also know that the variance of x should be equal to. Since the pdf is symmetric around x = we know that the mean is zero, i.e µ X =. This simplifies the calculation of the variance: σ X = (x µ X f X (xdx = x f X (xdx = α/ Because of the condition σ X =, we get α =. x e αx dx = α! α 3 = α (b The quantization noise for an uniform quantizer with stepsize << is given by: σ q = / This formula applies for uniform quantization independent of which pdf the signal follows. (c The probability of the signal lying inside the interval [(k, k ] is given by: P k = k (k f X (xdx = = ( e k e k (k e x dx = [ ] k e x (k Note that we have found the probability for signals lying in positive intervals, but P k = P k. This is because the pdf is symmetric around x =. Now we are going to use these probabilities to find the smallest rate R for the quantized source. The smallest rate is given by the entropy. The entropy is found according to this formula: H = = = k= P k log (P k = P k log (P k k= ( /e k (e log /e k (e k= k= ( /e k (e log (/ + log (e + log (e k Now we realize that k= P k C = C, where C is assumed to be a constant. And therefore: ( /e k (e log (/ + log (e = log (/ log (e k= 7

This is used to simplify some of the terms of the entropy expression: H = log (/ log (e = log (e /e k (e log (e k k= e k (e k log (e k= e = log (e + log (e(e ( e e = log (e + log (ee ( e ( e = log log (e (e + e (d Now we consider that we represent the source samples by a rate R = H. The source has a bandwidth W which means that we sample the source W times per second. The source therefore produces W R bits per second. The channel capacity when we occupy a frequency bandwidth of B Hz is given by C = B log ( + SNR. By setting the expression for the number of bits the source produces, equal to the channel capacity, we are able to find the minimum SNR to achieve error free transmission: W R = B log ( + SNR W R B = log ( + SNR SNR = W R/B SNR = 4R In the last step we have inserted W = 4 khz and B = khz. 8