The objective of this LabVIEW Mini Project was to understand the following concepts:

Similar documents
Ch 2: Linear Time-Invariant System

Discussion Section #2, 31 Jan 2014

Chapter 3 Convolution Representation

Analog vs. discrete signals

信號與系統 Signals and Systems

The Convolution Sum for Discrete-Time LTI Systems

Lecture 11 FIR Filters

2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal

信號與系統 Signals and Systems

Solution 10 July 2015 ECE301 Signals and Systems: Midterm. Cover Sheet

EEL3135: Homework #4

Problem Value Score No/Wrong Rec 3

Using MATLAB with the Convolution Method

NAME: 13 February 2013 EE301 Signals and Systems Exam 1 Cover Sheet

Frequency Response (III) Lecture 26:

Chap 2. Discrete-Time Signals and Systems

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

Module 3. Convolution. Aim

Digital Signal Processing Lecture 4

New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam

Module 1: Signals & System

Question Paper Code : AEC11T02

Shift Property of z-transform. Lecture 16. More z-transform (Lathi 5.2, ) More Properties of z-transform. Convolution property of z-transform

Discrete-Time Systems

(t ) a 1. (t ).x 1..y 1

Review of Analog Signal Analysis

Review of Fundamentals of Digital Signal Processing

Figure 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

VU Signal and Image Processing

Final Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet

Rui Wang, Assistant professor Dept. of Information and Communication Tongji University.

Two-Dimensional Signal Processing and Image De-noising

Module 4 : Laplace and Z Transform Problem Set 4

GATE EE Topic wise Questions SIGNALS & SYSTEMS

3.2 Complex Sinusoids and Frequency Response of LTI Systems

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

Solution 7 August 2015 ECE301 Signals and Systems: Final Exam. Cover Sheet

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1

x(t) = t[u(t 1) u(t 2)] + 1[u(t 2) u(t 3)]

NAME: 20 February 2014 EE301 Signals and Systems Exam 1 Cover Sheet

LTI Systems (Continuous & Discrete) - Basics

EE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet

ESE 531: Digital Signal Processing

University Question Paper Solution

DIGITAL SIGNAL PROCESSING LECTURE 1

Therefore the new Fourier coefficients are. Module 2 : Signals in Frequency Domain Problem Set 2. Problem 1

Review of Frequency Domain Fourier Series: Continuous periodic frequency components

This homework will not be collected or graded. It is intended to help you practice for the final exam. Solutions will be posted.

6.003 (Fall 2011) Quiz #3 November 16, 2011

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Lecture 2 Discrete-Time LTI Systems: Introduction

One Dimensional Convolution

hapter 8 Simulation/Realization 8 Introduction Given an nth-order state-space description of the form x_ (t) = f (x(t) u(t) t) (state evolution equati

Introduction to DSP Time Domain Representation of Signals and Systems

Cosc 3451 Signals and Systems. What is a system? Systems Terminology and Properties of Systems

Discrete-time signals and systems


DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010

UNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).

EE 224 Signals and Systems I Review 1/10

NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS

z-transforms Definition of the z-transform Chapter

2.161 Signal Processing: Continuous and Discrete Fall 2008

LTI H. the system H when xn [ ] is the input.

Frequency-Domain C/S of LTI Systems

Frequency Response and Continuous-time Fourier Series

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Introduction to DFT. Deployment of Telecommunication Infrastructures. Azadeh Faridi DTIC UPF, Spring 2009

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

Representing a Signal

ECE 308 Discrete-Time Signals and Systems

ELEG 305: Digital Signal Processing

New Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Spring 2018 Exam #1

Two-Dimensional Signal Processing and Image De-noising

Lecture 19 IIR Filters

As f and g are differentiable functions such that. f (x) = 20e 2x, g (x) = 4e 2x + 4xe 2x,

Digital Signal Processing. Midterm 2 Solutions

University of California Department of Mechanical Engineering ECE230A/ME243A Linear Systems Fall 1999 (B. Bamieh ) Lecture 3: Simulation/Realization 1

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Differential and Difference LTI systems

Convolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2,

Review of Fundamentals of Digital Signal Processing

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

Laplace Transforms Chapter 3

NAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet

LECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)

Digital Signal Processing Lecture 5

Definition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying

Lecture 1 From Continuous-Time to Discrete-Time

EE 3054: Signals, Systems, and Transforms Spring A causal discrete-time LTI system is described by the equation. y(n) = 1 4.

1. Linearity of a Function A function f(x) is defined linear if. f(αx 1 + βx 2 ) = αf(x 1 ) + βf(x 2 )

8 The Discrete Fourier Transform (DFT)

Interconnection of LTI Systems

ESE 531: Digital Signal Processing

Linear Convolution Using FFT

Properties of LTI Systems

EE361: Signals and System II

Chapter 2 Time-Domain Representations of LTI Systems

Signals & Systems interaction in the Time Domain. (Systems will be LTI from now on unless otherwise stated)

Transcription:

1. Objective The objective of this LabVIEW Mini Project was to understand the following concepts: The convolution of two functions Creating LABVIEW Virtual Instruments see the visual representation of convolution sum Resulting function of multiple convolution would yield a Gaussian function 2. Brief Description on Convolution Any Discrete Time (DT) function can be expressed as a sum of scaled and time shifted delta functions. Mathematically, signal x[n] can be expressed as k x[n] = k x[k] [n-k] (1) whereas [n-k] = time shifted impulse response x[k] = the amplitude scaling factor that represents the specific amplitude of the signal x[n] at time k, when actually the impulse occurs If a signal x[n], already expressed as sum of scaled and time shifted impulses, is the input of a Linear Time Invariant (LTI) system, the output y [n] will be k y[n] = k x[k] h[n-k] (2) whereas h[n-k] = the impulse response of the shifted delta function. The impulse response of an LTI system is the output of the system when the system is excited by delta function. [n] LTI System h[n] Figure 1. Impulse Response of a DT LTI system For a LTI system, the impulse h[n], as Equation (2) shows, can be used to compute the response to any arbitrary input signal, given that the signal is expressed as a sum of scaled and time shifted impulses. This sum in Equation (2) is defined as the convolution sum and is denoted by the symbol *.

k y[n] = x[n]*h[n] = k x[k] h[n-k] (3) For a Continuous Time (CT) time signal, the convolution integral is defined by the following equation: y(t) = x(t)*h(t) = x( ) h( -t) (4) 3.1. Task A: Creating a LABVIEW Virtual Instrument (VI) to Convolve two Rectangle Functions The VI was built form Pulse Patterns, Convolution functions, some numerical elements, and graph indicators, all put inside of a while loop. Figure (2) below shows the block diagram of the IV. Figure 2. The Block Diagram of the VI to convolve two rectangle functions. The sampling rate was 1000 Hz. The width and delay of each of the Pulse Patterns were defined according to the following formulae: Width = Samples / 10 (5) Delay = (Samples / 2) (Width/2) (6) The output of each Pulse Pattern was connected to a graph indicator through a Bundle in between. Aside from the output from Pulse Pattern, two other inputs to a Bundle were a constant 1 and halved sampling rate.

The outputs of the Pulse Patterns were also fed to the Convolution function. The output of the Convolution function was divided by the width before being connected to the graph indicator through another Bundle. The remaining two input elements of this Bundle were a constant 1 and the sampling rate. When the VI was run, it displayed following results in the front panel graph indicators: Figure 3. Input Signal Figure 4. Impulse Response Figure 5. The Convolved Sum

3.2. Task B (a): Convolving a Rectangle Function with a Triangle Function Using the given VI named DT Convolution.vi, a rectangle function was convolved with a triangle function. The output is shown in the following screenshot. Figure 6. Convolution between a rectangle and a triangle functions 3.2. Task B (b)-(c): Convolving a Rectangle Function with another rectangle Function Using the DT Convolution.vi, a rectangle function was convolved with another rectangle function. The convolution sum some for different values of n were recorded in the Table 1. Table 1: Task #2 n x[n-k]h[k] -2 0 0-1 0 0 0 1 1

1 1+1 2 2 1+1+1 3 3 1+1+1+1 4 4 1+1+1 3 5 1+1 2 Below is a screenshot of the convolution functions between two rectangle functions for n =10. Figure 7. Convolution between two rectangle functions 3.3. Task C (a)

In this task, some modifications to the VI made in Task A were made to check whether the results obtained (manually) before. In the block diagram, the convolution function along with the divider was put inside a for loop. Right clicking on the box that was connected to the first Pulse Pattern, indexing was disabled. Right clicking on the box that was connected to the second Pulse Pattern, Replace with shift register was selected, and then the changed cursor was moved to the box connected to the divide output. A control was created to determine the number of loops. The function connected to the first node of the Bundle connector was modified accordingly: First Node of Bundle = (No. of Convolutions) * (-Samples / 2) + (-Samples / 2) (7) Figure 8 shows the modified block diagram. Figure 8. Modified Block Diagram Figure 9, 10, and 11 shows the convolution of two rectangle functions for convolution number 1, 2 and 3 respectively.

Figure 9. Convolution between two rectangle functions; number of convolution 1 Figure 10. Convolution between two rectangle functions; number of convolution 2 Figure 11. Convolution between two rectangle functions; number of convolution 3 3.3. Task C (b)

In this part of the task it has to be proved that the function obtained after performing 20 successive convolutions is of the following form f ( x) 2 Bx Ae (8) Taking natural logarithm on both sides, the equation could be expressed as 2 ln( f ( x)) ln A Bx (9) The block diagram used in Task B had to be modified slightly for this purpose. The output of the for loop was connected to a Natural Logarithm function, which was then connected to a graph indicator through a Bundle. The modified block diagram is shown in Figure 13. Figure 13. Modified Block Diagram for Task 3 The modified VI was run for the number of convolution set to 20, and a screenshot of the resulting graphs were taken, which are shown in Figure 13 and Figure 14.

Figure 13. Graph of x(t)*h(t) for 20 multiple convolutions

Figure 14. The graph of x versus ln [f(x)]; number of convolution 20 From this graph, the values of ln [f(x)] corresponding to x = 9 and x = -9.5 was chosen. Then using the chosen value and Equation 9, the value of constants were found to be -0.83 and e -76.13. Having found the values of constants, the following graph was plotted in MATLAB. It has x 2 in X axis and ln [f(x)] in Y axis. The resulting graph was linear one.

700 600 500 ln[f(x)] 400 300 200 100 0-100 0 100 200 300 400 500 600 700 800 900 1000 x 2 Figure 15. The graph x 2 vs ln [f(x)] Since the graph is linear, it proves that f(x), the resulting function of multiple convolutions, is of Gaussian type.