+ All Categories
Home > Documents > V Semester - Basaveshwar Engineering College, Bagalkot Sem Fin… ·  · 2014-07-183 UEC520E Data...

V Semester - Basaveshwar Engineering College, Bagalkot Sem Fin… ·  · 2014-07-183 UEC520E Data...

Date post: 25-May-2018
Category:
Upload: vannhi
View: 219 times
Download: 0 times
Share this document with a friend
24
V Semester Sl. No. Subject Code Subject Credits 1 UEC511C Digital Signal Processing 4.0 2 UEC512C Digital Communication 4.0 3 UEC513C Circuit Design with VHDL 4.0 4 UEC514C Control Systems 4.0 5 UECXXXE Elective-I 3.0 6 UECXXXE Elective-II 3.0 7 UEC521L DSP and VHDL Lab 1.5 8 UEC522L Communication Lab 1.5 Total 25 Elective-I Sl. No Subject Code Subject Credits 1 UEC515E Computer Organization 3.0 2 UEC516E Soft Computing 3.0 3 UEC517E Pulse and Switching Circuits 3.0 Elective-II Sl. No Subject Code Subject Credits 1 UEC518E Random Process 3.0 2 UEC519E Automotive Electronics 3.0 3 UEC520E Data Structures using “C” 3.0
Transcript

V Semester

Sl. No. Subject Code Subject Credits

1 UEC511C Digital Signal Processing 4.0

2 UEC512C Digital Communication 4.0

3 UEC513C Circuit Design with VHDL 4.0

4 UEC514C Control Systems 4.0

5 UECXXXE Elective-I 3.0

6 UECXXXE Elective-II 3.0

7 UEC521L DSP and VHDL Lab 1.5

8 UEC522L Communication Lab 1.5

Total 25

Elective-I

Sl. No Subject Code Subject Credits

1 UEC515E Computer Organization 3.0

2 UEC516E Soft Computing 3.0

3 UEC517E Pulse and Switching Circuits 3.0

Elective-II

Sl. No Subject Code Subject Credits

1 UEC518E Random Process 3.0

2 UEC519E Automotive Electronics 3.0

3 UEC520E Data Structures using “C” 3.0

Course Title: Digital Signal Processing Course Code: UEC511C

Credits: 4 Teaching Hours: 52 Hrs (13 Hrs/Unit)

Contact Hours: 4 Hrs/Week

CIE Marks: 50 SEE Marks: 50 Total Marks: 100

Unit I

Discrete Fourier Transforms (DFT): Frequency domain sampling and reconstruction of discrete time

signals. DFT as a linear transformation, its relationship with other transforms, properties,

multiplication of two DFTs, the circular convolution, additional DFT properties, use of DFT in linear

filtering, overlap-save and overlap-add method.

Unit II

Fast-Fourier-Transform (FFT) algorithms: Direct computation of DFT, need for efficient computation

of the DFT (i.e. FFT algorithms). Radix-2 FFT algorithm for the computation of DFT and IDFT,

decimation-in-time and decimation-in-frequency algorithms. Goertzel algorithm, and chirp-z

transform algorithm.

Unit III

IIR filter design: Characteristics of commonly used analog filters – Butterworth and Chebyshev

filters. Design of IIR filters from analog filters (i.e. Butterworth and Chebyshev) impulse invariance

method, and approximation of derivative (backward difference, forward difference and bilinear

transformation) method.

Unit IV

FIR filter design: Introduction to FIR filters, spectrum of various windows used in FIR filter design,

design of FIR filters using windowing (Rectangular, Hamming, Hanning and Bartlet) method. FIR

filter design using frequency-sampling method. Implementation of discrete-time systems: Structures

for IIR and FIR systems-direct form I and direct form II systems, cascade and parallel realization.

Text Books:

1) Proakis & Monalakis, “Digital signal processing – Principles Algorithms & Applications”, PHI,

3rd

Edition, New Delhi, 1997.

2) Oppenheim & Schaffer, “Discrete Time Signal Processing”, PHI, 2003.

Reference Books:

1) S. K. Mitra, “Digital Signal Processing”, Tata Mc-Graw Hill, 2nd

Edition, 2004.

2) Schaum's, “Outline of Digital Signal Processing”, Schaum's Series.

Course Title: Digital Communication Course Code: UEC512C

Credits: 4 Teaching Hours: 52 Hrs (13 Hrs/Unit)

Contact Hours: 4 Hrs/Week

CIE Marks: 50 SEE Marks: 50 Total Marks: 100

Unit I

Sampling process: Sampling Theorem, quadrature sampling of Band pass signal, reconstruction of a

message from its samples, signal distortion in sampling. Practical aspects of sampling and signal

recovery, PAM, TDM.

Unit II

Waveform Coding Techniques: PCM, Channel noise and error probability, quantization noise and

SNR, robust quantization. DPCM, DM, ADM, Applications: Digital multiplexers, T1 carrier system.

Base-band shaping for Data Transmission: Discrete PAM signals, power spectra of discrete PAM

signals, ISI, Ideal solution and Raised Cosine solution.

Unit III

Digital Modulation Techniques: Digital Modulation formats, Coherent binary modulation techniques

(ASK, PSK, FSK), Coherent quadrature modulation techniques (minimum shift keying with brief

treatment). Non-coherent binary modulation techniques (FSK, DPSK, FSK).

Unit IV

Detection and Estimation: Gram-Schmidt Orthogonalization procedure, geometric interpretation of

signals, response of bank of correlators to noisy input, detection of known signals in noise, probability

of error.

Spread Spectrum Modulation: Pseudo noise sequences, notion of spread spectrum, direct sequence

spread coherent binary PSK, signal space dimensionality & processing gain, frequency hop spread

spectrum.

Text Book:

1) Simon Haykin “ Digital communications” John Wiley, 2003 Edition.

Reference Books:

1) B. P. Lathi and Zhi Ding, “Modern Digital & Analog Communication Systems”, 4th

Edition.

2) Bernard Sklar and Prabitra kumary Ray, “Digital Communication Fundamentals and

Applications” 2nd

Edition, Pearson Publications.

3) Herbert Taub, Goutam Saha, Donald L. Schilling, “Principles of Communication Systems”,

4th

Edition.

4) K. Sam Shanmugan, “Digital and Analog Communication Systems”, John Wiley & Sons,

2006.

Course Title: Circuit Design with VHDL Course Code: UEC513C

Credits: 4 Teaching Hours: 52 Hrs (13 Hrs/Unit)

Contact Hours: 4 Hrs/Week

CIE Marks: 50 SEE Marks: 50 Total Marks: 100

Unit I

Introduction: VHDL, design flow, EDA tools, translation of VHDL code into circuits, circuit

simulation, VHDL syntax, number and character representation in VHDL.

Code structure: Fundamental VHDL units, VHDL libraries and packages, library/package

declarations, entity, architecture, generic, coding guidelines, VHDL 2008, examples.

Data types: Introduction, VHDL objects, data-type libraries and packages, Classification of standard

data types, logic data types, unsigned and signed data types, fixed and floating point types, predefined

data type summary, user defined scalar types, user defined array types, integer Vs enumerated

indexing, array slicing, records, subtypes, specifying Port arrays, qualified types and overloading,

type conversion, legal Vs illegal assignments, Access types, File types.

Unit II

Operators & Attributes: Introduction, predefined Operators, overloaded and user-defined operators,

predefined attributes, user-defined attributes, synthesis attributes, Group, Alias.

Concurrent Code: Introduction, using operators, The when statement, The select statement, The

generate statement, Implementing sequential circuits with concurrent code, Implementing arithmetic

circuits with operators, Preventing combinational-Logic simplification, Allowing multiple-signal

assignments.

Sequential Code: Introduction, Latches and flip-flops, Process, The if statement, The wait statement,

The loop statement, The case statement, case Vs select, Implementing combinational circuits with

sequential code.

Unit III

Signals and Variables: Introduction, signal, variable, signal Vs variable, the interference of registers,

dual-edge circuits, making multiple signal assignments.

Package and Component: Introduction, Package, Component, Generic Map, Component instantiation

with Generate, Configuration, Block.

Function and Procedure: Introduction, The Assert statement, Function, Procedure, Function Vs

Procedure summary, Overloading.

Unit IV

Simulation with VHDL Techniques: Introduction, Simulation Types, writing data to files, reading

data from files, Graphical simulation (preparing the design), stimulus generation, general VHDL

template for testbenches, Type I testbench (manual function simulation), Type II testbench (manual

timing simulation), Type III testbench (Automated functional simulation), Type IV testbench

(Automated timing simulation), Testbenches with Record types, Testbenches with Data files.

VHDL Design of state machines: Introduction, VHDL template for FSMs, Poor FSM model, FSM

encoding Styles, The state-bypass problem in FSMs, systematic Design Technique for timed

machines, FSM with repetitive states, Other FSM designs.

Text Book:

1) Volnei A. Pedroni, “Circuit Design and Simulation with VHDL”, 2nd

Edition, PHI publication.

Reference Books:

1) Roth Jr. C.H, Thomson, “Digital Systems Design Using VHDL” 2002.

2) Bhaskar. J, “VHDL Synthesis Primer”, 2001.

3) Douglas. L. Perry, “VHDL Programming by Examples”, TMH, 2008.

4) Navabi Z, “VHDL Analysis and Modeling of Digital Systems”, Mc Graw-Hill, 1993.

5) Perry D L, “VHDL”, Mc Graw-Hill, 1999.

6) Robert K.D, “Digital Design with CPLD Applications VHDL”, Thomson, 2001.

7) Sudhakar Yalamanchi, “Introductory VHDL from Simulation to Synthesis”, Pearson

Education, 2001.

8) Nazeih. M. Botros, “HDL programming VHDL and Verilog”, Dreamtech, 2007.

Course Title: Control Systems Course Code: UEC514C

Credits: 4 Teaching Hours: 52 Hrs (13 Hrs/Unit)

Contact Hours: 4 Hrs/Week

CIE Marks: 50 SEE Marks: 50 Total Marks: 100

Unit I

System modeling: Definition of control system, Concept of feedback and its significance, open loop

and closed loop systems, Modeling of Electrical, Mechanical and Electromechanical systems,

Differential equations of physical system.

Transfer function, Block diagram representation and Reduction technique, Signal flow graph

representation and reduction using Mason’s gain formula.

Unit II

Time domain analysis of control systems: Introduction, standard test signals, Unit step response of a

second order system, Steady state error analysis, time domain specifications.

Stability analysis technique: Concept of stability, Location of Roots in the s-plane for stability,

methods of determining stability, Routh-Hurwitz stability criterion.

Unit III

Root-Locus Technique: Introduction, Procedure for constructing Root-locus. Stability analysis using

root locus.

Frequency Domain Analysis: Introduction, Polar plots, Bode plots, Gain and Phase cross over

frequency, gain margin, phase margin, Frequency domain specifications-resonant peak, resonant

frequency, and bandwidth.

Unit IV

Nyquist stability criterion; Principle of argument, mapping, Nyquist path, Nyquist criterion, Nyquist

Plot and stability analysis.

State Space Analysis;Introduction, concept of state and variables, state model, Non-homogeneous

solution of a state equation.

Text Books:

1) Nagrath and Gopal: Control System Engineering, New Age published.

2) K. Ogeta. Modern control engineering, Person eduction, Asia/PHI 4th

edition 2002.

Reference Books:

1) Benjamin,. C. Kuo,: Automatic control systems, PHI 7th

edition.

2) Richard C. Dorf and Robert. H. Bishop, “Modern Control Systems”, Person Education, 8th

Edition, 2002.

3) M. Gopal, “Control Systems-principles and Design” TMH, 2nd

Edition, 2002.

4) David. K. Chng, “ Analysis of Linear systems”, Narosa publishing house., 1996. Richard C.

Dorf and Robert. H. Bishop, “Modern Control Systems”, Person Education, 8th

Edition, 2002.

Course Title: Computer Organization Course Code: UEC515E

Credits: 3 Teaching Hours: 40 Hrs (10 Hrs/Unit)

Contact Hours: 3 Hrs/Week

CIE Marks: 50 SEE Marks: 50 Total Marks: 100

Unit I

Basic Structure of Computers: Computer Types, Functional Units, Basic Operational Concepts, Bus

Structures, Performance–Processor Clock, Basic Performance Equation, Clock Rate, Performance

Measurement, Historical Perspective. Machine Instructions and Programs: Numbers, Arithmetic

Operations and Characters, Memory Location and Addresses Memory Operations, Instructions and

Instruction Sequencing. Addressing Modes, Assembly Language, Basic Input and Output Operations,

Stacks and Queues, Subroutines, Additional Instructions, Encoding of Machine Instructions

Unit II

Input/output Organization: Accessing Multiple Devices, Controlling Device Requests, Exceptions,

Direct Memory Access, Buses I/O Devices, Interrupts – Interrupt Hardware, Enabling and Disabling

Interrupts, Handling Interface Circuits, Standard I/O, Interfaces – PCI Bus, SCSI Bus, USB.

Unit III

Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only Memories, Speed,

Size, and Cost, Cache Memories–Mapping Functions, Replacement Algorithms, Performance

Considerations, Virtual Memories, Secondary Storage, Arithmetic: Addition and Subtraction of

Signed Numbers, Design of Fast Adders, Multiplication of Positive Numbers

Unit IV

Arithmetic contd: Signed, Operand Multiplication, Fast Multiplication, Integer Division, Floating-

point Numbers and Operations Basic Processing Unit: Fundamental Concepts, Execution of a

Complete Instruction, Multiple Bus Organization, Hard-wired Control and Micro programmed

Control

Text Book:

1) Carl Hamacher, Zvonko Vranesic, Safwat Zaky, “Computer Organization”, 5th

Edition, Tata

McGraw Hill, 2002.

Reference Books:

1) David A. Patterson, John L. Hennessy, “Computer Organization and Design – The Hardware /

Software Interface ARM Edition”, 4th

Edition, Elsevier, 2009.

2) William Stallings, “Computer Organization & Architecture”, 7th

Edition, PHI, 2006.

Course Title: Soft Computing Course Code: UEC516E

Credits: 3 Teaching Hours: 40 Hrs (10 Hrs/Unit)

Contact Hours: 3 Hrs/Week

CIE Marks: 50 SEE Marks: 50 Total Marks: 100

Unit I

Fundamental Concepts: - Introduction to Artificial Neural Networks (ANN). Learning Process: -

error–correction learning, Hebbian learning, competitive learning, Boltzmann learning, the credit-

assignment problem, supervised learning, and other learning techniques.

Unit II

Single neuron/ Perceptron networks: - training methodology, typical application to linearly separable

problems. Multilayer Perceptron: - Back propagation algorithm, virtues and limitation of BP

algorithm, modifications to back-propagation. Radial-basis function Networks – interpolation

problem, Covers theorem, regularization networks, applications.

Unit III

Classical sets and Fuzzy sets, Classical relation and Fuzzy relation, Cartesian product, Crisp relation,

Fuzzy relation: Tolerance and Equilance relation, Membership functions: Future of the membership

functions, membership value assignment.

Unit IV

Fuzzy to crisp conversions: Lambda-cuts for Fuzzy sets, Lambda-cuts for Fuzzy Relations,

Defuzzification Methods, Fuzzy Arithmetic, Numbers, Vectors, and the Extension Principle, Fuzzy

Numbers, Interval Analysis in Arithmetic, Approximate Methods of Extension, Fuzzy vectors,

Classical Logic and Fuzzy Logic, Classical Predicate Logic, Fuzzy Logic,

Text Books:

1) Haykin, “Neural Networks, A Comprehensive Foundation”, Pearson Education, India.

2) T. J. Ross, “Fuzzy Logic with Engineering Applications”, MC Graw Hill International

Edition, 1997.

Reference Book:

1) Jang, Sun and Mizutani, “Neuro-Fuzzy and Soft-Computing – A computational approach to

learning and machine intelligence”, Prentice Hall of India.

2) S. Kumar, “Neural Networks: A Classroom approach”, Tata Mcgraw Hill, 2004.

3) M. T. Hagan, Howard B. Demuth, Mark H. Beale, “Neural Network Design”, Thomson 2002.

4) B. Yegnanarayana, “Artificial Neural Networks”, Prentice-Hall of India, 1999.

Course Title: Pulse and Switching Circuits Course Code: UEC517E

Credits: 3 Teaching Hours: 40 Hrs (10 Hrs/Unit)

Contact Hours: 3 Hrs/Week

CIE Marks: 50 SEE Marks: 50 Total Marks: 100

Unit I

Linear Wave Shaping: The low pass RC circuit, the low pass RC circuit as integrator, the high pass RC

circuit, the high pass RC circuit as differentiator, double differentiation, attenuators, RLC circuits,

ringing circuits.

Unit II

Nonlinear Wave Shaping: Clipping Circuits, clamping circuits, Switching Characteristics of Devices:

Junction diode switching times, Piece-wise linear diode characteristics, breakdown in junction diodes,

Transistor as switch, transistor switching times, breakdown voltages of transistor, the transistor switch

in saturation, temperature sensitivity of saturation parameters, design of transistor as switch.

Unit III

Multivibrators: Bistable multivibrator, a fixed biased bistable mutivibrators, a self biased transistor

binary, commutataing capacitors, a non saturating binary, triggering the binary, triggering

unsymmetrical through a unilateral devices, triggering symmetrical through a unilateral devices, a

direct connected binary, the emitter coupled binary, monostable multivibrator, the collector coupled

monostable multivibrator, the emitter coupled monostable multivibrator, triggering the monostable

multivinrator, astable multivibrator, the collector coupled astable multivibrator, the emitter coupled

astable multivibrator.

Unit IV

Time Based Generators: General features of time base signal, methods of generating time base

waveform, exponential sweep circuits, uni junction transistor, sweep circuit using UJT, sweep circuit

using transistor switch, a transistor constant current sweep, Miller and Bootstrap time based generators

basic principles, the transistor miller time base generator, the transistor Bootstrap time base generator,

current time based generators, a simple current sweep, linearity correction through adjustment of

driving waveform, a transistor current time base generator.

Synchronization and Frequency Division: Pulse synchronization of relaxation devices, frequency

division in sweep circuits, other astable relaxation circuits, monostable relaxation circuits as dividers,

phase delay and phase jitters, synchronization of sweep circuits with symmetrical signals, sine wave

frequency division with sweep circuits.

Text Books:

1) A Anand Kumar, “Pulse and Digital Circuits”, PHI 2nd

Edition, 2008.

2) Jacob Millman, Herbert Taub, and Mothiki Prakash Rao, “Pulse, Digital and Switching

Waveforms”, Tata MacGraw Hill, 2nd

Edition, 2007.

Course Title: Random Process Course Code: UEC518E

Credits: 3 Teaching Hours: 40 Hrs (10 Hrs/Unit)

Contact Hours: 3 Hrs/Week

CIE Marks: 50 SEE Marks: 50 Total Marks: 100

Unit I

Introduction to Probability Theory: Experiments, sample space, Events, Axioms, Assigning

probabilities, Joint and conditional probabilities, Baye’s Theorem, Independence, Discrete Random

Variables, Engg Example.

Unit II

Random Variables, Distributions, Density Functions: CDF, PDF, Gaussian random variable, Uniform

Exponential, Laplace, Gamma, Erlang, Chi-Square, Raleigh, Rician and Cauchy types of random

variables.

Operations on a single R.V.: Expected value, EV of Random variables, EV of functions of Random

variables, Central Moments, Conditional expected values.

Unit III

Pairs of Random variables, Joint CDF, joint PDF, Joint probability mass functions, Conditional

Distribution, density and mass functions, EV involving pairs of Random variables, Independent

Random variables, Complex Random variables, Engg Application.

Unit IV

Multiple Random Variables: Joint and conditional PMF, CDF, PDF, EV involving multiple Random

variables, Gaussian Random variable in multiple dimension, Engg application, linear prediction.

Random Process: Definition and characterization, Mathematical tools for studying Random Processes,

Stationary and Ergodic Random processes, Properties of ACF.

Text Book:

1) S. L. Miller and D. C. Childers, “Probability and Random Processes: Application to Signal

Processing and Communication”, Academic Press / Elsevier 2004.

Reference Books:

1) A. Papoullis and S U Pillai, “Probability, Random Variables and Stochastic Processes”,

McGraw Hill 2002.

2) Peyton Z Peebles, “Probability, Random Variables and Random Signal Principles”, 4th

Edition,

TMH, 2007.

3) H. Stark and Woods, “Probability, Random Processes and Applications”, PHI, 2001.

Course Title: Automotive Electronics Course Code: UEC519E

Credits: 3 Teaching Hours: 40 Hrs (10 Hrs/Unit)

Contact Hours: 3 Hrs/Week

CIE Marks: 50 SEE Marks: 50 Total Marks: 100

Unit I

Automotive Systems: Introduction to Power Train System, Transmission System, Braking System,

Steering System, Starting System, Charging System. Need for Electronics: Performance, Control &

Legislation. Bus Architecture and Protocols: Introduction to control networking, Review of SPI, I2C,

USB, CAN, LIN, FLEXRAY, MOST Protocols.

Unit II

Power train & Chassis Subsystem: Electronic fuel control in ignition systems, Fuel injection systems,

Advanced fuel control technology, ABS, TCS & ESP, Airbags. Automotive Sensors & Actuators:

Engine Speed Sensor, temperature sensor, Lambda sensor, Accelerometer (knock sensors).

Unit III

Automotive Engine Control Actuators, Solenoid actuator, Exhaust Gas Re circulation Actuator.

Infotainment & Navigation Systems, Vehicle multimedia, Driver Assistance & Navigation

Unit IV

AUTOSAR Standard: Motivation, AUTOSAR Architecture, Main Areas of AUTOSAR

Standardization, AUTOSAR Models.

Text Books:

1) Denton. T, “Automobile Electrical and Electronic Systems”, Edward Arnold publication,

1995.

2) William T. M., “Automotive Electronic Systems”, Heiemann Ltd., London, 1978.

Reference Books:

1) Nicholas Navet, “Automotive Embedded System Handbook”, CRC Press, 2009.

2) “BOSCH Automotive Handbook”, Wiley Publications, 8th

Edition, 2011.

3) Jason. R. Andrews, “Co-Verification of Hardware & Software for ARM SoC Design”,

Newnes Publications, 2004.

4) F. Balarin, “Hardware Software co-design of Embedded Systems”, Kluwer Academic

Publishers, 1987.

5) William B. Ribbens, “Understanding Automotive Electronics”, Newnes Publications, 6th

Edition, 2003.

Course Title: Data Structures Using “C” Course Code: UEC520E

Credits: 3 Teaching Hours: 40 Hrs (10 Hrs/Unit)

Contact Hours: 3 Hrs/Week

CIE Marks: 50 SEE Marks: 50 Total Marks: 100

Unit I

Advanced C: Pointers: Concepts, Pointer variables, Accessing variables through pointers, pointer

declaration & definition, Initialization of pointer variables, example programs, Pointers and functions,

Pointers to Pointers, Compatibility, Lvalue and Rvalue, example programs. Array and Pointers,

Pointers arithmetic and array, passing array to a functions, Memory allocation functions, some

example programs. Array of Pointers, dynamic array, strings and Pointers, Derived types Enumerated,

structure & Union: Type definition, enumerated types, structure, Accessing structures. Complex

structures, array of structure, structures and functions, pointers to structures, example programs,

unions.

Unit II

Introduction to data structures: Basic concepts, Pseudocode: Algorithm header, Purpose, Conditions

and Return, Statement Numbers, Variables, Statement constructs, sequence, selection, loop,

Algorithm analysis, Psuedocode example. The abstract data type: Atomic and composite data, Data

type, Data structure, Abstract data type, Model for an abstract data type: ADT operations, ADT data

structures, ADT Implementations: Array implementation, Linked list implementation, Pointers to

linked lists, Generic code for ADTs: Pointer to void, Pointer to Function: Defining pointers to

functions, using pointers to functions.

Linear Lists: Stacks: Basic stack operations: Push, Pop, Stack top, Stack linked list: Implementation,

Data structure, Stack head, Stack data node, Stack algorithms: Create Stack, Push Stack, Stack top,

Empty Stack, Full Stack, Stack count, Destroy Stack.

Unit III

C language implantations: Insert data, Push Stack, Print Stack, Pop character, Stack ADT: Data

structure, ADT Implementations, Stack structure, Create stack, Push stack, Pop stack, Stack top,

Empty stack, Stack count, Destroy stack, Recursion: Factorial: A case study: Recursion defined,

Iterative solution, Recursive solution, Designing Recursive algorithms: The design methodology,

Limitations of recursion. Design implementation- Reverse keyboard input, Recursive examples:

Greatest common divisor, GCD designs, GCD C implementation, Fibonacci Numbers, Design,

Fibonacci C implementation, how recursion works.

Queues: Queue Operations: Enqueue, Dequeue, Queue front, Queue rear, Queue example, Queue

Linked list design: Data structure, Queue head, Queue data node. Queue algorithms.

Unit IV

Queues: Create queue, Enqueue, Dequeue, Retrieving queue data, Empty queue, Full queue, Queue

count, Destroy queue, Queue ADT: Queue structure, Queue ADT algorithms, Queue Applications:

Categorizing data, Categorizing data design, Categorizing data - C implementation.

General Linear lists: Basic operations, Insertion, Deletion, Retrieval, Traversal, Implementation: Data

structure, Head node, Data node, Algorithms, Create list, Insert node, Delete node, List search,

Retrieve node, Empty list, Full list, List count, Traverse list, Destroy list, List ADT: ADT functions,

Create list, Add node, Internal insertion function, Remove node, Internal delete function, Search list,

Internal search function, Retrieve node, Empty list Full list, List count, Traverse, Destroy list.

Text Books:

1. Behrouz A. Forouzan and Richard F. Gilberg, “Computer Science: A Structured Programming

Approach Using C”, 2nd

Edition, Thomson, 2003.

2. Behrouz A. Forouzan and Richard F. Gilberg, “Data Structure: A Pseudocode Approach with

C”, 2nd

Edition, Cengage Learning Publisher, 2005.

Reference Books:

1. Andrew Tenanbaum, “Data Structures with C”, Thomson, 2005.

2. Robert Kruse & Bruce Leung, “Data Structures & Program Design in C”, Pearson Education,

2007.

3. Aaron M. Tenenbaum, Yedidyah Langsam, Moshe J.Augenstein, “Data Structures Using C”,

Pearson Education, Seventh impression 2009.

Course Title: DSP and VHDL Laboratory Course Code: UEC521L

Credits: 1.5 Contact Hours: 3 Hrs/Week

CIE Marks: 50 SEE Marks: 50 Total Marks: 100

List of Experiments - DSP

Using MATLAB

1) Computation of N point DFT and IDFT

2) Linear and Circular convolution of two sequences using DFT and IDFT.

3) Design and implementation of FIR filter (windowing/frequency sampling method) to meet

given specifications.

4) Design and implementation of IIR filter (Chebyshev / Butterworth) to meet given

specifications.

Using Digital Signal Processor (TMS 320 C 54XX)

1) Linear and convolution of two given sequences.

2) Computation of N- Point DFT of a given sequence

3) Realization of FIR filter (using any one window) to meet given specifications. The input can

be a signal from external source.

4) Realization of a two band graphic equalizer of two different audio bands. The input can be a

music signal (music containing different instruments).

List of Experiments - VHDL

1) Write VHDL code using concurrent signal assignment statements for

a. Full adder

b. 3:8 decoder with active low output, truth table is shown in table 1.1

c. 4:1 MUX, truth table is shown in table 1.2

d. Boolean expressions

i. F1(abc) = ∑(0,1,3,4,5);

ii. F2(abc) = π(1,2,3,5,7);

2) Write VHDL code using selected signal assignment statement

a. Full adder

b. 3:8 Decoder with active low output truth table shown in table 1.1

c. 4:1 MUX, truth table is shown in table 1.2

d. Boolean expressions

i. F1(abc) = ∑(0,1,3,4,5,);

ii. F2(abc) = π(1,2,3,5,7);

3) Implementation using conditional signal assignment statement

a. 8:3 Priority encoder truth table is shown in table 1.3

b. 3:8 Decoder with active low output truth table shown in table 1.1

c. 4:1 MUX, truth table is shown in table 1.2

d. Boolean expressions

i. F1(abc) = ∑(0,1,3,4,5,);

ii. F2(abc) = π(1,2,3,5,7);

4) Write VHDL program using process statement(s) for – combinational circuits

a. Full subtractor

b. 2 bit magnitude comparator

c. 8 bit magnitude comparator

d. 3:8 decoder

5) Displays

a. Write VHDL code for BCD to seven segment display decoder

b. Write VHDL code display following message on LCD

i. Line 1 : BEC

ii. Line 2 : ECE

c. Write VHDL code to run following message from left to right on LCD

i. Line 1 : BEC

ii. Line 2 : ECE

d. Write VHDL code to run following message from right to left on LCD

i. Line 1 : BEC

ii. Line 2 : ECE

e. Write VHDL program to display and blink following message every one second

i. Line 1 : BEC

ii. Line 2 : ECE

6) Counters and Shift Register

a. Write VHDL program for 4-bit up counter and display result on LEDS

b. Write VHDL program for BCD up counter and display the result on seven segment

display

c. Write VHDL program for 00 to 99 counter and display result on LCD

d. Write VHDL program for 6-bit SISO shift registers

7) Sequence Detector (1010)

Course Title: Communication Laboratory Course Code: UEC522L

Credits: 1.5 Contact Hours: 3 Hrs/Week

CIE Marks: 50 SEE Marks: 50 Total Marks: 100

List of Experiments

1) Design and verification of:

a. Second order active low pass filter

b. Second order active high pass filter

2) Design and verification of second order band pass filter.

3) Realization of Amplitude modulation and demodulation for a given modulation index.

4) Realization of Frequency modulation.

5) Realization of pulse width modulation.

6) Verification of sampling theorem.

7) Generation and detection of Amplitude shift keying (ASK) Signal.

8) Generation and detection of frequency shift keying (FSK) signal.

9) Generation and detection of phase shift keying (PSK) signal.

10) Study of sample and hold circuit.

11) Realization of pulse Amplitude modulation (PAM)

12) Realization of Pre-emphasis and de-emphasis circuits.

13) Generation of FSK signal using 555 timers.

14) Characterization of Phase Locked Loop (PLL)

15) Generation of PN sequence using shift registers and verification of its properties.


Recommended