Course Objectives
To provide the student with the fundamental concepts of initiating, planning, scheduling and controlling projects.
1.0 Introduction: (3 hours)
1.1 Project definition
1.2 Setting project objectives and goals
1.3 Project phases, project life cycle
2.0 Project Planning and Scheduling: (18 hours)
2.1 Planning function
2.2 Network models - CPM/PERT
2.3 Project scheduling with limited resources
2.4 Wiest's algorithms
2.5 Manpower leveling
2.6 Multiproject scheduling
2.7 Materials scheduling
2.8 Mathematical programming for minimum cost or maximum project return (simplex technique for linear programming)
3.0 Project Monitoring and Control: (10 hours)
3.1 Systems of control
3.2 Project control cycle
3.3 Feedback control systems
3.4 Cost control
3.5 Work breakdown structure
3.6 Introduction to project management information systems
4.0 Capital Planning and Budgeting: (10 hours)
4.1 Capital planning procedures
4.2 Preparation of operating budgets
4.3 Fixed and flexible budgets
4.4 Introduction to budgetary control
5.0 Impact Analysis: (4 hours)
5.1 Social impact analysis
5.2 Environmental impact analysis
5.3 Economic impact analysis
Textbook:
1.0 Arnold M. Ruskin and W. Eugene Estes, "Project Management", Marcel Dekker Publishers, 1982.
2.0 Joseph J. Moder and Cecil R. Phillips, "Project Management with CPM and PERT", Van Nostrand Reinhold Publishers, Latest Edition.
References:
1.0 L. S. Srinrat, "Pert and Application", East-West Press.
2.0 A. Bhattacharya and S. K. Sorkhel, "Management by Network Analysis", The Institution of Engineers (India).
3.0 Prasanna Chandra, "Projects: Preparation, Appraisal, Implementation", Tata McGraw-Hill Publishing Company Ltd., New Delhi.
Thursday, September 18, 2008
Minor Project
Course Objectives
To learn visual programming by carrying out a small project. During the project, the student will learn visual programming tool (JAVA/Visual Basic/Visual C++ or any current trend of visual tool). The student will also learn to formulate project documentation for his/her final year project. The project may be on the following areas or any other area relevant to the course:
1. Simulation of signaling in Microprocessor
2. Measurement converters to be used in web pages
3. Bar chart generator in web pages
4. Calculator
5. Cross word puzzle
6. Simulation of Electronic circuits
7. Simulation of logical circuits
1. Java Programming Language: (15 hours)
1.1. Introduction to Java
1.2. Java grammar
1.3. Variable and data types
1.4. Operators, statements, functions
1.5. Objects
1.6. Event handlers
2. Project guidance: (6 hours)
3. Project on visual programming: (39 hours)
The project document shall include the following items:
1. Technical description of the mini project
2. System aspect of the project
a. Baseline performance of the system
b. Performance analysis methodology
c. Reusability of modules in the software
3. Project sponsors if any
4. Implementation area
5. Project tasks and time schedule
6. Project team members and team leader
7. Project supervisor
To learn visual programming by carrying out a small project. During the project, the student will learn visual programming tool (JAVA/Visual Basic/Visual C++ or any current trend of visual tool). The student will also learn to formulate project documentation for his/her final year project. The project may be on the following areas or any other area relevant to the course:
1. Simulation of signaling in Microprocessor
2. Measurement converters to be used in web pages
3. Bar chart generator in web pages
4. Calculator
5. Cross word puzzle
6. Simulation of Electronic circuits
7. Simulation of logical circuits
1. Java Programming Language: (15 hours)
1.1. Introduction to Java
1.2. Java grammar
1.3. Variable and data types
1.4. Operators, statements, functions
1.5. Objects
1.6. Event handlers
2. Project guidance: (6 hours)
3. Project on visual programming: (39 hours)
The project document shall include the following items:
1. Technical description of the mini project
2. System aspect of the project
a. Baseline performance of the system
b. Performance analysis methodology
c. Reusability of modules in the software
3. Project sponsors if any
4. Implementation area
5. Project tasks and time schedule
6. Project team members and team leader
7. Project supervisor
Database Management Systems
Course Objectives
The course objective is to provide fundamental concept, theory and practices in design and implementation of Database Management System.
1.0 Introduction ( 3 hours)
1.1 Concept and applications
1.2 Objectives and Evolution
1.3 Data abstraction and data independence
1.4 Schema and Instances
1.5 Concept of DDL and DML
2.0 Data Models ( 5 hours)
2.1 Logical, Physical and Conceptual model
2.2 E-R Model
2.2.1 Entities and entity sets
2.2.2 Relationships and relationships sets
2.2.3 E-R diagram
2.2.4 Strong and weak entity sets
2.2.5 Attributes and keys
2.3 Network Data Model
2.4 Hierarchical Data Model
2.5 Unified Modeling Language
3.0 Relational model ( 3 hours)
3.1 Definitions and terminology
3.2 Structure of relational databases
3.3 The relational algebra and relational calculus
4.0 Relational languages ( 5 hours)
4.1 SQL and QBE
4.1.1 DDL and DML
5.0 Relational Database Design ( 6 hours)
5.1 Integrity constraints
5.1.1 Domain constraints
5.1.2 Functional dependencies
5.1.3 Referential integrity
5.1.4 Triggers
5.2 Multi-valued and Join Dependencies
5.3 Normalization
5.3.1 Needs of normalization
5.3.2 Normal Forms
5.3.3 DKNF
5.3 Views design
5.4 Decomposition of relation schemes
6.0 Query Processing ( 3 hours)
6.1 Introduction to query processing
6.2 Equivalence of expressions
6.3 Query Optimization
6.4 Query decomposition
7.0 Filing and File structure ( 5 hours)
7.1 Storage devices
7.2 Organization of records
7.3 File organizations
7.3.1 The sequential file organizations
7.3.2 The indexed sequential file organization
7.3.3 B-Tree index files
7.3.4 Hashing
7.3.5 Heap
7.4 Buffer Management
8.0 Security ( 3 hours)
8.1 Security and integrity violations
8.2 Access control and Authorization
8.3 Security and Views
8.4 Encryption and decryption
9.0 Crash Recovery ( 4 hours)
9.1 Failure classification
9.2 Backup-recovery
9.3 Storage hierarchy
9.4 Transaction model
9.5 Log-based recovery
9.6 Shadow paging
10.0 Concurrency control ( 4 hours)
10.1 Transaction
10.2 Scheduling and Serializability
10.3 Lock based protocols
10.4 Time-stamping
10.5 Deadlock handling
10.6 Multiple Granularity
11.0 Object Oriented Model ( 2 hours)
11.1 Introduction
11.2 Design of Object-Oriented Model
12.0 Distributed Model (2 hours)
12.1 Structure of distributed model
12.2 Design consideration
12.3 Applications
Laboratory:
There should be 12 laboratory exercises based on any standard RDBMS.
References:
1. H. F. Korth and A. Silberschatz, " Database system concepts", McGraw Hill
2. A. K. Majumdar and P. Bhattacharaya, "Database Management Systems", Tata McGraw Hill, India
3. G.C. Everest, "Database Management", McGraw Hill
The course objective is to provide fundamental concept, theory and practices in design and implementation of Database Management System.
1.0 Introduction ( 3 hours)
1.1 Concept and applications
1.2 Objectives and Evolution
1.3 Data abstraction and data independence
1.4 Schema and Instances
1.5 Concept of DDL and DML
2.0 Data Models ( 5 hours)
2.1 Logical, Physical and Conceptual model
2.2 E-R Model
2.2.1 Entities and entity sets
2.2.2 Relationships and relationships sets
2.2.3 E-R diagram
2.2.4 Strong and weak entity sets
2.2.5 Attributes and keys
2.3 Network Data Model
2.4 Hierarchical Data Model
2.5 Unified Modeling Language
3.0 Relational model ( 3 hours)
3.1 Definitions and terminology
3.2 Structure of relational databases
3.3 The relational algebra and relational calculus
4.0 Relational languages ( 5 hours)
4.1 SQL and QBE
4.1.1 DDL and DML
5.0 Relational Database Design ( 6 hours)
5.1 Integrity constraints
5.1.1 Domain constraints
5.1.2 Functional dependencies
5.1.3 Referential integrity
5.1.4 Triggers
5.2 Multi-valued and Join Dependencies
5.3 Normalization
5.3.1 Needs of normalization
5.3.2 Normal Forms
5.3.3 DKNF
5.3 Views design
5.4 Decomposition of relation schemes
6.0 Query Processing ( 3 hours)
6.1 Introduction to query processing
6.2 Equivalence of expressions
6.3 Query Optimization
6.4 Query decomposition
7.0 Filing and File structure ( 5 hours)
7.1 Storage devices
7.2 Organization of records
7.3 File organizations
7.3.1 The sequential file organizations
7.3.2 The indexed sequential file organization
7.3.3 B-Tree index files
7.3.4 Hashing
7.3.5 Heap
7.4 Buffer Management
8.0 Security ( 3 hours)
8.1 Security and integrity violations
8.2 Access control and Authorization
8.3 Security and Views
8.4 Encryption and decryption
9.0 Crash Recovery ( 4 hours)
9.1 Failure classification
9.2 Backup-recovery
9.3 Storage hierarchy
9.4 Transaction model
9.5 Log-based recovery
9.6 Shadow paging
10.0 Concurrency control ( 4 hours)
10.1 Transaction
10.2 Scheduling and Serializability
10.3 Lock based protocols
10.4 Time-stamping
10.5 Deadlock handling
10.6 Multiple Granularity
11.0 Object Oriented Model ( 2 hours)
11.1 Introduction
11.2 Design of Object-Oriented Model
12.0 Distributed Model (2 hours)
12.1 Structure of distributed model
12.2 Design consideration
12.3 Applications
Laboratory:
There should be 12 laboratory exercises based on any standard RDBMS.
References:
1. H. F. Korth and A. Silberschatz, " Database system concepts", McGraw Hill
2. A. K. Majumdar and P. Bhattacharaya, "Database Management Systems", Tata McGraw Hill, India
3. G.C. Everest, "Database Management", McGraw Hill
Operating Systems
Course Objectives
To provide the basics in designing of an operating system.
1. Principles of operating systems (5 hours)
1.1. Evolution of operating systems
1.1.1. User driven
1.1.2. Operator driven
1.1.3. Simple batch system
1.1.4. Off-line batch system
1.1.5. Directly-coupled off-line system
1.1.6. Multi-programmed spooling system
1.1.7. On-line timesharing system
1.1.8. Multiprocessor systems
1.1.9. Multi-computer/Distributed systems
2. Program construction utilities (6 hours)
2.1. Assembler
2.2. Archiver
2.3. Link editor
2.4. Relocating loader
3. Concurrent processes (5 hours)
3.1. Interleaving
3.2. Non-determinism
3.3. Process interaction sharing
3.4. Synchronization
3.5. Communication
3.6. Locks
3.7. Semaphores
3.8. Monitors
4. The system nucleus(kernel) (6 hours)
4.1. Context switching
4.2. First level interrupt handling
4.3. Kernel implementation of processes
4.4. Kernel implementation of semaphores
5. Scheduling (5 hours)
5.1. Priority pre-emption
5.2. Run to completion
5.3. Time-sliced
5.4. Multi-level queues
6. Input/Output (6 hours)
6.1. Polled input/output
6.2. Interrupt driven input/output
6.3. Device driver structure
7. Memory management (6 hours)
7.1. Single contiguous store allocation and overlays
7.2. Fixed partition store allocation
7.3. Dynamic partition store allocation and fragmentation/compaction
7.4. Virtual addressing
7.5. Memory management policy
8. Case study (6 hours)
8.1. Unix
8.2. Windows NT
Laboratories:
6 Laboratories based on standard operating system
References:
1. Mark Donovan: System programming
To provide the basics in designing of an operating system.
1. Principles of operating systems (5 hours)
1.1. Evolution of operating systems
1.1.1. User driven
1.1.2. Operator driven
1.1.3. Simple batch system
1.1.4. Off-line batch system
1.1.5. Directly-coupled off-line system
1.1.6. Multi-programmed spooling system
1.1.7. On-line timesharing system
1.1.8. Multiprocessor systems
1.1.9. Multi-computer/Distributed systems
2. Program construction utilities (6 hours)
2.1. Assembler
2.2. Archiver
2.3. Link editor
2.4. Relocating loader
3. Concurrent processes (5 hours)
3.1. Interleaving
3.2. Non-determinism
3.3. Process interaction sharing
3.4. Synchronization
3.5. Communication
3.6. Locks
3.7. Semaphores
3.8. Monitors
4. The system nucleus(kernel) (6 hours)
4.1. Context switching
4.2. First level interrupt handling
4.3. Kernel implementation of processes
4.4. Kernel implementation of semaphores
5. Scheduling (5 hours)
5.1. Priority pre-emption
5.2. Run to completion
5.3. Time-sliced
5.4. Multi-level queues
6. Input/Output (6 hours)
6.1. Polled input/output
6.2. Interrupt driven input/output
6.3. Device driver structure
7. Memory management (6 hours)
7.1. Single contiguous store allocation and overlays
7.2. Fixed partition store allocation
7.3. Dynamic partition store allocation and fragmentation/compaction
7.4. Virtual addressing
7.5. Memory management policy
8. Case study (6 hours)
8.1. Unix
8.2. Windows NT
Laboratories:
6 Laboratories based on standard operating system
References:
1. Mark Donovan: System programming
Communication Systems
Course Objectives
To introduce the student to analog and digital communication systems.
1.0 Analog and Digital Communication Systems: (2 hours)
1.1 Analog and digital communication sources, transmitters, transmission channels and receivers
1.2 Fundamental limitations due to noise, distortion and interference and the relationships between noise, bandwidth and information
1.3 Types and reasons for modulation
2.0 Representation of Communication Signals and Systems: (2 hours)
2.1 Review of signal transfer in linear systems, the ideal lowpass filter and distortionless transmission, the importance of channel bandwidth
2.2 The Hilbert transform and its properties
2.3 Bandpass systems and band-limited signals with examples
2.4 Complex envelope representation of band-limited signals, time domain expressions, rectangular representation (in-phase and quadrature components), polar representation (envelope and phase)
3.0 Continuous Wave Linear Modulators: (6 hours)
3.1 Amplitude modulation (AM), time domain expressions and modulation index, frequency domain (spectral). representations, transmission bandwidth for AM
3.2 AM modulation for a single tone message, phasor diagram of an AM signal, illustration of the carrier and sideband components
3.3 Transmission requirements for AM, normalized power and its use in communication, carrier power and sideband power
3.4 Double sideband suppressed carrier (DSB) modulation, time and frequency domain expressions
3.5 Transmission requirements for DBS, bandwidth and transmission power for DSB
3.6 Methods of generating AM and DSB, square modulators, balanced modulators, ring modulators
3.7 Single sideband modulation (SSB), generation of SSB using a sideband filter, indirect generation of SSB
3.8 Representation of SSB signals
3.9 Transmission requirements for SSB, transmit bandwidth and power, sideband filter examples
3.10 Vestigial sideband modulation (VSB)
4.0 Demodulators for Linear Modulation: (4 hours)
4.1 Demodulation of AM signals, square law and envelop detectors
4.2 The superheterodyne receiver for standard AM radio
4.3 Synchronous demodulation of AM, DSB and SSB using synchronous detection
4.4 Effects of frequency and phase errors in the local oscillator in DSB and SSB
4.5 Demodulation of SSB using carrier reinsertion and the use of SSB in telephony
4.6 Carrier recovery circuits
4.7 Introduction to the phase-locked loop (PLL)
5.0 Frequency Modulation (FM) and phase Modulation (PM): (4 hours)
5.1 Instantaneous frequency and instantaneous phase, time domain representations for FM and PM, phasor diagram for FM and PM
5.2 FM and PM signals for a single tone message, the modulation index and phasor diagrams
5.3 Spectral representation of FM and PM for a single tone message, Bessel’s functions and the Fourier series
5.4 Transmission bandwidth for FM, Carson’s rule, narrow-band and wide-band FM and PM signals
5.5 Generation of FM using Armstrong’s method, commercial FM requirements
5.6 Demodulation of FM and PM signals, the limiter discriminator
5.7 Commercial FM radio and stereo FM radio
5.8 Demodulation of FM using a phase-locked loop
6.0 Frequency Division Multiplexing (FDM) Systems: (1 hours)
6.1 FDM in telephony, telephone hierarchy and examples of group and super-group generation
6.2 Satellite systems and applications, frequency division multiple access (FDMA) systems
6.3 Filter and oscillator requirements in FDM
7.0 Spectral Analysis: (3 hours)
7.1 Review of Fourier transform theory, energy and power, parseval’s theorem
7.2 Power spectral density functions (pfsd), analog spectrum analyzers
7.3 The auto-correlation function, relationship between the pfsd and the auto-correlation function, pfsd’s of harmonic signals, psfd’s of uncorrelated (white) signals
7.4 Estimating psfd’s, the periodogram, psdf’s of harmonic signals
7.5 Effect of windowing on psdf estimates
8.0 Digital Communication Systems: (2 hours)
8.1 Digital communication sources, transmitters, transmission channels, and receivers
8.2 Distortion, noise, and interference
8.3 Nyquist sampling theory, sampling of analog signals, spectrum of a sampled signal
8.4 Sampling theorem for band-limited signals, effects of aliasing, reconstruction of sampled signals
9.0 Pulse Modulation Systems: (6 hours)
9.1 Pulse amplitude modulation (PAM), bandwidth requirements and reconstruction
methods, time division multiplexing
9.2 Pulse duration modulation (PDM), generation of PDM signals and reconstruction methods
9.3 Analog to digital conversion, quantization and encoding techniques, application to pulse code modulation (PCM)
9.4 Quantization noise in PCM, companding in PCM systems
9.5 Time division multiplexing (TDM), examples of PAM and PCM systems
9.6 The TI PCM system in telephony
9.7 The delta modulator and its operation
9.8 Quantization noise and slope overload in delta modulators, comparison of delta modulation and PCM
9.9 Introduction to linear prediction theory with applications in delta modulation
10.0 Digital Data Communication Systems: (8 hours)
10.1 Introduction to information theory, definition of information, examples of simple sources
10.2 Information rate and Shannon's channel capacity theorem
10.3 Baseband digital communication systems, multilevel coding using PAM
10.4 Pulse shaping and bandwidth considerations, intersymbol interference (ISI)
10.5 Nyquist conditional for zero ISI, band-limited Nyquist pulses, the eye diagram
10.6 Correlative coding techniques, reducing transmission bandwidth with duobinary encoding
10.7 Spectral shaping using bipolar and modified duobinary encoding techniques
10.8 Bandpass (modulated) digital data systems, digital modulation, PSK, DPSK and FSK
10.9 M-array data communication systems, quadrature amplitude modulation (QAM) systems, four phase PSK
10.10 Applications of modems for transmission over telephone lines
11.0 Representation of Random Signals and Noise in Communication Systems: (8 hours)
11.1 Signal power and spectral representations, the auto-correlation and power spectral density (pfsd) functions
11.2 White noise, thermal noise, the psdf of white signals
11.3 Input and output relationships for random signals and noise passed through a linear time invariant system, band-limited white noise, RC filtering of white noise
11.4 The noise bandwidth of a linear time invariant system and its use in communications
11.5 Optimum detection of a pulse in additive white noise, the matched filter
11.6 Matched filter detection in baseband data communication systems
11.7 Comparison of the matched filter for rectangular pulses with first and second order suboptimum Butterworth filters
11.8 Performance limitation of baseband data communications due to noise,
probability of error expressions for multilevel data signals
11.9 Relationship between signal power, noise and channel bandwidth, comparison of systems using Shannon capacity
11.10 Narrowband noise representation, generation of narrowband noise and psdf, time domain expressions for narrowband noise
12.0 Noise Performance of Analog and Digital Communication Systems: (8 hours)
12.1 Signal-to-noise ratio in linear modulation, synchronous detection of DSB
12.2 Signal-to-noise ratios for AM and SSB, comparison of DSB, SSB and AM
12.3 Effect of noise in envelope and square law detection of AM, threshold effects in nonlinear detectors
12.4 Signal-to-noise ratio for FM, SNR improvements using preemphasis and deemphasis networks
12.5 FM threshold effects, noise clicks in FM systems
12.6 Comparison of linear and exponential modulation systems for additive white band-limited noise channels
12.7 Effects of noise in modulated digital communication systems, optimum binary systems
12.8 Probability of error expressions for binary communications
12.9 Probability of error in QAM systems, comparison of digital modulation systems
13.0 Introduction to Coding Theory: (5 hours)
13.1 Block coding for error detection and correction, parity check bits and block coding
13.2 Examples of single cyclic error correcting codes
13.3 Introduction to convolution codes
Laboratory: Following Ten experiments are recommended:
1.0 Lowpass and bandpass filters with applications in communications. The student will be required to design and test a 4th order filter constructed using two 2nd order sections. The filter chips used will be the Burr-Brown UAFAI and the implementation could be Butterworth, Chebyshev or Bessel.
2.0 and 3.0 Linear modulation. This experiment will familiarize the student with linear modulation methods including double sideband modulation (DBS) and amplitude modulation (AM). will be compared to envelope detection.
4.0 Power spectral density (psdf) measurement of signals. A digital spectrum analyzer will be used to measure the psdf of signals. In particular, the power spectral density of frequency modulated signals will be analyzed and compared with theory.
5.0 Demodulation of frequency modulated signals using a phase locked loop (PLL). A second order PLL to demodulate an FM signal will be designed and tested in the laboratory. The PLL chip to be used is the CD4046B.
6.0 The delta modulator. In this experiment the effects of sampling rate, number of bits in the up-down counter are quantized and measured. The resulting family of SWR curves are compared with expected theoretical results.
7.0 Baseband data communications. A baseband communication system using NRZ signals and 2nd order transmit and receive filters is investigated. The measurements include the eye diagram and probability of error.
8.0 Correlative encoding. A correlative encoder is designed by the student and implemented in hardware. Commonly used encoders include duobinary, bipolar and modified duobinary. A corresponding digital simulation can also be used to illustrate the difference between analog and digital filtering.
9.0 Demodulation of frequency shift keying (FSK) using a phase locked loop (PLL). This is the digital counter-part of Laboratory #5 in COMMUNICATION SYSTEMS I. The PLL is designed to provide a good EYE while still ensuring that the loop stays in lock.
Note: A computer package can be used to replace most of the above hardware experiments. One such package is marketed by: Icucom Corporation, 48 Ford Avenue, Troy, New York 12080, (518) 247-7711 and is called "The Workstation Communications Simulator".
References:
1.0 S. Haykin, "An Introduction to Analog and Digital Communication", Wiley, New York, 1989.
2.0 L. W. Couch II, "Digital and Analog Communication Systems", 2nd Edition, Macmillan Publishing Company, New York, 1987.
To introduce the student to analog and digital communication systems.
1.0 Analog and Digital Communication Systems: (2 hours)
1.1 Analog and digital communication sources, transmitters, transmission channels and receivers
1.2 Fundamental limitations due to noise, distortion and interference and the relationships between noise, bandwidth and information
1.3 Types and reasons for modulation
2.0 Representation of Communication Signals and Systems: (2 hours)
2.1 Review of signal transfer in linear systems, the ideal lowpass filter and distortionless transmission, the importance of channel bandwidth
2.2 The Hilbert transform and its properties
2.3 Bandpass systems and band-limited signals with examples
2.4 Complex envelope representation of band-limited signals, time domain expressions, rectangular representation (in-phase and quadrature components), polar representation (envelope and phase)
3.0 Continuous Wave Linear Modulators: (6 hours)
3.1 Amplitude modulation (AM), time domain expressions and modulation index, frequency domain (spectral). representations, transmission bandwidth for AM
3.2 AM modulation for a single tone message, phasor diagram of an AM signal, illustration of the carrier and sideband components
3.3 Transmission requirements for AM, normalized power and its use in communication, carrier power and sideband power
3.4 Double sideband suppressed carrier (DSB) modulation, time and frequency domain expressions
3.5 Transmission requirements for DBS, bandwidth and transmission power for DSB
3.6 Methods of generating AM and DSB, square modulators, balanced modulators, ring modulators
3.7 Single sideband modulation (SSB), generation of SSB using a sideband filter, indirect generation of SSB
3.8 Representation of SSB signals
3.9 Transmission requirements for SSB, transmit bandwidth and power, sideband filter examples
3.10 Vestigial sideband modulation (VSB)
4.0 Demodulators for Linear Modulation: (4 hours)
4.1 Demodulation of AM signals, square law and envelop detectors
4.2 The superheterodyne receiver for standard AM radio
4.3 Synchronous demodulation of AM, DSB and SSB using synchronous detection
4.4 Effects of frequency and phase errors in the local oscillator in DSB and SSB
4.5 Demodulation of SSB using carrier reinsertion and the use of SSB in telephony
4.6 Carrier recovery circuits
4.7 Introduction to the phase-locked loop (PLL)
5.0 Frequency Modulation (FM) and phase Modulation (PM): (4 hours)
5.1 Instantaneous frequency and instantaneous phase, time domain representations for FM and PM, phasor diagram for FM and PM
5.2 FM and PM signals for a single tone message, the modulation index and phasor diagrams
5.3 Spectral representation of FM and PM for a single tone message, Bessel’s functions and the Fourier series
5.4 Transmission bandwidth for FM, Carson’s rule, narrow-band and wide-band FM and PM signals
5.5 Generation of FM using Armstrong’s method, commercial FM requirements
5.6 Demodulation of FM and PM signals, the limiter discriminator
5.7 Commercial FM radio and stereo FM radio
5.8 Demodulation of FM using a phase-locked loop
6.0 Frequency Division Multiplexing (FDM) Systems: (1 hours)
6.1 FDM in telephony, telephone hierarchy and examples of group and super-group generation
6.2 Satellite systems and applications, frequency division multiple access (FDMA) systems
6.3 Filter and oscillator requirements in FDM
7.0 Spectral Analysis: (3 hours)
7.1 Review of Fourier transform theory, energy and power, parseval’s theorem
7.2 Power spectral density functions (pfsd), analog spectrum analyzers
7.3 The auto-correlation function, relationship between the pfsd and the auto-correlation function, pfsd’s of harmonic signals, psfd’s of uncorrelated (white) signals
7.4 Estimating psfd’s, the periodogram, psdf’s of harmonic signals
7.5 Effect of windowing on psdf estimates
8.0 Digital Communication Systems: (2 hours)
8.1 Digital communication sources, transmitters, transmission channels, and receivers
8.2 Distortion, noise, and interference
8.3 Nyquist sampling theory, sampling of analog signals, spectrum of a sampled signal
8.4 Sampling theorem for band-limited signals, effects of aliasing, reconstruction of sampled signals
9.0 Pulse Modulation Systems: (6 hours)
9.1 Pulse amplitude modulation (PAM), bandwidth requirements and reconstruction
methods, time division multiplexing
9.2 Pulse duration modulation (PDM), generation of PDM signals and reconstruction methods
9.3 Analog to digital conversion, quantization and encoding techniques, application to pulse code modulation (PCM)
9.4 Quantization noise in PCM, companding in PCM systems
9.5 Time division multiplexing (TDM), examples of PAM and PCM systems
9.6 The TI PCM system in telephony
9.7 The delta modulator and its operation
9.8 Quantization noise and slope overload in delta modulators, comparison of delta modulation and PCM
9.9 Introduction to linear prediction theory with applications in delta modulation
10.0 Digital Data Communication Systems: (8 hours)
10.1 Introduction to information theory, definition of information, examples of simple sources
10.2 Information rate and Shannon's channel capacity theorem
10.3 Baseband digital communication systems, multilevel coding using PAM
10.4 Pulse shaping and bandwidth considerations, intersymbol interference (ISI)
10.5 Nyquist conditional for zero ISI, band-limited Nyquist pulses, the eye diagram
10.6 Correlative coding techniques, reducing transmission bandwidth with duobinary encoding
10.7 Spectral shaping using bipolar and modified duobinary encoding techniques
10.8 Bandpass (modulated) digital data systems, digital modulation, PSK, DPSK and FSK
10.9 M-array data communication systems, quadrature amplitude modulation (QAM) systems, four phase PSK
10.10 Applications of modems for transmission over telephone lines
11.0 Representation of Random Signals and Noise in Communication Systems: (8 hours)
11.1 Signal power and spectral representations, the auto-correlation and power spectral density (pfsd) functions
11.2 White noise, thermal noise, the psdf of white signals
11.3 Input and output relationships for random signals and noise passed through a linear time invariant system, band-limited white noise, RC filtering of white noise
11.4 The noise bandwidth of a linear time invariant system and its use in communications
11.5 Optimum detection of a pulse in additive white noise, the matched filter
11.6 Matched filter detection in baseband data communication systems
11.7 Comparison of the matched filter for rectangular pulses with first and second order suboptimum Butterworth filters
11.8 Performance limitation of baseband data communications due to noise,
probability of error expressions for multilevel data signals
11.9 Relationship between signal power, noise and channel bandwidth, comparison of systems using Shannon capacity
11.10 Narrowband noise representation, generation of narrowband noise and psdf, time domain expressions for narrowband noise
12.0 Noise Performance of Analog and Digital Communication Systems: (8 hours)
12.1 Signal-to-noise ratio in linear modulation, synchronous detection of DSB
12.2 Signal-to-noise ratios for AM and SSB, comparison of DSB, SSB and AM
12.3 Effect of noise in envelope and square law detection of AM, threshold effects in nonlinear detectors
12.4 Signal-to-noise ratio for FM, SNR improvements using preemphasis and deemphasis networks
12.5 FM threshold effects, noise clicks in FM systems
12.6 Comparison of linear and exponential modulation systems for additive white band-limited noise channels
12.7 Effects of noise in modulated digital communication systems, optimum binary systems
12.8 Probability of error expressions for binary communications
12.9 Probability of error in QAM systems, comparison of digital modulation systems
13.0 Introduction to Coding Theory: (5 hours)
13.1 Block coding for error detection and correction, parity check bits and block coding
13.2 Examples of single cyclic error correcting codes
13.3 Introduction to convolution codes
Laboratory: Following Ten experiments are recommended:
1.0 Lowpass and bandpass filters with applications in communications. The student will be required to design and test a 4th order filter constructed using two 2nd order sections. The filter chips used will be the Burr-Brown UAFAI and the implementation could be Butterworth, Chebyshev or Bessel.
2.0 and 3.0 Linear modulation. This experiment will familiarize the student with linear modulation methods including double sideband modulation (DBS) and amplitude modulation (AM). will be compared to envelope detection.
4.0 Power spectral density (psdf) measurement of signals. A digital spectrum analyzer will be used to measure the psdf of signals. In particular, the power spectral density of frequency modulated signals will be analyzed and compared with theory.
5.0 Demodulation of frequency modulated signals using a phase locked loop (PLL). A second order PLL to demodulate an FM signal will be designed and tested in the laboratory. The PLL chip to be used is the CD4046B.
6.0 The delta modulator. In this experiment the effects of sampling rate, number of bits in the up-down counter are quantized and measured. The resulting family of SWR curves are compared with expected theoretical results.
7.0 Baseband data communications. A baseband communication system using NRZ signals and 2nd order transmit and receive filters is investigated. The measurements include the eye diagram and probability of error.
8.0 Correlative encoding. A correlative encoder is designed by the student and implemented in hardware. Commonly used encoders include duobinary, bipolar and modified duobinary. A corresponding digital simulation can also be used to illustrate the difference between analog and digital filtering.
9.0 Demodulation of frequency shift keying (FSK) using a phase locked loop (PLL). This is the digital counter-part of Laboratory #5 in COMMUNICATION SYSTEMS I. The PLL is designed to provide a good EYE while still ensuring that the loop stays in lock.
Note: A computer package can be used to replace most of the above hardware experiments. One such package is marketed by: Icucom Corporation, 48 Ford Avenue, Troy, New York 12080, (518) 247-7711 and is called "The Workstation Communications Simulator".
References:
1.0 S. Haykin, "An Introduction to Analog and Digital Communication", Wiley, New York, 1989.
2.0 L. W. Couch II, "Digital and Analog Communication Systems", 2nd Edition, Macmillan Publishing Company, New York, 1987.
Monday, September 15, 2008
Computer Graphics
Course objectives
To present and practice the basic techniques used in computer graphics systems.
1.0 Purpose of Computer Graphics: (5 hours)
1.1 Early history of computer graphics
1.2 Engineering applications: CAD, schematic capture
1.3 Data visualization in medicine, art and engineering
2.0 Hardware Concepts: (8 hours)
2.1 Mouse, keyboard, light pen, touch screen and tablet input hardware
2.2 Raster and vector display architectures
2.3 Architecture of simple non-graphical display terminals
2.4 Architecture of graphical display terminals including frame buffer and colour manipulation techniques
2.5 Graphical architecture bottlenecks and interaction with the operating system
2.6 Specialized graphical processors and future development directions
3.0 Two-Dimensional Algorithms: (8 hours)
3.1 Direct and incremental line drawing algorithms
3.2 Bresenham algorithm
3.3 Two-dimensional world to screen viewing transformations
3.4 Two-dimensional rotation, scaling and translation transforms
3.5 Current transform concepts and advantages
3.6 Data structure concepts and CAD packages
4.0 Graphical Language: (6 hours)
4.1 Need for machine independent graphical languages
4.2 Discussion of available languages
4.3 Detailed discussion of graphical languages to be used in projects
5.0 Project Management: (4 hours)
5.1 Review of project management techniques
5.2 Review of program debugging techniques
6.0 Three-Dimensional Graphics: (10 hours)
6.1 Three-dimensional world to screen perspective viewing transform
6.2 Extension of two-dimensional transforms to three dimensions
6.3 Methods of generating non-planar surfaces
6.4 Hidden line and hidden surface removal techniques
6.5 Need for shading in engineering data visualization
6.6 Algorithms to simulate ambient, diffuse and specular reflections
6.7 Constant, Gouraud and phong shading models
6.8 Specialized and future three-dimensional display architectures
7.0 Project Development: (4 hours)
7.1 Project planning and description
7.2 Project development
7.3 Project report and presentation
Laboratory:
Computer graphics is best understood with "hands-on" experience. The laboratory exercises should consequently be directed toward introductory software concepts and familiarization with the graphical systems hardware architecture. Exercises might involve the development and comparison of various drawing algorithms or colour map animation. Exercises could be performed in either a high level language like c or a low level language like assembler.
Further exercises should familiarize the students with a high level graphics language which would then be used in the later laboratory periods in the development of a graphics project. This group project would be on an engineering topic preferably with both software and hardware aspects. The topic could be either initiated by the students or selected from a list provided by the instructor. An oral presentation with a demonstration should be part of the laboratory project report.
References:
1.0 J. D. Foley, S. K. Feiner and J. F. Hughes, "Computer Graphics - Principles and Practices", 2nd Edition, Addison-Wesley publishing Company, Don Mills, Ontario, Canada, 1989.
2.0 M. R. Smith and L. E. Turner, "EPLOT - A Machine Independent Graphical Interface", Department of Electrical and Computer Engineering, The University of Calgary. Documentation, example programs and diskette can be provided.
To present and practice the basic techniques used in computer graphics systems.
1.0 Purpose of Computer Graphics: (5 hours)
1.1 Early history of computer graphics
1.2 Engineering applications: CAD, schematic capture
1.3 Data visualization in medicine, art and engineering
2.0 Hardware Concepts: (8 hours)
2.1 Mouse, keyboard, light pen, touch screen and tablet input hardware
2.2 Raster and vector display architectures
2.3 Architecture of simple non-graphical display terminals
2.4 Architecture of graphical display terminals including frame buffer and colour manipulation techniques
2.5 Graphical architecture bottlenecks and interaction with the operating system
2.6 Specialized graphical processors and future development directions
3.0 Two-Dimensional Algorithms: (8 hours)
3.1 Direct and incremental line drawing algorithms
3.2 Bresenham algorithm
3.3 Two-dimensional world to screen viewing transformations
3.4 Two-dimensional rotation, scaling and translation transforms
3.5 Current transform concepts and advantages
3.6 Data structure concepts and CAD packages
4.0 Graphical Language: (6 hours)
4.1 Need for machine independent graphical languages
4.2 Discussion of available languages
4.3 Detailed discussion of graphical languages to be used in projects
5.0 Project Management: (4 hours)
5.1 Review of project management techniques
5.2 Review of program debugging techniques
6.0 Three-Dimensional Graphics: (10 hours)
6.1 Three-dimensional world to screen perspective viewing transform
6.2 Extension of two-dimensional transforms to three dimensions
6.3 Methods of generating non-planar surfaces
6.4 Hidden line and hidden surface removal techniques
6.5 Need for shading in engineering data visualization
6.6 Algorithms to simulate ambient, diffuse and specular reflections
6.7 Constant, Gouraud and phong shading models
6.8 Specialized and future three-dimensional display architectures
7.0 Project Development: (4 hours)
7.1 Project planning and description
7.2 Project development
7.3 Project report and presentation
Laboratory:
Computer graphics is best understood with "hands-on" experience. The laboratory exercises should consequently be directed toward introductory software concepts and familiarization with the graphical systems hardware architecture. Exercises might involve the development and comparison of various drawing algorithms or colour map animation. Exercises could be performed in either a high level language like c or a low level language like assembler.
Further exercises should familiarize the students with a high level graphics language which would then be used in the later laboratory periods in the development of a graphics project. This group project would be on an engineering topic preferably with both software and hardware aspects. The topic could be either initiated by the students or selected from a list provided by the instructor. An oral presentation with a demonstration should be part of the laboratory project report.
References:
1.0 J. D. Foley, S. K. Feiner and J. F. Hughes, "Computer Graphics - Principles and Practices", 2nd Edition, Addison-Wesley publishing Company, Don Mills, Ontario, Canada, 1989.
2.0 M. R. Smith and L. E. Turner, "EPLOT - A Machine Independent Graphical Interface", Department of Electrical and Computer Engineering, The University of Calgary. Documentation, example programs and diskette can be provided.
Probability and Statistics
Course Objectives
To provide the student with a practical knowledge of the principles and concepts of probability and statistics and their application to simple engineering problems.
1. Introduction and Descriptive Statistics: (4 hours)
1.1. An overview of probability and statistics
1.2. Pictorial and tabular methods in descriptive statistics
1.3. Measures of location: mean, median, quartiles, percentiles, etc.
1.4. Measures of variability
2. Probability: (4 hours)
2.1. Sample spaces and events
2.2. Axioms, interpretations and properties of probability
2.3. Counting techniques
2.4. Conditional probability
2.5. Independence
3. Discrete Random Variables and Probability Distributions: (6 hours)
3.1. Random variables
3.2. Probability distributions for random variables
3.3. Expected values of discrete random variables
3.4. The binomial probability distribution
3.5. The hypergeometric and negative binomial distributions
3.6. The Poisson probability distribution
4. Continuous Random Variables and Probability Distributions: (6 hours)
4.1. Continuous random variables and probability density functions
4.2. Cumulative distribution functions and expected values
4.3. The Normal Distribution
4.4. The Gamma Distribution
4.5. Chi-Squared Distribution
5. Joint Probability Distributions and Random Samples: (4 hours)
5.1. Jointly distributed random variables
5.2. Expected values, covariance and correlation
5.3. Sums and averages of random variables
5.4. The central limit theorem
6. Point Estimation: (2 hours)
6.1. Some general concepts of point estimation
6.2. Methods of point estimation
7. Interval Estimation: (3 hours)
7.1. Basic properties of Confidence Interval
7.2. Large-sample Confidence interval for population Mean and Proportion
7.3. A Confidence intervals for the mean of Normal Population
7.4. Confidence interval for the Variance and Standard Deviation of a Normal Population
8. Hypothesis Testing Procedures Based on a Single Sample: (5 hours)
8.1. Hypothesis and Test Procedure
8.2. Tests about the mean of a Normal Population
8.3. Large-sample Test for population mean
8.4. Large-sample Test for a population proportion
8.5. The t-test
8.6. Some comments on selecting a test procedure
9. Hypothesis Testing Based on Two Samples: (4 hours)
9.1. z-tests for differences between two population means
9.2. The sample t-test
9.3. Analysis of paired Data
9.4. Testing for differences between population proportions
10. Simple Linear Regression and Correlation: (4 hours)
10.1. The simple linear probabilistic model and principle of least square
10.2. Correlation, Correlation coefficient and coefficient of determination
10.3. Linear and non-linear Regression
10.4. Line of Regression and coefficient of Regression
11. The Analysis of categorical Data: (3 hours)
11.1. Goodness of Fit tests when category Probabilities are completely specified
11.1.1. Goodness of fit for composite Hypothesis
11.1.2. Two way contingency Tables
Textbook:
1.0 Jay L. Devore, “Probability and Statistics for Engineering and the Sciences”, Brooks/Cole publishing Company, Monterey, California, 1982.
Reference Book:
11 Murray R. Spiegel, "Theory and Problems of Probability and Statistics", McGraw Hill, Singapore
12 D. C. Sancheti and V. K. Kapoor, "Statistics", Sultan Chand and Sons, Educational Publishers, India
13 S. C. Gupta, "Fundamental of Statistics", Himalaya Publishing House, India
14 Jeetendra P. Aryal and Arun Gautam, "Quantitative Technique Vol. II", Vidhyarthy Pustak Bhandar, Nepal
15 S. C. Gupta and V. K. Kapoor, "Fundamentals of Mathematical Statistics", Sultan Chand & Son, India
To provide the student with a practical knowledge of the principles and concepts of probability and statistics and their application to simple engineering problems.
1. Introduction and Descriptive Statistics: (4 hours)
1.1. An overview of probability and statistics
1.2. Pictorial and tabular methods in descriptive statistics
1.3. Measures of location: mean, median, quartiles, percentiles, etc.
1.4. Measures of variability
2. Probability: (4 hours)
2.1. Sample spaces and events
2.2. Axioms, interpretations and properties of probability
2.3. Counting techniques
2.4. Conditional probability
2.5. Independence
3. Discrete Random Variables and Probability Distributions: (6 hours)
3.1. Random variables
3.2. Probability distributions for random variables
3.3. Expected values of discrete random variables
3.4. The binomial probability distribution
3.5. The hypergeometric and negative binomial distributions
3.6. The Poisson probability distribution
4. Continuous Random Variables and Probability Distributions: (6 hours)
4.1. Continuous random variables and probability density functions
4.2. Cumulative distribution functions and expected values
4.3. The Normal Distribution
4.4. The Gamma Distribution
4.5. Chi-Squared Distribution
5. Joint Probability Distributions and Random Samples: (4 hours)
5.1. Jointly distributed random variables
5.2. Expected values, covariance and correlation
5.3. Sums and averages of random variables
5.4. The central limit theorem
6. Point Estimation: (2 hours)
6.1. Some general concepts of point estimation
6.2. Methods of point estimation
7. Interval Estimation: (3 hours)
7.1. Basic properties of Confidence Interval
7.2. Large-sample Confidence interval for population Mean and Proportion
7.3. A Confidence intervals for the mean of Normal Population
7.4. Confidence interval for the Variance and Standard Deviation of a Normal Population
8. Hypothesis Testing Procedures Based on a Single Sample: (5 hours)
8.1. Hypothesis and Test Procedure
8.2. Tests about the mean of a Normal Population
8.3. Large-sample Test for population mean
8.4. Large-sample Test for a population proportion
8.5. The t-test
8.6. Some comments on selecting a test procedure
9. Hypothesis Testing Based on Two Samples: (4 hours)
9.1. z-tests for differences between two population means
9.2. The sample t-test
9.3. Analysis of paired Data
9.4. Testing for differences between population proportions
10. Simple Linear Regression and Correlation: (4 hours)
10.1. The simple linear probabilistic model and principle of least square
10.2. Correlation, Correlation coefficient and coefficient of determination
10.3. Linear and non-linear Regression
10.4. Line of Regression and coefficient of Regression
11. The Analysis of categorical Data: (3 hours)
11.1. Goodness of Fit tests when category Probabilities are completely specified
11.1.1. Goodness of fit for composite Hypothesis
11.1.2. Two way contingency Tables
Textbook:
1.0 Jay L. Devore, “Probability and Statistics for Engineering and the Sciences”, Brooks/Cole publishing Company, Monterey, California, 1982.
Reference Book:
11 Murray R. Spiegel, "Theory and Problems of Probability and Statistics", McGraw Hill, Singapore
12 D. C. Sancheti and V. K. Kapoor, "Statistics", Sultan Chand and Sons, Educational Publishers, India
13 S. C. Gupta, "Fundamental of Statistics", Himalaya Publishing House, India
14 Jeetendra P. Aryal and Arun Gautam, "Quantitative Technique Vol. II", Vidhyarthy Pustak Bhandar, Nepal
15 S. C. Gupta and V. K. Kapoor, "Fundamentals of Mathematical Statistics", Sultan Chand & Son, India
Engineering Economics
Course Objectives
To provide a knowledge of the basic tools and methodology of economic studies for evaluating engineering projects in private industry, in the public sector and in the utilities area.
1.0 Introduction (3 hours)
1.1 Essential business and accounting terminology
1.2 Definition of cash flow
1.3 Economic systems
2.0 Cost Classification and Analysis (5 hours)
2.1 The elements of cost
2.2 Classification of cost: overhead cost, prime cost
2.3 Cost variance analysis
2.4 Job and process costing
3.0 Interest and the Time Value of Money (6 hours)
3.1 Simple interest, compound interest, interest tables, interest charts
3.2 Present worth
3.3 Nominal and effective interest rates
3.4 Continuous compounding and continuous compounding formula
3.5 Interest calculations for uniform gradient
4.0 Basic Methodologies of Engineering Economic Studies (7 hours)
4.1 Present worth and annual worth methods
4.2 Future worth method
4.3 Internal rate of return method
4.4 Drawbacks of the internal rate of return method
4.5 External rate of return method
4.6 Minimum attractive rate of return method
4.7 The payback (payout) period method
5.0 Cost/Benefit Analysis (4 hours)
5.1 Conventional cost/benefit ratio
5.2 Modified cost/benefit ratio
5.3 Breakeven analysis
6.0 Investment Decisions: (8 hours)
6.1 Comparison of alternatives having same useful life
6.2 Comparison of alternatives having different useful life
6.3 Comparison of alternatives including or excluding the time value of money
6.4 Comparison of alternatives using the capitalized worth method
6.5 Definition of mutually exclusive investment alternatives in terms of
combinations of projects
6.6 Comparison of mutually exclusive alternatives
7.0 Risk Analysis: (4 hours)
7.1 Projects operating under conditions of certainty
7.2 Projects operating under conditions of uncertainty
7.3 Decision tree
7.4 Sensitivity analysis
8.0 Taxation System in Nepal: (3 hours)
8.1 Taxation law in Nepal
8.2 Depreciation rates for buildings, equipment, furniture, etc.
8.3 Recaptured depreciation
8.4 Taxes on normal gains
8.5 Taxes on capital gains
9.0 Demand Analysis and Sales Forecasting (5 hours)
9.1 Demand analysis
9.2 Correlation of price and consumption rate
9.3 Multiple correlation of price and consumption rate
9.4 Market research
9.5 Sales forecasting
9.6 Criteria for desirable sales forecasting procedures
9.7 Factors affecting accuracy of forecasting
Tutorials: 3 Assignments, 2 Quizzes, 3 Case Studies
Note:
The case studies will concentrate on economic analysis and selection of public projects, economic analysis and selection of private projects, risk analysis and demand analysis.
Textbook:
1.0 E. P. DeGramo, W. G. Sullivan and J. A. Bontadelli, 8th Edition, Macmillan publishing Company, ,1988.
References:
1.0 N. N. Borish and S. Kaplan, "Economic Analysis: For Engineering and Managerial Decision Making", McGraw-Hill.
To provide a knowledge of the basic tools and methodology of economic studies for evaluating engineering projects in private industry, in the public sector and in the utilities area.
1.0 Introduction (3 hours)
1.1 Essential business and accounting terminology
1.2 Definition of cash flow
1.3 Economic systems
2.0 Cost Classification and Analysis (5 hours)
2.1 The elements of cost
2.2 Classification of cost: overhead cost, prime cost
2.3 Cost variance analysis
2.4 Job and process costing
3.0 Interest and the Time Value of Money (6 hours)
3.1 Simple interest, compound interest, interest tables, interest charts
3.2 Present worth
3.3 Nominal and effective interest rates
3.4 Continuous compounding and continuous compounding formula
3.5 Interest calculations for uniform gradient
4.0 Basic Methodologies of Engineering Economic Studies (7 hours)
4.1 Present worth and annual worth methods
4.2 Future worth method
4.3 Internal rate of return method
4.4 Drawbacks of the internal rate of return method
4.5 External rate of return method
4.6 Minimum attractive rate of return method
4.7 The payback (payout) period method
5.0 Cost/Benefit Analysis (4 hours)
5.1 Conventional cost/benefit ratio
5.2 Modified cost/benefit ratio
5.3 Breakeven analysis
6.0 Investment Decisions: (8 hours)
6.1 Comparison of alternatives having same useful life
6.2 Comparison of alternatives having different useful life
6.3 Comparison of alternatives including or excluding the time value of money
6.4 Comparison of alternatives using the capitalized worth method
6.5 Definition of mutually exclusive investment alternatives in terms of
combinations of projects
6.6 Comparison of mutually exclusive alternatives
7.0 Risk Analysis: (4 hours)
7.1 Projects operating under conditions of certainty
7.2 Projects operating under conditions of uncertainty
7.3 Decision tree
7.4 Sensitivity analysis
8.0 Taxation System in Nepal: (3 hours)
8.1 Taxation law in Nepal
8.2 Depreciation rates for buildings, equipment, furniture, etc.
8.3 Recaptured depreciation
8.4 Taxes on normal gains
8.5 Taxes on capital gains
9.0 Demand Analysis and Sales Forecasting (5 hours)
9.1 Demand analysis
9.2 Correlation of price and consumption rate
9.3 Multiple correlation of price and consumption rate
9.4 Market research
9.5 Sales forecasting
9.6 Criteria for desirable sales forecasting procedures
9.7 Factors affecting accuracy of forecasting
Tutorials: 3 Assignments, 2 Quizzes, 3 Case Studies
Note:
The case studies will concentrate on economic analysis and selection of public projects, economic analysis and selection of private projects, risk analysis and demand analysis.
Textbook:
1.0 E. P. DeGramo, W. G. Sullivan and J. A. Bontadelli, 8th Edition, Macmillan publishing Company, ,1988.
References:
1.0 N. N. Borish and S. Kaplan, "Economic Analysis: For Engineering and Managerial Decision Making", McGraw-Hill.
Control Systems
Course Objectives
To provide information on feedback control Principles and to apply these concepts to typical physical processes. To introduce solution of typical problems.
1.0 Component Modeling, Linearization: (7 hours)
1.1 Differential equation and transfer function notations
1.2 State-space formulation of differential equations, matrix notation
1.3 Mechanical components: mass, spring, damper
1.4 Electrical components: inductance, capacitance, resistance, sources, motors, tachometers, transducers, operational amplifier circuits
1.5 Fluid and fluidic components
1.6 Thermal system components
1.7 Mixed systems
1.8 Linearized approximations of non-linear characteristics
2.0 System Transfer Functions and Responses: (10 hours)
2.1 Combinations of components to physical systems
2.2 Block diagram algebra and system reduction
2.3 Mason’s loop rules
2.4 Laplace transform analysis of systems with standard input functions - steps, ramps, impulses, sinusoids
2.5 Initial and final steady-state equilibria of systems
2.6 Principles and effects of feedback on steady-state gain, bandwidth, error magnitude, dynamic responses
3.0 Stability: (4 hours)
3.1 Heuristic interpretation of the conditions for stability of a feedback system
3.2 Characteristic equation, complex plane interpretation of stability, root locations and stability
3.3 Routh-Hurwitz criterion, eigenvalue criterion
3.4 Setting loop gain using the R-H criterion
3.5 Relative stability from complex plane axis shifting
4.0 Root Locus Method: (6 hours)
4.1 Relationship between root loci and time responses of systems
4.2 Rules for manual calculation and construction of root loci diagrams
4.3 Computer programs for root loci plotting, polynomial root finding and repeated eigenvalue methods
4.5 Derivative feedback compensation design with root locus
4.6 Setting controller parameters using root locus
4.7 Parameter change sensitivity analysis by root locus
5.0 Frequency Response Methods: (4 hours)
5.1 Frequency domain characterization of systems
5.2 Relationship between real and complex frequency response
5.3 Bode amplitude and phase plots
5.4 Effects of gain time constants on Bode diagrams
5.5 Stability from the Bode diagram
5.6 Correlation between Bode diagram plots and real time response: gain and
phase margins, damping ratio
5.7 Polar diagram representation, Nyquist plots
5.8 Correlation between Nyquist diagrams and real time response of systems: stability, relative stability, gain and phase margin, damping ratio
6.0 Simulation Using Microcomputer and Appropriate Software: (4 hours)
6.1 Role of simulation studies
6.2 Linear and non-linear simulations
6.3 TUTSIM as a simulation tool
7.0 Performance Specifications for Control Systems: (2 hours)
7.1 Time domain specifications: steady-state errors, response rates, error criteria,
hard and soft limits on responses, damping ratio, log decrement
7.2 Frequency domain specifications: band width, response amplitude ratio
8.0 Compensation and Design: (8 hours)
8.1 Application of root locus, frequency response and simulation in design
8.2 Meeting steady-state error criteria
8.3 Feedback compensation
8.4 Lead, lag, and lead-lag compensation
8.5 PID controllers
Laboratory:
1.0 Identification of Control System Components
- establish transfer functions and block diagram of electromechanical servo
system for position and velocity control
2.0 Open and Closed Loop Performance of Servo Position Control System
- note effects of loop gain on response
- record step responses and compare with those predicated by theory
3.0 Open and Closed Loop Performance of Servo Velocity Control System
- note effects of loop gain on response
- record step responses and compare with those predicated by theory
4.0 Simulation Study of Feedback System Using TUTSIM
- set up simulation model of servo system using TUTSIM on a microcomputer
and repeat response tests
5.0 Design of a PID Controller
- design of a PID controller for position servo
- check design with TUTSIM
- check design on operating system
6.0 Non-Electrical Control System
- study of a hydraulic or pneumatic servo system
Textbook:
1.0 K. Ogata, “Modern Control Engineering”, 2nd Edition, Prentice Hall, Englewood Cliffs, New Jersey, 1990.
To provide information on feedback control Principles and to apply these concepts to typical physical processes. To introduce solution of typical problems.
1.0 Component Modeling, Linearization: (7 hours)
1.1 Differential equation and transfer function notations
1.2 State-space formulation of differential equations, matrix notation
1.3 Mechanical components: mass, spring, damper
1.4 Electrical components: inductance, capacitance, resistance, sources, motors, tachometers, transducers, operational amplifier circuits
1.5 Fluid and fluidic components
1.6 Thermal system components
1.7 Mixed systems
1.8 Linearized approximations of non-linear characteristics
2.0 System Transfer Functions and Responses: (10 hours)
2.1 Combinations of components to physical systems
2.2 Block diagram algebra and system reduction
2.3 Mason’s loop rules
2.4 Laplace transform analysis of systems with standard input functions - steps, ramps, impulses, sinusoids
2.5 Initial and final steady-state equilibria of systems
2.6 Principles and effects of feedback on steady-state gain, bandwidth, error magnitude, dynamic responses
3.0 Stability: (4 hours)
3.1 Heuristic interpretation of the conditions for stability of a feedback system
3.2 Characteristic equation, complex plane interpretation of stability, root locations and stability
3.3 Routh-Hurwitz criterion, eigenvalue criterion
3.4 Setting loop gain using the R-H criterion
3.5 Relative stability from complex plane axis shifting
4.0 Root Locus Method: (6 hours)
4.1 Relationship between root loci and time responses of systems
4.2 Rules for manual calculation and construction of root loci diagrams
4.3 Computer programs for root loci plotting, polynomial root finding and repeated eigenvalue methods
4.5 Derivative feedback compensation design with root locus
4.6 Setting controller parameters using root locus
4.7 Parameter change sensitivity analysis by root locus
5.0 Frequency Response Methods: (4 hours)
5.1 Frequency domain characterization of systems
5.2 Relationship between real and complex frequency response
5.3 Bode amplitude and phase plots
5.4 Effects of gain time constants on Bode diagrams
5.5 Stability from the Bode diagram
5.6 Correlation between Bode diagram plots and real time response: gain and
phase margins, damping ratio
5.7 Polar diagram representation, Nyquist plots
5.8 Correlation between Nyquist diagrams and real time response of systems: stability, relative stability, gain and phase margin, damping ratio
6.0 Simulation Using Microcomputer and Appropriate Software: (4 hours)
6.1 Role of simulation studies
6.2 Linear and non-linear simulations
6.3 TUTSIM as a simulation tool
7.0 Performance Specifications for Control Systems: (2 hours)
7.1 Time domain specifications: steady-state errors, response rates, error criteria,
hard and soft limits on responses, damping ratio, log decrement
7.2 Frequency domain specifications: band width, response amplitude ratio
8.0 Compensation and Design: (8 hours)
8.1 Application of root locus, frequency response and simulation in design
8.2 Meeting steady-state error criteria
8.3 Feedback compensation
8.4 Lead, lag, and lead-lag compensation
8.5 PID controllers
Laboratory:
1.0 Identification of Control System Components
- establish transfer functions and block diagram of electromechanical servo
system for position and velocity control
2.0 Open and Closed Loop Performance of Servo Position Control System
- note effects of loop gain on response
- record step responses and compare with those predicated by theory
3.0 Open and Closed Loop Performance of Servo Velocity Control System
- note effects of loop gain on response
- record step responses and compare with those predicated by theory
4.0 Simulation Study of Feedback System Using TUTSIM
- set up simulation model of servo system using TUTSIM on a microcomputer
and repeat response tests
5.0 Design of a PID Controller
- design of a PID controller for position servo
- check design with TUTSIM
- check design on operating system
6.0 Non-Electrical Control System
- study of a hydraulic or pneumatic servo system
Textbook:
1.0 K. Ogata, “Modern Control Engineering”, 2nd Edition, Prentice Hall, Englewood Cliffs, New Jersey, 1990.
Microprocessor Based Instrumentation
Objectives
To introduce and apply the knowledge of microprocessor, A/D, D/A converter to design instrumentation system. Also to provide the concept on interfacing with microprocessor based system and circuit design techniques.
1. Interfacing Concept (4 hours)
1.1. Types of interfacing
1.2. Address decoding
1.3. Input/Output registers
1.4. PC Interfacing techniques
2. Methods of parallel data transfer (8 hours)
2.1. Simple input and output
2.2. Single Handshake I/O
2.3. Double Handshake I/O
2.4. 8255 and interface devices, block diagram, internal structures, and modes of initialization, and interfacing to a microprocessor
2.5. Microcomputer on instrumentation design
2.6. Interrupt driven data transfer
3. Interfacing A/D and D/A Converters (8 hours)
3.1. Introduction
3.2. General terms involved in A/D and D/A converters
3.3. Functional block diagram of 8-bit and 12-bit A/D and D/A converters
3.4. Selection of A/D and D/A converters based on design requirements
4. Serial and Parallel Data Communication (8 hours)
4.1. Synchronous and Asynchronous data communication
4.2. Parity and Baud rates
4.3. Serial Interface Device
4.4. RS-232 serial data standard and interface
4.5. Simplex, half duplex and full duplex operation using RS-232 port
4.6. Connection to printer and zero modem
5. Transmission and telemetry of data (5 hours)
5.1. Analog and Digital Transmission
5.2. Transmission schemes
5.2.1. Electrical carrier
5.2.2. Fiber optic
5.2.3. Satellite
5.3. Data loggers
6. Circuit Design and Layout (4 hours)
6.1. Converting requirements into design
6.2. Reliability, fault tolerance, and high speed design
6.3. Impedance matching
6.4. Standard data bus and networks
6.5. Reset and power failure detection
6.6. Redundant Architecture
6.7. Timing
7. Grounding and shielding (4 hours)
7.1. Outline for grounding and shielding
7.2. Single point grounding and grouped loop
7.3. Noise, noise coupling mechanism and prevention
7.4. Filtering and smoothing
7.5. Different kinds of shielding mechanism
7.6. Protecting against electrostatic discharge
7.7. Line filters, isolators and transient suppressors
8. Software for instrumentation and control applications (4 hours)
8.1. Types of software, selection and purchase
8.2. Software models and their limitations
8.3. Software reliability
8.4. Fault tolerance
8.5. Software bugs and testing
Laboratory Exercises :
The laboratory exercises deal with 8-bit or 12-bit A/D and D/A converters and communication with PC to PC using RS-232 port. There will be six exercises related with instrumentation.
1. Assembly language program
2. Simple data transfer using PPI
3. Handshake transfer using PPI
4. Interfacing of A/D converter using PPI
5. Interfacing of A/D converter using RS232 port
6. Interfacing of A/D converter using Printer port
7. Demonstration of other interfacing techniques and devices
8. Group project based on interfacing techniques and instrumentation
References:
1. D.V. Hall, “Microprocessor and Interfacing programming and hardware
2. K.R. Fowler, “Electronic Instrument Design”
3. E.O. Duebelin, “Measurement system application and design”
4. Linear circuit data book dealing with A/D and D/A converters
To introduce and apply the knowledge of microprocessor, A/D, D/A converter to design instrumentation system. Also to provide the concept on interfacing with microprocessor based system and circuit design techniques.
1. Interfacing Concept (4 hours)
1.1. Types of interfacing
1.2. Address decoding
1.3. Input/Output registers
1.4. PC Interfacing techniques
2. Methods of parallel data transfer (8 hours)
2.1. Simple input and output
2.2. Single Handshake I/O
2.3. Double Handshake I/O
2.4. 8255 and interface devices, block diagram, internal structures, and modes of initialization, and interfacing to a microprocessor
2.5. Microcomputer on instrumentation design
2.6. Interrupt driven data transfer
3. Interfacing A/D and D/A Converters (8 hours)
3.1. Introduction
3.2. General terms involved in A/D and D/A converters
3.3. Functional block diagram of 8-bit and 12-bit A/D and D/A converters
3.4. Selection of A/D and D/A converters based on design requirements
4. Serial and Parallel Data Communication (8 hours)
4.1. Synchronous and Asynchronous data communication
4.2. Parity and Baud rates
4.3. Serial Interface Device
4.4. RS-232 serial data standard and interface
4.5. Simplex, half duplex and full duplex operation using RS-232 port
4.6. Connection to printer and zero modem
5. Transmission and telemetry of data (5 hours)
5.1. Analog and Digital Transmission
5.2. Transmission schemes
5.2.1. Electrical carrier
5.2.2. Fiber optic
5.2.3. Satellite
5.3. Data loggers
6. Circuit Design and Layout (4 hours)
6.1. Converting requirements into design
6.2. Reliability, fault tolerance, and high speed design
6.3. Impedance matching
6.4. Standard data bus and networks
6.5. Reset and power failure detection
6.6. Redundant Architecture
6.7. Timing
7. Grounding and shielding (4 hours)
7.1. Outline for grounding and shielding
7.2. Single point grounding and grouped loop
7.3. Noise, noise coupling mechanism and prevention
7.4. Filtering and smoothing
7.5. Different kinds of shielding mechanism
7.6. Protecting against electrostatic discharge
7.7. Line filters, isolators and transient suppressors
8. Software for instrumentation and control applications (4 hours)
8.1. Types of software, selection and purchase
8.2. Software models and their limitations
8.3. Software reliability
8.4. Fault tolerance
8.5. Software bugs and testing
Laboratory Exercises :
The laboratory exercises deal with 8-bit or 12-bit A/D and D/A converters and communication with PC to PC using RS-232 port. There will be six exercises related with instrumentation.
1. Assembly language program
2. Simple data transfer using PPI
3. Handshake transfer using PPI
4. Interfacing of A/D converter using PPI
5. Interfacing of A/D converter using RS232 port
6. Interfacing of A/D converter using Printer port
7. Demonstration of other interfacing techniques and devices
8. Group project based on interfacing techniques and instrumentation
References:
1. D.V. Hall, “Microprocessor and Interfacing programming and hardware
2. K.R. Fowler, “Electronic Instrument Design”
3. E.O. Duebelin, “Measurement system application and design”
4. Linear circuit data book dealing with A/D and D/A converters
Computer Architecture and Design
Objectives
To provide basic architectural and designing concepts of computers. This course gives comprehensive view of basic computer architecture.
1. Central Processing Unit : ( 8 hours)
1.1 Hardwired and Microprogramed
1.2 Arithmetic Logic Unit
1.3 Instruction
1.4 Addressing Modes
1.5 Data transfer and manipulation program control ( status, branch, subroutine call, interrupt )
2. Arithmetic Processor Design : ( 8 hours)
2.2 Addition and Subtraction algorithm
2.3 Multiplication and Division algorithm
2.4 Logical Operation
2.5 Processor Configuration
2.6 Design of Control Unit
3. Memory System : (10 hours )
3.1. Microcomputer memory
3.2. Characterization of Memory System
3.3. Random Access Memory (DRAM, SRAM)
3.4. ROM
3.5. Memory Hierarchy
3.6. Memory Mapping
4. Input / Output Organization : ( 10 hours )
4.1. Peripheral devices
4.2. Basic Input/Output Interface
4.3. Input/Output Technique (Asynchronous Data transfer, DMA, Priority Interrupt)
4.4. Input/Output Processor
4.5. Data Command Processor
5. The PnP System Architecture: ( 9 hours )
5.1. ISA, PCI and PCMCIA
5.2. PnP Device configuration
5.3. PnP Card Resource Requirements
5.4. PnP BIOS and OS
5.5. PnP POST and Device ROMS
5.6. PnP BIOS Services
Laboratory Exercises:
The laboratory exercises shall be Hands-on Computer architecture project aiming to familiarize students with processor, control, memory, and I/O systems.
References :
1. M. Mano, “ Computer System Architecture”
2. A. Tanenbaum, “ Structured Computer Organization”, 3rd Edition, Prentice Hall, 1990
3. M. Morris Mano, Charles R. Kime, “ Logic and Computer Design Fundamentals”, PHI
4. Tom Shanley, “ Plug and Play System Architecture”, Addison-Wesley publishing company
5. William Stallings, “ Computer Organization and Architecture”, PHI
To provide basic architectural and designing concepts of computers. This course gives comprehensive view of basic computer architecture.
1. Central Processing Unit : ( 8 hours)
1.1 Hardwired and Microprogramed
1.2 Arithmetic Logic Unit
1.3 Instruction
1.4 Addressing Modes
1.5 Data transfer and manipulation program control ( status, branch, subroutine call, interrupt )
2. Arithmetic Processor Design : ( 8 hours)
2.2 Addition and Subtraction algorithm
2.3 Multiplication and Division algorithm
2.4 Logical Operation
2.5 Processor Configuration
2.6 Design of Control Unit
3. Memory System : (10 hours )
3.1. Microcomputer memory
3.2. Characterization of Memory System
3.3. Random Access Memory (DRAM, SRAM)
3.4. ROM
3.5. Memory Hierarchy
3.6. Memory Mapping
4. Input / Output Organization : ( 10 hours )
4.1. Peripheral devices
4.2. Basic Input/Output Interface
4.3. Input/Output Technique (Asynchronous Data transfer, DMA, Priority Interrupt)
4.4. Input/Output Processor
4.5. Data Command Processor
5. The PnP System Architecture: ( 9 hours )
5.1. ISA, PCI and PCMCIA
5.2. PnP Device configuration
5.3. PnP Card Resource Requirements
5.4. PnP BIOS and OS
5.5. PnP POST and Device ROMS
5.6. PnP BIOS Services
Laboratory Exercises:
The laboratory exercises shall be Hands-on Computer architecture project aiming to familiarize students with processor, control, memory, and I/O systems.
References :
1. M. Mano, “ Computer System Architecture”
2. A. Tanenbaum, “ Structured Computer Organization”, 3rd Edition, Prentice Hall, 1990
3. M. Morris Mano, Charles R. Kime, “ Logic and Computer Design Fundamentals”, PHI
4. Tom Shanley, “ Plug and Play System Architecture”, Addison-Wesley publishing company
5. William Stallings, “ Computer Organization and Architecture”, PHI
Theory of Computation
Course Objective
To provide an idea of the theory of formal languages, automata and complexity theory.
1.0 Finite automata and regular expression: ( 5 hours)
1.1 Finite state system
1.2 Non-deterministic finite automata
1.3 Regular expression
2.0 Properties of regular sets: ( 4 hours)
2.1 The plumbing lemma for regular sets
2.2 Closure properties of regular sets
2.3 Decision algorithms for regular sets
3.0 Context-free grammers: ( 8 hours)
3.1 Derivative trees
3.2 Simplification of context-free grammars
3.3 Normal forms
4.0 Pushdown automata: ( 4 hours)
4.1 Pushdown automata and context-free grammars
5.0 Properties of context-free languages: ( 6 hours )
5.1 The pumping lemma for CFL's
5.2 Closure properties of CFL's
5.3 Decision algorithms for CFL's
6.0 Turing Machines: (5 hours)
6.1 Computable languages and functions
6.2 Church's hypothesis
7. Undecidability (5 hours )
7.1 Properties of recursive and recursively languages
7.2 Universal turing machines and undecidable problem
7.3 Recursive function theory
8. Computational complexity theory: ( 4 hours)
9. Intractable problems: ( 4 hours)
9.1 Computable languages and functions
9.2 NP-complete problems
References:
1. H.R. Lewis, and C.H. Papadimitriou, " Element of the theory of Computation". Eastern Economy Edition, Prentice Hall of India
2. R. McNaughton, " Elementary Computability, Formal languages and Automata", Prentice Hall of India
3. E. Engeler, " Introduction to the Theory of Computation", Academic Press
To provide an idea of the theory of formal languages, automata and complexity theory.
1.0 Finite automata and regular expression: ( 5 hours)
1.1 Finite state system
1.2 Non-deterministic finite automata
1.3 Regular expression
2.0 Properties of regular sets: ( 4 hours)
2.1 The plumbing lemma for regular sets
2.2 Closure properties of regular sets
2.3 Decision algorithms for regular sets
3.0 Context-free grammers: ( 8 hours)
3.1 Derivative trees
3.2 Simplification of context-free grammars
3.3 Normal forms
4.0 Pushdown automata: ( 4 hours)
4.1 Pushdown automata and context-free grammars
5.0 Properties of context-free languages: ( 6 hours )
5.1 The pumping lemma for CFL's
5.2 Closure properties of CFL's
5.3 Decision algorithms for CFL's
6.0 Turing Machines: (5 hours)
6.1 Computable languages and functions
6.2 Church's hypothesis
7. Undecidability (5 hours )
7.1 Properties of recursive and recursively languages
7.2 Universal turing machines and undecidable problem
7.3 Recursive function theory
8. Computational complexity theory: ( 4 hours)
9. Intractable problems: ( 4 hours)
9.1 Computable languages and functions
9.2 NP-complete problems
References:
1. H.R. Lewis, and C.H. Papadimitriou, " Element of the theory of Computation". Eastern Economy Edition, Prentice Hall of India
2. R. McNaughton, " Elementary Computability, Formal languages and Automata", Prentice Hall of India
3. E. Engeler, " Introduction to the Theory of Computation", Academic Press
Data Structure and Algorithm Analysis
Objectives: Course objectives is to provide fundamental knowledge of Data Structure and its
design. To provide the knowledge of various algorithms.
1.0 Concept of data structure ( 2 hours)
1.1 Abstract Data Type
1.2 Implementation of Data structure
2.0 The Stack and Queue ( 6 hours)
2.1 Stack as an ADT
2.2 Stack operation
2.3 Stack application: Evaluation of Infix, Postfix, and Prefix expressions
2.4 Queue as an ADT
2.5 Operations in queue, Enqueue and Dequeue
2.6 Linear and circular queue
2.7 Priority queue
3.0 List ( 3 hours)
3.1 Definition
3.1.1 Static and dynamic list structure
3.1.2 Array implementation of lists
3.1.3 Queues as list
4.0 Linked lists ( 6 hours)
4.1 Link list as an ADT
4.2 Dynamic implementation
4.3 Operations in linked list
4.4 Linked stacks and Queues
4.5 Doubly linked lists and its applications
5.0 Recursion ( 4 hours)
5.1 Principle of recursion
5.2 TOH and Fibonacci sequence
5.3 Applications of recursion
6.0 Trees ( 6 hours)
6.1 Concept
6.2 Operation in Binary tree
6.3 Tree search, insertion/deletions
6.4 Tree traversals (pre-order, post-order and in-order).
6.5 Height, level, and depth of a tree
6.6 AVL balanced trees and Balancing algorithm
6.7 The Huffman algorithm
6.8 B-Tree
7.0 Sorting ( 5 hours)
7.1 Types of sorting: internal and external
7.2 Insertion and selection sort
7.3 Exchange sort
7.4 Merge and Radix sort
7.5 Shell sort
7.6 Heap sort as priority queue
7.7 Big 'O' notation and Efficiency of sorting
8.0 Searching ( 5 hours)
8.1 Search technique
8.2 Sequential, Binary and Tree search
8.3 General search tree
8.4 Hashing
8.4.1 Hash function and hash tables
8.4.2 Collision resolution technique
9.0 Graphs ( 8 hours)
9.1 Representation and applications
9.2 Graphs as an ADT
9.3 Transitive closure
9.4 Warshall's algorithm
9.5 Graphs types
9.6 Graph traversal and Spanning forests
9.6.1 Depth First Traversal and Breadth First traversal
9.6.2 Topological sorting: Depth first, breadth first topological sorting
9.6.3 Minimum spanning trees
9.6.4 Kruskal's and Round-Robin algorithms
9.7 Shortest-path algorithm
9.7.1 Greedy algorithm
9.7.2 Dijkstra's Algorithm
Laboratory:
There shall be 12 lab exercises based on C or C++
1. Implementations of stack
2. Implementations of linear and circular queues
3. Solutions of TOH and Finbonacci Recursion
4. Implementations of linked list: singly and doubly linked
5. Implementation of trees: AVL trees, Balancing of AVL
6. Implementation of Merge sort
7. Implementation of search: sequential, Tree and Binary
8. Implementation of Graphs: Graph traversals
9. Implementation of hashing
10. Implementations of Heap
References:
1. Y. Langsam, M.J. Augenstein and A. M. Tenenbaum, "Data Structures using C and C++", PHI
2. G. W. Rowe, "Introduction to Data Structure and Algorithms with C and C++", PHI
3. R.L. Kruse, B. P. Leung, C. L. Tondo, "Data Structure and Program design in C", PHI
4. G. Brassard and P. Bratley, "Fundamentals of Algorithms", PHI
design. To provide the knowledge of various algorithms.
1.0 Concept of data structure ( 2 hours)
1.1 Abstract Data Type
1.2 Implementation of Data structure
2.0 The Stack and Queue ( 6 hours)
2.1 Stack as an ADT
2.2 Stack operation
2.3 Stack application: Evaluation of Infix, Postfix, and Prefix expressions
2.4 Queue as an ADT
2.5 Operations in queue, Enqueue and Dequeue
2.6 Linear and circular queue
2.7 Priority queue
3.0 List ( 3 hours)
3.1 Definition
3.1.1 Static and dynamic list structure
3.1.2 Array implementation of lists
3.1.3 Queues as list
4.0 Linked lists ( 6 hours)
4.1 Link list as an ADT
4.2 Dynamic implementation
4.3 Operations in linked list
4.4 Linked stacks and Queues
4.5 Doubly linked lists and its applications
5.0 Recursion ( 4 hours)
5.1 Principle of recursion
5.2 TOH and Fibonacci sequence
5.3 Applications of recursion
6.0 Trees ( 6 hours)
6.1 Concept
6.2 Operation in Binary tree
6.3 Tree search, insertion/deletions
6.4 Tree traversals (pre-order, post-order and in-order).
6.5 Height, level, and depth of a tree
6.6 AVL balanced trees and Balancing algorithm
6.7 The Huffman algorithm
6.8 B-Tree
7.0 Sorting ( 5 hours)
7.1 Types of sorting: internal and external
7.2 Insertion and selection sort
7.3 Exchange sort
7.4 Merge and Radix sort
7.5 Shell sort
7.6 Heap sort as priority queue
7.7 Big 'O' notation and Efficiency of sorting
8.0 Searching ( 5 hours)
8.1 Search technique
8.2 Sequential, Binary and Tree search
8.3 General search tree
8.4 Hashing
8.4.1 Hash function and hash tables
8.4.2 Collision resolution technique
9.0 Graphs ( 8 hours)
9.1 Representation and applications
9.2 Graphs as an ADT
9.3 Transitive closure
9.4 Warshall's algorithm
9.5 Graphs types
9.6 Graph traversal and Spanning forests
9.6.1 Depth First Traversal and Breadth First traversal
9.6.2 Topological sorting: Depth first, breadth first topological sorting
9.6.3 Minimum spanning trees
9.6.4 Kruskal's and Round-Robin algorithms
9.7 Shortest-path algorithm
9.7.1 Greedy algorithm
9.7.2 Dijkstra's Algorithm
Laboratory:
There shall be 12 lab exercises based on C or C++
1. Implementations of stack
2. Implementations of linear and circular queues
3. Solutions of TOH and Finbonacci Recursion
4. Implementations of linked list: singly and doubly linked
5. Implementation of trees: AVL trees, Balancing of AVL
6. Implementation of Merge sort
7. Implementation of search: sequential, Tree and Binary
8. Implementation of Graphs: Graph traversals
9. Implementation of hashing
10. Implementations of Heap
References:
1. Y. Langsam, M.J. Augenstein and A. M. Tenenbaum, "Data Structures using C and C++", PHI
2. G. W. Rowe, "Introduction to Data Structure and Algorithms with C and C++", PHI
3. R.L. Kruse, B. P. Leung, C. L. Tondo, "Data Structure and Program design in C", PHI
4. G. Brassard and P. Bratley, "Fundamentals of Algorithms", PHI
Communication II (English)
Course Description:
This course is designed for the B. E. Level I year II part students of Civil, Mechanical and III
year I part students of Electrical, Electronics and Computer. It intends to develop and
strengthen in students the communication skills in the English language with emphasis on
writing, reading and speaking.
Course Objectives:
This course intends to develop skills in:
- understanding and using varieties of English.
- public speaking and mass communication.
- preparing and conducting meeting.
- faster / extensive reading.
- writing description, technical talk, seminar paper.
- writing technical reports.
1. Varieties of English: (1 hour)
1.1 British / American.
1.2 Formal / Informal.
1.3 Spoken / Written.
1.4 Polite / Familiar and Impersonal.
2. Mass communication:
2.1 Presentation of talk
2.2 Presentation of seminar paper.
2.3 Conduction of meeting.
3. Extensive reading (4 hours)
3.1 Scanning
3.2 Skimming
4. Writing (10 hours)
4.1 Writing description: Landscape, technical processes, mechanical / electrical
objects, maps, graphs, charts.
4.2 Preparing note and writing talk.
4.3 Writing seminar paper
4.4 Writing agenda, minute and notice.
4.5 Writing technical reports.
Evaluation Scheme:
A) Internal Assessment:
Report writing - 4 marks
Technical talk / Seminar paper or meeting - 4 marks
Attendance - 2 marks
Total: 10 marks
B) Semester Exam:
Varieties - 4 marks
reading - 8 marks
Description writing - 4 marks
Seminar paper / talk - 8 marks
Meeting - 6 marks
Report writing - 10 marks
Total: 40 marks
Total (A + B) 50 marks
Reference Books:
1.0 Anne Eisenberg, "Effective Technical Communication", McGraw - Hill. 1982.
2.0 K. W. Hope and T.E. Pearsall, "Reporting Technical Information", 5th Edition Macmillan Publishing Company, New York, 1984.
This course is designed for the B. E. Level I year II part students of Civil, Mechanical and III
year I part students of Electrical, Electronics and Computer. It intends to develop and
strengthen in students the communication skills in the English language with emphasis on
writing, reading and speaking.
Course Objectives:
This course intends to develop skills in:
- understanding and using varieties of English.
- public speaking and mass communication.
- preparing and conducting meeting.
- faster / extensive reading.
- writing description, technical talk, seminar paper.
- writing technical reports.
1. Varieties of English: (1 hour)
1.1 British / American.
1.2 Formal / Informal.
1.3 Spoken / Written.
1.4 Polite / Familiar and Impersonal.
2. Mass communication:
2.1 Presentation of talk
2.2 Presentation of seminar paper.
2.3 Conduction of meeting.
3. Extensive reading (4 hours)
3.1 Scanning
3.2 Skimming
4. Writing (10 hours)
4.1 Writing description: Landscape, technical processes, mechanical / electrical
objects, maps, graphs, charts.
4.2 Preparing note and writing talk.
4.3 Writing seminar paper
4.4 Writing agenda, minute and notice.
4.5 Writing technical reports.
Evaluation Scheme:
A) Internal Assessment:
Report writing - 4 marks
Technical talk / Seminar paper or meeting - 4 marks
Attendance - 2 marks
Total: 10 marks
B) Semester Exam:
Varieties - 4 marks
reading - 8 marks
Description writing - 4 marks
Seminar paper / talk - 8 marks
Meeting - 6 marks
Report writing - 10 marks
Total: 40 marks
Total (A + B) 50 marks
Reference Books:
1.0 Anne Eisenberg, "Effective Technical Communication", McGraw - Hill. 1982.
2.0 K. W. Hope and T.E. Pearsall, "Reporting Technical Information", 5th Edition Macmillan Publishing Company, New York, 1984.
Numerical Methods
Course Objectives
To present the theory of numerical computational procedures for solving engineering problems. Solution of ordinary and partial differential equations will be included.
1.0 Solution of Nonlinear Equations: (10 hours)
1.1 Review of calculus, continuity, differentiability, intermediate value theorem, Taylor’s theorem
1.2 Absolute, relative, and round off errors, error bounds for computational errors
1.3 Bisection method, its error bounds and convergence
1.4 Newton’s method, secant method and their convergence
1.5 Fixed point iteration, its convergence properties,
1.6 Zeros of polynomials by Horner’s method
2.0 Interpolation and Approximation: (10 hours)
2.1 Taylor’s polynomial approximation, Lagrange’s interpolation
2.2 Newton’s interpolation and divided differences
2.3 Iterative interpolation
2.4 Cubic spline interpolation
2.5 Least squares method of fitting continuous and discrete data or functions
3.0 Numerical Differentiation and Integration: (5 hours)
3.1 Numerical differentiation formulas
3.2 Newton-Cote’s numerical integration formulas, composite numerical integration
3.3 Romberg integration algorithm
3.4 Gaussian integration formulas
4.0 Linear Algebraic Equations: (10 hours)
4.1 Review of the properties of matrices
4.2 Matrix form of Gaussian elimination, pivoting strategies, ill-conditioning
4.3 Cholesky’s and related algorithms for matrix factorization
4.3 Eigen values and eigen vectors and the power method
5.0 Solution of ordinary Differential Equations: (7 hours)
5.1 Euler’s method for solving ordinary differential equations of 1st order and other related methods
5.2 Runge-Kutta methods
5.3 Extension to higher order equations
5.4 Initial value problems
5.5 Boundary value problems
6.0 Solution of partial Differential Equations: (3 hours)
6.1 Introduction to the solution of partial differential equations
6.2 Engineering examples
Reference Books:
1.0 W. Cheney and D. Kincaid, “Numerical Mathematics and computing”, Edition, Brooks/Cole publishing Co.,1985.
2.0 C.F. Gerald and P. O. Wheatley, “Applied Numerical Analysis”, 4th Edition, Addison-Wesley Publishing Company, New York.
3.0 S. Yakowitz and F. Szidarovszky, “An Introduction to Numerical Computations”, 2nd Edition, Macmillan publishing Co., New York.
Reference Book for Programs in C:
1.0 W.H. press, B. P. Flannery et. al., “Numerical Recipes in C”, 1st Edition, Cambridge Press,1988.
To present the theory of numerical computational procedures for solving engineering problems. Solution of ordinary and partial differential equations will be included.
1.0 Solution of Nonlinear Equations: (10 hours)
1.1 Review of calculus, continuity, differentiability, intermediate value theorem, Taylor’s theorem
1.2 Absolute, relative, and round off errors, error bounds for computational errors
1.3 Bisection method, its error bounds and convergence
1.4 Newton’s method, secant method and their convergence
1.5 Fixed point iteration, its convergence properties,
1.6 Zeros of polynomials by Horner’s method
2.0 Interpolation and Approximation: (10 hours)
2.1 Taylor’s polynomial approximation, Lagrange’s interpolation
2.2 Newton’s interpolation and divided differences
2.3 Iterative interpolation
2.4 Cubic spline interpolation
2.5 Least squares method of fitting continuous and discrete data or functions
3.0 Numerical Differentiation and Integration: (5 hours)
3.1 Numerical differentiation formulas
3.2 Newton-Cote’s numerical integration formulas, composite numerical integration
3.3 Romberg integration algorithm
3.4 Gaussian integration formulas
4.0 Linear Algebraic Equations: (10 hours)
4.1 Review of the properties of matrices
4.2 Matrix form of Gaussian elimination, pivoting strategies, ill-conditioning
4.3 Cholesky’s and related algorithms for matrix factorization
4.3 Eigen values and eigen vectors and the power method
5.0 Solution of ordinary Differential Equations: (7 hours)
5.1 Euler’s method for solving ordinary differential equations of 1st order and other related methods
5.2 Runge-Kutta methods
5.3 Extension to higher order equations
5.4 Initial value problems
5.5 Boundary value problems
6.0 Solution of partial Differential Equations: (3 hours)
6.1 Introduction to the solution of partial differential equations
6.2 Engineering examples
Reference Books:
1.0 W. Cheney and D. Kincaid, “Numerical Mathematics and computing”, Edition, Brooks/Cole publishing Co.,1985.
2.0 C.F. Gerald and P. O. Wheatley, “Applied Numerical Analysis”, 4th Edition, Addison-Wesley Publishing Company, New York.
3.0 S. Yakowitz and F. Szidarovszky, “An Introduction to Numerical Computations”, 2nd Edition, Macmillan publishing Co., New York.
Reference Book for Programs in C:
1.0 W.H. press, B. P. Flannery et. al., “Numerical Recipes in C”, 1st Edition, Cambridge Press,1988.
Sunday, September 14, 2008
Electrical Machines I
Course Objectives
To introduce and apply electric magnetic circuit concepts to electromechanical energy conversion to explain and predict the performance of basic devices such as transformer, electromagnets and rotating electric machines.
1.0 Magnetic Circuit Concepts: (5 hours)
1.1 Ohm’s law for magnetic circuits
1.2 Magnetic potential sources, electric current, permanent magnetic materials
1.3 Ferromagnetic materials, magnetic saturation, non-linearity, Hysterisis
1.4 Series and parallel magnetic circuits
1.5 Effect of air gaps
1.6 DC and AC excitation, Hysterisis and eddy currents, energy loss, laminations, sintered core
1.7 Self and mutual inductances
1.8 Force due to magnetic effects, electromagnets.
2.0 Transformer: (8 hours)
2.1 Magnetic circuits of transformer, transformer steels
2.2 Ideal transformers
2.3 Mutual inductance and coupled model of transformers
2.4 Air core Vs iron core transformers
2.5 Two winding transformers
2.6 Equivalent circuit of power transformers
2.7 Evaluation of Equivalent circuit parameters from open circuit and short circuit tests
2.8 Excitation consideration: core losses, current harmonics
2.9 Equivalent circuit calculation: voltage regulation and efficiency
2.10 Polarity of windings
2.11 Series and parallel connection of windings
2.12 Audio transformers Vs power transformers
2.13 Auto transformers
2.14 Instrumentation transformers – PTs, CTs
2.15 Three phase transformer connection
2.16 V-V and open delta connection
2.17 T-T connections
2.18 Scott 3 phase to 2 phase connections.
3.0 Principles of Electromechanical Energy Conversion: (2 hours)
3.1 Energy storage and retrieval from magnetic fields
3.2 Lenz’s law, Faraday’s laws, Fleming’s rule
3.3 Force and torque due to magnetic fields, principle of virtual work, the coenergy function
3.4 Interaction between electric, magnetic and mechanical systems
4.0 General Aspects of Modeling and Steady State Performance of DC machines: (4 hours)
4.1 DC machine constructional features
4.2 Magnetic circuit, air gap flux patterns
4.3 Mechanical rectification by commutator action
4.4 Torque Production and voltage generation
4.5 Armature windings, lap and wave windings
4.6 Field excitation: shunt, series and compound fields
4.7 Armature reaction
4.8 Commutation, interpoles.
4.9 Reversible energy flow between electrical and mechanical systems with a dc machine
5.0 DC Motors: (4 hours)
5.1 Torque/speed characteristics of shunt field, series field and compound field motors.
5.2 Effects of armature reaction on motor operation
5.3 Commutation problems, pole face compensating windings
5.4 Speed regulation and control in dc motors
5.5 Effect of field excitation and armature applied voltage on steady state performance of dc motors
5.6 Reversal of rotation of dc motors
5.7 Motor starting problems, limiting armature current inrush.
6.0 DC Generators: (4 hours)
6.1 Voltage/speed/load characteristics of dc generators
6.2 Shunt, series and compound field machines
6.3 Separate and self-excited machines, voltage build-up in self excited generators
6.4 Voltage regulation of generators
7.0 Control of DC Machines in the steadies-state: (3 hours)
7.1 Automatic voltage regulation of dc generators
7.2 Manual and automatic starting and speed control of motors, armature voltage and shunt field control.
8.0 Induction machines: (8 hours)
8.1 Construction and type
8.2 Rotating magnetic field and action of induction motor
8.3 Torque-slip characteristic
8.4 Losses and efficiency
8.5 Induction motor starter
8.6 Induction generator
9.0 Synchronous machines: (8 hours)
9.1 Basic structure of synchronous machines, salient pole and cylindrical rotor structure
9.2 Synchronous generators
9.2.1 Operating principle and emf equation
9.2.2 Speed and frequency relationship.
9.2.3 Synchronous generator on load, armature reaction, voltage regulation
9.2.4 Synchronization, generator connected to large system, infinite bus concept.
9.3 Synchronous motor
9.3.1 Operating principle
9.3.2 Starting methods
9.3.3 Effect of excitation, V-curve, inverted V-curve, power factor control
9.4 Power angle characteristic of cylindrical rotor machine
9.5 Two-reaction model of salient pole machine
9.6 Power angle characteristic cylindrical salient pole machine
Laboratory:
1) Magnetic Circuit Study.
- Calculate and measure BV & H for a magnetic circuit
- Compare the relative permeabilities of two different sample cores.
2) Two winding transformer
- Carry out o/c test and s/c test on a single phase transformer to evaluate equivalent circuit.
- Examine exciting current harmonics.
3) DC machine Study
- Study speed control using variable armature voltage and variable field current on dc shunt motor
- Study voltage regulation of a dc shunt generator
4) Induction machine study
- Measure torque-speed characters of a three phase induction motor
- Measure power factor and efficiency of the motor at various loading condition
5) Synchronous machine study
- Study of frequency and voltage control of a synchronous generator
Text books:
1) A. E. Fitzgerald, C. kingsley and S.D. Umans, “Electric Machinery” 4th ed. McGraw-Hill Book Company, New York 1983
2) Bhag S. Guru and Huseyin R. Hiziroglu, “Electric Machinory and Trans former”, Harcourt Brace Jovanovich, Inc., New York, 1988.
To introduce and apply electric magnetic circuit concepts to electromechanical energy conversion to explain and predict the performance of basic devices such as transformer, electromagnets and rotating electric machines.
1.0 Magnetic Circuit Concepts: (5 hours)
1.1 Ohm’s law for magnetic circuits
1.2 Magnetic potential sources, electric current, permanent magnetic materials
1.3 Ferromagnetic materials, magnetic saturation, non-linearity, Hysterisis
1.4 Series and parallel magnetic circuits
1.5 Effect of air gaps
1.6 DC and AC excitation, Hysterisis and eddy currents, energy loss, laminations, sintered core
1.7 Self and mutual inductances
1.8 Force due to magnetic effects, electromagnets.
2.0 Transformer: (8 hours)
2.1 Magnetic circuits of transformer, transformer steels
2.2 Ideal transformers
2.3 Mutual inductance and coupled model of transformers
2.4 Air core Vs iron core transformers
2.5 Two winding transformers
2.6 Equivalent circuit of power transformers
2.7 Evaluation of Equivalent circuit parameters from open circuit and short circuit tests
2.8 Excitation consideration: core losses, current harmonics
2.9 Equivalent circuit calculation: voltage regulation and efficiency
2.10 Polarity of windings
2.11 Series and parallel connection of windings
2.12 Audio transformers Vs power transformers
2.13 Auto transformers
2.14 Instrumentation transformers – PTs, CTs
2.15 Three phase transformer connection
2.16 V-V and open delta connection
2.17 T-T connections
2.18 Scott 3 phase to 2 phase connections.
3.0 Principles of Electromechanical Energy Conversion: (2 hours)
3.1 Energy storage and retrieval from magnetic fields
3.2 Lenz’s law, Faraday’s laws, Fleming’s rule
3.3 Force and torque due to magnetic fields, principle of virtual work, the coenergy function
3.4 Interaction between electric, magnetic and mechanical systems
4.0 General Aspects of Modeling and Steady State Performance of DC machines: (4 hours)
4.1 DC machine constructional features
4.2 Magnetic circuit, air gap flux patterns
4.3 Mechanical rectification by commutator action
4.4 Torque Production and voltage generation
4.5 Armature windings, lap and wave windings
4.6 Field excitation: shunt, series and compound fields
4.7 Armature reaction
4.8 Commutation, interpoles.
4.9 Reversible energy flow between electrical and mechanical systems with a dc machine
5.0 DC Motors: (4 hours)
5.1 Torque/speed characteristics of shunt field, series field and compound field motors.
5.2 Effects of armature reaction on motor operation
5.3 Commutation problems, pole face compensating windings
5.4 Speed regulation and control in dc motors
5.5 Effect of field excitation and armature applied voltage on steady state performance of dc motors
5.6 Reversal of rotation of dc motors
5.7 Motor starting problems, limiting armature current inrush.
6.0 DC Generators: (4 hours)
6.1 Voltage/speed/load characteristics of dc generators
6.2 Shunt, series and compound field machines
6.3 Separate and self-excited machines, voltage build-up in self excited generators
6.4 Voltage regulation of generators
7.0 Control of DC Machines in the steadies-state: (3 hours)
7.1 Automatic voltage regulation of dc generators
7.2 Manual and automatic starting and speed control of motors, armature voltage and shunt field control.
8.0 Induction machines: (8 hours)
8.1 Construction and type
8.2 Rotating magnetic field and action of induction motor
8.3 Torque-slip characteristic
8.4 Losses and efficiency
8.5 Induction motor starter
8.6 Induction generator
9.0 Synchronous machines: (8 hours)
9.1 Basic structure of synchronous machines, salient pole and cylindrical rotor structure
9.2 Synchronous generators
9.2.1 Operating principle and emf equation
9.2.2 Speed and frequency relationship.
9.2.3 Synchronous generator on load, armature reaction, voltage regulation
9.2.4 Synchronization, generator connected to large system, infinite bus concept.
9.3 Synchronous motor
9.3.1 Operating principle
9.3.2 Starting methods
9.3.3 Effect of excitation, V-curve, inverted V-curve, power factor control
9.4 Power angle characteristic of cylindrical rotor machine
9.5 Two-reaction model of salient pole machine
9.6 Power angle characteristic cylindrical salient pole machine
Laboratory:
1) Magnetic Circuit Study.
- Calculate and measure BV & H for a magnetic circuit
- Compare the relative permeabilities of two different sample cores.
2) Two winding transformer
- Carry out o/c test and s/c test on a single phase transformer to evaluate equivalent circuit.
- Examine exciting current harmonics.
3) DC machine Study
- Study speed control using variable armature voltage and variable field current on dc shunt motor
- Study voltage regulation of a dc shunt generator
4) Induction machine study
- Measure torque-speed characters of a three phase induction motor
- Measure power factor and efficiency of the motor at various loading condition
5) Synchronous machine study
- Study of frequency and voltage control of a synchronous generator
Text books:
1) A. E. Fitzgerald, C. kingsley and S.D. Umans, “Electric Machinery” 4th ed. McGraw-Hill Book Company, New York 1983
2) Bhag S. Guru and Huseyin R. Hiziroglu, “Electric Machinory and Trans former”, Harcourt Brace Jovanovich, Inc., New York, 1988.
Instrumentation I
Course Objectives
Comprehensive treatment of methods and instruments for a wide range of measurement problems.
1.0 Instrumentation Systems: (2 hours)
1.1 Functions of components of instrumentation system transduction, signal processing, signal transmission, output indication
1.2 Need for electrical, electronics, pneumatic and hydraulic working media systems and conversion devices
1.3 Analog and digital systems
2.0 Theory of measurements: (3 hours)
2.1 Static performance parameters: accuracy, precision, sensitivity, resolution, and linearity
2.2 Dynamic performance parameter: response time, frequency response and bandwidth
2.3 Error in measurement
2.4 Statistical analysis of errors in measurement
3.0 Transducers: (16 hours)
3.1 Measurement of electrical variables: voltage, current, resistance, frequency, inductance and capacitance
3.2 Measurement of mechanical variables: displacement, strain, velocity, acceleration, and vibration
3.3 Measurement of process variables: temperature, pressure, level, fluid flow, chemical constituents in gases or liquids, pH and humidity
3.4 Measurement of bio-physical variables: blood pressure and myoelectric potentials
4.0 Electrical Signal Processing and transmission: (6 hours)
4.1 Basic Op-amp characteristics
4.2 Instrumentation amplifier
4.3 Signal amplification, attenuation, integration, differentiation, network isolation and wave shaping
4.4 Effects of noise, analog filtering, digital filtering
5.0 Non-Electrical Signal Transmission: (3 hours)
5.1 Pneumatics, electro-pneumatic conversion devices, pneumatic transmission
5.2 Fibre optics, Electro-optic conversion devices, optical communications
6.0 Analog-Digital and Digital-Analog Conversion: (16 hours)
6.1 Analog signals and digital signals
6.2 Digital to analog converters: Weighted resistor type, R-2R ladder type, DAC Errors
6.3 Analog to digital converters: Successive approximation type, Dual ramp type, Flash type, ADC errors
7.0 Digital Instrumentation: (5 hours)
7.1 Sampled data system
7.2 Components of data acquisition system
7.3 Sample and hold circuits
7.4 Interfacing to the computers
8.0 Output Devices: (4 hours)
8.1 Indicators, meters
8.2 Strip chart recorders
8.3 magnetic tape recorders
8.4 4 X-Y plotters
Laboratory:
1.0 Operational Amplifiers in Circuit - Use of Op-amp as a summer, inverter, integrator and differentiator
2.0 Study of Transducers for Measurement of Linear Displacement and Strain
- Use resistive, inductive and capacitive transducers to measure displacement.
- Use strain gauge transducers to measure force.
3.0 Study of Various Transducers For Measurement of Angular Displacement, Angular Velocity, Pressure and Flow.
- use optical, hall effect and inductive transducer to measure angular displacement.
- use tachogenerator to measure angular velocity
- use RTD transducers to measure pressure and flow
4.0 Digital to Analog Conversion - perform static testing of D/A converter
5.0 Analog to Digital Conversion - perform static testing of A/D converter
6.0 Data Recording Devices - study the performance characteristics of strip chart recorder
References:
1. D. M. Consodine, “Process Instruments and Controls Handbook”, third edition, McGraw Hill, 1985
2. S. Wolf and R.F. M,. Smith, “Students Reference Manual for Electronic Instrumentation Laboratories”. Prentice Hall, 1990.
3. E. O. Deobelin “Measurement System: Application and Design”. McGraw Hill, 1990
4. A. K. Sawhney. “A Course in Electronic Measurements and Instrumentation”, Dhanpat Rai and Sons. 1988
5. C. S. Rangan, G. R. Sarma and V.S.V. Mani, “Instrumentation: Devices and Systems”, Tata McGraw Hill Publishing Company Limited, New Delhi, 1992
Comprehensive treatment of methods and instruments for a wide range of measurement problems.
1.0 Instrumentation Systems: (2 hours)
1.1 Functions of components of instrumentation system transduction, signal processing, signal transmission, output indication
1.2 Need for electrical, electronics, pneumatic and hydraulic working media systems and conversion devices
1.3 Analog and digital systems
2.0 Theory of measurements: (3 hours)
2.1 Static performance parameters: accuracy, precision, sensitivity, resolution, and linearity
2.2 Dynamic performance parameter: response time, frequency response and bandwidth
2.3 Error in measurement
2.4 Statistical analysis of errors in measurement
3.0 Transducers: (16 hours)
3.1 Measurement of electrical variables: voltage, current, resistance, frequency, inductance and capacitance
3.2 Measurement of mechanical variables: displacement, strain, velocity, acceleration, and vibration
3.3 Measurement of process variables: temperature, pressure, level, fluid flow, chemical constituents in gases or liquids, pH and humidity
3.4 Measurement of bio-physical variables: blood pressure and myoelectric potentials
4.0 Electrical Signal Processing and transmission: (6 hours)
4.1 Basic Op-amp characteristics
4.2 Instrumentation amplifier
4.3 Signal amplification, attenuation, integration, differentiation, network isolation and wave shaping
4.4 Effects of noise, analog filtering, digital filtering
5.0 Non-Electrical Signal Transmission: (3 hours)
5.1 Pneumatics, electro-pneumatic conversion devices, pneumatic transmission
5.2 Fibre optics, Electro-optic conversion devices, optical communications
6.0 Analog-Digital and Digital-Analog Conversion: (16 hours)
6.1 Analog signals and digital signals
6.2 Digital to analog converters: Weighted resistor type, R-2R ladder type, DAC Errors
6.3 Analog to digital converters: Successive approximation type, Dual ramp type, Flash type, ADC errors
7.0 Digital Instrumentation: (5 hours)
7.1 Sampled data system
7.2 Components of data acquisition system
7.3 Sample and hold circuits
7.4 Interfacing to the computers
8.0 Output Devices: (4 hours)
8.1 Indicators, meters
8.2 Strip chart recorders
8.3 magnetic tape recorders
8.4 4 X-Y plotters
Laboratory:
1.0 Operational Amplifiers in Circuit - Use of Op-amp as a summer, inverter, integrator and differentiator
2.0 Study of Transducers for Measurement of Linear Displacement and Strain
- Use resistive, inductive and capacitive transducers to measure displacement.
- Use strain gauge transducers to measure force.
3.0 Study of Various Transducers For Measurement of Angular Displacement, Angular Velocity, Pressure and Flow.
- use optical, hall effect and inductive transducer to measure angular displacement.
- use tachogenerator to measure angular velocity
- use RTD transducers to measure pressure and flow
4.0 Digital to Analog Conversion - perform static testing of D/A converter
5.0 Analog to Digital Conversion - perform static testing of A/D converter
6.0 Data Recording Devices - study the performance characteristics of strip chart recorder
References:
1. D. M. Consodine, “Process Instruments and Controls Handbook”, third edition, McGraw Hill, 1985
2. S. Wolf and R.F. M,. Smith, “Students Reference Manual for Electronic Instrumentation Laboratories”. Prentice Hall, 1990.
3. E. O. Deobelin “Measurement System: Application and Design”. McGraw Hill, 1990
4. A. K. Sawhney. “A Course in Electronic Measurements and Instrumentation”, Dhanpat Rai and Sons. 1988
5. C. S. Rangan, G. R. Sarma and V.S.V. Mani, “Instrumentation: Devices and Systems”, Tata McGraw Hill Publishing Company Limited, New Delhi, 1992
Electromagnetics
COURSE OBJECTIVES
To impart a good working knowledge of the fundamental laws of static and dynamic electric and magnetic fields and to provide exposure to generation, transmission and measurement techniques involving electromagnetic fields and waves.
1.0 Introduction: (2 hours)
1.1 Coordinate systems
1.2 Scalar and vector fields
1.3 Operations on scalar and vector fields
2.0 Electrostatic Fields in Free Space: (2 hours)
2.1 Coulomb’s law
2.2 Electric intensity
2.3 Electric flux density
2.4 Field lines
2.5 Graphical portrayal of fields
3.0 Gauss’s Law in Integral Form and Applications: (2 hours)
3.1 Conductors, insulators, semiconductors
3.2 Boundary conditions at a conductor surface
4.0 Concept of Divergence: (2 hours)
4.1 Transition from macroscopic to microscopic description
4.2 Divergence theorem
4.3 Gauss’s law in point form and applications
5.0 Electric Energy and Potential: (2 hours)
5.1 Gradient of a scalar point function
5.2 Electric intensity as the negative gradient of a scalar potential
5.3 Conservative fields
5.4 Electric energy density
5.5 Applications
6.0 Electrostatic Fields in Material Media: (2 hours)
6.1 Polarization
6.2 Free and bound charge densities
6.3 Relative permittivity
6.4 Capacitance calculations
6.5 Boundary conditions at the interface between two media
6.6 Applications
7.0 Boundary Value Problems in Electrostatics: (4 hours)
7.1 Laplace’s and Poisson’s equations
7.2 The uniqueness theorem
7.3 One-dimensional boundary value problems
7.4 Two-dimensional boundary value problems
7.5 Separation of variables
7.6 Cut-and-try method
7.7 Relaxation methods, numerical integration
7.8 Graphical field plotting
7.9 Capacitance calculations
8.0 Current and Current Density: (1 hour)
8.1 Conservation of charge
8.2 Continuity equation
8.3 Relaxation time constant
8.4 Applications
9.0 Time-Invariant Magnetic Fields: (3 hours)
9.1 Biot-Savart’s law
9.2 Magnetic intensity and magnetic induction
9.3 Ampere’s law in integral form
9.4 Applications
10.0 Concept of Curl: (3 hours)
10.1 Curl components as circulations per unit area
10.2 Stokes’ theorem
10.3 Ampere’s law in point form
10.4 Scalar and vector magnetic potentials
10.5 Boundary value problems and applications
11.0 Magnetic Forces and Torque: (1 hours)
11.1 Magnetic fields in material media
11.2 Relative permeability
11.3 Boundary conditions
11.4 Magnetic circuits
12.0 Quasi-Static Fields: (2 hours)
12.1 Faraday’s law of electromagnetic induction
12.2 Applications
13.0 Electrodynamic Fields: (2 hours)
13.1 Inadequacy of Ampere’s law derived for direct currents
13.2 Conflict with the continuity equation
13.3 Maxwell’s postulate of displacement current
13.4 Maxwell’s equations in integral and point forms
13.5 Examples
14.0 Wave Equations: (3 hours)
14.1 Uniform plane waves in dissipative media
14.2 Polarization
14.3 Wave impedance
14.4 Skin effect
14.5 A. C. resistance
14.6 Poynting vector
14.7 Reflection and refraction at the interface between two media
14.8 Reflection coefficient
14.9 Standing wave ratio
14.10 Impedance matching
14.11 Quarter wave transformer
15.0 Retarded Potentials: (2 hours)
15.1 Radiation from a dipole antenna
15.2 Wave guides
16.0 Transmission Lines: (8 hours)
16.1 Coaxial, single conductor/earth, two conductor lines
16.2 Field and lumped circuit equivalents
16.3 Characteristic impedance
16.4 Travelling and standing waves, reflection, termination impedance matching
16.5 Short and long lines
16.6 ABCD or h parameters, Y and Z parameters
16.7 Power and signal transmission capability of lines
Laboratory:
1.0 Teledeltos (electro-conductive) paper mapping of electrostatic fields
2.0 Determination of dielectric constant, display of a magnetic Hysterisis loop
3.0 Studies of wave propagation on a lumped parameter transmission line
4.0 Microwave sources, detectors, transmission lines
5.0 Standing wave patterns on transmission lines, reflections, power patterns on transmission lines, reflections, power measurement
6.0 Magnetic field measurements in a static magnetic circuit, inductance, leakage flux
References:
1.0 W.H. Hayt, “Engineering Electromagnetic”, McGraw-Hill Book Company, New York.
2.0 J. D. Kraus and K.R. Carver, “Electromagnetics”, prentice Hall Inc., New York.
3.0 N. Rao, “Elements of Engineering Electromagnetics”
To impart a good working knowledge of the fundamental laws of static and dynamic electric and magnetic fields and to provide exposure to generation, transmission and measurement techniques involving electromagnetic fields and waves.
1.0 Introduction: (2 hours)
1.1 Coordinate systems
1.2 Scalar and vector fields
1.3 Operations on scalar and vector fields
2.0 Electrostatic Fields in Free Space: (2 hours)
2.1 Coulomb’s law
2.2 Electric intensity
2.3 Electric flux density
2.4 Field lines
2.5 Graphical portrayal of fields
3.0 Gauss’s Law in Integral Form and Applications: (2 hours)
3.1 Conductors, insulators, semiconductors
3.2 Boundary conditions at a conductor surface
4.0 Concept of Divergence: (2 hours)
4.1 Transition from macroscopic to microscopic description
4.2 Divergence theorem
4.3 Gauss’s law in point form and applications
5.0 Electric Energy and Potential: (2 hours)
5.1 Gradient of a scalar point function
5.2 Electric intensity as the negative gradient of a scalar potential
5.3 Conservative fields
5.4 Electric energy density
5.5 Applications
6.0 Electrostatic Fields in Material Media: (2 hours)
6.1 Polarization
6.2 Free and bound charge densities
6.3 Relative permittivity
6.4 Capacitance calculations
6.5 Boundary conditions at the interface between two media
6.6 Applications
7.0 Boundary Value Problems in Electrostatics: (4 hours)
7.1 Laplace’s and Poisson’s equations
7.2 The uniqueness theorem
7.3 One-dimensional boundary value problems
7.4 Two-dimensional boundary value problems
7.5 Separation of variables
7.6 Cut-and-try method
7.7 Relaxation methods, numerical integration
7.8 Graphical field plotting
7.9 Capacitance calculations
8.0 Current and Current Density: (1 hour)
8.1 Conservation of charge
8.2 Continuity equation
8.3 Relaxation time constant
8.4 Applications
9.0 Time-Invariant Magnetic Fields: (3 hours)
9.1 Biot-Savart’s law
9.2 Magnetic intensity and magnetic induction
9.3 Ampere’s law in integral form
9.4 Applications
10.0 Concept of Curl: (3 hours)
10.1 Curl components as circulations per unit area
10.2 Stokes’ theorem
10.3 Ampere’s law in point form
10.4 Scalar and vector magnetic potentials
10.5 Boundary value problems and applications
11.0 Magnetic Forces and Torque: (1 hours)
11.1 Magnetic fields in material media
11.2 Relative permeability
11.3 Boundary conditions
11.4 Magnetic circuits
12.0 Quasi-Static Fields: (2 hours)
12.1 Faraday’s law of electromagnetic induction
12.2 Applications
13.0 Electrodynamic Fields: (2 hours)
13.1 Inadequacy of Ampere’s law derived for direct currents
13.2 Conflict with the continuity equation
13.3 Maxwell’s postulate of displacement current
13.4 Maxwell’s equations in integral and point forms
13.5 Examples
14.0 Wave Equations: (3 hours)
14.1 Uniform plane waves in dissipative media
14.2 Polarization
14.3 Wave impedance
14.4 Skin effect
14.5 A. C. resistance
14.6 Poynting vector
14.7 Reflection and refraction at the interface between two media
14.8 Reflection coefficient
14.9 Standing wave ratio
14.10 Impedance matching
14.11 Quarter wave transformer
15.0 Retarded Potentials: (2 hours)
15.1 Radiation from a dipole antenna
15.2 Wave guides
16.0 Transmission Lines: (8 hours)
16.1 Coaxial, single conductor/earth, two conductor lines
16.2 Field and lumped circuit equivalents
16.3 Characteristic impedance
16.4 Travelling and standing waves, reflection, termination impedance matching
16.5 Short and long lines
16.6 ABCD or h parameters, Y and Z parameters
16.7 Power and signal transmission capability of lines
Laboratory:
1.0 Teledeltos (electro-conductive) paper mapping of electrostatic fields
2.0 Determination of dielectric constant, display of a magnetic Hysterisis loop
3.0 Studies of wave propagation on a lumped parameter transmission line
4.0 Microwave sources, detectors, transmission lines
5.0 Standing wave patterns on transmission lines, reflections, power patterns on transmission lines, reflections, power measurement
6.0 Magnetic field measurements in a static magnetic circuit, inductance, leakage flux
References:
1.0 W.H. Hayt, “Engineering Electromagnetic”, McGraw-Hill Book Company, New York.
2.0 J. D. Kraus and K.R. Carver, “Electromagnetics”, prentice Hall Inc., New York.
3.0 N. Rao, “Elements of Engineering Electromagnetics”
Microprocessors
COURSE OBJECTIVES
To introduce the operation, programming, and application of microprocessors.
1.0 Introduction to Computer Architecture: (4 hours)
1.1 Automated calculator and stored program computer, Von Neuman, Harvard and modified Harvard architectures, principle elements - CPU, memory, control and input/output units
1.2 Simple stored program computer architecture, basic registers
1.3 Introduction to register transfer language (RTL) instruction description
2.0 Computer Instructions: ( 11 hours)
2.1 Introduction to memory reference, inherent, sequence modifying and input/output instructions
2.2 RTL descriptions of assembly level instructions
2.3 RTL description of load accumulator and store accumulator instructions
2.4 RTL description of inherent instructions, clear accumulator, increment and decrement
2.5 RTL descriptions of sequence modifying instructions - unconditional branch instructions, unconditional branch and jump instructions
2.6 RTL descriptions of sequence modifying instructions - conditional branch instructions, branch on accumulator zero, branch on accumulator not zero, signed and not signed arithmetic
2.7 Addressing modes - immediate, absolute, relative, indexed and indirect
3.0 Assembly Language Programming: (10 hours)
3.1 Assembler syntax - labels, instructions (opcodes, mnemonics and operands), directives and comments
3.2 Assembler operation - sample assembly language program and code generation, one pass and two pass assembly
3.3 Macro assemblers, linking assembler directives - .text, .data
4.0 Microcomputer Systems: (8 hours)
4.1 Microcomputer devices - bus structure, synchronous and asynchronous data bus, address bus, read and write operations and timing
4.2 Memory devices - static and dynamic random access memory (RAM), read only memory (ROM), ultraviolet electrically programmable memory (UVEPROM), electrically erasable programmable memory (EEPROM)
4.3 Input/output devices - parallel and serial interfaces, unique and non-unique address decoding
4.4 Synchronizing the computer with peripherals, simple and wait for data transfer wait interfaces
4.5 Serial asynchronous interfaces - ASCII codes, baud rate start bit, stop bit, parity bit, RS-232, RS-432 standards
5.0 Interrupt Operations: (6 hours)
5.1 Interrupt behaviour: complete instruction, save state of processor, optionally mask further interrupts and set program counter to interrupt service routine address
5.2 Interrupt service routine requirements - perform input/output, clear source of interrupt and return from interrupt
5.3 Interrupt priority - maskable and non-maskable interrupts, software interrupts, traps and exceptions
5.4 Vectored, chained and polled interrupt structures
5.5 Peripheral devices using interrupts - parallel and serial interfaces
5.6 Multiprocessing systems - communication between processes, semaphores, resource allocation and deadlock
6.0 Additional Topics: (6 hours)
6.1 Stacks, push and pull instructions
6.2 Static and dynamic variable allocation
6.3 Accumulator and register based computer architectures, reduced instruction set computer (RISC) and compressed instruction set computer (CISC)
architectures, digital signal processing (DSP) processors.
Laboratory:
1) Introduction to a microprocessor system - machine language monitor, simple hardware interface (switch, LED and flip/flop) address and data bus operation for program execution and memory read and write.
2) Assembly language programming - use of assembler, character input/output, arithmetic operations, base conversion, conditional branching, static variable allocation using labels assembler directives
3) Parallel interface programming - wait interfaces, input and output, development of test programs dynamic variable allocation on system stack
4 Serial asynchronous interface programming - wait interfaces, buffered input data, circular buffer
5) Interrupt programming - multiple processes running with varied priority, peripheral data rate determined by an external clock, demonstration of deadlock
References:
1) Z.G Vranesic and S.G.Zaky, “Microcomputer structures”, saunders College publishing, a division of Holt, Rinehart and Winston, 1989.
To introduce the operation, programming, and application of microprocessors.
1.0 Introduction to Computer Architecture: (4 hours)
1.1 Automated calculator and stored program computer, Von Neuman, Harvard and modified Harvard architectures, principle elements - CPU, memory, control and input/output units
1.2 Simple stored program computer architecture, basic registers
1.3 Introduction to register transfer language (RTL) instruction description
2.0 Computer Instructions: ( 11 hours)
2.1 Introduction to memory reference, inherent, sequence modifying and input/output instructions
2.2 RTL descriptions of assembly level instructions
2.3 RTL description of load accumulator and store accumulator instructions
2.4 RTL description of inherent instructions, clear accumulator, increment and decrement
2.5 RTL descriptions of sequence modifying instructions - unconditional branch instructions, unconditional branch and jump instructions
2.6 RTL descriptions of sequence modifying instructions - conditional branch instructions, branch on accumulator zero, branch on accumulator not zero, signed and not signed arithmetic
2.7 Addressing modes - immediate, absolute, relative, indexed and indirect
3.0 Assembly Language Programming: (10 hours)
3.1 Assembler syntax - labels, instructions (opcodes, mnemonics and operands), directives and comments
3.2 Assembler operation - sample assembly language program and code generation, one pass and two pass assembly
3.3 Macro assemblers, linking assembler directives - .text, .data
4.0 Microcomputer Systems: (8 hours)
4.1 Microcomputer devices - bus structure, synchronous and asynchronous data bus, address bus, read and write operations and timing
4.2 Memory devices - static and dynamic random access memory (RAM), read only memory (ROM), ultraviolet electrically programmable memory (UVEPROM), electrically erasable programmable memory (EEPROM)
4.3 Input/output devices - parallel and serial interfaces, unique and non-unique address decoding
4.4 Synchronizing the computer with peripherals, simple and wait for data transfer wait interfaces
4.5 Serial asynchronous interfaces - ASCII codes, baud rate start bit, stop bit, parity bit, RS-232, RS-432 standards
5.0 Interrupt Operations: (6 hours)
5.1 Interrupt behaviour: complete instruction, save state of processor, optionally mask further interrupts and set program counter to interrupt service routine address
5.2 Interrupt service routine requirements - perform input/output, clear source of interrupt and return from interrupt
5.3 Interrupt priority - maskable and non-maskable interrupts, software interrupts, traps and exceptions
5.4 Vectored, chained and polled interrupt structures
5.5 Peripheral devices using interrupts - parallel and serial interfaces
5.6 Multiprocessing systems - communication between processes, semaphores, resource allocation and deadlock
6.0 Additional Topics: (6 hours)
6.1 Stacks, push and pull instructions
6.2 Static and dynamic variable allocation
6.3 Accumulator and register based computer architectures, reduced instruction set computer (RISC) and compressed instruction set computer (CISC)
architectures, digital signal processing (DSP) processors.
Laboratory:
1) Introduction to a microprocessor system - machine language monitor, simple hardware interface (switch, LED and flip/flop) address and data bus operation for program execution and memory read and write.
2) Assembly language programming - use of assembler, character input/output, arithmetic operations, base conversion, conditional branching, static variable allocation using labels assembler directives
3) Parallel interface programming - wait interfaces, input and output, development of test programs dynamic variable allocation on system stack
4 Serial asynchronous interface programming - wait interfaces, buffered input data, circular buffer
5) Interrupt programming - multiple processes running with varied priority, peripheral data rate determined by an external clock, demonstration of deadlock
References:
1) Z.G Vranesic and S.G.Zaky, “Microcomputer structures”, saunders College publishing, a division of Holt, Rinehart and Winston, 1989.
Electronic Circuits I
COURSE OBJECTIVES
To build on the material presented in Semi Conductor Devices to include the fundamentals of analog integrated circuit (IC) operation. Particular attention will be directed toward understanding operational amplifier operation over the full useful frequency range. Regulated power supplies, power amplifiers and relaxation and sinusoidal oscillators will be discussed.
1.0 Integrated Circuit Technology and Device Models: (10 hours)
1.1 The planar process for integrated circuit fabrication
1.2 Review of dc and ac diode models
1.3 Review of dc and ac JFET models
1.4 Review of dc and ac bipolar transistor models
1.5 Review of dc and ac MOS transistor models
2.0 Operational Amplifier Circuits: (8 hours)
2.1 Bias circuits suitable for IC design
2.2 The widlar currant source
2.3 The differential amplifier
2.4 Active loads
2.5 Output stages
3.0 Operational Amplifier Characterization: (6 hours)
3.1 Input offset voltage
3.2 Input bias and input offset currents
3.3 Output impedance
3.4 Differential and common-mode input impedances
3.5 DC gain, bandwidth, gain-bandwidth product
3.6 Common-mode and power supply rejection ratios
3.7 Higher frequency poles, settling time
3.8 Slew rate
3.9 Noise in operational amplifier circuits
4.0 Power Supplies and Voltage Regulators: (6 hours)
4.1 Half-wave and full-wave rectifiers
4.2 Capacitive filtering
4.3 Zener diodes, bandgap voltage references, constant current diodes
4.4 Zener diode voltage regulators
4.5 Series transistor-zener diode voltage regulators
4.6 Series transistor-zener diode-constant current diode voltage regulators
4.7 Voltage regulators with feedback
4.8 IC voltage regulations
5.0 Untuned and Tuned Power Amplifiers: (7 hours)
5.1 Amplifier classification
5.2 Direct-coupled push-pull stages
5.3 Transformer-coupled push-pull stages
5.4 Tuned power amplifiers
5.5 Power dissipation considerations
6.0 Oscillator Circuits: (8 hours)
6.1 CMOS inverter relaxation oscillator
6.2 Operation amplifier based relaxation oscillators
6.3 Voltage-to-frequency converters
6.4 Sinusoidal oscillators
6.5 Conditions for oscillators
6.6 Amplitude and frequency stabilization
6.7 Swept frequency oscillators
6.8 Frequency synthesizers
6.9 Function generators
Laboratory:
1.0 Study of a discrete component operational amplifier realization.
2.0 Commercial operational amplifier characterization.
3.0 Regulated power supplies
4.0 Power amplifiers
5.0 Relaxation oscillators
6.0 Sinusoidal oscillators
Reference Books:
1) W. Stanely “operational Amplifiers with Linear Integrated circuits”, Charles E. Merrill publishing company, Toronto,1984.
2) J. G. Graeme, “Application of operational Amplifiers: Third Generation Techniques” The burr-Brown Electronic series”, McGraw-Hill, New York, 1973.
3) P. E. Allen and D. R. Holberg, “CMOS Analog Circuit Design”, Holt, Rinehart and Winston, Inc., New York, 1987.
4) A. S. Sedra and K. C. Smith, “Microelectronic Circuits”, 2nd Edition, Holt, Rinehart and Winston, Inc., New York,
To build on the material presented in Semi Conductor Devices to include the fundamentals of analog integrated circuit (IC) operation. Particular attention will be directed toward understanding operational amplifier operation over the full useful frequency range. Regulated power supplies, power amplifiers and relaxation and sinusoidal oscillators will be discussed.
1.0 Integrated Circuit Technology and Device Models: (10 hours)
1.1 The planar process for integrated circuit fabrication
1.2 Review of dc and ac diode models
1.3 Review of dc and ac JFET models
1.4 Review of dc and ac bipolar transistor models
1.5 Review of dc and ac MOS transistor models
2.0 Operational Amplifier Circuits: (8 hours)
2.1 Bias circuits suitable for IC design
2.2 The widlar currant source
2.3 The differential amplifier
2.4 Active loads
2.5 Output stages
3.0 Operational Amplifier Characterization: (6 hours)
3.1 Input offset voltage
3.2 Input bias and input offset currents
3.3 Output impedance
3.4 Differential and common-mode input impedances
3.5 DC gain, bandwidth, gain-bandwidth product
3.6 Common-mode and power supply rejection ratios
3.7 Higher frequency poles, settling time
3.8 Slew rate
3.9 Noise in operational amplifier circuits
4.0 Power Supplies and Voltage Regulators: (6 hours)
4.1 Half-wave and full-wave rectifiers
4.2 Capacitive filtering
4.3 Zener diodes, bandgap voltage references, constant current diodes
4.4 Zener diode voltage regulators
4.5 Series transistor-zener diode voltage regulators
4.6 Series transistor-zener diode-constant current diode voltage regulators
4.7 Voltage regulators with feedback
4.8 IC voltage regulations
5.0 Untuned and Tuned Power Amplifiers: (7 hours)
5.1 Amplifier classification
5.2 Direct-coupled push-pull stages
5.3 Transformer-coupled push-pull stages
5.4 Tuned power amplifiers
5.5 Power dissipation considerations
6.0 Oscillator Circuits: (8 hours)
6.1 CMOS inverter relaxation oscillator
6.2 Operation amplifier based relaxation oscillators
6.3 Voltage-to-frequency converters
6.4 Sinusoidal oscillators
6.5 Conditions for oscillators
6.6 Amplitude and frequency stabilization
6.7 Swept frequency oscillators
6.8 Frequency synthesizers
6.9 Function generators
Laboratory:
1.0 Study of a discrete component operational amplifier realization.
2.0 Commercial operational amplifier characterization.
3.0 Regulated power supplies
4.0 Power amplifiers
5.0 Relaxation oscillators
6.0 Sinusoidal oscillators
Reference Books:
1) W. Stanely “operational Amplifiers with Linear Integrated circuits”, Charles E. Merrill publishing company, Toronto,1984.
2) J. G. Graeme, “Application of operational Amplifiers: Third Generation Techniques” The burr-Brown Electronic series”, McGraw-Hill, New York, 1973.
3) P. E. Allen and D. R. Holberg, “CMOS Analog Circuit Design”, Holt, Rinehart and Winston, Inc., New York, 1987.
4) A. S. Sedra and K. C. Smith, “Microelectronic Circuits”, 2nd Edition, Holt, Rinehart and Winston, Inc., New York,
Applied Mathematics
Course objectives
This course focuses on several branches of applied mathematics. The student is exposed to complex variable theory and a study of the Fourier and Z transforms, topics of current importance in signal processing. The course concludes with studies of the wave and diffusion equations in cartesian, cylindrical and polar coordinates.
1. Complex Variables (10 hours)
1.1 Function of Complex Variables.
1.2 Taylor series.
1.3 Laurent series.
1.4 Singularities, Zeros and poles.
1.5 Complex integration
1.6 Residues.
2 Z-Transforms (8 hours)
2.6 Linear, time invariant systems, response to the unit spike
2.7 Delay, advance, convolution
2.8 Definition of the Z-transform
2.9 Relation of convolution to the product of transform
2.10 Region of convergence, relationship to causality
2.11 Inverse of the Z-transform by long division and by partial fraction expansion
2.12 Parseval’s theorem
3 The Fourier integral (8 hours)
3.1 The Fourier integral
3.2 The inverse Fourier integral formula.
3.3 Frequency and phase spectra.
3.4 The delta function.
4 Partial differential equations (10 hours)
4.1 Basic concepts.
4.2 Wave equation.
4.3 Diffusion equation.
4.4 The Laplace equation in 2 and 3 dimensions.
4.5 Polar coordinates.
4.6 Cylindrical coordinates.
4.7 Spherical coordinates.
4.8 Bessels and Legendre equations.
5. Linear Programming (9 hours)
5.1 The simplex method.
5.2 The canonical forms of solutions.
5.3 Optimal values.
Textbook:
1.0 E. Kreyszig, “Advanced Engineering Mathematics”, Fifth Edition, Wiley, New York.
Reference for Z-Transform:
1.0 A.V. Oppenheim, “Discrete-Time Signal Processing”, Prentice Hall, 1990.
2.0 K. Ogota, “Discrete-Time Control Systems”, Prentice Hall, Englewood Cliffs, New Jersey,
This course focuses on several branches of applied mathematics. The student is exposed to complex variable theory and a study of the Fourier and Z transforms, topics of current importance in signal processing. The course concludes with studies of the wave and diffusion equations in cartesian, cylindrical and polar coordinates.
1. Complex Variables (10 hours)
1.1 Function of Complex Variables.
1.2 Taylor series.
1.3 Laurent series.
1.4 Singularities, Zeros and poles.
1.5 Complex integration
1.6 Residues.
2 Z-Transforms (8 hours)
2.6 Linear, time invariant systems, response to the unit spike
2.7 Delay, advance, convolution
2.8 Definition of the Z-transform
2.9 Relation of convolution to the product of transform
2.10 Region of convergence, relationship to causality
2.11 Inverse of the Z-transform by long division and by partial fraction expansion
2.12 Parseval’s theorem
3 The Fourier integral (8 hours)
3.1 The Fourier integral
3.2 The inverse Fourier integral formula.
3.3 Frequency and phase spectra.
3.4 The delta function.
4 Partial differential equations (10 hours)
4.1 Basic concepts.
4.2 Wave equation.
4.3 Diffusion equation.
4.4 The Laplace equation in 2 and 3 dimensions.
4.5 Polar coordinates.
4.6 Cylindrical coordinates.
4.7 Spherical coordinates.
4.8 Bessels and Legendre equations.
5. Linear Programming (9 hours)
5.1 The simplex method.
5.2 The canonical forms of solutions.
5.3 Optimal values.
Textbook:
1.0 E. Kreyszig, “Advanced Engineering Mathematics”, Fifth Edition, Wiley, New York.
Reference for Z-Transform:
1.0 A.V. Oppenheim, “Discrete-Time Signal Processing”, Prentice Hall, 1990.
2.0 K. Ogota, “Discrete-Time Control Systems”, Prentice Hall, Englewood Cliffs, New Jersey,
Basic Computer Concept
1. Fundamentals ( 2 hours)
1.1 Evolution of Computer
1.2 Classification
1.2.1 Operation: Analog and Digital
1.2.2 Uses: General purpose and Specific purpose
1.2.3 Capacity: Mainframe, Mini, Personal, and Super computer
2. Basic Architecture ( 7 hours)
2.1 Building blocks of a PC
2.1.1 CPU
2.1.2 Memory
2.1.3 Input
2.1.4 Output
2.2 The Storage devices: Floppy Disk and Harddisk
2.3. Introduction of Peripherals
3. Operating System ( 4 hours)
3.1 Definition and Classification
3.2 Functions of Operating System
3.3 DOS
3.4 Windows
3.5 Mac OS
3.6 Unix
3.7 OS/2
4. Programming Languages, Interpreters and Compilers (4 hours)
4.1 Introduction and basic elements of programming language
4.2 Classification of programming language
4.3 Characteristics of Computer program
4.4 Assembler, Interpreter, and Compiler
4.5 Introduction to programming languages
5. Software Applications ( 5 hours)
5.1 Word Processor
5.2 Spreadsheet
5.3 Database
5.4 Graphics
5.5 Engineering
5.6 Customized Packages
6. Peripherals and Accessories ( 10 hours)
6.1 Printer/Plotter
6.2 Scanner
6.3 Mouse/Digitizer
6.4 CD-ROM/Optical Drive/Tape Drive
7. Network and Internet ( 12 hours)
7.1 Peer to peer and Dedicated server types
7.2 Topologies: Bus, Ring and Star
7.3 Network Cabling: 10Base2, 10BaseT, 10Base5, 100BaseT, Hub, Terminator, T
7.4 Networking Operating System: Novell NetWare, Windows NT, LANtastic, Windows95, SCO Unix, Banyan Vines, LAN Manager
7.5 Advantages, Disadvantages
7.6 The Internet
8. Computer Application ( 1 hour)
8.1 Computer Application
8.2 Impact of Computers on Society
8.3 Future development
Laboratory:
1. Six lab exercises covering computer hardware and Software.
2. Demonstration of Computer Network.
References:
1. Winn Rosch, "Hardware Bible"
2. P. K. Sinha, "Computer Fundamentals"
1.1 Evolution of Computer
1.2 Classification
1.2.1 Operation: Analog and Digital
1.2.2 Uses: General purpose and Specific purpose
1.2.3 Capacity: Mainframe, Mini, Personal, and Super computer
2. Basic Architecture ( 7 hours)
2.1 Building blocks of a PC
2.1.1 CPU
2.1.2 Memory
2.1.3 Input
2.1.4 Output
2.2 The Storage devices: Floppy Disk and Harddisk
2.3. Introduction of Peripherals
3. Operating System ( 4 hours)
3.1 Definition and Classification
3.2 Functions of Operating System
3.3 DOS
3.4 Windows
3.5 Mac OS
3.6 Unix
3.7 OS/2
4. Programming Languages, Interpreters and Compilers (4 hours)
4.1 Introduction and basic elements of programming language
4.2 Classification of programming language
4.3 Characteristics of Computer program
4.4 Assembler, Interpreter, and Compiler
4.5 Introduction to programming languages
5. Software Applications ( 5 hours)
5.1 Word Processor
5.2 Spreadsheet
5.3 Database
5.4 Graphics
5.5 Engineering
5.6 Customized Packages
6. Peripherals and Accessories ( 10 hours)
6.1 Printer/Plotter
6.2 Scanner
6.3 Mouse/Digitizer
6.4 CD-ROM/Optical Drive/Tape Drive
7. Network and Internet ( 12 hours)
7.1 Peer to peer and Dedicated server types
7.2 Topologies: Bus, Ring and Star
7.3 Network Cabling: 10Base2, 10BaseT, 10Base5, 100BaseT, Hub, Terminator, T
7.4 Networking Operating System: Novell NetWare, Windows NT, LANtastic, Windows95, SCO Unix, Banyan Vines, LAN Manager
7.5 Advantages, Disadvantages
7.6 The Internet
8. Computer Application ( 1 hour)
8.1 Computer Application
8.2 Impact of Computers on Society
8.3 Future development
Laboratory:
1. Six lab exercises covering computer hardware and Software.
2. Demonstration of Computer Network.
References:
1. Winn Rosch, "Hardware Bible"
2. P. K. Sinha, "Computer Fundamentals"
Logic Circuits
Course Objectives
An introduction to logic design. The main goal is to develop methods of
designing, constructing and building logic circuits.
1.0 Number System: (6 hours)
1.1 Decimal system and binary system
1.2 Base conversion methods
1.3 Complements of numbers
1.4 Basic arithmetic of binary numbers, use of 2’ s complement
1.5 Signed and unsigned numbers
1.6 Fractions conversion
1.7 Octal, hexadecimal and binary coded decimal (BCD)
1.8 Gray code, alphanumeric code
1.9 Error codes
2.0 Digital Design Fundamentals: (11 hours)
2.1 Logic gates, symbols, truth tables
2.2 Realization of logic gates using diodes, using NAND / NOR gates
2.3 Boolean algebra, DeMorgan’s law
2.4 The Karnaugh map, don’t care conditions
2.5 Minimization theorems and reduction of K-map
2.6 Product- of-sum and sum-of -product realization of K-map
2.7 Functional test vectors
3.0 Digital System Building Blocks: (11 hours)
3.1 Combinational Digital System
3.1.1 Half adder, full adder, n-bit adder
3.1.2 Encoder, decoder, multiplexer, demultiplexer
3.1.3 ROM, PLA
3.1.4 Practical aspects – fan-in, fan-out, propagation delay
3.2 Sequential Digital System
3.2.1 Difference between combinational and sequential circuit
3.2.2 The concept of memory, flip-flop as 1-bit register
3.2.3 Clock, Rising edge, falling edge and level triggering
3.2.4 Setup time, hold time, clock skew
3.2.5 S-R, J-K, Master-slave, T, and D type flip-flops, latches
3.2.6 Shift registers
3.2.6.1 Serial to parallel converter
3.2.6.2 Serial in serial out register
3.2.6.3 Parallel to serial converter
3.2.6.4 Parallel in parallel out register
3.2.6.5 Right shift, Left-shift register
3.2.6.6 Digital delay line
3.2.6.7 Sequence generator
3.2.6.8 Shift register ring and twisted ring counter
3.2.7 Ripple counter, synchronous counter, applications
4.0 Sequential Machines: (10 hours)
4.1 Synchronous machines
4.1.1 Clock driven models and state diagrams
4.1.2 Transition tables, Redundant states
4.1.3 Binary assignment
4.1.4 Use of flip-flops in realizing the models
4.2 Asynchronous machines
4.2.1 Hazards in asynchronous systems and use of redundant branch
4.2.2 Allowable transitions
4.2.3 Flow tables and merger diagrams
4.2.4 Excitation maps and realization of the model
5.0 Digital Design Examples: (7 hours)
5.1 Design study: Character Generators
5.1.1 Dot matrix of a character
5.1.2 Printed characters
5.1.3 CRT single-character waveform
5.1.4 Display of one character
5.1.5 Display of a line of characters
5.2 Design work: Serial adder
5.2.1 Block diagram and design issues
5.2.2 Concept of tri-state logic and bus
5.2.3 The registers with a common bus
5.2.4 The summing unit
Laboratory : The laboratory exercises in this course consist of both CAD and hardware construction. The hardware experiments involve the use of logic patch boards for construction of gates array and memory based circuits.
1.0 Safe Laboratory procedures
2.0 AND, OR, and INVERTER gates
3.0 DeMorgan’s law and familiarization with NAND and NOR gates.
4.0 Familiarization with binary addition and subtraction.
5.0 Construction of true complement generator
6.0 Encoder, decoder, and multiplexer.
7.0 Latches, RS, Master-slave and T type flip flops.
8.0 D and J-K type flip flops.
9.0 Shift registers
10.0 Ripple Counter, Synchronous counter
11.0 Familiarization with computer package for logic circuit design.
12.0 Design digital circuits using CAD.
References:
1.0 M. M. Mano, “Digital Logic and Computer Design”. Prentice Hall, Englewood Cliffs, N. J. 07632, 1979.
2.0 William I. Fletcher, “An Engineering Approach to Digital Design”. Prentice Hall of India, New Delhi 110 001, 1990.
3.0 Millman-Halkias, “Integrated Electronics”. McGraw-Hill, 1986.
4.0 D. L. Dietmeyer, “Logic Design of Digital systems”. Allyn and Bacon, Inc., Massachusetts 02194, 1982.
5.0 A. F. Malvino, “Digital Electronics & Computer” McGraw Hill
An introduction to logic design. The main goal is to develop methods of
designing, constructing and building logic circuits.
1.0 Number System: (6 hours)
1.1 Decimal system and binary system
1.2 Base conversion methods
1.3 Complements of numbers
1.4 Basic arithmetic of binary numbers, use of 2’ s complement
1.5 Signed and unsigned numbers
1.6 Fractions conversion
1.7 Octal, hexadecimal and binary coded decimal (BCD)
1.8 Gray code, alphanumeric code
1.9 Error codes
2.0 Digital Design Fundamentals: (11 hours)
2.1 Logic gates, symbols, truth tables
2.2 Realization of logic gates using diodes, using NAND / NOR gates
2.3 Boolean algebra, DeMorgan’s law
2.4 The Karnaugh map, don’t care conditions
2.5 Minimization theorems and reduction of K-map
2.6 Product- of-sum and sum-of -product realization of K-map
2.7 Functional test vectors
3.0 Digital System Building Blocks: (11 hours)
3.1 Combinational Digital System
3.1.1 Half adder, full adder, n-bit adder
3.1.2 Encoder, decoder, multiplexer, demultiplexer
3.1.3 ROM, PLA
3.1.4 Practical aspects – fan-in, fan-out, propagation delay
3.2 Sequential Digital System
3.2.1 Difference between combinational and sequential circuit
3.2.2 The concept of memory, flip-flop as 1-bit register
3.2.3 Clock, Rising edge, falling edge and level triggering
3.2.4 Setup time, hold time, clock skew
3.2.5 S-R, J-K, Master-slave, T, and D type flip-flops, latches
3.2.6 Shift registers
3.2.6.1 Serial to parallel converter
3.2.6.2 Serial in serial out register
3.2.6.3 Parallel to serial converter
3.2.6.4 Parallel in parallel out register
3.2.6.5 Right shift, Left-shift register
3.2.6.6 Digital delay line
3.2.6.7 Sequence generator
3.2.6.8 Shift register ring and twisted ring counter
3.2.7 Ripple counter, synchronous counter, applications
4.0 Sequential Machines: (10 hours)
4.1 Synchronous machines
4.1.1 Clock driven models and state diagrams
4.1.2 Transition tables, Redundant states
4.1.3 Binary assignment
4.1.4 Use of flip-flops in realizing the models
4.2 Asynchronous machines
4.2.1 Hazards in asynchronous systems and use of redundant branch
4.2.2 Allowable transitions
4.2.3 Flow tables and merger diagrams
4.2.4 Excitation maps and realization of the model
5.0 Digital Design Examples: (7 hours)
5.1 Design study: Character Generators
5.1.1 Dot matrix of a character
5.1.2 Printed characters
5.1.3 CRT single-character waveform
5.1.4 Display of one character
5.1.5 Display of a line of characters
5.2 Design work: Serial adder
5.2.1 Block diagram and design issues
5.2.2 Concept of tri-state logic and bus
5.2.3 The registers with a common bus
5.2.4 The summing unit
Laboratory : The laboratory exercises in this course consist of both CAD and hardware construction. The hardware experiments involve the use of logic patch boards for construction of gates array and memory based circuits.
1.0 Safe Laboratory procedures
2.0 AND, OR, and INVERTER gates
3.0 DeMorgan’s law and familiarization with NAND and NOR gates.
4.0 Familiarization with binary addition and subtraction.
5.0 Construction of true complement generator
6.0 Encoder, decoder, and multiplexer.
7.0 Latches, RS, Master-slave and T type flip flops.
8.0 D and J-K type flip flops.
9.0 Shift registers
10.0 Ripple Counter, Synchronous counter
11.0 Familiarization with computer package for logic circuit design.
12.0 Design digital circuits using CAD.
References:
1.0 M. M. Mano, “Digital Logic and Computer Design”. Prentice Hall, Englewood Cliffs, N. J. 07632, 1979.
2.0 William I. Fletcher, “An Engineering Approach to Digital Design”. Prentice Hall of India, New Delhi 110 001, 1990.
3.0 Millman-Halkias, “Integrated Electronics”. McGraw-Hill, 1986.
4.0 D. L. Dietmeyer, “Logic Design of Digital systems”. Allyn and Bacon, Inc., Massachusetts 02194, 1982.
5.0 A. F. Malvino, “Digital Electronics & Computer” McGraw Hill
Semiconductor Devices
COURSE OBJECTIVES
To introduce the fundamentals of analysis of electronic circuits containing modern electronic components.
1.0 Linear Device Models: (6 hours)
1.1 Voltage-controlled voltage source model
1.2 Voltage-controlled current source model
1.3 Input and output resistance
1.4 Voltage and power gain calculations
1.5 Reverse transfer concept and the hybrid-pi circuit
1.6 Voltage gain calculations using the hybrid-pi circuit
1.7 y, z and h parameter calculations from the hybrid-pi circuit
1.8 Hybrid-pi circuit parameter calculations from the y, z and h parameters
2.0 Two-Terminal Nonlinear Devices: (6 hours)
2.1 Nonlinear circuit analysis
2.2 The load line
2.3 The perfect diode and circuit calculations
2.4 Semi conductor diode characteristics
2.5 Modeling the semi conductor diode and circuit calculations
2.6 Zener diode characteristics, modeling and circuit analysis
3.0 The Junction Field-Effect Transistor, a Three-Terminal Nonlinear Device: (6 hours)
3.1 JFET quadratic characteristics
3.2 Load line construction and biasing
3.3 Small-signal model around a dc operations point
3.4 JFET amplifier small-signal analysis
4.0 The Bipolar Transistor, a Three-Terminal Nonlinear Device: (8 hours)
4.1 The Ebers-Moll equations
4.2 Transistor configurations
4.3 Load line and biasing in the common-base configuration
4.4 Small-signal model around a dc operating point
4.5 Common-base amplifier small-signal analysis
4.6 Load line and biasing in the common-emitter configuration
4.7 Small-signal model around a dc operating point
4.8 Common-emitter amplifier small-signal analysis
4.9 Load-line and biasing in the common-collector configuration
4.10 Small-signal model around a dc operating point
4.11 Common-collector amplifier small-signal analysis
5.0 The Metal-oxide-semi conductor Transistor, a Three-Terminal Nonlinear Device: (6 hours)
5.1 The MOSFET quadratic characteristics
5.2 MOSFET load line and biasing
5.3 Small-signal model around a dc operating point
5.4 MOSFET amplifier small-signal analysis
6.0 Switching Circuits: (5 hours)
6.1 The bipolar transistor switch
6.2 Bipolar transistor logic circuits, examples of TTL circuits
6.3 The MOSFET switch
6.4 The NMOS family of logic circuits, some examples
6.5 The CMOS family of logic circuits, some examples
7.0 The Operational Amplifier: (6 hours)
7.1 The ideal operational amplifier
7.2 Feedback ideas
7.3 Inverting and non-inverting amplifiers
7.4 Summing amplifier
7.5 Integrator
7.6 Differentiator
7.7 Simple RC active filter
7.8 Combination of real diodes and the ideal operational amplifier in circuits such as the precision rectifier, the peak detector, the voltage clamp, etc.
Laboratory:
1.0 Introductory laboratory to familiarize students with equipment.
2.0 Diode characteristics, rectifiers, zener diodes.
3.0 Junction field-effect transistor characteristics and single stage amplifiers.
4.0 Bipolar transistor characteristics and single stage amplifiers.
5.0 some basic bipolar circuits for integrated circuit design: widlar current sources, current mirrors.
6.0 CMOS inverter characteristics, simple oscillator circuit.
Reference Book:
1.0 A. S. Sedra and K. C. Smith, “Microelectronic Circuits”, 2nd Edition, Holt, Rinehart and Winston, Inc., New York, 1987.
2.0 J. R. Cogdell, “Foundations of Electrical Engineering”, Prentice Hall, Englewood Cliffs, New Jersey, 1990.
To introduce the fundamentals of analysis of electronic circuits containing modern electronic components.
1.0 Linear Device Models: (6 hours)
1.1 Voltage-controlled voltage source model
1.2 Voltage-controlled current source model
1.3 Input and output resistance
1.4 Voltage and power gain calculations
1.5 Reverse transfer concept and the hybrid-pi circuit
1.6 Voltage gain calculations using the hybrid-pi circuit
1.7 y, z and h parameter calculations from the hybrid-pi circuit
1.8 Hybrid-pi circuit parameter calculations from the y, z and h parameters
2.0 Two-Terminal Nonlinear Devices: (6 hours)
2.1 Nonlinear circuit analysis
2.2 The load line
2.3 The perfect diode and circuit calculations
2.4 Semi conductor diode characteristics
2.5 Modeling the semi conductor diode and circuit calculations
2.6 Zener diode characteristics, modeling and circuit analysis
3.0 The Junction Field-Effect Transistor, a Three-Terminal Nonlinear Device: (6 hours)
3.1 JFET quadratic characteristics
3.2 Load line construction and biasing
3.3 Small-signal model around a dc operations point
3.4 JFET amplifier small-signal analysis
4.0 The Bipolar Transistor, a Three-Terminal Nonlinear Device: (8 hours)
4.1 The Ebers-Moll equations
4.2 Transistor configurations
4.3 Load line and biasing in the common-base configuration
4.4 Small-signal model around a dc operating point
4.5 Common-base amplifier small-signal analysis
4.6 Load line and biasing in the common-emitter configuration
4.7 Small-signal model around a dc operating point
4.8 Common-emitter amplifier small-signal analysis
4.9 Load-line and biasing in the common-collector configuration
4.10 Small-signal model around a dc operating point
4.11 Common-collector amplifier small-signal analysis
5.0 The Metal-oxide-semi conductor Transistor, a Three-Terminal Nonlinear Device: (6 hours)
5.1 The MOSFET quadratic characteristics
5.2 MOSFET load line and biasing
5.3 Small-signal model around a dc operating point
5.4 MOSFET amplifier small-signal analysis
6.0 Switching Circuits: (5 hours)
6.1 The bipolar transistor switch
6.2 Bipolar transistor logic circuits, examples of TTL circuits
6.3 The MOSFET switch
6.4 The NMOS family of logic circuits, some examples
6.5 The CMOS family of logic circuits, some examples
7.0 The Operational Amplifier: (6 hours)
7.1 The ideal operational amplifier
7.2 Feedback ideas
7.3 Inverting and non-inverting amplifiers
7.4 Summing amplifier
7.5 Integrator
7.6 Differentiator
7.7 Simple RC active filter
7.8 Combination of real diodes and the ideal operational amplifier in circuits such as the precision rectifier, the peak detector, the voltage clamp, etc.
Laboratory:
1.0 Introductory laboratory to familiarize students with equipment.
2.0 Diode characteristics, rectifiers, zener diodes.
3.0 Junction field-effect transistor characteristics and single stage amplifiers.
4.0 Bipolar transistor characteristics and single stage amplifiers.
5.0 some basic bipolar circuits for integrated circuit design: widlar current sources, current mirrors.
6.0 CMOS inverter characteristics, simple oscillator circuit.
Reference Book:
1.0 A. S. Sedra and K. C. Smith, “Microelectronic Circuits”, 2nd Edition, Holt, Rinehart and Winston, Inc., New York, 1987.
2.0 J. R. Cogdell, “Foundations of Electrical Engineering”, Prentice Hall, Englewood Cliffs, New Jersey, 1990.
Electric Circuits II
Course Objectives: To continue work in Electric Circuits I including the use of the Laplace Transform to determine the time and frequency domain responses of electric circuits.
1.0 Matrix Methods in Network Analysis: (4 Hours)
1.1 Mesh Analysis
1.2 Nodal analysis
2.0 Review of Classical Solution if Ordinary Differential Equations With Constant Coefficients: (5 hours)
2.1 First order differential equations, RL and RC circuits
2.2 General and particular solution
2.3 Initial conditions on L's and C's
2.4 Natural unforced response of LR and CR circuits from initial conditions, time
constant
2.5 Complete transient and steady state response of first order system including
initial conditions and applied forcing functions.
3.0 Complete Time Domain Response of Second and Higher Order System: (5 hours)
3.1 Initial conditions
3.2 Transient and steady state components of response including initial conditions
3.3 RLC resonance, damping factors, high and low Q circuits
4.0 Review of Laplace Transform: (4 hours)
4.1 Definitions and properties valuable for network analysis
4.2 Laplace transform of common forcing functions
4.2.1 Step and shifted step functions
4.2.2 Ramp and impulse functions
4.2.3 Sinusoidal functions
4.3 Real translation and complex translation theorem
4.4 Partial fraction expansion
5.0 Use of Laplace Transform Techniques for Solution of Ordinary Differential Equations with Constant Coefficients: (4 hours)
5.1 Transient and steady-state responses of networks to step, ramp, impulse and
sinusoidal forcing functions with and without initial conditions on L's and C's
5.1.1 First order systems
5.1.2 Second and higher order systems
6.0 Transfer Functions, Poles and Zeros of Networks: (4 hours)
6.1 Concept of complex frequency
6.2 Transfer functions for two part networks
6.3 Poles and zeros of network functions
6.4 Relationship between pole/zero and system time response
7.0 Frequency Response of Networks: (4 Hours)
7.1 Magnitude and phase response
7.2 Bode diagrams
7.3 Band width, high-Q and low-Q circuits
7.4 Basic concept of filters, high-pass, band stop, low and band-pass filters
8.0 Fourier Series and transform: (5 hours)
8.1 Basic concept of Fourier series and analysis
8.2 Evaluation of Fourier coefficients for periodic non-sinusoidal waveforms in electric networks
8.3 Introduction of Fourier transforms
9.0 Two-port Parameters of Networks: (6 hours)
9.1 Definition of two-port networks
9.2 Short circuit admittance parameters
9.3 Open circuit impedance parameters
9.4 Transmission Short circuit admittance parameters
9.5 Hybrid parameters
9.6 Relationship and transformations between sets of parameters
9.7 Applications to filters
9.8 Applications to transmission lines
10.0 State Space Analysis: (4 hours)
10.1 Concept of state and state variables
10.2 State space representation of network equations
Laboratory:
1.0 Transient Response in first Order System Passive Circuits
- measure step and impulse of RC and RL circuits using oscilloscope
- relate time responses to analytical transfer function) calculations
2.0 Transform Response in Second Order System Passive Circuits
- measure step and impulse response of RLC series and parallel circuits using oscilloscope
- relate time responses to transfer functions and pole-zero configuration
3.0 Frequency Response of first and Second Order Passive Circuits
- measure amplitude and phase response and plot Bode diagrams for RL, RC and RLC circuits
- relate body diagrams to transfer functions and pole-zero configuration circuits.
4.0 Electric circuits Simulation Study
- Use SPICE program to simulate circuit and tests carried out in lab 1-3 and compare result from measurement with those from SPICE
5.0 Measurement of Harmonic Content of a Voltage
- Calculate Fourier coefficients for a square wave and variety this by harmonic measurements of a signal form a square wave generator using harmonic analyser.
- Repeat for a half wave rectified wave form using a diode and a resistor
Reference Books:
a) M.E. Van Valkenburg, "Network Analysis", third Edition, Prentice hall, 1995
b) William H. Hayt. Jr. & Jack E. Kemmerly, “Engineering Circuits Analysis", Forth edition, McGraw Hill International, Editions, Electrical Engineering Series, 1987.
c) Michel D. Cilletti, "Introduction to Circuits Analysis and Design", Holt, Hot Rinehart and Winston International Edition, New York, 1988.
1.0 Matrix Methods in Network Analysis: (4 Hours)
1.1 Mesh Analysis
1.2 Nodal analysis
2.0 Review of Classical Solution if Ordinary Differential Equations With Constant Coefficients: (5 hours)
2.1 First order differential equations, RL and RC circuits
2.2 General and particular solution
2.3 Initial conditions on L's and C's
2.4 Natural unforced response of LR and CR circuits from initial conditions, time
constant
2.5 Complete transient and steady state response of first order system including
initial conditions and applied forcing functions.
3.0 Complete Time Domain Response of Second and Higher Order System: (5 hours)
3.1 Initial conditions
3.2 Transient and steady state components of response including initial conditions
3.3 RLC resonance, damping factors, high and low Q circuits
4.0 Review of Laplace Transform: (4 hours)
4.1 Definitions and properties valuable for network analysis
4.2 Laplace transform of common forcing functions
4.2.1 Step and shifted step functions
4.2.2 Ramp and impulse functions
4.2.3 Sinusoidal functions
4.3 Real translation and complex translation theorem
4.4 Partial fraction expansion
5.0 Use of Laplace Transform Techniques for Solution of Ordinary Differential Equations with Constant Coefficients: (4 hours)
5.1 Transient and steady-state responses of networks to step, ramp, impulse and
sinusoidal forcing functions with and without initial conditions on L's and C's
5.1.1 First order systems
5.1.2 Second and higher order systems
6.0 Transfer Functions, Poles and Zeros of Networks: (4 hours)
6.1 Concept of complex frequency
6.2 Transfer functions for two part networks
6.3 Poles and zeros of network functions
6.4 Relationship between pole/zero and system time response
7.0 Frequency Response of Networks: (4 Hours)
7.1 Magnitude and phase response
7.2 Bode diagrams
7.3 Band width, high-Q and low-Q circuits
7.4 Basic concept of filters, high-pass, band stop, low and band-pass filters
8.0 Fourier Series and transform: (5 hours)
8.1 Basic concept of Fourier series and analysis
8.2 Evaluation of Fourier coefficients for periodic non-sinusoidal waveforms in electric networks
8.3 Introduction of Fourier transforms
9.0 Two-port Parameters of Networks: (6 hours)
9.1 Definition of two-port networks
9.2 Short circuit admittance parameters
9.3 Open circuit impedance parameters
9.4 Transmission Short circuit admittance parameters
9.5 Hybrid parameters
9.6 Relationship and transformations between sets of parameters
9.7 Applications to filters
9.8 Applications to transmission lines
10.0 State Space Analysis: (4 hours)
10.1 Concept of state and state variables
10.2 State space representation of network equations
Laboratory:
1.0 Transient Response in first Order System Passive Circuits
- measure step and impulse of RC and RL circuits using oscilloscope
- relate time responses to analytical transfer function) calculations
2.0 Transform Response in Second Order System Passive Circuits
- measure step and impulse response of RLC series and parallel circuits using oscilloscope
- relate time responses to transfer functions and pole-zero configuration
3.0 Frequency Response of first and Second Order Passive Circuits
- measure amplitude and phase response and plot Bode diagrams for RL, RC and RLC circuits
- relate body diagrams to transfer functions and pole-zero configuration circuits.
4.0 Electric circuits Simulation Study
- Use SPICE program to simulate circuit and tests carried out in lab 1-3 and compare result from measurement with those from SPICE
5.0 Measurement of Harmonic Content of a Voltage
- Calculate Fourier coefficients for a square wave and variety this by harmonic measurements of a signal form a square wave generator using harmonic analyser.
- Repeat for a half wave rectified wave form using a diode and a resistor
Reference Books:
a) M.E. Van Valkenburg, "Network Analysis", third Edition, Prentice hall, 1995
b) William H. Hayt. Jr. & Jack E. Kemmerly, “Engineering Circuits Analysis", Forth edition, McGraw Hill International, Editions, Electrical Engineering Series, 1987.
c) Michel D. Cilletti, "Introduction to Circuits Analysis and Design", Holt, Hot Rinehart and Winston International Edition, New York, 1988.
Subscribe to:
Posts (Atom)