Documente Academic
Documente Profesional
Documente Cultură
Course Outline
Outline
Course Outline Books Course Objectives Course Outcomes Prerequisites Course Assessment
Examination
Course Outline
course outline
Course Code : ET317 Course Name : Digital Signal processing Course Teacher : V. R. Gupta Class Room : ET-216 Oce : Faculty Room (ET-311 Oce Hours : 9.00 am to 4.00 pm. Phone : 09665381684 Email : guptavikas.1051@redimail.com Number of Lectures per Week : 03 Number of Tutorials per Week : 01 Lab. hours per week : 02
Vikas R. Gupta Assistant Professor ET317 : Digital Signal Processing
Books
Text Books Digital signal processing- A computer based approach By S. K. Mitra,2nd Edition,Tata McGraw Hill, 2002 Discrete time signal processing By V. Oppenheim, R. W. Schafer,2nd Edition,PHI, 2008 Reference Books Digital signal processing Principles, algorithms and applications By J. G. Proakis, D. G. Manolakis,2nd Edition,PHI, 2002. Digital Signal Processors, Architecture, Programming and Applications By Venkataramani, Bhaskar,2nd Edition,Tata McGraw Hill, 2008. Introduction to DSP by Johny R Johnson, PHI, 2nd edition 2003. Vikas R. Gupta Assistant Professor ET317 : Digital Signal Processing
Course Objectives
Evaluate the performance of a digital lter, in terms of its frequency response;
Course Objectives
Evaluate the performance of a digital lter, in terms of its frequency response; Use Fast Fourier Transform techniques for the analysis of arbitrary signals;
Course Objectives
Evaluate the performance of a digital lter, in terms of its frequency response; Use Fast Fourier Transform techniques for the analysis of arbitrary signals; Demonstrate coecient quantization eects in digital lters;
Course Objectives
Evaluate the performance of a digital lter, in terms of its frequency response; Use Fast Fourier Transform techniques for the analysis of arbitrary signals; Demonstrate coecient quantization eects in digital lters; Design digital lters using transformation techniques from analog designs;
Course Objectives
Evaluate the performance of a digital lter, in terms of its frequency response; Use Fast Fourier Transform techniques for the analysis of arbitrary signals; Demonstrate coecient quantization eects in digital lters; Design digital lters using transformation techniques from analog designs; Design digital lters using windowing techniques;
Course Objectives
Evaluate the performance of a digital lter, in terms of its frequency response; Use Fast Fourier Transform techniques for the analysis of arbitrary signals; Demonstrate coecient quantization eects in digital lters; Design digital lters using transformation techniques from analog designs; Design digital lters using windowing techniques; Design digital lters meeting given specications;
Course Objectives
Evaluate the performance of a digital lter, in terms of its frequency response; Use Fast Fourier Transform techniques for the analysis of arbitrary signals; Demonstrate coecient quantization eects in digital lters; Design digital lters using transformation techniques from analog designs; Design digital lters using windowing techniques; Design digital lters meeting given specications; Organize and write technical reports;
Course Objectives
Evaluate the performance of a digital lter, in terms of its frequency response; Use Fast Fourier Transform techniques for the analysis of arbitrary signals; Demonstrate coecient quantization eects in digital lters; Design digital lters using transformation techniques from analog designs; Design digital lters using windowing techniques; Design digital lters meeting given specications; Organize and write technical reports; Organize and make technical presentations.
Vikas R. Gupta Assistant Professor ET317 : Digital Signal Processing
Course Outcomes
Prerequisites
To take this course, you should have knowledge and understanding of 1 ET305-Signals and systems;
Prerequisites
To take this course, you should have knowledge and understanding of 1 ET305-Signals and systems; 2 C and data structure
Prerequisites
To take this course, you should have knowledge and understanding of 1 ET305-Signals and systems; 2 C and data structure 3 Assembly language programming.
Course Assessment
1 Home Assignments:= 4%
Course Assessment
Course Assessment
Course Assessment
Course Assessment
1 Home Assignments:= 4% 2 Surprise Test:= 2% 3 Quiz:= 2% 4 Attendance:= 2% 5 Mid Sem. Exam-1:= 15%
Course Assessment
1 Home Assignments:= 4% 2 Surprise Test:= 2% 3 Quiz:= 2% 4 Attendance:= 2% 5 Mid Sem. Exam-1:= 15% 6 Mid Sem. Exam-2:= 15%
Course Assessment
1 Home Assignments:= 4% 2 Surprise Test:= 2% 3 Quiz:= 2% 4 Attendance:= 2% 5 Mid Sem. Exam-1:= 15% 6 Mid Sem. Exam-2:= 15% 7 End Sem. Exam:= 60%
Examination
Examination There will be 2 scheduled exams and at least one Surprise Test as detailed below. The schedule of these examinations is given in the Academic Calendar for the session published by the Dean (Academic Matters) 1) Mid Sem. Exam-1: On the basis of Unit 1 & 2.
Examination
Examination There will be 2 scheduled exams and at least one Surprise Test as detailed below. The schedule of these examinations is given in the Academic Calendar for the session published by the Dean (Academic Matters) 1) Mid Sem. Exam-1: On the basis of Unit 1 & 2. 2) Mid Sem. Exam-1: On the basis of Unit 3 & 4.
Examination
Examination There will be 2 scheduled exams and at least one Surprise Test as detailed below. The schedule of these examinations is given in the Academic Calendar for the session published by the Dean (Academic Matters) 1) Mid Sem. Exam-1: On the basis of Unit 1 & 2. 2) Mid Sem. Exam-1: On the basis of Unit 3 & 4. 3) End Sem. Exam : On the basis of Unit 1 to 6
Examination
Examination There will be 2 scheduled exams and at least one Surprise Test as detailed below. The schedule of these examinations is given in the Academic Calendar for the session published by the Dean (Academic Matters) 1) Mid Sem. Exam-1: On the basis of Unit 1 & 2. 2) Mid Sem. Exam-1: On the basis of Unit 3 & 4. 3) End Sem. Exam : On the basis of Unit 1 to 6 4) Surprise Test : On the topics taught till the day of examinations.
Step1: Compute the maximal sux of w with respect to l (say v) and the maximal sux of w with respect to r (say v?).
Step1: Compute the maximal sux of w with respect to l (say v) and the maximal sux of w with respect to r (say v?). Step 2: Find words u, u? such that w = uv = u?v?.
Step1: Compute the maximal sux of w with respect to l (say v) and the maximal sux of w with respect to r (say v?). Step 2: Find words u, u? such that w = uv = u?v?. Step 3: If |v| |v?|, then output (u, v). Otherwise, output(u?, v?).