How To Exam?

a knowledge trading engine...


Manipal University 2008 B.E Biomedical Engineering SIXTH SEMESTER END-SEMESTER S SUBJECT: BIOMEDICAL DIGITAL SIGNAL PROCESSSING - Question Paper

Saturday, 26 January 2013 04:55Web


SIXTH SEMESTER B.E. DEGREE END-SEMESTER exams MAY 2008
SUBJECT: BIOMEDICAL DIGITAL SIGNAL PROCESSING (BME 308)
(REVISED CREDIT SYSTEM)

M$llol 9 &J

Reg. No.

MANIPAL INSTITUTE OF TECHNOLOGY


B

INSPIRED BY LIFE


(Manipal University)

Manipal - 576 104

SIXTH SEMESTER B.E. DEGREE END-SEMESTER EXAMINATIONS MAY 2008

SUBJECT: BIOMEDICAL DIGITAL SIGNAL PROCESSING (BME 308)

(REVISED CREDIT SYSTEM)

Friday, May 23, 2008 : 9.00 a.m..- 12.00 noon TIME: 3 HOURS    MAX. MARKS: 100

Instructions to Candidates:

1.    Answer any FIVE full questions.

2.    Draw labeled diagram wherever necessary

(A)    If the Nyquist rate for xa(t) is Qs, what is the Nyquist rate for each of the following signals that are derived from xa(t)?

06

06

08

06

06


i)    dxa(t)/dt ii) xa(2t) iii) xa2(t) iv) xa(t) Cos(Qot)

(B)    Find the inverse of each of the following Z-transforms:

i) X(z) = log (1- 2z-1) ; |Z|2

ii)    X(z) = e 1/z , with x(n) a right sided sequence.

(C)    With an example explain the use of variable length coding in reducing the amount of ECG data.

(A)    A linear shift invariant system has a unit sample response h(n) = u(-n-1). Find the output if the input is x(n) = -n 3n u(-n).

2


(B)    A digital filter that is implemented on a DSP chip is described by the linear

3    1

constant coefficient y(n) = y(n-1)y(n-2)+x(n). In evaluating the

4    8

performance of the filter, the unit sample response is measured. The internal storage registers on the chip, however, are not set to zero prior to applying the input. Therefore, the output of the filter contains the effect of the initial conditions, which are y(-1) = -1 and y(-2) = 1. Determine the response of the filter for all n > 0 and compare it with the zero state response.

(C)    With block diagram and waveforms explain the Pan-Tompkins algorithm for detecting the QRS complex and to estimate the RR interval series.

08


(A) Suppose that we would like to design an analog Chebyshev low-pass filter so that ( 1-Sp) < |Ha(jQ)| < 1 for | Q| < Qp and |Ha(jQ)| < Ss for Qs < | Q | Find an expression for the required filter order, N, as function of Qp, Qs, Sp and Ss.

Let x(n) be a finite length sequence with X(k) = (0, 1+j, 1, 1-j). Using the properties of DFT, find DFTs of the following sequences:

i)    p(n) = e j(n/2)n x(n)

ii)    q(n) = Cos[(n/2)n] x(n)

i)    Show that the bilinear transformation maps the jQ-axis in the s-plane onto the unit circle, |Z| = 1, and maps the left-half s-plane , Re(s) < 0 inside the unit circle, |Z| < 1.

(C)


08


ii)    Use the bilinear transformation to design a first order low-pass Butterworth filter that has a 3-dB cutoff frequency wc = 0.2n.

(A)


4


2m


2m


06


For the sequences x1(n) = Cos(-- ) , x2(n) = Sin(-- ), 0< n < N-1 find the N-point circular convolution.

Explain with a block schematic the steps involved in ECG interpretation.

An analog signal contains frequencies up to 10KHz. This signal is sampled at 50KHz. Design an FIR filter having a linear phase characteristic and a transition band of 5KHz. The filter should provide minimum 50dB attenuation at the end of transition band.


(B)

(C)


06

08


(A)

(B)

(C)

(A)

(B)

(C)


5


06

06

08

06

06


4 + 2.25Z-1 - .25Z-


2


Implement the system H(z) =


as a parallel network of


1 + .25Z-1 - .122Z - 2 first order direct form structures.

Describe the following Template matching techniques to classify the patterns in the ECG Signal: i) Template cross-correlation ii) Template subtraction.

Given the sequences x1(n) = {2, 1, 1, 2} and x2(n) = { 0, -1, -1, 1} compute circular convolution using DIT-FFT algorithm.

Explain the following: i) FIR filter properties ii) Portable Arrhythmia Monitor

Given the list of raw ECG data : [ 0, 1, 1, 0, -1, 10, 20, 40, 50, 20, -1, -30, -20, -10, 0, 1, 0, 0, 1, -1 ] produce the data points that are stored using the turning point algorithm.

Find the convolution of x(n) and h(n) using the 8-point DIF-FFT. x(n) = { 1, 2, 1} & h(n) = { 1, 2, 3 }


08







Attachment:

( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Manipal University 2008 B.E Biomedical Engineering SIXTH SEMESTER END-SEMESTER S SUBJECT: BIOMEDICAL DIGITAL SIGNAL PROCESSSING - Question Paper