You are on page 1of 115

Academic Handbook

M.Tech. Programme

Academic Affairs
(2013-2014)
NATIONAL INSTITUTE OF
TECHNOLOGY GOA

Course Curriculum
for
Master of Technology Programme
in
Computer Science and Engineering

Department of Computer Science and Engineering

National Institute of Technology Goa
Farmagudi, Ponda, Goa - 403 401

Semester-wise Credit Distribution
Semester
I
II
III
IV
Total Credits

Total Credits
18
18
14
14
64

P Credits Advanced Algorithms & Analysis (AAA) 3-0-0 3 CS601 Advanced Computer Networks (ACN) 3-0-0 3 3 CS602 3-0-0 3 4 CS8** Mathematical Foundations of Computer Science (MFCS) Elective-I 3-0-0 3 5 CS603 Advanced Algorithms & Analysis Laboratory 0-0-3 2 6 CS604 Advanced Computer Networks Laboratory 0-0-3 2 7 CS605 Seminar 0-0-3 2 Total Credits 18 Second Semester Sl.Summary of Course Contents (First year) First Semester Sl. Code 1 CS600 2 Subjects L-T. Code 1 CS650 2 Subjects L-T.P Credits Advanced Database Systems (ADBS) 3-0-0 3 CS651 Advanced Computer Architecture (ACA) 3-0-0 3 3 CS652 Object Oriented Software Engineering (OOSE) 3-0-0 3 4 CS8** Elective-II 3-0-0 3 5 CS653 Advanced Database Systems Laboratory 0-0-3 2 6 CS654 Object Oriented Software Engineering Laboratory 0-0-3 2 7 CS655 VIVA - 2 8 HU650 Communication Skills and Technical Writing (Audit 1-0-2 - Course) Total Credits 4 18 . No Sub. No Sub.

Code 1 CS700 2 3 Subjects L-T. Prerequisites for the Admission into the Programme 1 Data Structures 2 Design and Analysis of Algorithms 3 Computer Organization and Architecture 4 Discrete Mathematics 5 Computer Networks 6 Database Management Systems 5 . No Sub.P Credits Major Project-I 0-0-12 8 CS8** Elective-III 3-0-0 3 CS8** Elective-IV 3-0-0 3 Total Credits 14 Fourth Semester Sl. Code CS750 1 Subjects Major Project-II L-T. if they are not exposed to the prerequisites such as below. As the students with background other than computer science and engineering have been allowed to apply for M.Summary of Course Contents (Second year) Third Semester Sl. Tech programme in computer science and engineering. they may not be allowed to get the admission into the programme.P Credits 0-0-21 14 Total Credits 14 NOTE: The applicant must have a sufficient background in computer science and engineering to complete the degree requirements with reasonable performance. No Sub.

List of Electives Program Specific Electives SI. No. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 Course Code CS800 CS801 CS802 CS803 CS804 CS805 CS806 CS807 CS808 CS809 CS810 CS811 CS812 CS813 CS814 CS815 CS816 CS817 CS818 CS819 CS820 CS821 CS822 CS823 CS824 CS825 CS826 Course Name Foundations of Cryptography Wireless Sensor Networks Advanced Compiler Design Distributed Computing Systems Design of Secure Protocols Mobile Computing Machine Learning Health Informatics Soft Computing Service Oriented Architecture & Cloud Computing Big Data Analytics Pattern Recognition Artificial Neural Networks Computer Vision Game Theory Data Warehousing & Data Mining E-Commerce Advanced Operating Systems Security and Privacy Bioinformatics Algorithms Graph Theory Probability and Statistics Program Analysis and Verification Linear Algebra Number Theory Complexity Theory Human Computer Interface 6 Total Credits (L-T-P) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) Credits 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) 3 3 3 3 3 3 3 3 3 .

No Sub. They are evaluated like any other courses and credits earned count towards degree requirements.P Credits 1-0-2 - . These courses can be given anytime in the semester. the above semester-wise credit structure is followed. The syllabi of these courses are not specified.1-Credit Module Courses SI. Code 1 HU650 Subjects Communication Skills and Technical Writing (* No credits) 7 L-T. 1 2 3 4 5 6 7 8 9 10 Course Code CS827 CS828 CS829 CS830 CS831 CS832 CS833 CS834 CS835 CS836 Course Name Special Module in Computational Geometry Special Module in Parallel Computation Special Module in Hardware Systems Special Module in Theoretical Computer Science Special Module in Artificial Intelligence Special Module in High Speed Networks Special Module in Concurrency Special Module in NLP Special Module in Numerical Methods Special Module in CSE* Total Credits (L-T-P) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) (3-0-0) Credits 1 1 1 1 1 1 1 1 1 1 These courses will usually cover topics that are not generally covered in the regular courses. It will be decided by the courses instructor from time to time. Interested students can register for these courses for credits. provided. No. Audit Course* Sl. * The 1-credit module course CS836 will cover topics of current interest in computer science and engineering. They are specially designed to take advantage of short time eminent visitors from Industry/Academics.

Proposed Course Contents 8 .

T... etc. Algorithm design techniques: Greedy algorithms. dynamic programming. Voronoi diagrams. R. Arithmetic algorithms : GCD. Leiserson and Ronald D River. 4. Internet algorithms. Combinatorial algorithms. Randomized algorithms for the problems in various domains viz. Algorithms on graphs : Traversal. NPCompleteness proofs. divide-and-conquer algorithms. 3rd edition. 2002. 9 . max flow algorithm etc. Vijay V Vazirani. Graph algorithms.. 1979. 1995. Module 4 10 Hours Randomized algorithms: Monte Carlo and Las Vegas algorithm.. Geometric algorithms parallel and distributing algorithms. NP-Completeness and reducibility. shortest path. optimal algorithms. PHI. Proof of lower. NP-Complete problems. S. Hopcroft and Ullman The design and analysis of Computer Books Algorithms. primality testing etc. 1st edition. 1st edition.Setcover. time and space complexity.. Branch-and-bound. Numerical algorithms. etc. modular arithmetic. Addison Weseley. Computers and Intractability: A Guide to the Theory of NP-Completeness. Cormen.. cut . radix and bucket sorts. Freeman. Exact exponential algorithms: 1. Aho. Approximation Algorithms. Module 5 5 Hours Approximation Algorithms: PTAS and FPTAS algorithms. TSP etc. Cambridge University. amortization. Johnson. online algorithms. Charles E. 3. 2009. 5. M. Garey and D. Springer. Module 3 10 Hours NP-Completeness: Polynomial time. sweep paradigm. Verification. 1974. Geometric algorithms : Convex hulls. Reference 2.Subject Code CS600 Course Objectives Module 1 Advanced Algorithms & Analysis (AAA) Credits: 3 (3-0-0) Total hours: 45 To study paradigms and approaches used to analyze and design algorithms and to appreciate the impact of algorithm design in practice. topological sort. Module 2 15 Hours Algorithms on arrays: Selection and median-finding. Introduction to Algorithms. 1st edition. minimum spanning trees.. string matching (Rabin-Karp and Knuth-Morris-Pratt algorithms) etc. Number theory and algebra. network flow -preflow-push algorithms. counting. 5 Hours Formal models of computation. Randomized Algorithms. Rajeev Motwani and Prabhakar Raghavan.

Paradigms for Communication in Internet. Multicast Routing Protocols. IPSEC. Gigabit Ethernet. Behrouz A. Morgan Kauffman. Reference Tata McGraw Hill. SONET. Video conference. Markus Hoffmann and Leland R. 1. Quality of Service Mechanisms.Subject Code CS601 Advanced Computer Networks (ACN) Course Objectives To understand the theoretical and the practical aspects of the advanced networking principles including the distributed computing. High Performance Communication Networks. Applications(WWW. Content Delivery Networks. IPv6. Mitigation in Internet. Module 5 5 Hours Applications and Other Networking Technologies: RTP. VoIP. Module 4 12 Hours Distributed Systems: Naming. and Practice. High speed transport protocols. 2007. Protocols to Support Streaming Media. 2000 4. PGP. SIP. Security in MPLS. PON. Bluetooth. DiffServ and IntServ Architectures. Security Systems. BGP. 3. RTSP. Protocols. Varaiya. Traffic Characterization (CBR. Walrand and P. Module 2 8 Hours Local Area Network Technologies: Fast Ethernet. Flow Control. Overlay and P2P Networks. DSL. Computer Networks: A Systems Approach. Morgan Kauffman. DDNS. Larry L. 2013. J. Multi Protocol Label Switching. Peterson and Bruce S. TCP/IP reference model. CATV. Caching. 10 . 2nd edition. DDoS Attack. 4th edition. Virtual Private Networks. Beaumont. DTH. 10 Hours Module 1 Credits: 3 (3-0-0) Total hours: 45 Review of Basic Network Architectures: OSI reference model. Switching Paradigms. ATM reference model. Morgan Kaufmann. Satellite and Ad hoc Networks. RSVP. Books 2. FTH. Optical Networks. 5th edition. IEEE 802. Improving QoS in Internet. VBR). Issues of Scaling in Internet and Distributed Systems. Forouzan. Audio/Video Streaming. Caching Techniques forWeb. Networked Games. TLS. VLANS. Multiplexing. Davie. 2005.11 WLAN. SSH. Content Networking: Architecture. Multimedia Transport Protocols. Client/Server). ISDN. The course involves the future networking principles also. Module 3 10 Hours Internetworking: Interdomain Routing. Data Communications and Networking. DNS. Introduction to Cellular. Error Control. Connecting LANs.

Functions. their equivalence with Turing machines. Books vol. Some other computing models and formalisms. Undecidability. Feller. 1971. Induction. MA. Distributions. Module 4 10 Hours Probability– Sample space. Rajeev Motowani and Jeffrey Ullman. Principle of Inclusion-Exclusion. Automata Theory. Course Objectives 2. Languages. Random Variables. Module2 6 Hours Combinatorics– General Counting methods. Mathematical logic. John Hopcroft. Eigen values. Introduction to Linear Algebra. Reference 1. Applications to undecidability. 11 . Vector Spaces. quadratic residues. Combinatorics. Proof techniques. congruences. Recurrence relations..Subject Code Mathematical Foundations of Computer Science (MFCS) CS602 Credits: 3 (3-0-0) Total hours: 45 This course introduces the mathematical foundations for computer science. Discrete mathematics. Module 1 10 Hours Language of Math– Logic. Boolean and linear algebra and Automata theory. Matrices and Linear Transformations. Cantor’s diagonalization. Basic number theory: Divisibility. Wellesley-Cambridge Press. th 4. Functions of random variables. Expectation. Springer. 1974. Module 5 10 Hours Linear Algebra– Fields. 3rd edition. countable and uncountable sets. Posets and Lattices . Turing machines. 2011. viz. Gilbert Strang. Groups and algebraic structures. An Introduction to Probability Theory and Its Applications. 1 & 2. Relations. Jean Gallier.Permutations. (infinite) sets. Chebyshev inequality. Context-free languages and pushdown automata. Grammars and Languages: Regular languages and finite automata.Applications to optimization problems and graph theory. Wiley. and Computation. Generating Functions. W. Orthogonality. Basis. 2009. Module 3 09 Hours Automata. 4 Edition. Recursion. 3. Vector and Matrix Norms . Applications. Wellesley. Tail Inequalities Chernoff Bound.

Cormen. Computer Algorithms: Introduction to Design and Analysis. Introduction to Algorithms. and C. Michael T..Subject Code CS603 Course Objectives Advanced Algorithms & Analysis Laboratory Credits: 2 (0-0-3) Total hours: 42 To have hands on session with the algorithms. Harper Collins. 3. Addison-Wesley. 4. 1991. Experiments Experiments include the implementations of the algorithms related to various computational problems in various domains viz. M. vol. Reference Books 1. John Wiley. Data Structures and Their Algorithms. C. Analysis. Goodrich and Roberto Tamassia. Stein. L. 2008. H. L. Alsuwaiyel. using different design paradigms. Rivest. Algorithm Design: Foundations. and numerical algorithms etc. 1999. Harry R. and Internet Examples. Geometric algorithms. H. 1st edition. cryptographic algorithms. 2000. Leiserson. Algorithm Design Techniques and Analysis. - Divide and conquer algorithms. 2009. R. Graph algorithms. Sara Baase and Allen Van Gelder. MIT Press. 2. 12 . T. World Scientific. 2nd edition. Lewis and Larry Denenberg. - Greedy algorithms - Dynamic programming algorithms - Branch and bound algorithms Implementation of the randomized algorithms for various computational problems and comparison with their best deterministic counterparts. 5. 7. 3rd edition..

Davie. Java Network Programming. rd 3. To develop a chat application 3. FIFOs. Morgan Kaufmann. 2003. Course Objectives Subject Code Seminar Credits: 2 (0-0-3) CS605 Course Objectives Students will have to choose a topic in CSE’s current trends or industry practices. Exercises to explore transport protocols 6. 13 . Computer Networks: A Systems Approach. Broadly applications will be of the following nature: 1. Simulation of the distributed systems 7. and present it along with a suitable demonstration. Reference 2. Simulation of the routing algorithms 5. 3 edition. O’Reilly. Rudoff. Richard Stevens. UNIX Network Books Programming. 2004. To develop a networked multi-party game 4. W. Bill Fenner and Andrew M. Addison Wesley. 2007. stream audio and video 2. Running clock synchronization algorithms 1. 4th edition. Elliotte Rusty Harold. Developing basic network client server programs to exchange data.Subject Code CS604 Advanced Computer Networks Laboratory Credits: 2 (0-0-3) Total hours: 42 To provide hands on in the topics studied in advanced computer networks course This laboratory focuses on developing applications inter process communication tools such as pipes. 3rd edition. Peterson and Bruce S. prepare a write up. message queues and sockets. Larry L.

Module 5 9 Hours Access Control-Models. 5. To understand and evaluate the aspects of database security. security and privacy. G. clustering. client server object bases. 1. Security for workflow systems. spatial operators. McGraw Hill. Addison Wesley. Recovery. spatial query languages. Sushil Jajodia. data storage. Elmasri and S. cache coherence. query optimization: cost estimation. DTD. shared disk systems. concurrency control heterogeneity issues. indexing. overview of client-server architecture and its relationship to distributed databases. nested transactions.anonymity. online query processing and optimization. Policy. vector model. Martella and P. need for spatial operators and relations. Benjamin . XPath. load balancing. Database system concepts. Mc-Graw Hill.5th edition. 2nd edition. AviSilberschatz. 1994. data partitioning. M. 1999. logical data models for spatial databases: raster model (map algebra). 10 Hours Module 3 Advanced transaction models: Save points. 10 Hours Module 2 Parallel databases: Parallel architectures. sagas. XML indexing. Henry Korth. OGIS queries. Springer. Castino. object identity and its implementation. 2007.g. Fugini. pipelining. data stream management.multidimensional k. Security in Advanced Database systems. query processing. XML. Security in Data Warehouses and OLAP systems. Sudarshan. R. multi-level transactions. 4. To explain the process of DB Query processing and evaluation. 8 Hours Module 4 Models of spatial data: Conceptual data models for spatial databases (e. 2008.index based. Distributed databases principles and systems. Trust management and Negotiations. adaptive query processing. Database watermarking. intra-operator parallelism. pictogram enhanced ERDs).Cummings. 3PC. and object-oriented databases.Subject Code CS650 Course Objectives Advanced Database Systems (ADBS) Credits: 3 (3-0-0) Total hours: 45 To develop an appreciation of emerging database trends as they apply to semistructured data. 5th edition. Samarati (eds). Books 3. Michael Gertz. Spatial database security. the internet. Secure data outsourcing. Database Security. multilevel recovery. 14 . persistent programming languages. replication and hot spares. Reference 2. Ceri S and Pelagatti G. SQL3 and ADT. 8 Hours Module 1 Distributed database concepts. shared nothing/shared disk/shared memory based architectures. 2005. Navathe. distributed systems 2PC. Fundamentals of database systems. and S. query optimization: algorithms. Handbook of Database Security: Applications and Trends. performance measures. S. scheduling.

hardware and software parallelism. Module 4 11 Hours Advanced processor architectures: Multithreaded processors. control flow versus data flow. design of the control unit. design of memory management unit. demand driven mechanisms. PHI. Terence Fountain and Peter Kacsuk. 2. memory hierarchy design-basic memory cell. memory chip. instruction level parallelism. Hennesy and David A. 2007 5. I/O methods Pipelined processor design: overlapped execution of instructions. Computer Architecture and Organization. grain size latency. 6. Parallel Computer: Architecture and Programming. John Paul Shen and Mikko H. Rajaraman and C. dynamic techniques. SIMD and MIMD. instruction format.pipelined arithmetic unit design. control flow techniques. John L. pipeline hazards. Conditions of parallelism. Tata McGraw Hill. John P. Storage systems: strage area networks. multi-processor systems. Sivarama murthy. Briggs. 3. Dezso Sima. 2000. memory data flow techniques. K. Graphics processing units. Reference Books 1. Hayes. 4th edition. Computer Architecture and Parallel Processing. Hwang and F. data and resource dependencies. Patterson. comparison of flow mechanisms. memory unit. pipeline idealism. V. cache-coherence protocols. 4. data path design. Module 2 13 Hours Superscalar processor: Parallel pipelines. Module 3 11 Hours High performance computing architectures: Parallel computer models and program parallelism. 1998. 2005. 3rd edition. out of order execution of instructions. Lipasti. Modern processor design Fundamentals of superscalar processors. multi-core processors. 1997. Elsevier.Subject Code CS651 Course Objectives Advanced Computer Architecture (ACA) Credits: 3 (3-0-0) Total hours: 45 To understand the design principles of the modern computing systems Module 1 10 Hours Principles of computer organization: Data representation. Classification of machines.A. McGraw Hill. directory based protocols. Computer Architecture. semantic constraints: register data flow techniques. Addison Wesley. 1984. program flow mechanism. RAID architecture. data flow architecture. program partitioning and scheduling. cache memory unit design with mapping methods and multi-level cache design. representation of instructions.A quantitative approach. SISD. McGraw Hill. Advanced Computer Architectures: A design space approach. 15 .instruction set architectures (RISC and CISC).

Mike O'Docherty.An Object-Oriented Approach.software engineering concepts. Object-Oriented Analysis and Design with Applications. forward engineering. coupling and cohesion. 4th edition. Wiley Publication. Michael W. managing and documenting testing. Patterns. Jim Conallen and Kelli A. managing and documenting analysis. managing and documenting system design. refactoring. class diagrams. requirements elicitation activities – identifying actors. system testing. software engineering development activities. Module 2 12 Hours Requirements elicitation .functional and nonfunctional requirements. communication diagrams. services and subsystem interfaces. identifying and storing persistent data. Module 4 11 Hours Mapping models to code – model transformation. sequence diagrams. project management. verifiability and traceability. Analysis modeling – analysis object models and dynamic models. Pearson Education. Bernd Bruegge and Allen H. and Java.Subject Code CS652 Course Objectives: Object Oriented Software Engineering (OOSE) Credits: 3 (3-0-0) Total hours: 45 This course introduces Object-oriented software engineering (OOSE) . state machine diagrams. Alan Dennis. Engle. Object-Oriented Software Engineering Reference Using UML. entity. 3. use-cases. project organization and communication. Introduction to UML . mapping activities. Young. or business by applying the object-oriented paradigm and visual modeling. designing the global control flow. identifying services and boundary conditions. boundary and control objects. managing software development. reverse engineering. composite structure diagrams. providing access control. scenarios. activity diagrams.which is a popular technical approach to analyzing. Addison-Wesley. Wiley. analysis activities – from use cases to objects. Robert A. addressing design goals – mapping subsystems to processors and components. object design – specifying interfaces. testing concepts – faults. interaction overview diagrams. 4. integration testing. usability testing. transformation principles. software lifecycle. Maksimchuk. system design activities – from objects to subsystems. Systems Analysis and Design with UML 2. 1. 16 . Bobbi J. Barbara Haley Wixom and David Tegarden. Module 1 11 Hours Introduction to software engineering . Module 3 11 Hours System design concepts – subsystem and classes. designing an application. generalization and specialization. object diagrams. clarity and correctness. testing activities – component inspection. deployment diagrams. erroneous states and failures.UML notations – package diagrams. unit testing. component diagrams. maintaining traceability and documentation. use-case diagrams. completeness. configuration management. Books 2.0 . 2012. Houston. 3rd edition. managing implementation. layers and partitions. Object-Oriented Analysis and Design: using UML. system. Rationale management. consistency. timing diagrams. 3rd edition. realism. Dutoit. 2009. Grady Booch. 2005.

5. Database system concepts. A project on distributed databases (decided by the instructor. Navathe. SQL programming and report generation ORACLE/SYBASE/DB2/SQL-Server/INFORMIX. Database schema design 2. Henry Korth. Distributed databases principles and systems. 1. Moving objects databases. 8. Database creation. ODBC and CORBA calls from application Programs. Tata Mc-Graw Hill. Database security exercises. McGraw-Hill. 2007. 2nd edition. Reference 2. 3. Morgan Kaufman. Raghu Ramakrishnan.Cummings. 5th edition Benjamin . R. 1999. Fundamentals of database systems. Ralf HartmutGuting and Markus Schneider. McGraw Hill. 5. Books 3. 2005. using a commercial RDBMS like 4.Subject Code CS653 Course Objectives Advanced Database Systems Laboratory Credits: 2 (0-0-3) Total hours: 42 To have hands on session of the Database concepts 1. AviSilberschatz. 6. Internet based access to databases and database administration. Implementation of Role based model for a database system. Students are to be exposed to front end development tools. Database management systems.) 7. Elmasri and S. and S. 17 . 2000. 5th edition. Ceri S and Pelagatti G. 2005. 4. Sudarshan.

Alan Dennis. 10. India. 5. StarUML. 4th edition. Identify the user interface. Furthermore. Analyze. Dutoit .Subject Code CS654 Course Objectives Object Oriented Software Engineering (OOSE) Laboratory Credits: 2 (0-0-3) Total hours: 42 The participants are expected to analyze application scenarios and design information systems using the Unified Modeling Language (UML). Draw component and deployment diagrams. Select domain of interest (e.0 . 2012. 11. John Wiley & Sons. Systems Analysis and Design with UML 2. Bernd Bruegge and Allen H. Jim Conallen and Kelli A. Identify use cases and develop the use case model. Barbara Haley Wixom and David Tegarden. Wiley. 3rd edition. design and develop this application using OOSE approach: 1. and Java. 1. 9. 4. Also develop risk management and project plan (Gantt chart). 2. Identity the conceptual classes and develop a domain model with UML Class diagram. Bobbi J. Draw the state chart diagram. Grady Booch. 6. Young.g. Maksimchuk. 8. and Rational Software Architect. 2009.An Object-Oriented Approach. Using the identified scenarios find the interaction between objects and represent them using UML Interaction diagrams. Michael W. Eclipse IDE. Patterns. Books 2. e-Ticketing). Develop an IEEE standard SRS document. Pearson Education. Mike O'Docherty. Engle. 3rd edition. and technical services. Addison-Wesley. logical architecture diagram with UML package diagram notation. Identify the business activities and develop an UML Activity diagram.g. Visual Paradigm for UML. Implement the domain objects layer. Implement the technical services layer. 4. Implement the user interface layer. Object-Oriented Software Engineering Reference Using UML. Object-Oriented Analysis and Design: using UML. Houston. Object-Oriented Analysis and Design with Applications. 2005. 7. 3. Draw the partial layered. 3. the designed systems are to be implemented using object-oriented programming language such as Java. 18 . 2007. Robert A. Suggested Software Tools: ArgoUML. domain objects. e-Commerce) and identify multi-tier software application to work on (e.

PrécisSummary/Executive Summary/Abstract Module 2 8 hours Technical Reports-Types-Format-Nuances to be followed Module 3 10 hours Preparation of Technical Document-Reports-Instruction Manuals-Project Proposal (Prefatory Part. 1971. and Professional Ethics ) Reference 1. Steve. Lencioni.Main Part. Crisp Learning. Writing Exercises-Paragraph. Patrick. 2000. Module 1 12 hours Introduction to Communication-Definition-Types-Classifications. Proxemics. New York: Drake Publishers. 2006. Millett. Subject Code HU650 (Audit Course) Communication Skills and Technical Writing Credits: 0 (1-0-2) Total hours: 45 This course is meant for developing Professional Communication and Technical Writing Skills among the students. John Wiley and Sons. Mandel.Subject Code CS655 Course Objectives VIVA Credits: 2 Students will have to attend for a viva-voce in presence of all the faculty of the department for the evaluation of the subjects studied in the first year (I and II semesters) with a suitable demonstration. 2.Terminal Section) Module 4 15 hours Presentation of Technical Report (Kinesics. Wood. The Lab hours will give emphasis on Technical Presentation and Seminar (on different emerging topics) followed by question-answer and discussion. The Five Dysfunctions of a Team: NJ. 3. Course Objectives 19 . 2011. The Art of Speaking. Technical Presentation Skills: A Practical Guide for Better Speaking Books: (Revised Edition). 4. Communication Skills. Raman and Sharma. New Delhi: OUP.

4. Hugh L. Springer.Montgomery. Authentication schemes. Finite fields. Commitment protocols. Herbert S. Paul C. Alfred J. Reference 1. Interactive proofs. Cambridge University Press. Menezes. Public key infrastructure. Rudolf Lidl. 1994. 2. cryptographic protocols and the latest elliptic curve systems. Vanstone. Elliptic curve cryptosystems. Ivan Niven. Zero knowledge proofs. Attacks. Module 2 6 Hours Symmetric key encryption: Stream ciphers and block ciphers. 3. van Oorschot. Elliptic curve. Non-interactive proofs. John Wiley. Neal Koblitz. An Introduction to the Theory of Numbers. Zukerman.Subject Code CS800 Foundations of Cryptography (FC) Credits: 3 (3-0-0) Total hours: 45 The purpose of the course is to familiarize the students to the arithmetic topics that Course Objectives have been at the centre of interest in applications of number theory. Springer. Hash functions. Module 3 10 Hours Public key cryptography. It also includes familiarizing the students with cryptography. Herald Niederreiter. Module 4 8 Hours Identification schemes. CRC Press. Digital cash. Module 5 9 Hours Secret sharing schemes. Electronic voting. 2002. 5. Identity based encryption. Handbook of Applied Cryptography. Hans Delfs. Introduction to Cryptography: Principles and Books Applications. Number theory and cryptography. 20 . Digital signatures. 2007. Scott A. particularly in cryptography. Helmut Knebl. 1991. 1996. Module 1 12 Hours Mathematical preliminaries: Number theory and algebra. Introduction to Finite Fields and their Applications. Key exchange algorithm.

Module 2 11 hours WSN architectural framework. security attacks.4 and ZigBee security. underground mining. serial flow control. WSN security – fundamentals and challenges. routing protocols. channel encoding. 2011. 2. active volcano. Christian Poellabauer. channels. basic ZigBee chat. IEEE 802. protocols and mechanisms for security. network layer – routing metrics. localization – ranging techniques. radio basics. Mehmet Can Vuran. El Emary.structural health monitoring. range-free localization. reliability. Building Wireless Sensor Networks: with ZigBee. wireless MAC protocols – energy efficiency. M. Ian F. introduction to Arduino. Module 3 11 hours Node and network management. 1. sensor node architecture and operating systems. scalability. Akyildiz. Wireless Sensor Networks in Reference Books Communications and Networking. Waltenegus Dargie. precision agriculture. XBee. Arduino. O'Reilly Media. Wireless Sensor Networks: From Theory to Applications. 4. Robert Faludi . time synchronization in WSN – basics and protocols. Course Objectives: 21 . Wiley-Blackwell. PAN addresses. 2010. 2010. dynamic power management. healthcare. 2013. advanced ZigBee. modulation. signal propagation. This course introduces the wireless sensor networks technology and discusses challenges in the design and management of wireless sensor networks. pipeline monitoring. Wiley. traffic control. adaptability. building WSN with Zigbee and Arduino. Ibrahiem M. CRC Press. Fundamentals of Wireless Sensor Networks: Theory and Practice. low latency and predictability. power management – local power management. addressing basics. range-based localization. 9 hours Module 1 Introduction to WSN. WSN applications . flooding and gossiping. Ramakrishnan. S.Subject Code CS801 Wireless Sensor Networks (WSN) Credits: 3 (0-0-3) Total hours: 45 A wireless sensor network (WSN) is a network of spatially distributed autonomous sensors those monitor physical or environmental conditions and cooperatively pass their data through the network to a main location. and Processing. introduction to ZigBee – network topology. 3. Module 4 14 hours Sensor network programming. event-driven localization.15. physical layer – source encoding.

Subject Code
CS802

Advanced Compiler Design
(ACD)

Credits: 3 (3-0-0)
Total hours: 45

Describe the steps and algorithms used by language translators, Recognize
the underlying formal models such as finite state automata, push-down
automata and their connection to language definition through regular
expressions and grammars, Discuss the effectiveness of optimization. To
understand the advancements in compiler construction.
Module 1
6 Hours
Introduction to compiler design, Model of a Compilers, Translators, Interpreters, Assemblers,
Languages, Computer Architecture vs Compiler Design, Lexical analyzer, Regular expressions
and finite automata.
Module2
6 Hours
Introduction to context free grammars, BNF notation, Syntax Analysis.
Course
Objectives

Module 3
8 Hours
Parsing Techniques: Top-down parsing and Bottom-up parsing, general parsing strategies, brute
force approach, recursive descent parser and algorithms, simple LL(1) grammar, bottom-up
parsing-handle of a right sentential form, shift reduce parsers, operator precedence parsers, LR,
SLR, Canonical LR, LALR grammar and parsers, error recover strategies for different parsing
techniques.
Module 4
10 Hours
Symbol table, syntax-directed translation schemes, intermediate code generation, translation
schemes for programming language constructs, runtime storage allocation. Code generation,
improvement and instruction selection: Issues, basic blocks and flow graphs, register allocation,
DAG representation of programs, code generation from DAG, peep hole optimization,
dependence analysis and redundancy elimination, specifications of machine.
Module 5
15 Hours
Code optimization: source of optimizations, optimization of basic blocks, loops, global
dataflow analysis, procedural and inter-procedural optimization, instruction scheduling
optimization for memory hierarchy, solution to iterative dataflow equations. Compilation for
high performance architecture; Portability and retargetability, Selected topics from compilers
for imperative, object-oriented and mark-up languages, parallel and distributed programming
and concurrency.
1. Alfred V. Aho, Ravi Sethi & Jeffrey D. Ullman, Compilers; Principles,
Reference
Techniques & Tools, Addison- Wesley Publication, 2001.
Books
2. William A. Barrett, John D. Couch, Compiler Construction, Theory and
Practice, Galgotia, 2000.
3. Steven S. Muchnik, Advanced Compiler Design & Implementation, Morgan
Kaufmann Publishers, 1997.
4. Michael L. Scott, Programming Language Pragmatics, Morgan Kaufmann,
22

2009.
5. Randy Allen and Ken Kennedy, Optimizing Compilers for Modern
Architectures, Morgan Kaufmann, 2001.
Subject
Code
CS803
Course
Objectives

Distributed Computing Systems
(DCS)

Credits: 3 (3-0-0)
Total hours: 45

This course covers abstractions and implementation techniques for the design of
distributed systems. It focuses on server design, network programming, naming,
storage systems, security, and fault tolerance.

Module 1

10 Hours

Introduction Distributed Systems and applications, Distributed vs parallel systems, models of
distributed systems, Message Passing mechanisms IPC and RPC.
Module2

12 Hours

Clock synchronization, physical & logical clocks, vector clocks, verifying clock algorithms,
mutual exclusion using time stamp, election algorithms, Distributed mutual exclusion using time
stamps, token & quorums, centralized & distributed algorithms, proof of correctness &
complexity, drinking philosophers problem, Implementation & performance evaluation of DME
Algorithms.
Module 3

11 Hours

Leader election algorithms, global states, global predicates, termination detection, Control of
distributed computation, disjunctive predicates, performance evaluation of leader election
algorithms on simulated environments.
Module 4

12 Hours

Distributed File Systems and Services, Shared data, Synchronization Transaction and
Concurrency Control. Distributed databases, Name service, Timing & Coordination, Replication,
Security and Fault Tolerance.
Reference 1. Vijay K Garg, Elements of Distributed Computing, Wiley & Sons, 2002.
2. Pradeep Sinha, Distributed Operating Systems- Concepts and Design, PHI,
Books
2000.
3. A.S. Tanenbaum, M.V. Steen, Distributed Systems – Principles and Paradigms,
PHI, 2003
4. George Couloris, Jean Dollimore, Time Kindberg, Distributed Systems:
Concepts & Design”, Addison Wesley, 2003.
5. Nancy Lynch, Distributed Algorithm, Morgan Kaufmann Publishers, 1996.

23

Subject Code
CS804
Course
Objectives

Module 1

Design of Secure Protocols
(DSP)

Credits: 3 (3-0-0)
Total hours: 45

In this course, we investigate the paradigm of practice-oriented provable
security in the context of public key cryptography. Central to this paradigm is
the notion of security definition of a cryptographic task. Next comes the
problem of designing protocols that can be proven secure assuming the
intractability of certain computational problem(s) or the security of some
atomic primitive(s). Several such cryptographic protocols will be studied in the
course.
8 Hours

Introduction to Cryptography: Basics of Symmetric Key Cryptography, Basics of Assymetric
Key Cryptography, Hardness of Functions . One-way functions, one-way trapdoor functions.
Notions of Semantic Security (SS) and Message Indistinguishability (MI): Proof of Equivalence
of SS and MI, Hard Core Predicate, Trap-door permutation.
Module 2
6 Hours
Formal Notions of Attacks: Attacks under Message Indistinguishability: Chosen Plaintext Attack
(IND-CPA), Chosen Ciphertext Attacks (IND-CCA1 and IND-CCA2), Attacks under Message
Non-malleability: NM-CPA and NM-CCA2, Inter-relations among the attack model. Random
Oracles: Provable Security and asymmetric cryptography, hash functions One-way functions:
Weak and Strong one way functions
Module 3
9 Hours
Provably secure Pseudo-random Generators (PRG): Blum-Micali-Yao Construction,
Construction of more powerful PRG, Relation between One-way functions and PRG, Pseudorandom Functions (PRF). Building a Pseudorandom Permutation. Provable security under
different attacks of block ciphers, stream ciphers. Symmetric Encryption.
Module 4
10 Hours
Message authentication: MAC, Authenticated encryption. Public key encryption: the notions of
indistinguishability and semantic security including the question of equivalence of definitions,
security against chosen plaintext and chosen ciphertext attacks. Some concrete public key
encryption and identity-based encryption schemes and their security.
Module 5
12 Hours
Digital signatures and the notion of existential unforgability under chosen message attacks. Key
agreement protocols and secure channels. The random oracle assumption. The quantitative
measure of security including the questions of tightness in security reduction and concrete
security. Shamir's Secret Sharing Scheme, Formally Analyzing Cryptographic Protocols. Case
Studies.

24

Wenbo Mao. 25 . Hans Delfs. Prentice Hall. 2. Foundations of Cryptography.edu. Theory and Practice. Chapman & Hall/CRC Cryptography and Network Security Series. 2007. Lecture Notes on Cryptography. 2007. Shaffi Goldwasser and Mihir Bellare. Modern Cryptography. Cambridge University Press. Yehuda Lindell. 5. 3. 2003. 4. Oded Goldreich. Available at http://citeseerx.psu. Helmut Knebl. Introduction to Cryptography: Principles and Applications.ist. Springer. Jonathan Katz. Vol-I and Vol-II. Introduction to Modern Cryptography: Principles and Protocols. 2002.Reference Books 1.

multiplexing. wireless LAN – IEEE 802. antennas. 2. DHCP. modulation. localization. Module 1 10 Hours History of wireless communications. spread spectrum.Subject Code Mobile Computing (MC) Credits: 3 (3-0-0) CS805 Course Objectives: Total hours: 45 This course briefly introduces the basic concepts. Asoke K Talukder.11. 26 . Roopa Yavagal. Mobile Communications. signal propagation. MEO. simplified reference model. Module 4 12 Hours Support for mobility in current communication systems and Internet – wireless application protocol. Module 2 11 Hours Medium access control – techniques and algorithms. routing. mobile computing algorithms and support for mobility in current communication systems and Internet. cellular networks. 2003. web 2. Pearson Education Reference Books Limited. handover. 1. UMTS. principles and developments in mobile computing. satellite systems – GEO. security issues in mobile computing. This includes major mobile communication technologies. 3G. Bluetooth. mobile native applications.0. file systems. TETRA. Jochen Schiller. market for mobile communications. mobile web applications. Module 3 12 Hours Mobile network layer – Mobile IP. signals. Mobile Computing – Technology. Applications and Service. mobile transport layer – indirect TCP. open research topics. mobile ad-hoc networks. McGraw-Hill Professional. HIPERLAN. Voice over IP. GPRS. wireless transmission technologies – frequencies for radio transmission. telecommunication systems – GSM. CDMA. snooping TCP. DECT. LEO. mobile TCP. 2006.

feature selection and visualization. association rules. maximum a posteriori. probabilistic models. Clustering. Bayesian. support vector machines. The Elements of Statistical Learning. value functions. ensemble classifiers. functions. pattern recognition. distributed. Reference Books 1. Occam learning. nearest neighbor classifiers. mistake bound analysis. sufficient statistics. Learning classifiers. semantic web. Course Objectives Module 3 14 Hours Computational learning theory. text and language processing. Konstantinos Koutroumbas. Friedman. hierarchical clustering. data and knowledge. Sergios Theodoridis. sample complexity analysis. decision trees. Machine Learning. Module 4 11 Hours Reinforcement learning. mixture models. 2006. bag of words classifiers. Tibshirani. neural networks. 4. 27 . behaviors and programs from experience. Bayesian networks. Pattern Recognition. ranging from classification methods like decision trees and support vector machines. 2001. over structured models like hidden Markov models. humancomputer interaction. Dimensionality reduction. program synthesis. to understand natural language. McGraw Hill. Springer. internet-based information systems. Bishop. This course will introduce the fundamental set of techniques and algorithms that constitute machine learning as of today. grammars. Module 1 8 Hours Algorithmic models of learning. locally weighted regression. probabilistic relational models. and bioinformatics and computational biology. VC dimension. automated knowledge acquisition. to analyze customer purchase data. accuracy and confidence boosting. Berlin: Springer-Verlag.. 3. Module 2 12 Hours Parameter estimation. Machine learning techniques are used to create spam filters. Learning from heterogeneous. Academic Press. Selected applications in data mining. Pattern Recognition and Machine Learning. N-gram models. Tom Mitchell. C. k-means clustering. distributional clustering. and minimum description length frameworks. 2. relations.Subject Code CS806 Machine Learning (ML) Credits: 3 (3-0-0) Total hours: 45 Machine learning is concerned with the question of how to make computers learn from experience. to clustering and matrix factorization methods for recommendation. 2009. Hastie. Markov and Hidden Markov models. or to detect fraudulent credit card transactions. 1997.

com. Module 2 12 Hours Healthcare data. Module 4 11 Hours Evidence-based medicine and clinical practice guidelines. Springer. health information technology policy.which is an intersection of biomedical science. health information infrastructure. 2. public health informatics. James J. telemedicine. Shortliffe. biomedical decision making. Reference Books 1. 2012. 28 . patient care. lulu. patient-centered care systems. Robert E Hoyt . Ann Yoshihashi. Module 3 12 Hours Electronic health record systems. 2012. future of health informatics. Cimino.Subject Code CS807 Course Objectives: Module 1 Health Informatics (HI) Credits: 3 (3-0-0) Total hours: 45 This course introduces the field of health informatics . patient monitoring systems. Health Informatics: Practical Guide For Healthcare And Information Technology Professionals. public health and information technology. computer architectures and software engineering for healthcare and biomedicine. health information security. standards in health informatics. Edward H. 10 Hours Overview of health informatics. ethics in health informatics. health information exchange. information and knowledge. Nora Bailey. introduction to bioinformatics. Biomedical Informatics: Computer Applications in Health Care and Biomedicine .

10 Hours Module 1 Introduction to artificial neural networks (ANNs): artificial neuron as a computational model of a biological neuron. Application of fuzzy systems. Books 2. Neural networks: A classroom approach. Yegnanarayana. 4. Lang. Goldberg . conjugate based learning method. convergence theorem. Competitive learning models: principal component analysis. Other evolutionary computing methods such as: ant colony optimization. 1999. learning laws. delta learning law. inference system with different fuzzy membership functions: Fuzzy clustering method: soft clustering. fuzzy set theory. momentum factor in learning. adaptive neuro-fuzzy inference systems: Fuzzy-neuro systems: Fuzzy perceptron and learning method for the same. databased modeling with genetic programming. R. generalized delta rule. Artificial Neural Networks. membership. Decision making using the fuzzy sets. B. a simple genetic algorithm. Satish Kumar.finding best solution. Genetic algorithms for combinatorial optimization. types of membership functions. continuous parameter genetic algorithm. relations and operations. bias-variance dilemma 8 Hours Module 2 Deep learning: feedback neural networks. Genetic Algorithms in Search. fuzzy K-means clustering method: Neuro-fuzzy systems: fuzzy logic with adaptive learning. Pearson Education. David E. Advanced operations and techniques in genetic search. error back propagation learning. theoretical foundations of genetic algorithms. swarm optimization. natural optimization methods. S. T. uncertainty. convergence theorem. defuzzification methods. and Machine 29 . J. architectures for neural networks. Neuro-fuzzy and soft computing. minimum seeing algorithms. Multilayer feed forward neural networks: Structure. applications of genetic programming. Boltzan machine. 14 Hours Module 4 Evolutionary computing: optimization problem solving . learning factors. Reference 1. 2011. C. Introduction to genetic programming. genetics-based machine learning – introduction and application.Subject Code CS808 Course Objectives Soft Computing (SC) Credits: 3 (3-0-0) Total hours:45 To deal with the uncertainty that is inherent in any pattern recognition task. The uncertainty is natural in the real world also and human brain deals with it efficiently. Perceptron: learning law. binary genetic algorithm. selforganizing map (SOM). Printice Hall India. Tata McGraw Hill. recurrent neural networks. fuzzy inference systems. 1996. SASEGASA – parallel genetic algorithm. genetic algorithms in scientific methods. 3. Mizutaju. Sun and E. Optimization. activation functions. Pulsed neural networks 13 Hours Module 3 Basic concepts of fuzzy logic: crisp set-properties. fuzzy back propagation network. Genetic algorithms: Overview. Introduction to Type-2 fuzzy logic systems: The structure. fuzzification. convolution neural networks.

principles of service orientation. Module 2 8 hours Planning and analysis for building SOA – SOA delivery lifecycle phases. Richard Hill. Prentice Hall. activity management and composition. Genetic Algorithms and Genetic Programming: Modern Concepts and Practical Applications. Addison-Wesley. Web Services. 2. 2013. 3.which is a software architecture design pattern based on discrete pieces of software providing application functionality as services to other applications. characteristics. and Cloud Computing. SOAP. 5. MangoDB. 2nd Edition. Michael Rosen. metadata and security. SOA platforms. continuing evolution of SOA. services composition. service-oriented analysis. Michael Affenzeller. service integration patterns. John Wiley & Sons. service modeling. Service-Oriented Architecture: Concepts. Arnon Rotem-Gal-Oz. Douglas K. benefits and pitfalls. SOA patterns for performance. Laurie Hirsch. Springer-Verlag. 12 hours Introduction to SOA – fundamentals. intelligence in the cloud. scalability and availability. Siavash Moshiri. Boris Lublinsky. Web services and SOA – web services framework. 1989. CRC Press. 2) Cloud computing – which is a model for delivering services in which resources are retrieved from the internet through web-based tools and applications. service layers. and infrastructure as a service. SOA Patterns. Module 3 10 hours Service-oriented design. cloud security and governance. Technology. data in the cloud – Cassandra. and Design. platform as a service. The Savvy Manager's Guide. 2012. Smith. Barry. service design guidelines. service modeling applications. Module 4 15 hours Introduction to cloud computing. London. 2003. Guide to Cloud Computing: Principles and Practice. Reference Books 1. 2005. 2009. major models – software as a service. Stefan Wagner. Morgan Kaufmann Publishers . WSBPEL. Kevin T. Balcer. Andreas Beham. message exchange patterns. 5. business process design. security and manageability patterns. Thomas Erl. misperceptions. service consumer patterns. 30 . Marc J. Applied SOA: Service-Oriented Architecture and Design Strategies. fundamental WS-* extensions. 4. adopting SOA with cloud computing. Stephan Winkler. Service-Oriented Architectures. WSDL. advanced messaging.Learning. Peter Lake. Subject Code Credits: 3 (3-0-0) CS809 Total hours: 45 Service Oriented Architecture and Cloud Computing (SOAC) Course Objectives: Module 1 This course introduces the fields of: 1) Service-oriented architecture (SOA) . 2012. Manning Publications Company.

introspection. RHadoop. 2013. statistical data mining. statistics and machine learning. regression coefficient. Module 2 12 Hours Big data techniques – data range. paired-variable assessment – CHAID based data mining. overfitting. logistic regression. importing and exporting data from various databases. Identification. too much data. fixing data. RBase. search. measurement. scatterplots. Module 3 11 Hours Variable assessment .Subject Code Big Data Analytics (BDA) Total hours: 45 CS810 Course Objectives: Module 1 Credits: 3 (3-0-0) Big data refers to a collection of large and complex data sets those are difficult to process using traditional data processing applications. Michael Milton. recommending and modeling.. Packt Publishing. Providing structure to unstructured data – machine translation. data analytics with R and Hadoop. indexing. query output adequacy. transfer. statistics. frequency distributions. deidentification and reidentification. estimation-only analysis. Morgan Kaufman-Elsevier. 1. and Analyzing Reference Books Complex Information. legalities and societal issues. data in search of a theory. Hadoop Distributed File System (HDFS) – fundamentals and architecture. bigness bias. 2011. big data and healthcare. 2013.large data analysis platform. The challenges include capture. 2nd Edition. O'reilly Media Inc. symmetrizing ranked data – scales of measurement. Big Data Analytics with R and Hadoop.. ontologies and semantics. Hadoop security. failure. algorithm selection. CRC Press. curation. 11 Hours Introduction – small and big data.correlation coefficient. ordinary regression. Jules J Berman. analysis and visualization. data description and reduction. Apache Pig. 2012. Hadoop programming in Java. normalizing and adjusting data. automating data processing with Oozie. Sharing. denominator. big data analysis – clustering. 2. 4. resource evaluation. Head First Data Analysis: A learner's guide to big numbers. autocoding. Box-andWhiskers plot. Big Data Now: 2012 Edition. Hadoop – different Hadoop modes. Integrating R and Hadoop – RHIPE. storage. Module 4 11 Hours R language – data modeling in R. mean and standard deviation. reformulate a question. 31 . results review. dependencies. importing data into R. Bruce Ratner . sharing. MapReduce – fundamentals and architecture. data reduction. Vignesh Prajapati . many-variable assessment – principle component analysis. special considerations – theory in search of data. immutability and immortality. and good decisions. predictive contribution coefficient. Principles of Big Data: Preparing. stepwise approach to big data analysis – formulate a question. term extraction. 2009. Stem-and-Leaf display. 5. O'Reilly Media Inc. 3. Statistical and Machine-Learning Data Mining: Techniques for Better Predictive Modeling and Analysis of Big Data. and to perform predictions of outcomes and behaviors. classifying. data integration and software interoperability. Hive. This course introduces concepts and techniques to overcome these challenges and to infer laws from large data sets to reveal relationships.

John Wiley & Sons. recognition of strings Module 4 8 Hours Discriminant analysis: Models for decision surfaces. Bayesian networks (graphical models) Module 2 8 Hours Methods for parameter estimation: maximum likelihood estimation. classification and regression trees (CART). minimum mean squared error based learning. Sergios Theodoridis and Konstantinos Koutroumbas. 3. Pattern Classification.Subject Code CS811 Course Objectives Pattern Recognition (PR) Credits: 3 (3-0-0) Total hours:45 To build intelligent systems based on the learning framework. 2. GMM. support vector machines Repression: Linear models for regression. hierarchical clustering methods. decision surfaces. Richard O. Module 1 12 Hours Pattern classification: Bayesian decision theory. discriminant functions. cluster validation methods Reference Books 1. linear discriminant analysis-perception model. methods for clusteringhard and soft clustering. Pattern Recognition and Machine Learning. 2006. Academic Press-Elsevier. classifiers. 4th Edition. Bayesian estimation. Hart and David G. continuous and discrete values features. Pattern Recognition. Bayesian regression Module 5 7 Hours Pattern clustering (unsupervised learning): Criterion functions for clustering. Duda. normal (Gaussian) density. 2nd Edition. Stork. minimum-error-rate classification. maximum a posteriori estimation. Gaussian mixture models Sequential pattern classification: Hidden Markov models for dynamic patterns Module 3 10 Hours Non-parametric method for density estimation: Parzon window and K-nearest neighbor method Methods for dimensionality reduction: Fisher's discriminant analysis. Springer. 2009 32 . K-means. polynomial regression. Principal component analysis Non metric methods: Decision trees. Bishop. Peter E. 2012. Christopher M.

delta learning law. learning factors. universal approximation theorem. RBF networks for pattern classification. Reference Books convolution neural networks. multi-class pattern classification using SVMs. Module 4 8 Hours Feedback neural networks: Problem of pattern storage and retrieval. conjugate gradient method for learning. energy analysis of hopfiled model. activation functions. SVM for linearly non-separable classes. Boltzman machine. generalized delta rule. Module 2 14 Hours Non-linear neural networks: Perceptron. bias-variance dilemma Module 3 8 Hours Statistical learning theory. Prentice Hall. 3rd Edition. convergence criteria. Radial basis function networks: RBF networks for function approximation. Ltd. architectures for ANNs. 2009. activation functions.learning law. Yegnanarayana. multilayer feed forward neural networks-structure.Subject Code CS812 Course Objectives Module 1 Artificial Neural Networks (ANN) Credits: 3 (3-0-0) Total hours:45 To study a computational model of the human neural system though it is still not known the exact functioning of the same. error back propagation learning. Tata McGraw Hill. 2. Hebbs learning law. Neural Networks: A Classroom Approach. discrete Hopfiled networks. SVM for nonlinearly separable classes using kernels. artificial neuron as a computational model of a neuron. Neural Networks and Learning Machines. 1. Haykin. dynamical systems. linear neural networks. principle of empirical risk minimization. convergence theorem. recurrent neural networks. cross validation method for selecting the architecture. Printice Hall India Learning Pvt. Sathish Kumar. Artificial Neural Networks. 2009 33 . Support vetcor machines: SVM for linearly separable classes. momentum factor in learning. 3. B. 2011. 8 Hours Biological neuron. Simon S. energy function of hopfield model. 3rd Edition. Module 5 7 Hours Introduction to deep neural networks.

Module 3 12 Hours Stereopsis: Reconstruction. Sampling and aliasing. Image Processing. Normalized correlations and finding patterns. David A Forsyth and Jean Ponce. 3rd Eidtion. and Machine Vision. 2011. Hough transform. pinhole cameras.face recognition. J. Gonzalez and Richard E. Pearson Education. Sources. John Wiley & Sons Australia. human stereo. edge effects in discrete convolution. Digital Image Processing. Analysis using oriented pyramid. Texture: Representing texture. Richard Szeliski. The geometry and views: Two views. continuous convolution. Springer. model based vision. surface color from image color. Vaclav Hlavac and Roger Boyle. 2. face detection. Computer Vision: Algorithms and Applications. and applied vision for graphics also. A Modern Approach. image/scene classification. Applications. applications. using color camera. Module 4 10 Hours 3D reconstruction. 4th Edition. 2009 5. Representing color. shift invariant linear systemsdiscrete convolution. 2011 3. Schalkoff R. Computer Vision. 1989 4. Segmentation by fitting a model. Cengage Learning. Shape from texture. segmentation by graph theoretic clustering.. line and area sources. Rafael C. Limited. photometric stereo.Subject Code CS813 Course Objectives Module 1 Computer Vision (CV) Credits: 3 (3-0-0) Total hours:45 To expose the students to fundamental and advanced topics in computer vision with a focus on image statistics. fitting lines. estimating derivatives. Binocular fusion. Woods. content based image and video retrieval Reference Books 1. Milan Sonka. Segmentation by clustering: Human vision. Spatial frequency and Fourier transforms. Limited. detecting edges. radiometry terminology. human color perception. Pearson Eductaion India. shadows and shading: Local shading models.point. surveillance. A model for image color. fitting curves. Color: Physics of color. 10 Hours Introduction and overview. 2014 34 . motion tracking. Edge detection: Noise. Module 2 13 Hours Image Processing: Linear filters: Linear filters and convolution. filters as templates. Digital Image Processing and Computer Vision. machine learning techniques. Analysis.

The Shapley Value. This course provides a sound foundation of game theory and mechanism design to enable the audience to apply them to problem solving in a rigorous way. 2009. Module 3 12 Hours Mechanism Design: The Mechanism Design Environment. Repeated Game. Nucleolus. Module 1 7 Hours Introduction and Outline of the Course. Springer. Bayesian Games. Bayesian Mechanisms (dAGVA). 2. Social Choice Functions with Illustrative Examples . The Nash Bargaining Problem. 35 . Strategic Form Games with Illustrative Examples.Harvard University Press. Roger B. analyze. Narahari. VickreyClarke-Groves (VCG) Mechanisms. Dinesh Garg. Y. London. and solve decentralized design problems involving multiple autonomous agents that interact strategically in a rational and intelligent way. Mixed Strategy Nash Equilibrium with Illustrative Examples and Key Results such as the Nash Theorem. 3. Game Theoretic Problems in Network Economics and Mechanism Design Solutions. Implementation of Social Choice Functions. and Hastagiri Prakash. Other Solution Concepts: Kernel. Classification of Games. Rationality. Matrix Games: Saddle Points. 2009. Intelligence. Utilities. Bayesian Nash Equilibrium. Pure Strategy Nash Equilibrium with Illustrative Examples and Key Results. Ramasuri Narayanam. Dominant Strategy Equilibria. Revenue Equivalence Theorem. Computation of Nash Equilibria and introduction to algorithmic theory. Martin J. Minimax Theorem. Myerson. The Core. Gibbard-Satterthwaite and Arrow Impossibility Theorem. Coalitional Games (Transferable Utility Games). Evolutionary Game Theory (ESS Strategies). Myerson Optimal Auction. 1997.Subject Code Credits: 3 (3-0-0) Game Theory (GMT) CS814 Course Objectives Total hours: 45 Game theory and mechanism design offer an important tool to model. Game Theory: Analysis of Conflict. Oxford University Press. Reference Books 1. Module 2 14 Hours Non-Cooperative Game Theory: Extensive Form Game. Definitions. Osborne. Incentive Compatibility and Revelation Theorem. Common Knowledge. Further Topics in Mechanism Design Module 4 12 Hours Correlated Strategies and Correlated Equilibrium. An Introduction to Game Theory.

Subject Code
CS815
Course
Objectives

Data Warehousing and Data
Mining (DWM)

Credits: 3 ( 3-0-0)
Total hours: 45

Following this course, students will be able to 1) Learn the concepts of
database technology, 2) Understand data mining principles and techniques,
3) Discover interesting patterns from large amounts of data to analyze and
extract patterns to solve problems, make predictions of outcomes. 4)
Evaluate systematically supervised and unsupervised models and algorithms
with respect to their accuracy, 5) Design and implement of a data-mining
application using sample, realistic data sets and modern tools.

Module 1

12 Hours

Introduction to data warehousing, building a data warehouse, mapping the data warehouse to a
multiprocessor architecture, OLAP technology for data mining, data warehouse,
multidimensional data model, data warehouse architecture, data warehouse implementation,
OLAP guidelines, multidimensional versus multi relational OLAP, categories of tools, DBMS
schemas for decision support data extraction, cleanup and transformation tools for metadata,
development of data cube technology, from data warehousing to data mining, data generalization,
efficient methods for data cube computation, further development of data cube and OLAP
Technology, attribute-oriented induction.
Module 2
8 Hours
Introduction to data mining tasks, objectives (classification, clustering, association rules, sequential
patterns, regression, deviation detection).
Module 3
8 Hours
Data and preprocessing (data cleaning, feature selection, dimensionality reduction), Curse of
Dimensionality
Module 4
8 Hours
Classification (decision-tree based approach, rule-based approach, instance-based classifiers, Bayesian
Approach: Naive and Bayesian networks, classification model evaluation).
Module 5
9 Hours
Clustering (partitional methods, hierarchical methods, graph-based methods, density-based methods,
cluster validation methods), anomaly/outlier detection (introduction to various types of outliers,
statistical-based, density-based and other methods for outlier detection).

36

Reference
Books

1. Jiawei Han and Micheline Kamber, Data mining: Concepts and techniques,
3rd Edition, Morgan Kaufmann publishers, 2012.
2. Raph Kimball and Margy Ross, Data warehouse toolkit, 3rd Edition, John
Wiley & Sons Publications, 2013.
3. Gordon Linoff and Michael. J. Berry, Data mining techniques: Marketing,
sales, customer support, 3rd Edition, John Wiley & Sons, 2011.

Subject Code
CS816
Course Objectives

E-Commerce (EC)

Credits: 3 (3-0-0)
Total hours: 45

To provide principles of e-commerce from a business perspective.

Module 1

11 Hours

Infrastructure and tools for e-commerce, current trends in e-commerce applications development,
the business of internet commerce, enterprise level e-commerce.
Module 2

12 Hours

Security and encryption, electronic payment systems, search engines, intelligent agents in ecommerce, on-line auctions, data mining for e-commerce.
Module 3

12 Hours

Web metrics, recommended systems, knowledge management, mobile e-commerce, legal, ethical
and social issues.
Module 4

10 Hours

Seminars and mini projects.

Reference
Books

1. Henry Chan, Raymond Lee, Tharam Dillon and Elizabeth Chang, ECommerce-Fundamentals and application, John Wiley & Sons 2007.
2. G. Winfield Treese and Lawrence C. Stewart, Designing Systems for
Internet Commerce, Addison-Wesley Professional, 2003.
3. M. L. Brodie and Dieter Fensel, Ontologies: A Silver Bullet for Knowledge
Management and ECommerce, Springer, 2004.
4. Olaf Zimmermann, Mark Tomlinson and Stefan Peuser, Perspectives on
Web Services”, Springer, 2004.

37

Subject Code
CS817
Course
Objectives

Advanced Operating Systems
(AOS)

Credits: 3 (3-0-0)
Total hours: 45

To provide comprehensive and up-to-date coverage of the major developments
in distributed operating system, multi-processor operating system and database
operating system.

Module 1

8 Hours

Architectures of distributed systems , system architecture types, issues in distributed OS,
communication networks, primitives, theoretical foundations, inherent limitations of a distributed
system, lamp ports logical clocks, vector clocks, casual ordering of messages, global state, cuts
of a distributed computation, termination detection, distributed mutual exclusion.
Module 2

12 Hours

Distributed deadlock detection, introduction, deadlock handling strategies in distributed systems,
issues in deadlock detection and resolution, control organizations for distributed deadlock
detection, centralized, distributed and hierarchical deadlock detection algorithms , agreement
protocols.
Module 3

10 Hours

Distributed shared memory, architecture, algorithms for implementing DSM, memory coherence
and protocols, design issues, distributed scheduling, issues in load distributing, components of a
load distributing algorithm, stability, load distributing algorithm, performance comparison,
selecting a suitable load sharing algorithm, requirements for load distributing, task migration and
associated issues. Failure recovery and Fault tolerance: Introduction, basic concepts,
classification of failures, backward and forward error recovery, recovery in concurrent systems,
consistent set of check points, synchronous and asynchronous check pointing and recovery,
check pointing for distributed database systems, recovery in replicated distributed databases.
Module 4

8 Hours

Protection and security, preliminaries, the access matrix model and its implementations, safety in
matrix model, advanced models of protection. Cryptography basics, multiple encryption and
authentication in distributed systems.
Module 5

7 Hours

Multiprocessor OS, database OS, database systems, a concurrency control model, problem,
serializability theory, distributed database systems, concurrency control algorithms.
1. Mukesh Singhal and Niranjan G. Shivorothri, Advanced Concepts in Operating
systems: Distributed, Multiprocessor and Database Operating Systems,
Reference
McGraw-Hill Education, 1994.
Books
2. Andrew S. Tanenbaum, Distributed Operating systems, Pearson Education,
2008.
3. Doreen L. Galli, Distributed operating systems: concepts and practice, Prentice
Hall, 2000.
4. Abraham Silberschatz and Avi Silberschatz, Applied Operating systems, John
Wiley & Sons, 2000.
5. Lubomir F. Bic and Alan C. Shaw, Operating systems Principles, Prentice Hall
PTR, 2003.

38

M. 2011. American Bar Association. Differential Privacy: Definitions and Early Uses. Privacy-Preserving Data Publishing: An Overview. Access control of outsourced data. Privacy: Foundations of Privacy. 2010. privacy models. Future Research Directions 1. Information Security and Privacy. Nerel Online. Bailey. Module 3 10 Hours Privacy Regulations. Multiple-Time Data Publishing :Graph Data . Books 2. 3. Noiseless Differential Privacy. Anonymity and Security. Module 4 15 Hours Privacy preserving data publishing: Fundamental Concepts: anonymization methods. Cryptosystems.Other Data Types . Raymond Chi-Wing Wong.Subject Code CS818 Course Objectives Security and Privacy (S&P) Credits: 3 (3-0-0) Total hours: 45 This course introduces the concepts of security and privacy. Privacy preserving Data Mining techniques. Module 1 10 Hours Introduction: Basic concepts: number theory. Shaw. anonymization method for trasaction data. trajectory data. social networks data and textual data. Complete Guide to Internet Privacy. 39 . Module2 10 Hours Provable Security. Formal analysis and design of algorithms and protocols. T. One-Time Data Publishing. Reference 2012. Morgan and claypool publishers. Ada Wai-Chee Fu.

Handbook of computational molecular biology. Jones & P. 2005. MIT Press. lowest common ancestors. Chapman and Hall/CRC. A. S. Module 4 Genome assembly – overlap-layout-consensus and graph based methods. R. A. Module 3 String data structures and algorithms – look-up tables. construction algorithms.. Carillo-Lippman heuristic. Aluru. Cambridge University Press. Durbin. suffix arrays and suffix trees. Hirshberg's space-saving algorithm. 1. C. An Introduction to Bioinformatics Reference Algorithms. N. what is it involved in analyzing a DNA. Biological sequence analysis: probabilistic models of proteins and nucleic acids. Module 1 Introduction to molecular biology – Basic introduction including DNA. Eddy. Comparative genomics – Identifying gene clusters and evolutionarily conserved sequences. 3. approximation algorithms. Books 2. 1998. role of bioinformatics Module 2 Pairwise sequence alignments – Global. proteins. banded dynamic programming. 2004. Module 5 Phylogenetics – distance based methods including ultrametric and additive distances. Pevzner. central dogma etc. Pairwise and multiple genome comparisons. tree alignments. basic applications of suffix trees. Mitchison. gap penalty functions. heuristic methods. S. character based methods including parsimony and perfect phylogeny. Krogh.Subject Code CS819 Course Objectives Bioinformatics Algorithms (BA) Credits: 3 (3-0-0) Total hours:45 To explore fundamental algorithmic techniques in bioinformatics and computational biology that are enabling the current revolution in life sciences and medicine It will serve as the foundation course for students of computer science who are interested in doing research or pursue career in computational biology or in bioinformatics. 40 . Multiple sequence alignments – sum-of-pairs scoring function. semi-global and local alignments. G.

trails. greedy coloring algorithm. Prentice Hall. 3rd edition. Pearson Education. class-1 and class-2 graphs. 5-color-theorem. Module 4 9 Hours Edge colorings. paths and cycles. number of trees.R. 2011. P. Module 1 8 Hours Definitions. 3. Euler’s formula and its consequences. N. Prim’s algorithm. planar graphs. planarity. Konig’s theorem. R. Floyd-Warshall shortest path algorithm Module2 8 Hours Trees. John Wiley and Sons. connectivity and so on. 41 . J. necessary conditions and sufficient conditions. characterization. weighted graphs and shortest paths. Eulerian graphs. West. connected graphs. isomorphic graphs. minimum spanning trees. walks. Applications. . basic concepts. SpringerBooks Verlag. The Probabilistic Method. vertex Colorings. Module 5 12 Hours Planarity (duality. 5th edition. characterizations of planar graphs. Definitions and characterizations. connectivity. covering. bipartite graphs. 2000. directed walks. Reference 2. blocks. Hamiltonicity. Euler's formula. paths. 2003. matroids. matchings in bipartite graphs. Graph Theory (Graduate Texts in Mathematics). weighted graphs. larger graphs from smaller graphs. Spenser. Graph Theory (Graduate Texts in Mathematics). coverings and matchings. Dijkstra’s shortest path algorithm. edge-coloring of bipartite. 2008.S. D. 5. Eulerian and Hamilton digraphs. Grimaldi. basic definitions. independent sets. 1. graphs. R. While the course will cover all elementary concepts such as coloring. Gupta-Vizing theorem. directed graphs. Ramsay theory. degree of a vertex. cut-vertices and cut-edges. Alon and J. Chinese Postman problem.Subject Code CS820 Course Objectives Graph Theory (GT) Credits: 3 (3-0-0) Total hours: 45 The intension of this course is to introduce the subject of graph theory to computer science students in a thorough way. 2000. random graphs). it will also introduce the students to some advanced concepts. pictorial representation of a graph. cycles. 4. Discrete and Combinatorial Mathematics: An Applied Introduction. special graphs. Cayley’s formula. Fleury’s algorithm.A. Diestel. 2nd edition. Murty. Kruskal’s algorithm. Asia. Springer. cliques and chromatic number. 4-color theorem). complements. matrix representations of graphs. extremal graphs. Module 3 8 Hours Hamilton Graphs. 2nd edition. sub graphs. connected graphs and shortest paths. Introduction to Graph Theory. Advanced topics (perfect graphs. Bondy and U. perfect matching’s in graphs. Hall’s theorem. B.

problems. 4. Larson. exponential. Testing of Hypotheses: Null and alternative hypotheses. confidence intervals for proportions. J. density and cumulative distribution functions. A First Course in Probability. normal. Chebyshev’s inequality.M. McGraw-Hill Higher Education. gamma. tests for one sample. problems. S. relative frequency and axiomatic definitions of probability. two sample problems for normal populations.K. independence of random variables. fields. distributions of order statistics. Md. Module 4 10 Hours Estimation: Unbiasedness. Introduction to Probability Theory and Statistical Inference. probability mass. tests for proportions.K. individuals are able to predict the likelihood of an event occurring. Ross. Poisson. the method of moments and the method of maximum likelihood estimation. limit of a sequence of sets. 3rd edition. median and quantiles.Principles and Applications for Engineering and the Computing Sciences. problems. binomial.M. (Sampling): The Central Limit Theorem. 42 . (Joint): Joint. correlation and regression. inverse Gaussian. organize and evaluate data. distributions of the sample mean and the sample variance for a normal population. E. continuous uniform.Subject Code Probability and Statistics (P&S) Credits: 3 (3-0-0) Total hours: 45 CS821 Course Objectives Probability and Statistics is one of the most important branches of the mathematical sciences.S. problems. confidence intervals for parameters in one sample and two sample problems of normal populations. Knowledge of these topics is critical to decisionmaking and to the analysis of data. 2012. An Introduction to Probability & Statistics. addition rule and conditional probability. sigma-rings. 2nd Reference edition. continuous. negative binomial. problems. Wiley. two types of error. beta. Chi-Square. Probability: Classical. Using concepts of probability and statistics. Books 2. Rohatgi. distributions of sums of random variables. mixed random variables. bivariate normal distribution. 2002. S. Module2 8 Hours Random Variables: Discrete. Markov inequality. Saleh. 2009. Cauchy. rings. the critical and acceptance regions. 9th edition. V. reliability and hazard rate. Milton & J. Introduction to Probability and Statistics . Neyman-Pearson Fundamental Lemma.C. Introduction to Probability & Statistics for Engineers and Scientists. Elsevier AP. 3. Module 5 7 Hours Transformations: functions of random vectors. problems. and identify the significance of statements. product moments. total probability. Module 3 12 Hours Distributions: (Special) Discrete uniform. H. monotone classes. Module 1 8 Hours Algebra of Sets: sets and classes. sigmafields. 2000. multiplication rule.J. the most powerful test. 4th edition. 5. reliability of series and parallel systems. 1982. Arnold. 1. Ross. Bayes’ Theorem and independence. Chi-square goodness of fit test. double exponential distributions. t and F distributions. geometric. marginal and conditional distributions. mathematical expectation. moments. Pearson. probability and moment generating function. applications. Weibull. consistency. 4th edition. hypergeometric. lognormal. A. power of the test. Pareto. Wiley-Interscience.

4.a formal verification technique for assessing functional properties of information and communication systems. the principles of top-down refinement. A. Springer. 2002. program test for any implementation – black box testing. MIT Press. 2003. Schnoebelen. M. 43 . W. dynamic analysis – structural program testing. 5. Baier. regular properties. The SPIN Model Checker: Primer and Reference Manual. Module 3 11 hours System verification – model checking. Berard. C. Module 4 14 hours Finding bugs in concurrent systems. sample SPIN models. automata and logic. K. Addison-Wesley. building verification models. modeling concurrent systems. Module 2 11 hours The semantic analysis – the precondition. using design abstraction. J. PROMELA semantics. Hands-On Approach. dynamic program analysis. Chapman & Hall/CRC. program correctness – programs without loops. Holzmann. Laroussinie. testing for code robustness and code efficiency. Katoen. finding exact solutions. partial order reduction. static analysis – intermediate program representation. Software Verification and Analysis: An Integrated. Books 2. 2008. tell about a program without its execution. 2009. Systems and Software Verification: ModelChecking Techniques and Tools. an overview of PROMELA. dealing with codes that make non-ordered approximations. Petit. G. computation tree logic. linear temporal logic. the post condition. Model checking is an automated technique to check the absence of errors and it is considered as an intelligent and effective debugging technique. 3. P. 9 hours Introduction to code verification. Springer. Finkel. Bidoit.Subject Code CS822 Course Objectives: Module 1 Program Analysis and Verification (PAV) Credits: 3 (3-0-0) Total hours: 45 This course teaches techniques for model checking . 2001. defining correctness claims. iterative programs. equivalences and abstraction. Principles of Model Checking. P. the orderverification procedure and its benefits. P. model abstraction. Stanley. timed automata. search algorithms and optimization. program dependencies. Salari. Petrucci. K. B. L. G. design of coverage test suite. using SPIN and XSPIN – the TimeLine editor. 1. A. F. J. P. Laski. numerical algorithm development. McKenzie. linear-time properties. probabilistic systems – Markov chain and Markov decision processes. the mathematical model and numerical algorithm. a verification model of a telephone switch. Knupp. Larsen. Verification of Computer Codes in Computational Reference Science and Engineering.

matrix operations. 44 . Gaussian elimination in practice 1. Fourier series. graphs and networks. G. differential equations. Strang. Formulas for determinants. basis and dimension. inverse of a matrix. Linear algebra and its applications. least squares approximations. positive definite matrices. 2006. idea of elimination. Wellesley. orthogonal bases and Gram-Schmidt Determinants: Properties of determinants. dot products. 2009. the rank and row reduced form. Introduction to Linear Algebra. matrices. transposes and permutations Module 2 9 hours Vector spaces and subspaces: The null subspace of A: Solving Ax=0. diagonalization of a matrix. computer graphics. 4thEdition. Module 5 9 hours Applications: Matrices in engineering. G. LU and LDU factorizations. Strang. WellesleyReference Cambridge Press. eliminations using matrices. 9 hours Introduction to vectors: Vectors and linear combinations. Books 2. Solving linear equations: Vectors and linear equations. symmetric matrices. MA. Thomson Books. four fundamental subspaces Module 3 9 hours Orthogonality: Projections. Markov matrices linear programming. applications of determinants Module 4 9 hours Eigen values and Eigen vectors: Introduction to Eigen values and Eigen vectors.Subject Code CS823 Course Objectives Module 1 Linear Algebra (LA) Credits: 3 (3-0-0) Total hours: 45 To have a hand on in linear algebra to understand matrices and use them to various engineering applications.

4th printing. Euler's theorem. 2nd edition. 4. Books 2. H. 45 . Divisibility tests. Finite Fields (Encyclopedia of Mathematics and its Applications). V. Algorithms for Finite fields. Integer Factorization algorithms. Finite fields. Divisibility Theory in Integers: Divisibility properties. Elliptic Curve arithmetic Course Objectives Module 4 12 Hours Large integer computations: Computations in Zn . Computations in groups. Fermat's theorem. Lidle. 1. greatest common Divisor. 2008. Diophantine Equations.Subject Code CS824 Number Theory (NT) Credits: 3 (3-0-0) Total hours: 45 This course introduces the number theory. Module2 15 Hours Theory of Congruences: Basic properties of congruences. R. Koblitz. Polynomial arithmetic . Module 1 8 Hours Preliminaries: Well ordering principle. Division Theorem. Cambridge Press. Cohen. Module 3 10 Hours Groups. 2000. Primality testing of Integers. 2nd edition. Sequence generation. Cambridge University press. Quadratic Residues and Reciprocity. Chinese Remainder Theorem. Primes and their distribution: The fundamental theorem of arithmetic. Niderreiter. Springer. Diophantine equation. Elliptic Curves. Reference Springer. 2008. Shoup. Algorithms for discrete logarithms . H. Rings. Algebraic structures and the computational aspects of number theory. Rings and Fields. 3. Euclidean algorithm. 1994. A Computational Introduction to Number Theory and Algebra. N. Arithmetic Functions. Mathematical Induction. Linear congruences. A Course in Number theory and Cryptography. A course in Computational algebraic number theory.

Module 1 10 Hours Fundamental concepts: problems and algorithms. Turing machines. P vs NP. NP-complete problems. NL and NL-completeness. Computational Complexity: A Modern Approach. Module 4 11 Hours Randomized computation: RP. Relationship between complexity classes. Randomized space complexity. NP and co-NP. Reference Cambridge University Press. Non-uniform complexity. Papadimitriou. Barak. Error reduction. Books 2. BPP. Module 3 12 Hours Diagonalization and Relativization. 46 . Communication complexity and circuit lower bounds. 1993. Interactive proofs.Subject Code CS825 Course Objectives Complexity Theory (CT) Credits: 3 (3-0-0) Total hours: 45 This course introduces computational complexity theory. Probabilistic algorithms. 1. Addison Wesley. 2009. computability. H. The polynomial hierarchy: optimization problems. C. Module2 12 Hours Complexity Classes: P. 1st edition. S. Space complexity: PSPACE and PSPACE-completeness. Reduction and completeness. Computational Complexity. Arora and B. Approximation and Inapproximability. ZPP.

physical design. interface technology. Gestalt principles describing human visual perception. Johnson. analytics. factors affecting learning. Elsevier/Morgan-Kaufmann. Preece. data analysis. 11 hours Human perception. attention shape thought and action. user manuals. 47 . 4. menu selection. software tools. 3. learning from experience. the process. design. 2009. Shneiderman. Plaisant. 2010. Jacobs. evaluating interface designs. Reference 1. inspections – heuristic evaluation and walkthroughs. command and natural languages. The following topics are covered by this course: human capabilities. Interaction Design: Beyond Human . natural user interfaces. societal and individual impact of user interfaces. Cohen and S. practical issues in the process of interaction design. form filling and dialog boxes. online help and tutorials. 5th Edition. Y. prototypes. Designing with the Mind in Mind: Simple Guide to Understanding User Interface Design Rules. Module 3 11 hours Interaction design – introduction. task analysis. choosing interface. social interaction. design issues – Quality of Service. 1990. Module 4 11 hours Data gathering. prototyping and construction – conceptual design. Wiley. peripheral vision. establishing requirements – data gathering and processing. B. 2011. interfaces – interface types. interaction devices. D. information search and visualization. Designing the User Interface: Strategies for Effective Human-Computer Interaction. Norman. human vision. M. cognitive aspects – cognition frameworks. Currency/ Doubleday. C. The Design of Everyday Things. color vision. evaluation case studies. Books Person Education. J. problem solving and calculation. scenarios. predictive models. Sharp. performing learned actions. interpretation and presentation. attention and memory. Module 2 12 hours Usability of interactive systems – guidelines. 2. and evaluation of user interfaces to computers.Computer Interaction. evaluation – types of evaluation. 3rd edition. balancing function and fashion. interaction styles – direct manipulation and virtual environments. evaluation framework – DECIDE – a framework to guide evaluation. emotional interaction. J. time requirements. the user experience. task description. understanding and conceptualizing interaction – conceptual models. interaction types.Subject Code CS826 Course Objectives: Module 1 Human Computer Interface (HCI) Credits: 3 (3-0-0) Total hours: 45 Human-Computer Interface (HCI) refers to the design. principles and theories. interface design methods and interface evaluation. development processes – managing design processes. visual structure. Rogers. H. recognition and recall. prototyping. collaboration. interface metaphors.

403 401 48 . Ponda. Goa .Course Curriculum for Master of Technology Programme in Electronics and Communication Engineering Department National Institute of Technology Goa Farmagudi.

Semester-wise Credit Distribution Semester I II III IV Total Credits Total Credits 19 17 14 14 64 49 .

No. Program Name: VLSI Semester-wise Distribution of the Courses Semester I Total Credits Credits Course Name (L-T-P) EC600 Digital IC Design (3-0-0) 3 2 EC601 Analog IC Design (3-0-0) 3 3 EC602 Semiconductor Device Theory and Modelling (3-0-0) 3 4 EC603 Digital Signal Processing (3-0-0) 3 5 EC604 IC Design Laboratory (0-0-6) 3 6 EC605 Semiconductor Device Simulation Laboratory (0-0-3) 2 7 EC606 Seminar (0-0-3) 2 SI.Tech.M. No. Course Code 1 Total Credits 19 Semester II SI. Course Code 1 EC650 Course Name VLSI Testing and Testability 2 EC651 Total Credits (L-T-P) Credits (3-0-0) 3 VLSI Technology (3-0-0) 3 3 Elective I (3-0-0) 3 4 Elective II (3-0-0) 3 5 EC652 System Design Laboratory (0-0-6) 3 6 EC653 VIVA-VOCE - 2 7 HU650* Communication Skills and Technical Writing (1-0-2) - Total Credits 17 50 .

Semester III Total Credits Credits Course Name (L-T-P) 1 Elective III (3-0-0) 3 2 Elective IV (3-0-0) 3 Major Project-I (0-0-12) 8 SI. No. 3 Course Code EC700 Total Credits 14 Semester IV Total Credits SI. Course Code Course Name (L-T-P) 1 EC750 Major Project-II (0-0-21) Total Credits Credits 14 14 51 . No.

List of Electives Electives Total Credits SI. No. Course Code Course Name (L-T-P) Credits 1 EC800 Optoelectronics and Photonics (3-0-0) 3 2 EC801 Architectural Design of IC (3-0-0) 3 4 EC802 Digital Design using FPGA (3-0-0) 3 5 EC803 System on CHIP (3-0-0) 3 6 EC804 Mixed Signal Design (3-0-0) 3 7 EC805 VLSI Embedded Systems (3-0-0) 3 8 EC806 VLSI Design Automation (3-0-0) 3 9 EC807 Compound Semiconductor Devices (3-0-0) 3 10 EC808 Nano-electronic Device Engineering (3-0-0) 3 11 EC809 Active Filter Design (3-0-0) 3 12 EC810 Low Power VLSI Design (3-0-0) 3 13 EC811 Power Management IC’s (3-0-0) 3 14 EC812 Advanced Topics in VLSI (3-0-0) 3 15 EC813 Memory Design & Testing (3-0-0) 3 16 EC814 IC for Broadband communication (3-0-0) 3 17 EC815 CMOS RF IC Design (3-0-0) 3 18 EC816 Advanced Antenna Theory (3-0-0) 3 19 EC817 VLSI Signal Processing (3-0-0) 3 20 EC818 Multi-rate Signal Processing (3-0-0) 3 52 .

III (3-0-0) (3-0-0) 3 3 Program Electives Total Credits SI. Course Code Course Name (L-T-P) Credits 1 EC850 Data Structures and Algorithms (3-0-0) 3 2 EC851 Advanced Computer Architecture (3-0-0) 3 3 EC852 Optimization Techniques (3-0-0) 3 4 EC853 Linear Algebra (3-0-0) 3 5 EC854 Random Processes (3-0-0) 3 53 .II 2 24 EC822 Selected Topics in ECE .I 1 23 EC821 Selected Topics in ECE .21 EC819 Multimedia Systems 22 EC820 Selected Topics in ECE . No.

Read-write memories (RAM). Kang & Y. Pipelining. 6 hours Module 4 Memory Design Read-Only Memories. Ltd. CMOS Digital Integrated Circuits. Reference Books 1. Static and Dynamic Characteristics of CMOs inverter. Impact of Clock Skew and Jitter. Power dissipation. 1999. Tata McGraw . 54 . Eugene Fabricius. 6 transistor SRAM cell. dynamic memory design. Introduction to VLSI Design.Core Subject Syllabus Credits: 3(3-0-0) Subject Code Digital IC Design EC600 Total hours: 42 Course Objectives To understand the fundamental properties of digital Integrated circuits using basic MOSFET equations and to develop skills for various logic circuits using CMOS related design styles. Sense amplifiers. Timing metrics of sequential circuits.. 14 hours Module 2 Designing combinational and sequential circuits Static CMOS design.Hill Education. 4. Jan M. 2012. McGraw Hill. and Borivoje Nikolic Digital Integrated Circuits .Switching characteristics . The course also involves analysis of performance metrics. Logical effort. Rabaey. perspective. Cell based and Array based design implementations. Module 1 Implementation of strategies for digital ICs 10 hours Custom Circuit design. Power dissipation.Delay models –Timing issues in Digital circuits. Uyemura. Pearson. 1990. Logical effort of complex gates. Leblebici. 12 hours Module 3 Interconnect and Timing Issues Circuit characterization and performance estimation . Dynamic CMOS Logic. 3. Capacitance estimation . M. Wiley India Pvt. New Ed Edition. Anantha Chandrakasan. Dynamic latches and Registers. Different styles of logic circuits. Static and dynamic properties of complex gates. Introduction to VLSI Circuits. 2003. John P. Material from the Journal of Solid-state Circuits and the International Solid-state Circuits Conference proceedings. ROM cells.A design 2. 5.Resistance.

Module 4 Nonlinearity. CMOS Analog Circuit Design. B. Allen & D. Stability compensation. R. 2008. 5. David Johns & Ken Martin. passive components and their parasitics.Credits: 3(3-0-0) Subject Code Analog IC Design EC601 Total hours: 42 Course Objectives This course covers the analysis and design of analog integrated circuits starting from basic building blocks to different implementations of the amplifiers in CMOS technology. Hurst. Gregorian and Temes. 2011. Design of Analog CMOS Integrated Circuits. 3. Mismatch and Layout 10 hours Noise: Types of Noise. Wiley-India. Module 3 6 hours References Supply independent biasing. P. Meyer. Capacitor nonlinearity. Oxford Press. 2008. Wiley-India. small and large signal modelling and analysis. Current Mirrors. Constant-Gm biasing. S. Two-stage amplifiers . Mismatch analysis. P. feedback amplifier topologies. noise model. Mcgraw-Hill Education. Common mode feedback analysis. 2. Module 1 CMOS amplifiers basics 12 hours Introduction to MOS Capacitances. Holberg. Slew-rate. 2008. Frequency response. Analysis and Design of Analog Integrated Circuits. Module 2 12 hours Multi-stage amplifiers Telescopic and Folded cascode amplifiers. Nonlinearity of Differential Circuits. Lewis. Razavi. Analog Integrated Circuit Design. Analog MOS Integrated Circuits for Signal Processing.analysis. Bandgap reference. R. 4. Offset cancellation techniques. Wiley-India. P. Gray. Layout Techniques Reference Books 1. Pole splitting. 55 . 2002. Different Single stage and Differential Amplifiers.

2000. Solid State Electronic Devices. 4. Springer. Cambridge University Press. Module 3 10 hours BJT Bipolar device Design and Modeling. 5. Prentice Hall. Fifth Edition. 1991. 1998. Small and large signal models. Alternate MOS structures (SOI devices and Multi-gate MOSFETs) in brief. FinFETs and other multigate transistors. John Wiley & Sons.Subject Code Semiconductor Device Theory and Modelling EC602 Course Objectives Module 1 Credits: 3(3-0-0) Total hours: 42 To familiarize with the physical concepts behind the operation of microelectronic devices and also covers high performance. MOS switch. charge storage. Reference Books 1. 3. Ohmic contacts. Concentration and motion of carriers in Semiconductor bulk 8 hours Valence band and Energy band models of intrinsic and extrinsic semiconductors. MOSFET capacitances. Modern Semiconductor Device Physics. S. 56 . Brief overview of BJT CAD SPICE model and VBIC model introduction. M. C-V characteristics. 14 hours Module 4 MOSFET Alternate MOS structures Analysis of MOSFET. 2. Bipolar Device optimization & performance factors for digital and analog circuits. Non-ideal effects. MOSFET models for calculation. Ben G. Fundamentals of Modern VLSI Devices. J. Static I-V characteristics of MOSFETs. ideal static I-V characteristics and deviations including breakdown. Yuan Taur & Tak H Ning. ac small signal equivalent circuit. Calculation of threshold voltage. Schottky junctions. Thermal equilibrium carrier concentration. Multidimensional effects. Recombination and generation. Module 2 Quantitative theory of PN junctions 10 hours Band diagrams. P. electrostatics of a p-n junction diode. Colinge. high speed semiconductor devices used in VLSI systems. M. Sze. breakdown voltage. S. Tyagi. Wiley. 1998. Carrier transport phenomena. Streetman. 2007. Channel length modulation. Introduction to Semiconductor materials and Devices. body bias effect and short channel effects. switching characteristics.

Sanjit K. DT signals and systems. focus will be on FIR. E. P.S. 2012. Decimation by an integer factor. 4. Ingle and John G. Issues associated with IIR filters. and S. Specifically. issues related to finite word length and advantage of specific structures for implementation. 2. Interpolation by an integer factor. McGraw Hill. Proakis. Frequency analysis of signals. 1994. 6. Cengage Learning. Sampling rate conversion by a rational factor. Optimization Techniques in Filter Design. B. FFT algorithms. 5. 2010. 10 hours Module 4 Introduction to Multi-rate Signal Processing Sampling rate conversion. Module 1 Review of Signals and Systems 8 hours Introduction to CT signals and systems. Vinay K. John Wiley and sons.Digital Signal Processing A Computer-Based Approach. 2002. da Silva. Transform domain analysis of LTI systems. DFT. Module 3 Finite Word length problems in Digital Filters 12 hours Representation of binary numbers in digital filters. Cambridge. J. Fixed and Floating point representation. Proakis.Credits: 3(3-0-0) Subject Code Digital Signal Processing EC603 Total hours: 42 Course Objectives To expose to the basic concepts in digital processing system design with emphasis on the digital filter design and related algorithmic and implementation issues. and Dimitris G. Manolakis. Reference Books 1. Sampling rate converter as a time variant system. Fliege N J. IIR Digital filter design and implementation. Practical structures for decimators and interpolators. 2004. Digital filter applications. Pearson-Education. Various specific digital filters will be discussed and their use for some signal processing applications will be also discussed. Mitra. Algorithms and Applications. Implementation of different structures. Multi stage implantation of digital filters. Delhi.Properties. Netto. IIR Filters classical and optimized design techniques. Vaidyanathan. Pearson. Digital Signal Processing Principles. Essential of Digital Signal Processing using MATLAB. 3. Digital Signal Processing System Analysis and Design. 12 hours Module 2 Design of Digital Filters Digital filter structures. 57 . A. FIR digital filter design and implementation. Error due to quantization. P. truncation and round off. Diniz. John G. N. 2003. P. Multirate Digital Signal Processing.R. L. Multirate Systems and Filter Banks.

place & route and timing verification. 3. Placement. Post layout simulation.A Design Perspective. Second Edition. F. Standard cell layout techniques. Digital IC design Schematic simulation of CMOS Inverter. Telescopic amplifiers Two-stage amplifiers. Razavi. Springer. netlist synthesis. Routing. automated design tools. Parasitic extraction.Gail Gray. VHDL Design Representation and Synthesis. Multiplier and Shifters.Armstrong.Credits:3 (0-0-6) Subject Code IC Design Laboratory EC604 Course Objectives Module 1 Total hours: 84 This course introduces CMOS schematic design. B. Second Edition. Design of Adders. Synthesis with timing constraints. Differential amplifiers: Completer characterization of Single stage differential amplifiers. 2005. Third Edition. 58 . Prentice Hall. Sherwani. Pre layout simulation. Prentice Hall. Design of Analog CMOS Integrated Circuits. 2005. Cascode amplifiers. Post layout simulation. 5. Allan Hastings. Pre layout simulation. Module 2 Analog IC design Single stage amplifiers: Completer characterization of Common source amplifier.1999. McGraw-Hill Education. Floor planning. 4. Layout techniques Reference Books 1. Algorithms for VLSI Physical Design Automation. Naveed A. Digital Integrated Circuits . Folded Cascode. Common drain amplifiers. Pearson Education. Jan M Rabaey. Parasitic extraction. EDA Tools will be introduced in this course. 2. 2007. Common Gate amplifiers. layout techniques. The Art of Analog Layout. 2002. power and delay issues and Layout techniques. James R.

59 . Find the carrier concentration. The aim of these experiments is to understand the different effects in BJT. βdc and γ with emitter width and respective current characteristics Module 3 3D MOS device Simulate a 3D MOS device (FINFET/SOI/Piller MOSFET. Module 1 2D simulations Use device simulator to generate a pn diode structure. Introduction to Semiconductor materials and Devices. Module 2 BJT simulations Bipolar devices are integral part of high speed circuit. potential distribution (at different biases) and doping distribution across the structure. FinFETs and other multigate transistors. Extract Vbi from capacitance characteristics. User Manuals of respective software. 2007. Jean. MOSFET and novel device structures. electron and hole concentration. 1997. electric field. Tyagi. the following experiments can be performed: 1) Variation in α. Springer. Colinge. extract I-V and C-V characteristics and make similar observations as in device simulation and explain the differences if any. βdc and γ with base doping and base width and respective current characteristics 2) Variation in α. Springer.Subject Code EC605 Semiconductor Device Simulation Laboratory Credits: 3 (0-0-3) Total hours: 42 Course Objectives This course covers the analysis and design of pn diode. P.S. Silicon-on-insulator Technology: Materials to VLSI. Second Edition. Check the current and capacitance values with hand calculations. BJT. Tri-gate MOSFET GAA MOSFET) and obtain their characteristics. Process simulates the same structure with same/similar doping levels. M. Reference Books 1. 3. For a lateral/planar BJT. If not taken care in device design. John Wiley & Sons.Pierrie Colinge. 1991. 2. 4. J. Freeze different models one used. Any given MOSFET has a parasitic BJT. Exporting the process simulated structure in to device simulator. the parasitic BJT may lead to very different behavior. Simulate I-V characteristics and also get the C-V characteristics.

Timing verification. Abramovici. Agrawal. Module 1 Fundamental of VLSI testing 12 hours Basic of VLSI testing. Kropf. Second Edition. E. Automatic Test Pattern Generation (ATPG). 60 . Scope of testing and verification in VLSI design process. fault equivalence and fault location. fault dominance. automatic test pattern generation. System testing and test for SOCs. Formal verification. Bushnell and V. Scan design. Springer Verlag. Third Edition. defects. Essentials of Electronic Testing for Digital. and built-in self-test (BIST) also covered. 1993. fault modeling and simulation. Test interface and boundary scan. Introduction to Formal Hardware Verification. Design for testability. 4. Details of test economy. Delay fault testing. D. Digital Systems Testing and Testable Design. 2004. Principles of CMOS VLSI Design. A. Design verification techniques based on simulation. fault detection and redundancy. Kluwer Academic Publishers. 2000. Addison Wesley. Addison Wesley. 1990. 5. 2. analytical and formal approaches. Weste and Kamran Eshraghian. Module 4 Functional and Timing verification 8 hours Functional verification. Weste and David Harris. 3. M. Friedman. Module 3 Test automation and Design verification 10 hours BIST for testing of logic and memories. Principles of CMOS VLSI Design. Test automation. M. Neil H. T. Hardware emulation. Reference Books 1. D. Breuer and A. embedded cores and SOCs. E. 2000. Basics of equivalence checking and model checking. Memory and MixedSignal VLSI Circuits. design for testability. Module 2 Fault Modeling and testing 12 hours Fault models. Jaico Publishing House.Credits: 3 (3-0-0) Subject Code VLSI Testing and Testability EC650 Total hours: 42 Course Objectives This course covers introduction to the concepts and techniques of VLSI (Very Large Scale Integration) design verification and testing. M. Issues in test and verification of complex chips. Neil H.

61 . 4. Silicon VLSI Technology. Crystal structure. shallow junction formation & modeling. Measurement methods. Prentice Hall Electronics. oxidation enhanced diffusion. SOI Wafer manufacturing.Subject Code VLSI Technology Credits: 3 (3-0-0) Total hours: 42 EC651 Course Objectives This course aims at understanding the manufacturing methods and their underlying scientific principles in the context of technologies used in VLSI chip fabrication. Interfacial dopant pileup. Chang and S. Etching Technologies and Back-end Technology Thinfilm Deposition: Chemical and physical vapour deposition. Wafer manufacturing and Clean rooms 12 hours CMOS Process flow starting from Substrate selection to multilevel metal formation. Photoresists. RIE. growth kinetics and models. Plasma etching. Clean rooms. S. 1983. epitaxial growth. New York. 3. McGraw Hill. 10 hours Module 2 Photolithography and Oxidation Photolithography: Light sources. comparison between bulk and SOI CMOS technologies. Reference Books 1. 1988.. Deal and P. Silicided gates and S/D regions. Wafer exposure systems. C. 2000. Stephen Campbell. RTA Process & dopant activation 12 hours Module 4 Thin film Deposition. Back-end Technology: Contacts. M. VLSI Technology. Modeling deposition processes. 2. Etching Technologies: Wet etching. Segregation. M. John Wiley Inc. Damage production and annealing.K. deposition of dielectrics and metals commonly used in VLSI.Griffin. Electronic stopping. Vias. manufacturing methods and systems. Etching of materials used in VLSI. resist patterns and etched features. James Plummer. wafer cleaning and gettering: Basic concepts. Modeling of etching. S. High energy and ultralow energy implantation. Sze (Ed). manufacturing methods and equipment. measurement methods and characterization. The Science and Engineering of Microelectronics. Oxidation: Wet and Dry oxidation. Wafer preparation and specifications. Baking and development.Y. VLSI Fabrication Principles. 1996. Module 1 Crystal Growth. Mask making. Ghandhi. ULSI Technology. Multi-level Interconnects. Multi-chip modules and packaging. McGraw Hill Companies Inc. defects. Measurement of mask features and defects. Sze (Ed). 5. Second Edition. Czochralski and FZ growth methods. Characterization methods. Reflow & planarization. Oxford University Press. M. 8 hours Module 3 Diffusion and Ion-implantation Diffusion: Models for diffused layers. dopant-defect interaction. Ion-implantation: Basic concepts. 1996.

62 . Design & Programming. 2002. DCT. Embedded Systems Design with Platform FPGAs Principles and Practices. User manual of the tools for RF IC design. Inc. Readings in Hardware/Software Co-Design. 5. Wolf. Application case studies of signal processing applications FFT. a) System on chip lab course introduces CAD tool for system design and implementation of Prototype SoC platform using FPGA and ARM processor boards. G. Mountain View.V. K. 2004. Design of a tuned LNA and performance analysis. FPGA-Based Prototyping Methodology Manual Best Practices in Design-for-Prototyping. 2012. Data books of ARM7/ARM9.H. Silage. Examples on multiprocessor environments.264 etc. Wolf. Academic Press. RF microelectronics. b) The objective of this course is to cover the design issue related to RF IC Design. 4. Dreamtech Publication. 1997. Kluwer Academic Publishers. Xilinx ISE. EDK and ARM tool-chain will be used in this course. Razavi. 2010. Ernst. DeMicheli. T. Ron Sass and Andrew G. 2010. Mini Lab Projects Reference Books: 1. Module 1 System on chip Development of embedded systems in both ARM and FPGA platforms. Dennis. Lee.Credits:3 (0-0-6) Subject Code System Design Laboratory EC652 Course Objectives Total hours: 84 This course covers the Laboratory topics based on the core and elective subjects. The design of CMOS radio-frequency integrated circuits. Staunstrup and W. Embedded OS development on FPGA/ARM platforms and device driver development. 8.. Austin Lesea and Rene Richter. Elsevier Inc. Book stand Publishing. FIR. Cambridge: Cambridge University Press.K. and W. 7. int. Example syllabus based on electives like System on chip or CMOS RF IC is given below. J. Mini Project Module 2 RF IC Design Characterization of a MOS transistor for RF. JPEG. Design of a mixer based on a Gilbert cell. Synopsys. Embedded Real Time Systems: Concepts. Schmidt. 2nd ed. R. Prasad. 9. 2. 6.K. 3..2nd ed. 2003. Custom IP interfacing techniques for different protocols for above applications. B. Doug Amos. H. Design of a VCO and performance analysis. Pearson Education International. Embedded Design Using Programmable Gate Arrays. 2008. Hardware/Software Co-Design: Principles and Practice.

Subject Code Seminar Credits: 2 (0-0-3) EC606 Course Objectives Subject Code Students will have to choose a topic in current VLSI related areas or industry practices and prepare a write up along with suitable presentation and demonstration. 63 . VIVA-VOCE Credits: 2 EC654 Course Objectives Students will have to attend for a viva-voce in front of all the faculty of the department for the evaluation of the subjects studied in the first year (I and II semesters) with a suitable demonstration.

2. Proxemics. Technical Presentation Skills: A Practical Guide for Better Speaking (Revised Edition). 2011. Patrick. Mandel. The Five Dysfunctions of a Team. 64 . 4. Drake Publishers. 12 hours Module 1 Introduction to Communication-Definition-Types-Classifications.Subject Code HU650* (Audit Course) Course Objectives Communication Skills and Technical Writing Credits: 0 (1-0-2) Total hours: 45 This course is meant for developing Professional Communication and Technical Writing Skills among the students. Steve. 2006. Millett. The Art of Speaking. Lencioni. The Lab hours will give emphasis on Technical Presentation and Seminar (on different emerging topics) followed by question-answer and discussion. OUP. Wood. 1971. 3. and Professional Ethics ) Reference Books 1.Main PartTerminal Section) 15 hours Module 4 Presentation of Technical Report (Kinesics. Crisp Learning. Communication Skills. Summary/Executive Summary/Abstract Writing Exercises-Paragraph- Précis- 8 hours Module 2 Technical Reports-Types-Format-Nuances to be followed 10 hours Module 3 Preparation of Technical Document-Reports-Instruction Manuals-Project Proposal (Prefatory Part. Raman and Sharma. John Wiley and Sons. 2000.

1998. photonic band gap materials. Cerenkov configuration SHG. 1985. comparison of direct and coherent performance. 2. homodyne and heterodyne systems. semiconductor lasers for coherent systems. 5. receivers. Avalanche photodiode. Fronts ends for digital fiber optic receivers. reverse bias photo-detectors. 2007. Introduction to optical fiber. Reference Books 1. Ghatak.Credits: 3(3-0-0) Subject Code Optoelectronics and Photonics EC800 Total hours: 42 Course Objectives This course will cover basic laser theory. McGraw-Hill. quantum efficiency. G. Optical fiber Communication. distributed sensing with fiber optics. optical properties of semiconductors and quantum wells. Max Born & Emil Wolf. Optical fiber communication. J. dark current. Basic principles of interferometric optical fiber sensor. semiconductor physics. Wiley-Interscience. heterostructure semiconductor lasers. 65 . signal to notice ratio. Module 1 Semiconductor lasers 10 hours Semiconductor lasers for optical fiber communications. Fundamentals of Photonics. 3. Module 2 Photo detectors and Optical Receiver Operation 12 hours Device structure and fabrication. Keiser. Prentice-Hall International. The primary emphasis will be on semiconductor materials and devices. single frequency semiconductor lasers. Cambridge University Press. 2008. Module 4 8 hours Sensor and Devices Optical fiber sensor and devices. equalizer for optical communication. Distributed feedback in Ga-As-P lasers. 1999. Fabry-Perot cavity. photo-detectors for fiber optics. Seniar. types of detectors. detectors for digital fiber optic receivers. phase matching in waveguide. A. Second harmonic generation (SHG) in integrated optics. signal processing in mono mode fiber optic sensor. Receivers for digital fiber optic communication systems: basic components. PIN diode. optical detection and noises. electromagnetic waves. Principles of Optics. K. phase matched harmonic generation in waveguides. coherent detection principles. Saleh & Teich. PIN-FET receivers for longer wavelength communication systems. 4. Nonlinear process in optical fibers. Module 3 12 hours Transmission System Coherent optical fiber transmission systems. Cambridge University Press. intensity modulation through light interruption.

Prentice. architecture and circuit design trade-offs to optimize for power. VLIW architecture 10 hours Module 3 Testable architecture: Controllability and observability. performance and area. Pipeline and parallel architectures: Architecture for real time systems. VLSI Digital Signal Processing Systems. Kung. 8 hours Module 4 Trade-off issues: Optimization with regard to speed. Prentice-Hall. Digital Signal Processing with Field Programmable Gate Arrays. A. data dependences. driver etc. 2. Nikolic. CORDIC unit. K. 66 . 4. 1999. fast adder. latency and throughput related issues. J. 2003. critical path and worst case timing analysis. Y. micro-programmed control techniques. identifying fault locations. multiplier. Prentice Hall. Rabaey. data-path synthesis. 12 hours Module 2 Data-path optimization. array architectures. Springer-Verlag. Digital Integrated Circuits: A Design Perspective. VLSI Array Processors. Control strategies: Hardware implementation of various control structures. clocking strategy. power conscious structures. area and power. Data-path element: Data-path design philosophies. 12 hours Module 1 VLSI Design flow. U. application specific combinatorial and sequential circuit design. self-reconfigurable fault tolerant structures. asynchronous and low power system design. control structures. Parhi. 2001. S. 1988. concept of hierarchical system design. general design methodologies. Second Edition. Meyer-Baese. Mapping algorithms into Architectures: Signal flow graph. 3. ASIC (application specific integrated circuits) and ASISP (application specific instruction set processors) design Reference Books 1.Credits: 3(3-0-0) Subject Code Architectural Design of ICs EC801 Course Objectives Total hours: 42 This course covers algorithm. boundary scan and other such techniques. Chandrakasan and B. Wiley & Sons.

Application Specific Integrated Circuits. Design methodology and technology overview. 2004. Dynamic architecture using FPGAs. vendor specific issues (emphasis on Xilinx / Altera). M. FPGA based system design. 2000. 67 . W. coarse vs fine grained. combinational and sequential design. 2. Reference Books 1. test benches. granularity of function and wiring resources. sequential and DSP kernels on Xilinx / Altera boards.Partitioning and Placement. power dissipation I/O block architecture: Input and Output cell characteristics. Overview of FPGA architectures and technologies: FPGA Architectural options. 4. reconfigurable systems. timing models. 2007. The Design Warriors's Guide to FPGAs. Module 4 10 hours Applications Applications . Digital Design using Verilog. High Level System Architecture and Specification: Behavioural modelling and simulation. Elsevier. Smith. delays. clock input. Pearson. Clive Maxfield.Credits: 3(3-0-0) Subject Code Digital Design using FPGAs EC802 Total hours: 42 Course Objectives To learn field programmable gate array (FPGA) technologies and utilize associated computer aided design (CAD) tools. Module 2 Tool for logic Implementation 12 hours Hardware description languages. DSP using FPGAs. Simulation / implementation exercises of combinational. Module 1 Introduction 08 hours Digital system design options and trade-offs. Programmable interconnect . synthesis issues. S. Routing resources. 3. To synthesize digital systems with testing strategies and construct test benches. Elsevier. Timing. 2004. application case studies. Module 3 Implementation on FPGA 12 hours Logic block architecture: FPGA logic cells. Pearson. J.Embedded system design using FPGAs. state machine design. Wolf. Power dissipation. Peter Ashenden.

G. Firmware development. Schirner. Embedded System Design: Modeling. DRAM interface. Gajski. cache modeling and hybrid models. SystemC overview. & Swan. Pre-layout wiring estimates. Essential issues in SOC design: designing complex systems-on-chip. De Micheli.. Lin. Ghenassia.. Transaction-level modeling with SystemC: TLM concepts and applications for embedded systems. High. Springer. 68 . S. 2010. Martin. Simulation styles (fluid flow versus eventing). Frequency and voltage dynamic scaling. F. 2006. assertion-driven design and the concurrent development of hardware and embedded software. Y-L. 2009. Combinational and sequential equivalence. Liao. Temporal logic compilation to FSM. Structural hazards. Module 1 Low-level modeling and design refactoring 12 hours Verilog RTL Design with examples. Gerstlauer. McGraw-Hill. SoC parts. Reference Books 1. Verification. 1994. Springer. Electronic systems level (ESL). 3. variables and transactions for component inter-communication. A. 2002. Glue logic synthesis. Hardware/software interfaces and codesign. IP-XACT. testing and synthesis 10 hours Assertion based design: testing and synthesis. PSL/SVA assertions. Synthesis.level Synthesis and Automated Assembly. Memory maps. Using signals. Module 3 Assertions for design. Grotker.S. Basic RTL to gates synthesis algorithm.Credits: 3(3-0-0) Subject Code System on Chip Design EC803 Total hours: 42 Course Objectives This course covers SoC design and modeling techniques with emphasis on architectural exploration. G. Module 4 Power control and power modeling 8 hours Power consumption formulae. S. retiming. Springer. Programmer's model. Springer. Abdi. 2. 4. Transactional modeling. S. refactoring. System design with SystemC. Design exploration. high-level and hybrid modeling 12 hours Bus and cache structures. G. T. Module 2 Design partition. 5. Clock gating. D. Instruction set simulators. Synthesis and Optimization of Digital Circuits.

Pipeline ADC. Module 2 12 hours ADC and DAC Basics ADC. Holberg. op-amp designs. folding-and-interpolation ADC. Franco Maloberti. Module 4 10 hours Advanced Topics VCO. 2. Wiley-India. David Johns & Ken Martin. Charge pump. switched capacitor A/D and D/A converters. Wiley-IEEE Press. multistage sigma-delta converters. biasing and references. IEEE Press. Jacob Baker. McGraw-Hill Education. 1995. 4. CMOS Analog Circuit Design. Allen & D. Loop Filter. 3. Razavi. Springer-2007. 6. 2002. B. and clock generation systems for digital and mixed signal. Analog Integrated Circuit Design. Switched-capacitor filter architectures. Principles of Data Conversion System Design. Razavi. Data Converters. Precautionary measures for integrating analog and digital modules within an IC. CMOS Mixed Signal Circuit Design. Schreier & Temes. Module 1 Filter basics 10 hours Analog continuous-time filters: passive and active filters. Oxford Press. B. Flash ADC. Basics of analog discrete-time filters and Z-transform. Introduction/Characterization of DACs. Successive approximation ADCs. 2008. Understanding Delta-Sigma Data Converters. Wiley-IEEE Press. 5. R. Second Edition. 2009. 69 . 7. floor planning and physical design of mixed signal IC design. Design of Analog CMOS Integrated Circuits. Sample and Hold Circuits. The syllabus includes primitive cells. 2011.Credits: 3(3-0-0) Subject Code Mixed Signal Design EC804 Total hours: 42 Course Objectives This course covers theory and concepts to Integrate both Analog and Digital subsystems on a single monolithic chip to create an electronic system. Reference Books 1. 2004. Design of decimation filter. various architectures of high speed DAC Module 3 10 hours Over sampled ADC Over sampled ADC: Working principle and architecture of a Sigma-delta ADC. P.

timer.Credits: 3(3-0-0) Subject Code VLSI & Embedded systems EC805 Course Objectives Module 1 Total hours: 42 The course covers prototype development of embedded VLSI system. PLB.. Peter J. Reusability. Design of Master and Slave Bus protocols based IPs. Wireless protocols. 2010. Frequency. Dominic Symes. Elsevier Inc. emphasis on different embedded processors and multiprocessor and architectures. 2002. DMA etc. Sloss. Mountain View. clock. ASIC and FPGA based System On Chip. G. Digital Design: An Embedded Systems Approach Using Verilog. FPGA-Based Prototyping Methodology Manual Best Practices in Design-for-Prototyping. Simple & Autonomous I/O Controllers. Morgan Kaufmann.264. Productivity. Custom IP (Intellectual-Property) hardware design for System-On-a-Chip. H. Wolf. 4. 2006. Bus protocols (AXI. design challenges. Clocking and Synchronisation issues. Co-simulation using different simulators. 7. Ashenden. Andrew. 2010. NPI etc. Energy. Springer. Lin. Readings in Hardware/Software Co-Design. In addition to the conceptual foundations. Embedded Systems Design with Platform FPGAs Principles and Practices. 6.). 2004. system level optimization. 2008. Ron Sass and Andrew G. Cache Memory. Ernst. and W. and Tony Givargis. Reference Books 1. 5 hours Embedded System on chip platforms Introduction to embedded system and design methodology for ARM and FPGA devices. this course also covers various design methodologies and platforms based on ARM and FPGA. Essential issues in SOC design: designing complex systems-on-chip. Inc.S. Power. Concepts & types of Memory and interfacing. Prototype development of embedded application advantages.L. Digital signal Processor. Design Metrics. Application profiling. Performance and Area. Hardware-software co-design. 5. 3. System Level Design Trade-offs. Y. Schmidt. Advanced design Methodologies using HLS for an application like JPEG 2000. 25 hours Module 2 MPSoC platform for FPGAs and ARM Embedded Computer Organization. and Chris Wright. Embedded System Design: A unified Hardware/Software Introduction. Academic Press. ARM system developer's guide: designing and optimizing system software. Austin Lesea and Rene Richter. General purpose peripherals (interrupt. The course focuses on software application by mapping of functions onto hardware components. Morgan Kaufmann Publication. Differences between General Purpose Processor. Doug Amos. 12 hours Module 3 Analysis and case-studies Architecture exploration of IP. and advanced high speed buses. MJPEG. 2. Synopsys. 70 . Cache mapping techniques and impact on system performance. Frank Vahid.) and special purpose peripherals Serial Transmission techniques & Standards. FSL. R. DeMicheli. Embedded operating systems for SoC platforms. Design for Test. memory and power.

Graph theory fundamentals. Module 4 New topics in VLSI CAD 8 hours Design consideration for Analog and Mixed Signal Design. Naveed A Sherwani. Module 2 Partitioning and Routing 12 hours Partitioning. M. 2008. High-level synthesis. Mehta. Cormen. Chip Layout styles. quality metrics. Clock and Power Routing–Global routing. E. T. 2008. Sapatnekar. Algorithms for VLSI Physical Design Automation. and H. World Scientific. Third Edition. Emerging topics in the VLSI CAD. 1998. S. Reference Books 1. D. Third Edition. VLSI and Circuit Design Issues including power and delay analysis. 3. Channel routing. 2. 1999. Auerbach Publications. H. S. Sung Kyu Lim. Module 3 Optimization and Synthesis 10 hours Optimization techniques. Alpert. models for physical design. Compaction. Sait. Gordian. Handbook of Algorithms for Physical Design Automation. J. geometric. Youssef. 71 . Graph-theoretic models of floorplans. Logic synthesis and Technology Mapping-Dynamic Programming. Dagon. 4. Stein. Practical Problems in VLSI Physical Design Automation. C. Leiserson. R. C. MIT Press. Introduction to Algorithms. Module 1 VLSI CAD basics 12 hours VLSI CAD Flow. and C. Rivest. P. Floorplanning-tutte’s approach. Springer. VLSI Physical Design Automation: Theory and Practice. timing and power-consumption constraints of the design.Credits: 3 (3-0-0) Subject Code VLSI Design Automation EC806 Total hours: 42 Course Objectives The objective of physical design automation is to carry out mapping of the given structural representation into layout representation optimally using computers so that the resulting layout satisfies topological. S. Design Rule Check. Algorithm Design Approaches for VLSI CAD. Placement-general problem. 5. L. 2009.

1981. S. Reference Books 1.. 3. Sadao. Physics of Semiconductor Devices. Physical Properties of III-V Semiconductor Compounds: InP. Fermi level pinning. 1990. High Speed Semiconductor Devices. Sze. contrasts with p-n diodes. M. S. Sze. S. Wiley. Shur. Wiley. 1990. Dynamic models: large signal switching transients. Module 1 Introduction to compound semiconductor 12 hours Compound semiconductor crystals. InAs. Physics of Semiconductor Devices. optical properties and electrical properties. and InGaAsP. M. Deep level problem. Second Edition. diffusive vs. Conduction normal to junction: I-V models and characteristics. GaAs. small signal. 72 . mobility in semiconductors and carrier scattering mechanisms. GaP. theories of barrier formation and of current flow. models for terminal characteristics. 2. modulation doping. M. accounting for velocity saturation. examples of fabrication sequences. RF characteristics. 4. Module 4 8 hours HFETs & HBTs Basic device. high f models. 1992. free carrier concentration and Fermi-Dirac integral. Module 2 12 hours Heterostructures E-x Profiles. application-specific designs. pseudomorphic solution. Adachi. non-ideal behaviour. InGaAs. III-V alloys. Prentice-Hall. theory. Module 3 10 hours MESFETs Basic concept. structural. John Wiley & Sons. M. Conduction parallel to heterojunction. ballistic flow.Credits: 3 (3-0-0) Subject Code Compound Semiconductor Devices EC807 Total hours: 42 Course Objectives The goal of this course is to impart the elements of III-V compound semiconductor materials and their related electronic and photonic devices. Fabrication sequences. S.

Silicon-on-nothing. hetero structures of III-V and II-VI compounds . tunneling. Nanoelectronics – Principles & devices. Springer. characteristics. 12 hours Device Physics and Introduction to scaling issues Challenges going to sub-100 nm MOSFETs – fundamental limits for MOS operation. J. Vladimir V Mitin. 3. Coulomb staircase. SiGe HBTs. effects of high-K gate dielectrics on MOSFET performance. Gilmer. Silicon Quantum Integrated Circuits Silicon-Germanium Heterostructures Devices: Basics and Realisations. Module 2 Novel Device Structures 12 hours Novel MOS-based devices – Multiple gate MOSFETs. Mircea Dragoman and Daniela Dragoman. Silicon-on-insulator devices. Springer 2005. Sze (Ed). 2. PD SOI. Spin-based devices – spinFET. S. 2005. 7. H. 2005. FD SOI. Nag. Module 4 8 hours Quantum Effects Quantum structures – quantum wells. B. Cambridge University Press. SCEs and DIBL effects. 6. 73 . 1999. Kasper. strained Si devices. Springer 2005. Karl Goser. R. Module 3 Hetero structure based devices 10 hours Hetero structure based devices – Type I.resonant tunneling devices. Si-Ge heterostructure.R. II and III Heterojunction. non-uniform dopant concentration. interconnect and lithography issues. 5. Oxide layer thickness. Quantum heterostructures. Modeling and Simulation. E. Huff and D. energy quantization. Viatcheslav A Kochelap and Michael A Stroscio. velocity saturation. Springer 2002. High speed semiconductor devices. Carbon nanotubes based devices – CNFET.C. 4. FinFETs. Bloch oscillations Reference Books 1. High-K gate dielectrics.Credits: 3(3-0-0) Subject Code Nano-Electronic Device Engineering EC808 Course Objectives Module 1 Total hours: 42 This course will introduce the rapidly developing field of nano-engineering materials and various device structures with special focus on their electronic properties. Nanoscale Transistors: Device Physics. Nanoelectronics and Nanosystems: From Transistors to Molecular and Quantum Devices. 1990. MODFET/HEMT. subthreshold current. quantum wires and quantum dots. Wiley. power density. Single electron devices – charge quantization.. characteristics. High Dielectric Constant Materials for VLSI MOSFET Applications. Paul. Physics of Quantum Well Devices. 8. Artech House Publishers. Springer. 2005. Coulomb blockade. vertical MOSFETs. D. M. Mark Lundstrom and Jing Guo.

Characteristics of IC op-amps . 10 hours Module 2 Ladder filter structures LC ladder filter . 1998. Van Valkenburg. Van Valkenburg. Continuous-Time Filter Functions. Oxford University Press. Current-Mode VLSI Analog Filters . off-set problems. 1995. First Edition. To develop the skills required to design and verify the various filter circuits using op-amps and OTA’s. CRC Press. 1976. Material from the Journal of Solid-state Circuits and the International Solid-state Circuits Conference proceedings.Elementary Transconductance Building blocks.Design and Applications. K.prototype & synthesis.First-order building blocks. Gm-C filters. Properties of Active networks synthesis and Design. Limitations of opamp based filters. Sun and J. Oxford University Press.E. Schaumann and M. 4. P. The Ideal Operational Transconductance Amplifier (OTA).E. The Approximation Problem. 2.Credits: 3(3-0-0) Subject Code Active Filter Design EC809 Total hours: 42 Course Objectives To understand the fundamental concepts involved in the design of Continuous-time filters. Ananda Mohan. V. Characterization of on-chip integrated continuous time filters. Active elements . T. Impedance converters. Reference Books 1. Fidler.Second order sections. 10 hours Module 4 Switched capacitor circuits Switched capacitor filters. Analog Filter Design. 2003. Module 1 Filter Fundamentals 10 hours Filter Characterization. Design of Analog Filters. Y. 5. 12 hours Module 3 Realizations of active filters Active-RC filters. Gobind Daryanani. Butterworth. Chebyshev & Inverse-Chebyshev filter response and pole locations. Steps in Filter design. Continuous-Time Active Filter Design. 6. Deliyannis. 3. Birkhauser. Frequency transformation of low-pass filter. M. 74 . 2003. R. Wiley.

4. switching activity reduction. Low voltage design techniques using reverse Vgs. 2002. 2002 2. Pass Transistor Logic Synthesis. 10 hours Module 2 Low-Voltage CMOS Circuits Introduction. Practical Low Power Digital VLSI Design. 2000. CMOS Analog Circuit Design. steep sub threshold swing and multiple threshold voltages. Low Power Design Methodologies. pre-computation logic. Anantha P. Low power digital cells library. network restructuring and Reorganization. Yeap. Emerging Low power approaches. Wiley. Adiabatic Computation. and Sharat Prasad. 12 hours Module 4 Architecture and system Low power Architecture & Systems: Power & performance management. minimizing short channel effect. low power arithmetic components. KAP.Credits: 3 (3-0-0) Subject Code Low-Power VLSI Design EC810 Course Objectives Module 1 Total hours: 42 To understand the critical requirements and implementation of Low-power VLSI circuits. 3. Sources of power dissipation on Digital Integrated circuits.Gate reorganization. Philip Allen. parallel architecture with voltage reduction. Testing with elevated intrinsic leakage. Reference Books 1. Leakage current in Deep sub-micron transistors. Chandrakasan. 75 . 1995. and Robert W. Dynamic dissipation in CMOS. Rabaey. multiple supply voltages. and Douglas Holberg. device design issues. Design style. Oxford University Press. logic encoding. Low-Power CMOS VLSI Circuit Design. Kaushik Roy. signal gating.1997 5. The course also covers critical issue related to continued scaling of microelectronic circuits. Module 3 12 hours Circuit and logics Low Power Circuits: Transistor and gate sizing. Device & Technology Impact on Low Power: short circuit and leakage in CMOS. state machine encoding. Logic level. Gary K. Brodersen. Low Power Digital CMOS Design. Kluwer Academic Publications. 08 hours Introduction Introduction: Need for low power VLSI chips. Kluwer Academic. and Pedram. flow graph transformation. Special Flip Flops & Latches design.

Kluwer. 12 hours Module 2 Single ended primary inductance converter. Fundamentals of Power Electronics. LED drivers and solar micro-inverters. 10 hours Module 4 Voltage references. McGraw-Hill. Analysis of negative feedback circuits. 2009. interleaved converters. Kazimierczuk. 2008. Synchronous Buck converter. Mechanisms of switching loss. Zero Voltage switching DC-DC converter. W. PWM control of DC-DC converter. 3. 12 hours Module 1 Introduction to DC to DC converter. Switching in Inductor. dc-ac inverters for gas discharge lighting ballasts and wireless power transfer. Cuk Converter. Small-signal ac modeling. Analog IC Design with Low Dropout Regulators. resonant converters. Stabilization. and analysis of various DC to DC converters. Design and analysis of voltage references are also covered. Reference Books 1. PWM for Class D audio amplifier. voltage regulators. Pulse-Width Modulated DC-DC Power Converters. dc-ac inverters. Gabriel Rincon-Mora. switched-capacitor power converters and linear regulators. 2. Temperature and power supply sensitivity. PWM building blocks. 76 . Marian K. Various control techniques. Wiley. Applications emphasized include dc-dc converters for computer power and portable applications. Boost converter. 2001. R. Erickson and D. Second Edition. flyback converter. Maksimovic.Credits: 3(3-0-0) Subject Code Power Management ICs EC811 Course Objectives Total hours: 42 This course covers operation principles of different dc-dc converters: switched-mode power converters. Buck converter. ZVS converter. 8 hours Module 3 Zero current switching DC-DC converters.

this will address an application space that has become particularly relevant in recent times. Journal of Solid-State Circuits (JSSC) Transactions of Circuits and Systems I (TCAS-I) Transactions of Circuits and Systems II (TCAS-II) Transactions on Very Large Scale Integration Systems (TVLSI) IEEE Journal on Emerging and Selected Topics in Circuits and Systems Other relevant Journal and conference papers 77 . Serial links etc. wireless transceiver design.Credits: 3(3-0-0) Subject Code Advanced Topics in VLSI EC812 Course Objectives Total hours: 42 This course covers the advanced topics in the VLSI Design and emphasis will be given to one specific domain of integrated circuit design. Sensor design. 4. ultra-low-power design. 3. 5. 2. 6. Most often. Wireless body area networks. Examples are serial links. 21 hours Module 1 Topics on Wireless transceiver design. References 1. RF ID 21 hours Module 2 Topics on Ultra low power design.

latency. 2. Open and folded arrays. Semiconductor Memories: Technology. Third Edition. architectures. Wiley. refresh. design and testing of Memory Circuits starting from basic building blocks. CMOS Circuit Design. Charge Pump. High speed DRAM architectures. SRAM. 4. DRAM Circuit Design: Fundamental and High-Speed Topics. Wiley-IEEE. 12 hours Module 2 Introduction to DRAM. Ashok K. 8 hours Module 4 Reliabilities issues. Application Specific Memories and Architectures. Topics in Advanced Memory Technology.Credits: 3(3-0-0) Subject Code Memory Design & Testing EC813 Course Objectives Total hours: 42 This course covers the analysis. sensing basics. sense amplifiers. FLASH and interfacing circuits are covered. Wiley-IEEE. RAM Electrical Testing. Advanced BIST and Built-in Self-Repair Architectures. and Lin. FLASH (FLASH array sensing and programming). 1996. 8T cell implementation etc. Timing circuits. General Design for Testability Techniques.). 2013. Layout. Baker. Memory ErrorDetection and Correction Techniques. kickback. Embedded Memory DFT and BIST Techniques. RAM Pseudorandom Testing. Megabit DRAM Testing. Jacob Baker. and Reliability. 2010. EPROM 10 hours Module 3 RAM Fault Modeling. Sensing using Sigma-Delta Modulation. Sharma. 2007. Application Specific Memory Testing. IDDQ Fault Modeling and Testing. 78 . Reference Books 1. SRAM (Read and Write operation. Second Edition. 6T. RAM Built-in Self-Test (BIST). WileyIEEE. Johnson. and cycle time. Manufacture and Application. DFT and BIST for ROMs. Semiconductor Memories: A Handbook of Design. and Simulation. bandwidth. Testing. 3. PROM. Memory Fault-Tolerance Designs. Control logic. floating-gate architectures. Keeth. 12 hours Module 1 Review of CMOS circuit design. Memory technologies like DRAM. Power. Betty Prince. High Density memory package Technologies.

Sansen.Subject Code IC for Broadband communication Credits: 3(3-0-0) Total hours: 42 EC814 Course Objectives Module 1 The objective of this course is to study digital signal transmission over lossy and dispersive channels.C. Design of Analog Integrated Circuits and Systems. Design of Analog CMOS Integrated Circuits. 2. Lewis. feed-forward and decision feedback equalization. Tsividis. feed-forward and decision feedback equalization. 1994. 12 hours Digital signal transmission Digital signal transmission over lossy and dispersive channels: Eye diagrams. and jitter. John Wiley & Sons. World Scientific. and Meyer. Analysis and design of Analog Integrated Circuits. Behzad Razavi. crosstalk. 79 . Module 2 12 hours Equalization Equalization: Transmit pre-emphasis. and integrated circuit implementation of these techniques. Y. McGraw-Hill. multiplexers. techniques to combat them. 2009. 1997. Gray. 2000. Receive feed-forward equalization. 10 hours Module 3 IC broadband amplifiers for transmitter and receiver Integrated circuit implementation of broadband amplifiers for transmission and reception. 3. Synchronization: clock and data recovery circuits using phase locked loops and delay locked loops. Hurst. Eye closure. Analog Integrated Circuit Design. IC broadband amplifiers. 5. It provides an understanding of signal degradation. equalization. R. Fifth Edition. clock and data recovery circuits. David Johns and Ken Martin. McGraw-Hill. Reference Books 1. 8 hours Module 4 Clock and data recovery circuits Clock and data recovery circuits. John Wiley and Sons. K. 4.M. and decision feedback equalization. Laker and W. Mixed Analog Digital VLSI Devices and Technology (An introduction). 2002. and demultiplexers.

1998. RF system characterization.Credits: 3 (3-0-0) Subject Code CMOS RF IC Design Total hours: 42 EC815 Course Objectives The objective of this course is to cover the circuit design theory and their implementation techniques at RF frequencies specific to CMOS technologies. Low Noise Amplifier — design examples. Lee. Frequency Synthesizers: Principles. Personal Education Electronics and VLSI series. 2004. 80 . T. Fractional PLL. The bridge between communication system designer and RF IC designer. RF Microelectronics. Tuned amplifiers. Cambridge University Press. LC oscillators and VCOs. 3. Module 4 Oscillators & synthesizers 12 hours Analysis fundamentals and inductors. Mixers — Introduction. 2. VLSI for Wireless Communication. Leunge. RF properties of MOS. Module 1 Historical Aspects 8 hours Historical Aspects — From Maxwell to current wireless standards. B. Pearson Education. active and passive. cascades. 2002. B. The Design of Radio-Frequency Integrated Circuits. passive RLC. lumped. Integer N vs. H. design. Razavi. common system characterization. Prentice Hall. Reference Books: 1. Module 2 Transceiver Architectures 8 hours Transceiver Architectures — motivation for the individual blocks. Module 3 Low Noise Amplifier and mixer 14 hours Noise sources.

12 hours Huygens' principle. frequency independent antennas. 2005. Module 1 Fundamental Concepts 10 hours Physical concept of radiation. directivity and gain. Analysis of uniformly spaced arrays with uniform and non-uniform excitation amplitudes. Third Edition. reciprocity. input impedance. feeding methods. Reference Books 1. Balanis. C. finite-length dipole. S. A.Credits: 3(3-0-0) Subject Code Advanced Antenna Theory EC816 Total hours: 42 Course Objectives The main objective is to study modern antenna concepts for various applications. R. W. Thiele. and G. different types of antenna and array configurations. broadcast antennas. Antenna Theory and Design. Second Edition. radiation from sectoral and pyramidal horns. polarization. 1998. linear elements near conductors. Elliot. dipoles for mobile communication. John Wiley & Sons. Stutzman. John Wiley & Sons. prime-focus parabolic reflector antennas. 10 hours Infinitesimal dipole. A. Module 3 Aperture. Module 4 Microstrip Antennas and Antenna Arrays 10 hours Basic characteristics of microstrip antennas. Log-periodic and Yagi antennas. near-and far-field regions. small circular loop. effective aperture. radiation from rectangular and circular apertures. Radiation pattern. 2003. The concepts can further be extended in the VLSI domain for RF IC design. Antenna Theory and Design. Antenna Theory and Design. 3. design of rectangular and circular patch antennas. Reflector and Broadband Antennas. efficiency. Wiley-IEEE Press. methods of analysis. 2. Revised Edition. Module 2 Radiation from Wires and Loops. 81 . The course will explain basic antenna parameters. L.

Algorithmic strength reduction in filters and transforms. Module 1 DSP Concepts 12 hours Linear system theory. John Wiley. Keshap K. modified Winograd algorithm. DCT and inverse DCT. Design and Implementation. parallel FIR filters. This course also describes the techniques of critical path and algorithmic strength reduction in the filter structures. power reduction techniques. modified Cook-Toom algorithm. 1985. DFT. 3. 2007. 82 . Data flow graph representation of DSP algorithm. Binary multipliers. V. Unfolding. Retiming. Winograd algorithm. Madisetti. Parhi. low power IIR filter design. realization of digital filters. Multiply Accumulator (MAC) and Sum of Product (SOP). Module 4 Power Analysis in DSP systems 10 hours Scaling versus power consumption. FFT. Module 3 10 hours Fast Convolution Cook-Toom algorithm. Kung. S. U. Reference Books 1. Digital Signal processing with Field Programmable Arrays. H. 2007. Whitehouse. New York. power estimation techniques. Folding and Systolic architecture design. This course describes the basic ideas about digital signal processing. 1995. 4. Typical DSP algorithms. J. DSP applications. IEEE Press. power analysis. K. Low power CMOS lattice IIR filter.Credits: 3(3-0-0) Subject Code VLSI Signal Processing EC817 Total hours: 42 Course Objectives This course covers the various VLSI architectures and algorithms for digital signal processing. Prentice Hall. VLSI Digital Signal Processing Systems. Meyer-Baese. VLSI Digital Signal Processors: An Introduction to Rapid Prototyping and Design Synthesis. Springer. 2. Module 2 10 hours Architectural Issues Binary Adders. Y. Pipelining and Parallel Processing. VLSI and Modern Signal Processing.

Sampling rate conversion by a rational factor. lattice structures for linear phase FIR PR QMF banks. M-channel filter banks. Prentice Hall of India. 2003. M-channel FIR paraunitary filter banks. 2002. multi-rate filter design and DFT filter banks. Module 4 Linear Phase Perfect Reconstruction QMF Banks 12 hours Introduction. Decimation by an integer factor. N. errors created in QMF bank. Module 3 Maximally Decimated Filter Banks 10 hours Introduction. Digital Signal Processing Principles. Pearson-Education. Manolakis. S. Tata McGraw Hill. 83 and . formal synthesis of linear phase FIR PR QMF lattice. Reference Books 1. John Wiley and sons. interpolator. Multirate Systems and Filter Banks. Fliege N J. 4. cosine modulated perfect reconstruction systems. Interpolation by an integer factor. G. Applications of Multirate Signal Processing: Analysis of audio. 3. two channel FIR paraunitary QMF banks. Cosine modulated Filter Banks. Practical structures for decimators and interpolators. Multistage design of decimator and interpolator.Credits: 3(3-0-0) Subject Code Multi-rate Signal Processing EC818 Total hours: 42 Course Objectives This course covers the basic ideas about decimator. This course also describes the design of filter bank and efficient implementation of the filter banks. FIR structures with time varying Coefficients. 2004. Module 1 Introduction 10 hours Introduction. Applications of Interpolation and decimation in signal processing. J. & D. J. perfect reconstruction systems. Paraunitary Perfect Reconstruction (PR) Filter Banks. P. Multirate Digital Signal Processing. Vaidyanathan. 2. alias free QMF system. filter bank properties induced by paraunitariness. image and video signals. Digital Signal Processing-A Computer Based Approach. Algorithms Applications. G. lossless transfer matrices. Mitra. Sampling rate conversion. Sampling and Signal Reconstruction. efficient polyphase structures. power symmetric QMF banks. Proakis. 1994. Design of FIR filters for sampling rate conversion. Module 2 Multi-rate filter design 10 hours Direct form and Polyphase FIR structures. Sampling rate converter as a time variant system. K. two channel paraunitary QMF lattice. polyphase representation. speech. P.

20 hours Module 3 Architectures for multimedia CODEC module Design and analysis of several light-weight multimedia and image processing algorithms and computation management techniques. 32. sub-task scheduling. High performance architectures. Keshab K. springer. traditional development flows and algorithms on multimedia. 2007. The VC-1 and H. design consideration. Springer. Lin. image and multimedia processing. Youn-Long Steve. Pipelined MPSoCs. Digital VLSI systems design. 3.. Le Thinh. John Wiley & Sons. 17 hours Module 2 Algorithms and Embedded systems Review of various architecture types. 2008 4. low power design. 2. Intra prediction. Digital signal processing for multimedia systems. Ramachandran. deblocking filter. image processing systems and various algorithms for multimedia and image processing. Lee. entropy coder. advanced video memories hierarchies and specialized (multi-/many-core) hardware processor architectures and design methods (e. power estimation approaches. Iain E. CRC Press. Articles on IEEE Transactions on Circuits and Systems for Video Technology. power.. John Wiley & Sons. and Yong Lian. 8. Tian. Stream Processors. lossless coders. The course covers basics of embedded multimedia.Credits: 3(3-0-0) Subject Code Multimedia-Systems EC819 Total hours: 42 Course Objectives The objective of the course is to learn hardware accelerators for various modules in embedded systems. et al. Advanced arithmetic architectures and design methodologies: division and square root. audio processing and highlight their limitations in the light of performance. and Hari Kalva. and Takao Nishitami. 264 video compression standards for broadband video services. Module 1 Multimedia Application 5 hours An extensive overview of state-of-the-art techniques. DCT architectures. 5. 2010. wavelet VLSI architectures. Reference Books 1. 84 . Multimedia. Springer. advanced systolic design. cordic algorithms and architectures for fast and efficient vector-rotation implementation. and memory requirements. motion compensation .. Vol. Keshab K. system exploration for custom low power data storage and transfer. Integer discrete cosine transform. Jae-Beom. 264/AVC Standard. resource sharing. VLSI digital signal processing systems: design and implementation.. Richardson. Entropy Coders of the H. hardware description and synthesis of DSP systems. 6. Parhi. system integration and Future generation hardware codecs. Springer. and Stochastic Processors). architecture evaluation. 2011. consumer electronics etc. 1999. finite field arithmetic. and Seetharaman. 7.g. M. The H. 2011. VLSI Design for Video Coding. Study of various architectures for motion estimation. VLSI Systems. memory reuse mechanisms. Xiaohua. Parhi. 2007. Programmable and custom architectures and algorithms.264 advanced video compression standard.

Syllabus can be framed according to the need. Syllabus can be framed according to the need.Credits: 1 Subject Code EC820 Course Objectives Selected Topics in ECE-I Total hours: 14 This course covers the current topics in the ECE and emphasis will be given to application space that has become particularly relevant in recent times. Credits: 2 Subject Code EC821 Course Objectives Selected Topics in ECE-II Total hours: 28 This course covers the current topics in the ECE and emphasis will be given to application space that has become particularly relevant in recent times. Credits: 3 (3-0-0) Subject Code EC822 Course Objectives Selected Topics in ECE-III Total hours: 42 This course covers the current topics in the ECE and emphasis will be given to application space that has become particularly relevant in recent times. Syllabus can be framed according to the need. 85 .

parenthesis matching. Michael T. complete binary tree. Alfred V Aho. Goodrich. Cormen. Thomas H. introduction to algorithm analysis and design techniques. quad trees and k-d trees. 4. text similarity testing-range trees. path matrix. 86 . dynamic programming. 4 hours Module 1 Introduction to data structures and objectives. open addressing. Second Edition. and graphs and writing programs for these solutions. 2003. height balanced trees like AVL tree and 2-3 tree and other operations and applications of trees. data structures for disjoint sets. Course Objectives 8 hours Module 3 Linked lists: Linear. backtracking. Ullman. circular queue. 2010. John E Hopcroft. Elementary Operations. 6 hours Module 2 Stacks: Representation. Sartaj Sahni and Dinesh Mehta. linear and binary search. heaps. heap. binary search trees. elementary operations and applications. 2006. Data Structures and algorithms in Java. Data structures & algorithms. binary trees. 2003. 8 hours Module 5 Graphs: Representation. elementary operations and applications such as infix to postfix. red-black Trees. 2. Clifford Stein. search trees . stacks. binary search trees. Reference books 1. binary search tree. basic concepts Arrays: one dimensional. binomial heaps.Program Electives Subject Code EC850 Data Structures & Algorithms Credits: 3 (3-0-0) Total hours: 42 Following this course. Leiserson. hash tables. algorithms on sorting: selection sort. 10 hours Module 6 (Miscellaneous Topics) Hash tables. dequeue. tournament trees. B – Trees. Second Edition. quick sort. Roberto Tamassia. Fundamentals of data structures and algorithms using C++. Jeffrey D. heap sort. branch and bound and writing programs for these solutions. graph traversal. Charles E. 2) Solve problems using algorithm design methods such as the greedy method. Suffix Trees-Tries-Text compression. postfix evaluation. adjacency list. circular and doubly linked lists. fibonacci heaps. hash functions. Fourth Edition. John Wiley & Sons. Inc. Ellis Horowitz. hash tables. elementary operations and applications such as polynomial manipulation. tree traversal. Ronald L. Addison Wesley.Rivest. spanning tree. searching. 8 hours Module 4 Trees: Binary tree representation.. students will be able to: 1) Solve problems using data structures such as linear lists. queues. multi-dimensional. Introduction to algorithms. priority search trees. 3. direct address tables. Galgotia Publications. merge sort. splay trees. divide and conquer. bubble sort. MIT Press. Queues: Simple queue.

arithmetic pipeline design. W. 1994. conditions of parallelism. multiprocessor system interconnects. design of memory hierarchies. 3. reducing miss rate and miss penalty. VLIW architectures. 87 . Reference Books: 1. multifunctional arithmetic pipelines. Module 3 Pipelining and Multiprocessors 12 hours Linear pipeline processor. vector and symbolic processors. Hwang. multiprocessors. grain size and latency. dynamic instruction scheduling. performance metrics and measures. J. main memory organizations. superscalar processors. and memory hierarchy design for optimal performance of the system. advanced processor technology. McMillan. branch prediction. McGraw Hill. pipelining. Stallings. Module 2 12 hours Advanced Processors Principles of scalable performance. Advanced Computer Architecture. branch handling techniques. program flow mechanisms. Designing Efficient Algorithms for Parallel Computer. M. Quinn. K. 1990. data and resource dependencies. Module 1 Parallel Computer Models 10 hours Classification of parallel computers.Credits: 3(3-0-0) Subject Code Advanced Computer Architecture Total hours: 42 EC851 Course Objectives The objective of the course is to cover concepts related to parallel computer models. 2001. grain packing and scheduling. TMH. 2. nonlinear pipeline processor. advanced processors. message passing schemes. Multiprocessors and multi computers. system interconnect architectures. mechanisms for instruction pipelining. Module 4 Memory Hierarchy Design 8 hours Cache basics & cache performance. multiprocessors and multicomputer. cache coherence and synchronization mechanisms. superscaler and vector processors. CISC scalar processors. RISC scalar processors. multilevel cache hierarchies. instruction pipeline design. Computer Organization and Architecture.

P. special queuing methods. A. Reference Books: 1. Poisson process. Sullivan. non-linear programming with unconstrained and constrained optimization problems. 88 . Module 2 Non-linear programming 8 hours One-dimensional minimization method. 3. 2013. J. and S. search method. Rao. Chong. J. Failure time distributions. An Introduction to Optimization. Zak. Reliability of a system in terms of the reliability of its components. constrained optimization methods: Introduction. computation procedure and case studies. convex optimization. L. Mathematics of Non-linear Programming. the birth and death process. Springer Verlag. E. Module 4 Dynamic Programming 12hours Multistage decision problems.Credits: 3 (3-0-0) Subject Code Optimization Techniques EC852 Total hours: 42 Course Objectives The objective of this course is to study convex optimization techniques. Certain life models. Uhl. H. K. Lagrange multipliers. F. 2. 2009. 1993. and Parallel system. (P) Ltd. John Wiley & Sons. E. Module 3 10 hours Reliability Basic concepts. Publishers. Peressimi. Optimization: Theory and Practices. Module 1 Convex optimization techniques 12 hours Convex sets and functions. New Age Int. conditional failure rate function. Fundamentals of queuing system. series system. unconstrained and constrained optimization theory and practices. reliability theory and dynamic programming. S. Kuhn-Tucker conditions. S.

5 hours Module 4 5 hours Solution of Equations Solution of equations: Gaussian Elimination. The second part is intended to solve practical problems and provide algorithmic solutions. matrix rank. 1996. Jacobi methods. It is intended as a broad course from engineering perspective. SVD. inverse. Hermitian and symmetric matrices. Lanczos and Arnoldi methods. bilinear forms. 3. tridiagonal methods. Matrix Analysis. unitary matrices. Second Edition. Linear Algebra and its Application. Hoffman and Kunze. SOR methods. Module 1 Vector Space 5 hours Vector Spaces. 2. 4. Horn and Johnson. Golub and Van Loan. Matrix Computations. pivoting. Fourth edition. vector algebra. Gramm-Schmidt orthonormalization. 2005. Linear Algebra. LU and Cholesky factorizations. projection matrices and other special matrices. Cambridge University Press. 7 hours Module 7 Iterative Methods Iterative Methods for Linear Systems: Jacobi and Gauss-Seidel iterations. Strang. positive definite matrices. Linear Transformations and Matrices. basis vectors. Module 3 Inner Product Space Inner product spaces and vector norms. QR factorizations. Module 5 7 hours Orthogonolization Orthogonalization and Least Squares: Householder and Givens Matrices. 89 . The first part covers the vector space. Module 6 8 hours Eigen Value Problem Symmetric Eigenvalue Problem: power iterations. 5 hours Module 2 Characteristic Equation Eigen values and vectors of matrices and eigenvalue decomposition. Thrid Edition.Credits: 3 (3-0-0) Subject Code Linear Algebra EC853 Total hours: 42 Course Objectives This course covers the fundamentals of linear algebra and matrices theory. transformations and matrices theory and also provides the geometrical setting. Rank Deficient LS Problem. Reference Books 1. 2009. symmetric QR algorithm. Cengage Learning. Johns Hopkins University Press. determinant. 1990. Prentice Hall. subspaces. matrix norms. Full Rank Least Squares(LS) Problem. condition number.

An Exploration of Random Processes for Engineers. 4. Markov Process. Gaussian Random Vectors. Reference Books 1. Dimitri Bertsekas. Random Variables and their Distribution. Class Notes. 2014. Stationarity. Module 2 Convergence of Sequence of Random Variables 10 hours Various types of Convergence. S. Cross Moments. Continuous Time Markov Chain. 1996. Linear Innovations Sequences. 90 . Pillai. Cauchy Criteria for Convergence. 3. The Orthogonality Principle of MMSE Estimation. Renewal Theory. Athena Scientific. John Wiley and Sons. First Edition. Jointly Distributed Random Variables. Sheldon Ross. 2002.Credits: 3(3-0-0) Subject Code Random Processes EC854 Total hours: 42 Course Objectives This course covers the foundations and major concepts in random processes which are required for communications and signal processing concepts. Bruce Hajek. Frequently used Distributions. Module 3 Random Vectors and MMSE Estimation 10 hours Basic Definitions. A Papoulis. U. Chernoff Bound and Large Deviation Theory. Discrete Time Markov Chain. Functions of Random Variables. Introduction to Probability. Expectation. Counting Processes and Poisson Process. Stochastic Processes. Introduction to Martingales. Convex Functions and Jensen’s Inequality. 2002. Fourth Edition. Independence and Conditional Probability. Probability. Conditional Densities. John Tsitsiklis. Module 1 Preliminaries 8 hours Axioms of Probability. Limit Theorems. Discrete Time Kalman Filtering Module 4 14 hours Random Processes Random Processes. 2. Random Variables and Stochastic Processes. Tata McGraw-Hill.

Course Curriculum for Master of Technology Programme in Power Electronics and Power Systems Department of Electrical and Electronics Engineering National Institute of Technology Goa Farmagudi. Ponda.403 401 91 . Goa .

Tech I – Semester Semester-wise Credits Distribution Semester Total Credits I 12+4+2=18 (4-Programme Core + 2-Labs+1-Seminar) II 9+3+4+2=18 (3-Programme Core +1-Elective+ 2-Labs+1.M.Viva) III 06+08 =14 (2-Electives + Major Project -I) IV 14 (Major Project Work-II) Total Credits 64 92 .

Code Subjects L-T. No Sub.Sl.P Credits 1 EE600 Power Electronic Converters & Drives 3-0-0 3 2 EE601 Machine Modeling & Analysis 3-0-0 3 3 EE602 Advanced Power system Analysis 3-0-0 3 4 EE603 Renewable Energy Systems 3-0-0 3 5 EE604 Power Electronics Laboratory 0-0-3 2 6 EE605 Simulation Laboratory 0-0-3 2 7 EE606 Seminar 0-0-3 2 18 Total Credits M. No Sub. Code 1 EE650 2 Subjects L-T.Tech II – Semester Sl.P Credits Advanced Electric Drives 3-0-0 3 EE651 HVDC & FACTS 3-0-0 3 5 EE652 Systems & Control Theory 3-0-0 3 3 EE8xx Elective-I 3-0-0 3 4 EE653 DSP & FPGA Laboratory 0-0-3 2 5 EE654 Electric Drives Laboratory 0-0-3 2 6 EE655 Viva 7 HU650 Communication Skills and Technical Writing 2 1-0-2 0 18 Total Credits 93 .

Code 1 EE8xx 2 3 Subjects L-T.Tech IV.M. No Sub.Semester Sl.Semester Sl. Code 1 EE750 Subjects Major Project-II L-T.P Credits 0-0-21 14 14 Total Credits 94 . No Sub.Tech III .P Credits Elective – II 3-0-0 3 EE8xx Elective – III 3-0-0 3 EE700 Major Project-I 0-0-12 08 14 Total Credits M.

List of Electives Program Electives SI. No. Course Code Course Name Total Credits (L-T-P) Credits Elective-I 1 EE 801 2 3 Modelling and Simulation of Power Electronic Systems 3(3-0-0) 3 EE 802 Advanced Power Electronics 3(3-0-0) 3 EE 803 Photovoltaic and its Applications 3(3-0-0) 3 Elective-II 1 EE 804 Power System Dynamics & Control 3(3-0-0) 3 2 EE805 Smart Electric Grid 3(3-0-0) 3 3 EE 806 Power Quality 3(3-0-0) 3 Elective-III 1 EE807 Soft Computing 3(3-0-0) 3 2 EE 808 DSP Controlled Drives 3(3-0-0) 3 3 EE 809 Digital Control Theory 3(3-0-0) 3 4 EE810 Optimal Control 3(3-0-0) 3 95 .

5. 2.Course Contents Subject Code EE600 Power Electronic Converters & Drives Credits: 3 (3-0-0) Total hours: 45 Module 1 Phase controlled converters: Single phase Half controlled and fully controlled converters. single phase dual converters. 7. Pearson. 2009 3. dual converters. Devices and Applications. 2005. Gordon R.C drives. Philip T. slip power recovery schemes. Schlect. M. front end converter or synchronous link converters. Closed-loop control of drives: D. and D choppers. Robbins: Electronics: Converters. B. Three phase half controlled and fully controlled converters. Applications. 3rd Edition. John Wiley & Sons. Slemon and A. Krishnan: Electronic motor drives modeling Analysis and control I Edition Prentice Hall India.M. Stability of power electronic drive. Verghese: Principles of Power Electronics . Torque-speed characteristics of converter controlled separately excited dc motor in continuous and discontinuous mode of conduction. Power John 4. 12 pulse/18 pulse converter. S.1996. Pearson Education. non-isolated and isolated DC-DC converters. Rashid: Power Electronics-circuits. evaluation of input power factor and harmonic factor and effect of input line inductance. Kassakian. Oxford University Press.H. 6. John G. Module 2 DC-DC converters: Study of Class . Wiley Pub. Reference books 1. Separately excited DC motor drive using DC-DC converters. shaft-load coupling systems. Undeland and William P. 1st Edition. Geroge C. R. T. A. 3rd Edition.K. PHI. dynamic and regenerative braking. B. Ned Mohan. pulse width modulation techniques. power factor Improvements.A. power factor improvement. Martin F. four quadrant operation.B. Drives. Krein: Elements of Power Electronics. Module 3 Inverters: single phase inverters. Basic power electronic drive system and components. Different types of loads. input power factor and harmonic factor. C.. 96 .C. Bose: Modern Power Electronics and AC Drives. three phase inverters. multilevel inverters. speed control. Straughen: Power Semiconductor Drives. Dewan. Module 4 Induction to motor drives: Equivalent circuit. Synchronous motor drives: Operation with fixed frequency and variable frequency source. 2002.

Reference books 1. Module 3 Theory of synchronous machines: Voltage and torque equations. vector potentials in machines and actual boundaries. 2002. IEEE Press. Computer simulation of arbitrary reference frame. Winding inductances and voltage equations. transformation between reference frames. P. Hunting and small oscillations. Synchronizing and damping torques. equal area criteria. Bianchi: Electrical Machine Analysis using Finite Elements. transient armature inductances and field time constant. Theory of symmetrical induction machines: Voltage and torque expression. state-space model of Induction motor in'd-q-0' variables. variables observed from various frames.Concept of sub-transients. Wasynczuk and S. Krause. 2006. Module 4 Field aspects of electrical machines: Vector potential.Single and double excited systems. Classical two-dimensional analysis of air gap field. equations in arbitrary reference frame. Electro-magnetic (EM) energy conversion. Field analysis and performance calculation in linear Induction motor and linear synchronous motor. N. Finite element method of calculation. P.E.D. J. Krieger. O. Operation of synchronous machine under asynchronous running. R. 2005 4. Sudhoff: Analysis of Electric Machinery and Drive Systems. 97 . 2. Machine windings and air-gap MMF. 3. Bhimbra: Generalized Theory of Electrical Machines. CRC Press.S. C. Production of electromagnetic torque.Subject Code EE601 Machine Modelling & Analysis Credits: 3 (3-0-0) Total hours: 45 Module 1 Basic principles of electric machine analysis: Magnetically coupled circuits. Khanna Publishers. 2nd Edition. Module 2 Reference frame theory: Equations of transformation. computer simulation. 1984. magnetic saturation. Meisel: Principles of Electromechanical Energy Conversion.

D.Multi area power flow analysis. 6. Tata McGraw Hill Publishing Co. Tata McGraw Hill Publishing Co. Network Observability and Pseudo-measurements. Nagrath: Modern Power System Analysis. 5. 1. B. 7. T. Arrilaga. DC power flow model. Detection and Identification of Bad measurements. 4. Algorithms for formation of bus admittance and bus impedance matrices with mutually coupled branches. P. Kothari and I. Module 2 Load flow: Load flow-Newton Raphson method. New Delhi.Mahailnaos. 2. Macmillan Publishing Company. I. P. Singh: Advanced Power System Analysis and Dynamics. G.F: Power Generation Operation and Control. ATC assessment. Module 4 Security and State Estimation:Security assessment. J. 8. C. Stagg. Module 3 Fault and Contigency Analysis: Balanced and unbalanced faults. Decoupled . Ahson: Computer Aided Power System Analysis & Control. Ltd. L. John Wiley and sons. Kothari.Z Bus method in contingency analysis. P. Maximum Likelihood Weighted Least-Squares Estimation. Singular and non-singular Transformation. New York. J. El. Heydt: Computer Analysis Methods for Power Systems.Fast decoupled Load flow.J and Wollenberg.P: Power System Stability and Control. Sensitivity factors. NewYork. J.G. System Reduction for Contingency and Fault Studies. Harker: Computer Modelling of Electric Power Reference books System. Arnold.A.H: Computer Methods in Power System Analysis. McGra w Hill. K. Kundur.W . Ltd. Abiad. State Estimation of an AC Network. McGraw Hill 3. 98 .B. State Estimation in Power Systems. D. Sparsity Technique and optimal ordering. Wood.Subject Code EE602 Advanced Power System Analysis Credits: 3 (3-0-0) Total hours: 45 Module 1 Network Modelling: Formation of network matrices. Digital simulation techniques in fault analysis. Contingency Analysis of DC Model. S. John Wiley & Sons. New Age International Publishers.A. P.

superconducting magnetic storage system. Conversion systems and their performance features. Felix A. aerodynamics of wind rotors. Solar Power: Solar processes and spectral composition of solar radiation. self excited induction generator Module 5 Energy Storage systems: Parameters. types of converters. applications. Bhadra. Radiation flux at the Earth’s surface. Solar collectors. renewable resources. Abbasi. Types and performance characteristics.2004. R. Banerjee: Wind Electrical Systems. Kastha. single and double output systems.Subject Code EE 603 Renewable Energy Systems Credits: 3 (3-0-0) Total hours: 45 Module 1 Non-renewable reserves and resources. 3. M. Transformation of Energy.2006. isolated systems. Prentice Hall of India. Press. John Wiley & Sons. N. compressed air energy storage. Liserre and Pedro Rodríguez: Grid Converters for Photovoltaic and Wind Power Systems. variable speed induction generators with full and partial rated power converter topologies. 99 . performance analysis. lead-acid batteries. Applications. Godoy Simões: Integration of Alternative Sources of Energy. grid connected and self-excited induction generator operation. Abbasi: Renewable Energy Sources and Their Environmental Impact. S. speed and voltage control. Photo-Voltaic power plants: Solar energy. semi variable speed induction generator. D. Teodorescu. constant voltage and constant frequency generation with power electronic control. John Wiley & Sons. S. Reference books 1.A. Module 3 Tidal Energy: Wave characteristics. 2005. flywheels. Application.speed characteristics of wind turbines. conversion to electrical power: induction and synchronous generators. power. 2. Maximum Power Point Tracking Fuel cells: Fuel cells. pumped hydroelectric energy storage. characteristics of wind power plant. Module 2 Wind Energy: Wind energy conversion. Farret and M. Oxford Univ. Distributed Generation. self-excited induction generator. efficiency limit for wind energy conversion. Grid connected PV systems.speed and torque . N. Stand alone system with DC and AC loads with and without battery storage. S. Module 4 Induction generators: operating principle. 2011. equivalent circuit. commercial and manufacturing issues. renewable energy economics. reactive power compensation. wind turbine control systems. generation of electricity PV cell characteristic. 4. Geothermal energy: Biological conversion of Energy. ultra-capacitors.

DC-to-DC Switched Mode Converters. 1. quasi-square wave and SPWM Control Reference books 1. Ned Mohan. 3rd Edition. 3rd Edition. John Wiley & Sons. Devices and Applications. Ned Mohan.M.Robbins: Power Converters. Undeland and William P.H. Subject Code EE605 Power Electronics Simulation Laboratory PHI. Three-phase Half and Full controlled Converter with R-L and R-L-E loads. M. 2009. Rashid: Power Electronics-circuits. 2. Applications.M. 3rd Edition. John Wiley & Sons. T. 2005. 2005. Triac etc. Power Credits: 2 (0-0-3) Total hours: 45 Modelling of DC-DC converters Study of different PWM techniques Study on the 'dq0' transformation in various frames of reference Modelling of DC motor.). Characteristics of Power Semiconductor devices (SCR. 100 Electronics: .Subject Code EE604 1) 2) 3) 4) 5) 6) Power Electronics Laboratory Credits: 2 (0-0-3) Total hours: 45 Single phase Half and Full controlled Converter with R-L and R-L-E loads. M. Induction motor and synchronous motor drives Reference books 1. 2009.H. T. Rashid : Power Electronics-circuits. Robbins: Electronics: Converters. 2.Φ Inverter with square wave.Φ & 3. 3rd Edition. Applications. Single phase AC voltage controller feeding R and R-L loads. Undeland and William P. Devices and Applications. PHI.

Analysis and Control. 1. Brushless DC motor drive. Different types of loads. 1st Edition. IEEE Press. Vector control of synchronous motor drive. 101 Sons. B. Ltd. John Wiley & 2006 3. Module 2 Self-controlled synchronous motor drive. Permanent magnet drives and Industrial drives.Subject Code EE650 Advanced Electric Drives Credits: 3 (3-0-0) Total hours: 45 Module 1 Basic power electronic drive system and components. Module 3 Switched reluctance motor drive. Stability of power electronic drive. shaft-load coupling systems. Pearson. Bin-Wu: High-power Converters and AC Drives. . Scalar and Vector control of Induction motor. R. PHI India 2002. Direct torque and flux control of Induction motor.Modelling.K. Reference books 2002. Krishnan: Electric Motor drives . Bose: Modern Power Electronics and AC Drives. 2..

X. Wiley Interscience. converter bridge characteristics. T. planning for HVDC transmission.S. I. independent real and reactive power flow control. 5. C. analysis with and without overlap. 1996. comparisons between SVC and STATCOM. principles of dc link control. 1999. Delhi. J. Newyork. Song and A. Standard Publishers and Distributors. TSR. description of DC Transmission System. Reference books 1. L. Padiyar: HVDC Power transmission System.X. N. types of ac filters. limitations. 2001. Pal: Flexible AC Transmission Systems: Modeling and Control. 2nd Edition. 1998. Padiyar: Power System Dynamics. Y. R. R. Modern trends in DC transmission. Module 2 HVDC transmission analysis of HVDC converters. K. technical performance. Arrillaga: HVDC transmission. IEEE Press Book. compensator control.Subject Code EE 651 HVDC and FACTS Credits:3 (3-0-0) Total hours: 45 Module 1 Historical development of HVAC and HVDC links. power flow control. IET. E.P. application of dc transmission. constraints of maximum transmission line loading. Stability and Control. New age International. SSSC. Gyugyi: Understanding FACTS: Concepts and Technology of Flexible AC Transmission Systems. introduction to interline power flow controller. Module 3 Power flow in AC Systems. Birkhauser.2006. Benefits of FACTS transmission line compensation: uncompensated line. Kimbark: Direct Current Transmission. Series compensation. Zang. Johns: Flexible AC Transmission Systems. TCR and STATCOM. economics of power transmission.G Hingorani. 2. H. IET. 3. shunt compensation. 1994. Vol. B. 7. 6. reliability. comparison.starting and stopping of dc link. TCBR. basic principle of P and Q control. 4. types of DC links and converter station. Operation and control of TSC. pulse number. generation of harmonics. applications. K. Static series compensation: TSSC. Definition of FACTS. power control . Introduction to harmonics & filters. operation and control of UPFC. 1971. phase angle control. Operation and control applications Module 5 Unified Power Flow Controller: circuit arrangement. TCPAR. Rehtanz and B. converter and HVDC system control. Module 4 Static shunt compensators: SVC and STATCOM. 102 . Publishers.

optimal control concept. N. Oxford Univ. observability. integral control. solution of state equation. Reference books 1. Describing function methods. Dorf and R.K. 103 . Prentice Hall. K.Subject Code EE652 Systems and Control Theory Credits: 3 (3-0-0) Total hours: 45 Module 1 Review of matrices.J. combined observer-controller system. Khalil: Nonlinear Systems. Ogata: Modern Control Engineering. Principles of linearization. 2001. equivalent systems. system decoupling. H. duality. rings. state space realizations and minimal realizations. direct transfer function design procedures. C. Module 4 State Feedback Design: Linear State variable feedback. and fields. feedback linearization methods. Prentice Hall.S. pole placement for single and multivariable systems. system decomposition. 2003. Module 2 State Space Description: State space representations of systems. asymptotic tracking and regulation. diagonal form. Module 6 Nonlinear system Dynamics & Control: Analysis of Modelling equations: state-plane Analysis. vector space.. 3. solution of linear quadratic regulator problem. 2. controllable and observable canonical forms. state variable modelling of dynamical systems. Module 5 State Estimation and Servo Control: State observer. Introduction to Nonlinear Control Techniques: Sliding mode control. Lyapunov methods. transient response. group. Press. stability of linear systems. Pearson. robust servo control design. 2006. 4. H.H. R. Zak: Systems and Control. Bishop: Modern Control Systems. Module 3 System Analysis: controllability. transfer functions. reduced order observers. 2002.

Applications. multiple pulse. 2004. Devices and Applications. Hamid A. Subject Code EE654 Electric Drives Laboratory Credits: 2 (0-0-3) Total hours: 45 Thyristorised drive for 1hp DC motor with closed loop control Single phase & three phase half control and fully controlled bridge rectifier fed separately excited DC motor drive Four quadrant chopper drive for separately excited DC motor drive Speed control of 3 phase wound rotor Induction motor Implementation of single pulse. John Wiley & Sons. Bin-Wu: High-power Converters and AC Drives. Rashid : Power Electronics-circuits. Dorling kindersley. sine-triangle and space vector modulation PWM schemes with DSP controller. aliasing. Toliyat: DSP Based Electromechanical Motion Control.Robbins: Power Electronics: Converters. quantization Saw tooth wave generation Single pulse .Subject Code EE653 DSP & FPGA Laboratory Credits: 2 (0-0-3) Total hours: 45 CCS introduction. M. 3rd Edition. 2009. T. Ned Mohan. 3rd Edition. Reference books 1. 2. 3. CRC Press. 1st Edition. IEEE Press. Undeland and William P. Wolf: FPGA based system design. John Wiley & 2006 Sons.H. sin-triangle and space vector modulation PWM generation Digital filter design FPGA based motor control applications Reference books 1. multiple pulse. 104 . PHI. 2004. 2005. 2.M.

John Wiley and Sons. Mandel. Reports-TypesFormat-Ethics to be followed. 6.Prefatory Part. Wood. 2000. 7. The Five Dysfunctions of a Team: NJ. Steve.Subject Code HU650*(Audit Course) Communication Skills and Technical Writing Credits: 0 (1-0-2) Total hours: 15 Hrs 12 hours Module 1 Communication-Definition-Types-Classifications. New York: Drake Publishers. 12 hours Module 2 Writing Skills: Technical Document-Reports-Instruction Manuals-Project Proposal 10 hours Module 3 Writing Exercises: Precis-Summary/Executive Summary/Abstract 8 hours Module 4 Preparation of Report. 105 .Main Part. 8. Lencioni. 2006. 1971. New Delhi: OUP. Raman & Sharma. Patrick. Presentation Skills-Do’s and Don’ts. Communication Skills. Crisp Learning.Terminal Section Reference Books: 5. Millett. Technical Presentation Skills: A Practical Guide for Better Speaking (Revised Edition). The Art of Speaking. 2011.

3. PWM modeling . Mechanical and electro mechanical systems. 3rd Edition. John Wiley & Sons. Chee-Mun Ong: Dynamic Simulation of Electric Machinery: Using 106 Matlab/Simulink . Ramnarayanan and V. Mathematical modeling of simple electrical. Applications. conventional controllers using small signal models. Module 3 Modeling: steady state analysis of converters. B.Electives Subject Code EE801 Modeling and Simulation of Power Electronic Systems Credits: 3 (3-0-0) Total hours: 45 Module 1 Introduction to ODE solvers. Patil. T. Types of mathematical models. 2010. State Space Averaging Technique and its application in simulation and design of power converters. state space average modeling. 1st Edition.Robbins: Power Electronics: Converters. simulation of switching converters with state space averaging. Narosa Publishers. Modeling and simulation of Induction motor. V. Modeling. M. 2. V/f Control of Induction motor and Vector controlled 3-Ph Induction motor. converter transfer functions. Simulation of electric drives: Modeling of different PWM Techniques. M and N method. Trapezoidal integration. Module 4 Control Techniques in Power Electronics: State space modelling and simulation of linear systems. Developing a model. Hysteresis controllers. Ranganathan: Simulation of Power Electronic Converters. steps of using ODE solvers. Undeland and William P. Ned Mohan. dynamic analysis of converters. T.modeling of converters operating in continuous and discontinuous conduction mode. 2009. Module 2 Simulation of power electronic converters: State-space representation. Fuzzy control.M. Reference books 1. Output and state feedback switching controllers.

power factor correction. Devices and Applications. 3. Ned Mohan. Erickson and DraganMaksimovic: Fundamentals of Power Electronics.H. permanent magnet sine fed. 3rd Edition. multipulse VSCs. Multipulse ac-dc converters: Diode and thyristor based converters. Energy conservation and power quality improvements in these drives.. Module 2 Single-phase improved power quality ac-dc converters: Buck. push-pull and bridge in DCM and CCM. 2008. solated dcdc converters: Flyback. 2009. Zeta in DCM and CCM. synchronous.2001 107 . Marian K. multilevel VSCs. 2. Reference books 1. 2nd Edition. buck-boost. Single-phase. PHI. forward. 4. PWM VSC (Voltage source converters). Undeland and William P. T. Permanent magnet brushless dc (PMLDC) and switched reluctance motors. synchronous reluctance motors. power factor correction. Module 3 Three-phase improved power quality ac-dc converters: VSC . Cuk. Module 4 Solid state controllers for motor drives: Vector control and direct torque control of induction. half bridge. UPS. PWM CSC (Current voltage source converters). boost. PWM CSC (Current voltage source converters). boost. John Wiley & Sons Ltd.Subject Code EE802 Advanced Power Electronics Credits: 3 (3-0-0) Total hours: 45 Module 1 Non-isolated dc-dc converters: Buck. 3rd Edition. Robbins: Power Electronics Converters. Cuk. M. 1st Edition. Rashid : Power Electronics-circuits. Applications. Robert W. Their application in SMPS. single-stage converters (SSSSC). welding and lighting systems.M. multilevel VSCs. Kazimierczuk: Pulse-width Modulated DC-DC Power Converters. buck-boost. SEPIC. LCI (load commutated inverter) fed large rating synchronous motor drives. John Wiley & Sons. 2005. Springer.

nanotechnology applications.Subject Code EE 803 Photovoltaic and its applications Credits: 3 (3-0-0) Total hours: 45 Module 1 Solar energy: solar insolation vs world energy demand. anti-reflection coatings. p-n junction photodiodes. single junction and triple-junction solar panels. current energy consumption from different sources. DC to AC conversion. Kalogirou: Solar Energy Engineering: Processes and Systems. Fonash: Solar Cell Device Physics. Academic Press. 1. polycrystalline and amorphous silicon solar cells. on-site storage and grid connections. Imperial College Press. Cost analysis and environmental issues: Cost analysis and pay back calculations for different types of solar panels and collectors. module structure and module fabrication. beam splitters. load matching. types of solar energy concentrators. conversion efficiency. performance monitoring. operating solar cells at high incident energy for maximum power output. Jenny Nelson: The Physics of Solar Cells. charge carrier generation. inverters. Module 3 Optical engineering: Optical design. metalsemiconductor hetero junctions and semiconducting materials for solar cells. recombination and other losses. 2nd edition . fill factor and optimization for maximum power. resources and utilization. Photo electrochemical cells for hydrogen production: photo electrochemical electrolysis. measurements. electron and holes transports. solution based processes solar cell production. output power. photoelectron chemical cells for hydrogen production. environmental and health effects. operating temperature Vs. fresnel lenses and fresnel reflectors. hydrogen storage. I-V characteristics. solar hydrogen efficiency. current trends in photovoltaic research and applications. cadmium telluride thin-film solar cells. solar cell applications: pv cell interconnection. installation and operating costs. efficiency. semiconducting materials. environmental and safety issues. surface structures for maximum light absorption. conversion efficiency. Module 2 Photovoltaic (PV): Fundamentals of solar cells. electrostatic field across the depletion layer. Soteris A. hydrogen economy. band engineering. quantum dots. Stephen J. absorption of photons. installation. band gap theory. Module 4 Thin film solar cells: Single crystal. depletion region.Sustainable Energy: production and storage. excitation and photoemission of electrons. system sizing. F Lasnier: Photovoltaic Engineering Handbook CRC Press 108 .Academic Press Reference books 3. equivalent circuits. 2009 4. device physics. device structures. device construction. design of stand-alone PV systems. 2003 2. protection systems. types of solar cells. Solar cell properties and design.

Digital Stabilizer. Module 3 Power System Stabilizer: Block diagram of PSS. steady state analysis. PV curve. multi-machine analysis. transmission system characteristics.methods for improving transient stability.State space representation concept.P. system state matrix including PSS. response to a step change in mechanical power input. B S Publication. Pearson Education Asia. critical clearing time and angle. analysis of stability. classical representation of generator. Transient stability. IEEE Press books Power Engineering Series 3. Voltage stability:. load characteristics. phasor representation. McGraw-Hill Reference 2. Voltage collapse and prevention of voltage collapse. per unit representation.signal stability problems. d-q transformation.M and Fouad: Power System Control and Stability”. machine with multiple pole pairs-mathematical description. Swing equation.system representation by state equations. Stabilizer limits 1. factors influencing transient stability. numerical integration method . 4. QV curve and PQ curve.Basic concept. Kundur: Power System Stability and Control. Nasser Tleies: Power Systems Modelling and Fault Analysis. Parks transformation. Stabilizing signal washout stabilizer gain. Phase lead compensation. Frequency-based stabilizers. Anderson.Subject Code EE804 Power System Dynamics and Control Credits: 3 (3-0-0) Total hours: 45 Module 1 Modelling: Synchronous machine theory and modelling:. 5.Concept of transient stability. Peter W. small signal stability of a multi machine connected to infinite bus system. Characteristics of small . 109 .voltage-current and flux linkage. equivalent circuit for d-q axes. Elsevier. Excitation control design Exciter gain. R-K method (4rth order). Module 2 Stability Analysis: Small signal stability analysis -small signal stability of a single machine connected to infinite bus system. K R Padiyar: Power system Dynamics Stability and Control. generator characteristics.armature and field structure. characteristics of reactive power compensating devices. 2008. small-signal stability improvement methods: delta-omega and delta P-omega stabilizers. Eigen properties of the state vectors. rotor angle – steady state equivalent circuit. Excitation system modelling-excitation systems block diagram . Sauer and M APai: Power system Dynamics Stability. Euler method.

Subject Code EE805 Smart Electric Grid Credits: 3 (3-0-0) Total hours: 45 Module 1 Introduction to Smart Grid-Smart Grid Functions .Computational Intelligence Techniques . communication facilities. 4. field bus and Ethernet. PLC.Wide Area MeasurementSystems (WAMS) . A. and Solutions.Key Challenges for Smart Grid Module 2 Smart Grid Architecture -Components and Architecture of Smart Grid Design . 1995. introduction to SCADA: grid operation and Control. architecture.in hybrids . 110 . Lukas: Distributed Control Systems. 2012 5. Van NostrandReinfold Company. 2012 by CRC Press 2.Control of Smart Power Grid System Module 4 Introduction to Factory & Process Automation. Ackermann: Wind Power in Power Systems. 2008. Reference books 1.G. Networking standards.Distribution Generation Technologies.Indian Smart Grid . Thorp: Synchronized Phasor Measurements and their Applications.Transmission and Distribution Automation .Storage Technologies . difference between SCADA system and DCS. Gil Masters: Renewable and Efficient Electric Power System . Module 3 Introduction to Renewable Energy Technologies .Electric Vehicles andplug . Technology. Vertical Integration of Industrial Automation. Wiley-IEEE Press.Environmental . Programming language. Phadke and J. 2004.Supervisory Control and Data Acquisition (SCADA). 3. Series: Electric Power and Energy Engineering Published: October 24. Springer. 2nd Edition. Michael P.Synchro Phasor Measurement Units (PMUs) .Distributed Control Systems (DCS). local control unit.Advantages .Micro grids . Stuart Borlase: Smart Grids: Infrastructure. engineering interfaces. John Wiley & Sons. T.S. operator interface.

voltage imbalance. passive and active filters. Heydt: Electric Power Quality. parks transformations. IEEE Press. 2007. compensation in frequency domain.passive filters. technical and economic considerations. Power system response characteristics: harmonics Vs transients. 1999. long duration variation such as sustained interruption. 3) M. current control techniques for derivation of gating signals. over voltage. hybrid filters. Harmonic distortion evaluation. Akagi: Instantaneous Power Theory and Applications to Power Conditioning. 2) G. Clark’s transformations. Module 4 Control strategies: Instantaneous active and reactive power (p-q) control strategy. topology based categorization. 1994. devices for controlling harmonic distortion. active filters applications depending on power quality issues. inter harmonics. Type-2 fuzzy logic controller. power frequency variations. Voltage sag. categorization of active power filter: converter based categorization. derivation of compensating signals. Effect of harmonics. solutions for mitigation of harmonics. Module 3 Introduction to active power filter control strategies: shunt active filter basic compensation principle.Subject Code EE806 Power Quality Credits: 3 (3-0-0) Total hours: 45 Module 1 Introduction to power quality: terms and definitions: overloading. Reference books 1) H. IEEE and IEC standards of power quality. harmonic indices. NewYork. Instantaneous active and reactive current (Id-Iq) control strategy and perfect harmonic cancellator. IEEE Press. signal conditioning. selection considerations of APFS. IN. Harmonics: harmonic sources from commercial and industrial loads. supply system based categorization. West Lafayette. classification of power filters. voltage and current distortion. Type-1 fuzzy logic controller. 111 . voltage fluctuation. active filters. under voltages. and neural networks. under voltage. 2nd Edition. selection of power filters. active power filter control strategies. voltage swell.J Bollen: Understanding Power Quality Problems: Voltage Sags and Interruptions. hysteresis current control scheme and adaptive hysteresis current control scheme.T. resonance. harmonic distortion. Stars in a Circle Publications. generation of gating signals to the devices of the APF. Module 2 Introduction to APF technology. Introduction to Dc link voltage regulation: DC link voltage regulation with PI Controller. compensation in time domain. locating harmonic sources. Concepts of transients: short duration variations such as interruption. over voltages.H.

properties. general concepts of associative memory (associative matrix. membership. limitations of the single layer perceptron model (XOR Problem). . fuzzy sets. Bidirectional Associative Memory (BAM) architecture. Hybrid Systems: ANFIS. Triangular membership function and Gaussian MF). operations of artificial neuron. M. 2. association rules. types of neuron activation function. 1. Rule base fuzzy logic applications: fuzzy logic control and fuzzy classification. neural dynamics (activation and synaptic). perceptron models: discrete. J. Module 4 Introduction to classical sets . training algorithms: discrete and continuous perceptron networks. Design of control rules: trapezoidal MF. 1997. generalized delta rule. defuzzification methods: COA. control. fuzzy relations. Applications. architecture of Hopfield network: discrete and continuous versions. history of artificial neural systems development. perceptron convergence theorem. feedback network. Module 3 Associative memories: Hebbian learning. Prentice Hall 112 . continuous and multi-category. features.introduction. properties. Module 2 Classification model. cardinalities. uncertainty. learning strategies. neural processing. Type-2 fuzzy inference system with different fuzzy MFs (Trapezoidal membership function. SOM. Introduction to Type-2 FLC: The structure of Type-2 FLC. discriminant functions. fuzzy inference systems: Mamdani max-min and max-product composition scheme. Fuzzification. operations and relations. triangular MF and Gaussian MF. Zurada: Introduction to artificial neural networks.Subject Code EE 807 Soft Computing Credits: 3 (3-0-0) Total hours: 45 Module 1 Introduction to biological and artificial neuron models. Mc-culloch-Pitts neuron model. hamming distance. GA tuned Fuzzy System. fault diagnosis and load forecasting. learning difficulties and improvements. single and multilayer feed forward neural networks. and decision regions. Applications of fuzzy systems. development of rule base and decision making system. Neural network applications: process identification. Simon Haykin: Neural Networks A Comprehensive Foundation. membership functions. credit assignment problem. learning rules. operations. Genetic Algorithm. storage and recall algorithm. defuzzification to crisp sets. ANN architectures. Back Propagation Algorithm (BPA). Jaico publishers. Module 5 Evolutionary Computation: Different variants. BOA. models of Artificial Neural Networks: feed forward network. MOM. and LOM. Fuzzy Filtered NN & Neural Fuzzy Systems. membership value assignment.

Modelling. Sun . 2007. 5. PHI. Multiple pulse . Induction Motor Reference books 1. TMH. Interrupts. Mizutani: Neuro-Fuzzy and Soft Computing A Computational Approach to Learning and Machine Intelligence. Bin-Wu: High-power Converters and AC Drives. 2004. John Wiley & 2006 3. Analysis and Control. Module 2 Implementation of PWM schemes: Single pulse . S. 1st Edition. Timothy J Ross: Fuzzy Logic with Engineering Applications. J.Reference books 3. Sine triangle PWM. Hamid A. 2. IEEE Press. . Module 4 DSP-Based Control of Stepper Motors. Event managers. 2002. B. R. Space vector PWM.ADC. E. synchronous motors. 4. CRC Press. T. Prentice Hall.Kosko: Fuzzy Engineering. C. Krishnan: Electric Motor drives . R. Module 3 Clarke's and park's transformations: Implementation of Clarke's and Park's transformation. PHI India 113 Sons. Toliyat: DSP Based Electromechanical Motion Control. Jang. 1997 Subject Code EE808 DSP Controlled Drives Credits: 3 (3-0-0) Total hours: 45 Module 1 Overview of TMSLF2407 or Advanced DSP controllers: Instruction Set. BLDC Motors.

Design by Discrete Equivalent. Module 4 Design of Digital Control Systems: A State Space Approach. Controller Design for Discrete-time Systems. Module 2 State Variables Approach to Discrete time Systems: Definition of the State Vector. Zhou. Estimator Design. Prentice Hall. Doyle: Essentials of Robust Control. State Transformations. Optimal control. K. Continuous-time Controller Design. Module 5 The Effect of Quantization. Zhou andJ. 1996. Controller Implementation.Subject Code EE809 Digital Control Theory Credits: 3 (3-0-0) Total hours: 45 Module 1 Introduction to Digital Control Systems: Continuous-time Vs Discrete-time Systems. Continuous-time System Analysis. Regulator Design. Reference books 1. Prentice-Hall. J. Analysis of Finite Precision Errors. Glover: Robust and Optimal Control. State Feedback. Solution of State Equations. Adaptive control. Doyle. Control Law Design. Parameter estimation. 2. Root Locus Design in the z-plane. Digital Control Vs Digital Signal Processing (DSP). The MIMO Transfer Function Matrix G(z). and K. Discrete-time System Analysis. Limit Cycles. 1996 114 . K.Signal Discretization. Module 3 Direct Design of Digital Control Systems Using Transform Techniques: Z-plane Specification of Control System. C. Observability and Controllability.

Green. Hall. Lagrange multiplier technique Module 2 Dynamic programming. application to minimum time. Falb: Optimal Control. Tracking problem. Sethi and G. 2007 2. S.P. multistage decision processes Module 5 Linear regulator problem: matrix Riccati equation and its solution.J. control problems. Numerical solution techniques. and terminal control problem Module 4 Dynamic programming: Belaman’s principle of optimality. Parameter optimization Module 3 Pontryagin’s principle: theory. M. M. 3rd Athena Scientific. Computational methods in optimal control. Johnson and D. 2005 4.L. Application of mathematical programming. Limebeer: Linear Robust Control. McGraw Hill. Prentice Digitized Dec 2007 edition. 3. Bertsekas: Dynamic Programming and Optimal Control. D. D. Static and dynamic optimization.P. Volume I. **************************************************** **************************************************** ******************************************** 115 . Euler-Language equation and transversality conditions. Thompson: Kluwer Academic Publishers. singular perturbations 1.L.E.Subject Code EE810 Optimal Control Credits: 3 (3-0-0) Total hours: 45 Module 1 Calculus of Variations: problems of Lagrange. 2000 Reference books Optimal Control Theory. N. Athans and P. Mayer and Bolza. 2nd edition.