Showing posts with label ANNA UNIVERSITY REGULATION 2013 PG SYLLABUS. Show all posts
Showing posts with label ANNA UNIVERSITY REGULATION 2013 PG SYLLABUS. Show all posts

Sunday, 12 January 2014

CP7010 CONCURRENCY MODELS - ANNA UNIVERSITY 1ND SEM CSE SYLLABUS REG-2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. COMPUTER SCIENCE AND ENGINEERING
CP7010 CONCURRENCY MODELS

OBJECTIVES: 
 To model concurrency in FSP
 To specify and check safety and liveness properties
 To understand concurrency architectures and design
 To apply linear temporal logic to safety and liveness analysis
 To apply Petri nets for concurrency modeling and analysis

UNIT I FSP AND GRAPH MODELS
Concurrency and issues in concurrency – models of concurrency – graphical models – FSP &
LTSA – modeling processes with FSP – concurrency models with FSP – shared action – structure diagrams – issues with shared objects – modeling mutual exclusion – conditional synchronization – modeling semaphores – nested monitors – monitor invariants

UNIT II SAFETY AND LIVENESS PROPERTIES
Deadlocks – deadlock analysis in models – dining philosophers problem – safety properties –
single-lane bridge problem – liveness properties – liveness of the single-lane bridge – readers- writers problem – message passing – asynchronous message passing models – synchronous
message passing models – rendezvous

UNIT III CONCURRENCY ARCHITECTURES AND DESIGN
Modeling dynamic systems – modeling timed systems – concurrent architectures – Filter pipeline – Supervisor-worker model – announcer-listener model – model-based design – from requirements to models – from models to implementations – implementing concurrency in Java – program verification

UNIT IV LINEAR TEMPORAL LOGIC (LTL)
Syntax of LTL – semantics of LTL – practical LTL patterns – equivalences between LTL
statements – specification using LTL – LTL and FSP – Fluent proposition – Temporal propositions – Fluent Linear Temporal Logic (FLTL) – FLTL assertions in FSP – Database ring problem

UNIT V PETRI NETS
Introduction to Petri nets – examples – place-transition nets – graphical and linear algebraic
representations – concurrency & conflict – coverability graphs – decision procedures – liveness – colored Petri nets (CPN) – modeling & verification using CPN – non-hierarchical CPN – modeling protocols – hierarchical CPN – timed CPN – applications of Petri Nets

TOTAL : 45 PERIODS
OUTCOMES:
Upon Completion of the course, the students will be able to
 Develop concurrency models and FSP
 State safety and liveness properties in FSP
 Verify properties using LTSA tool  Explain concurrency architectures
 Design concurrent Java programs from models
 Apply Linear Temporal Logic to state safety and liveness properties
 Assert LTL properties in FSP and check using LTSA tool  Model and analyze concurrency using Petri nets

REFERENCES:
1. Jeff Magee & Jeff Kramer, “Concurrency: State Models and Java Programs”, Second Edition,John Wiley, 2006.
2. M. Huth & M. Ryan, “Logic in Computer Science – Modeling and Reasoning about Systems”,
Second Edition, Cambridge University Press, 2004.
3. B. Goetz, T. Peierls, J. Bloch, J. Bowbeer, D. Holmes, and D. Lea, “Java Concurrency in
Practice”, Addison-Wesley Professional, 2006.
4. Wolfgang Reisig, “Petri Nets: An Introduction”, Springer, 2011.
5. K. Jensen and L. M. Kristensen, “Colored Petri Nets: Modeling and Validation of Concurrent
Systems”, Springer, 2009.
6. Wolfgang Reisig, “Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case
Studies”, Springer, 2013.

Thursday, 9 January 2014

NE7001 SENSING TECHNIQUES AND SENSORS - ANNA UNIVERSITY 1ST SEM CSE SYLLABUS REG-2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. COMPUTER SCIENCE AND ENGINEERING
NE7001 SENSING TECHNIQUES AND SENSORS

OBJECTIVES: 
 To study the sensor characteristics and the fundamental principles of sensing
 To understand the sensor interface electronics
 To study selected motion-related sensors
 To study light and radiation detectors
 To study selected temperature sensors
 To study selected chemical sensors

UNIT I PRINCIPLES OF SENSING
Data Acquisition – sensor characteristics – electric charges, fields, potentials – capacitance – magnetism – inductance – resistance – piezoelectric – pyroelectric – Hall effect – hermoelectric effects – sound waves – heat transfer – light – dynamic models of sensors

UNIT II OPTICAL COMPONENTS AND INTERFACE ELECTRONICS
Radiometry – Photometry – mirrors – lenses – fibre optics – concentrators – Interface circuits –
amplifiers – light-to-voltage – excitation circuits – ADC – Digitization – Capacitance-to-voltage –bridge circuits – data transmission – noise in sensors and circuits – calibration – low power
sensors

UNIT III MOTION RELATED SENSORS
Occupancy and motion detectors: ultrasonic – microwave – capacitive detectors – triboelectric – optoelectronic motion sensors – optical presence sensor – Pressure Gradient sensorsVelocity and acceleration sensors: Accelerometer characteristics – capacitative accelerometers – piezoelectric accelerometers – piezoresistive accelerometers – thermal accelerometers – Gyroscopes – piezoelectric cables – gravitational sensors

UNIT IV LIGHT AND RADIATION DETECTORS
Light Detectors: Photo diodes – photo transistor – photo resistor – cooled detectors – CCD and CMOS image sensors – thermal detectors – optical design – gas flame detectors
Radiation Detectors: scintillating detectors – ionization detectors – cloud and bubble chambers

UNIT V TEMPERATURE AND CHEMICAL SENSORS
Temperature Sensors: coupling with objects – temperature reference points – thermo resistive
sensors – thermo electric contact sensors – semiconductor sensors – acoustic sensors –
piezoelectric sensors Chemical sensors: characteristics – classes of chemical sensors –
biochemical sensors – multi-sensor arrays – electronic noses and tongues

TOTAL: 45 PERIODS
OUTCOMES:
Upon Completion of the course,the students will be able to
 Explain sensor characteristics
 Explain the physics of sensors
 Explain optical components of sensors
 Apply sensor interface electronics
 Choose and use appropriate motion-related sensors
 Choose and use appropriate light and radiation detectors
 Choose and use appropriate temperature sensors
 Choose and use appropriate chemical sensors

REFERENCE:
1. Jacob Fraden, “Handbook of Modern Sensors: Physics, Designs, and Applications”, Fourth
Edition, Springer, 2010.

Saturday, 4 January 2014

SE7103 FORMAL MODELS OF SOFTWARE SYSTEMS - ANNA UNIVERSITY 1ST SEM CSE SYLLABUS REG-2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. COMPUTER SCIENCE AND ENGINEERING
SE7103 FORMAL MODELS OF SOFTWARE SYSTEMS
OBJECTIVES:
 To understand the basic elements of Z
 To understand relations, functions, and logical structures in Z
 To understand Z schemas and schema calculus
 To learn selected Z case studies
 To understand Z schema refinement

UNIT I FOUNDATIONS OF Z
Understanding formal methods – motivation for formal methods – informal requirements to formal specifications – validating formal specifications – Overview of Z specification – basic elements of Z – sets and types – declarations – variables – expressions – operators – predicates and equations

UNIT II STRUCTURES IN Z
Tuples and records – relations, tables, databases – pairs and binary relations – functions – sequences – propositional logic in Z – predicate logic in Z – Z and boolean types – set comprehension – lambda calculus in Z – simple formal specifications – modeling systems and change

UNIT III Z SCHEMAS AND SCHEMA CALCULUS
Z schemas – schema calculus – schema conjunction and disjunction – other schema calculus
operators – schema types and bindings – generic definitions – free types – formal reasoning –
checking specifications – precondition calculation – machine-checked proofs

UNIT IV Z CASE STUDIES
Case Study: Text processing system – Case Study: Eight Queens – Case Study: Graphical User Interface – Case Study: Safety critical protection system – Case Study: Concurrency and real time systems

UNIT V Z REFINEMENT

Refinement of Z specification – generalizing refinements – refinement strategies – program
derivation and verification – refinement calculus – data structures – state schemas – functions and relations – operation schemas – schema expressions – refinement case study

TOTAL : 45 PERIODS

OUTCOMES:

Upon Completion of the course,the students will be able to
 Apply the basic elements of Z
 Develop relational, functional, and logical Z structures
 Develop Z schema as models of software systems
 Perform verifications and conduct proofs using Z models
 Refine Z models towards implementing software systems

REFERENCES:
1. Jonathan Jacky, “The way of Z: Practical programming with formal methods”, Cambridge
University Press, 1996.
2. Antoni Diller, “Z: An introduction to formal methods”, Second Edition, Wiley, 1994.
3. Jim Woodcock and Jim Davies, “Using Z – Specification, Refinement, and Proof”, Prentice
Hall, 1996.
4. J. M. Spivey, “The Z notation: A reference manual”, Second Edition, Prentice Hall, 1992.
5. M. Ben-Ari, “Mathematical logic for computer science”, Second Edition, Springer, 2003.
6. M. Huth and M. Ryan, “Logic in Computer Science – Modeling and Reasoning about
systems”, Second Edition, Cambridge University Press, 2004.

Wednesday, 1 January 2014

CP7002 PROBABILISTIC REASONING SYSTEMS - ANNA UNIVERSITY 1ST SEM CSE SYLLABUS REG-2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. COMPUTER SCIENCE AND ENGINEERING
CP7002 PROBABILISTIC REASONING SYSTEMS

OBJECTIVES: 
 To construct and reason with Bayesian networks
 To reason with temporal models
 To make exact and approximate inferences with graphical models
 To understand learning of parameters for probabilistic graphical models
 To understand actions and decisions with probabilistic graphical models

UNIT I REPRESENTATION
Probability Theory, Graphs, Bayesian network representation: Bayes networks, Independence in graphs – Undirected graphical models: Parameterization, Markov Network independencies – Conditional Bayesian networks.

UNIT II TEMPLATE BASED REPRESENTATION
Temporal models (Dynamic Bayesian networks , Hidden Markov Models) – Directed probabilistic models for object-relational domains – Inference in temporal models: Kalman filters.

UNIT III INFERENCE
Exact inference: Variable elimination – Exact inference: Clique trees (Junction trees) – Approximate inference: Forward sampling, Importance sampling, MCMC – MAP inference:
Variable elimination for MAP, Max-product in clique trees.

UNIT IV LEARNING
Learning graphical models – Parameter estimation: maximum-likelihood estimation, MLE for
Bayesian networks, Bayesian parameter estimation – Structure learning in Bayesian networks:
Constraint based, structure scores, structure search – Partially observed data: Parameter
estimation, Learning models with hidden variables – Learning undirected models: Maximum
likelihood

UNIT V ACTIONS AND DECISIONS
Causality – Utilities and decisions – Structured decision problems

TOTAL: 45 PERIODS

OUTCOMES:
Upon Completion of the course, the students will be able to
 Construct Bayesian networks
 Reason with Bayesian networks
 Reason with Dynamic networks and Hidden Markov Models
 Conduct inferences with Bayesian networks
 Implement algorithms to learn probabilistic graphical models
 Explain actions and decisions with probabilistic graphical models

REFERENCES:
1. Daphne Koller and Nir Friedman, “Probabilistic Graphical Models: Principles and Techniques”,MIT Press, 2009.
2. David Barber, “Bayesian Reasoning and Machine Learning”, Cambridge University Press,
2012.27
3. Adnan Darwiche, “Modeling and Reasoning with Bayesian networks”, Cambridge University
Press, 2009.
4. Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012.
5. Stuart Russel and Peter Norvig, “Artificial Intelligence: A Modern Approach”, Third Edition,
Prentice Hall, 2009.

Monday, 30 December 2013

CP7003 DATA ANALYSIS AND BUSINESS INTELLIGENCE - ANNA UNIVERSITY 1ST SEM CSE SYLLABUS REG-2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. COMPUTER SCIENCE AND ENGINEERING
CP7003 DATA ANALYSIS AND BUSINESS INTELLIGENCE
OBJECTIVES: 
 To understand linear regression models
 To understand logistic regression models
 To understand generalized linear models
 To understand simulation using regression models
 To understand causal inference
 To understand multilevel regression
 To understand data collection and model understanding

UNIT I LINEAR REGRESSION
Introduction to data analysis – Statistical processes – statistical models – statistical inference –
review of random variables and probability distributions – linear regression – one predictor – multiple predictors – prediction and validation – linear transformations – centering and
standardizing – correlation – logarithmic transformations – other transformations – building
regression models – fitting a series of regressions

UNIT II LOGISTIC AND GENERALIZED LINEAR MODELS
Logistic regression – logistic regression coefficients – latent-data formulation – building a logistic regression model – logistic regression with interactions – evaluating, checking, and comparing fitted logistic regressions – identifiability and separation – Poisson regression – logistic-binomial model – Probit regression – multinomial regression – robust regression using t model – building complex generalized linear models – constructive choice models.

UNIT III SIMULATION AND CAUSAL INFERENCE
Simulation of probability models – summarizing linear regressions – simulation of non-linear
predictions – predictive simulation for generalized linear models – fake-data simulation –
simulating and comparing to actual data – predictive simulation to check the fit of a time-series
model – causal inference – randomized experiments – observational studies – causal inference using advanced models – matching – instrumental variables

UNIT IV MULTILEVEL REGRESSION
Multilevel structures – clustered data – multilevel linear models – partial pooling – group-level
predictors – model building and statistical significance – varying intercepts and slopes – scaled inverse-Wishart distribution – non-nested models – multi-level logistic regression – multi-level generalized linear models

UNIT V DATA COLLECTION AND MODEL UNDERSTANDING
Design of data collection – classical power calculations – multilevel power calculations – power
calculation using fake-data simulation – understanding and summarizing fitted models –
uncertainty and variability – variances – R2 and explained variance – multiple comparisons and
statistical significance – analysis of variance – ANOVA and multilevel linear and general linear
models – missing data imputation

TOTAL: 45 PERIODS
OUTCOMES:
Upon Completion of the course,the students will be able to
 Build and apply linear regression models
 Build and apply logistic regression models
 Build and apply generalized linear models
 Perform simulation using regression models
 Perform casual inference from data
 Build and apply multilevel regression models
 Perform data collection and variance analysis

REFERENCES:
1. Andrew Gelman and Jennifer Hill, "Data Analysis using Regression and
multilevel/Hierarchical Models", Cambridge University Press, 2006.
2. Philipp K. Janert, "Data Analysis with Open Source Tools", O'Reilley, 2010.
3. Wes McKinney, "Python for Data Analysis", O'Reilley, 2012.
4. Davinderjit Sivia and John Skilling, "Data Analysis: A Bayesian Tutorial", Second Edition,
Oxford University Press, 2006.
5. Robert Nisbelt, John Elder, and Gary Miner, "Handbook of statistical analysis and data
mining applications", Academic Press, 2009.
6. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, "Big Data, Big Analytics: Emerging
Business Intelligence and Analytic Trends for Today's Businesses", Wiley, 2013.
7. John Maindonald and W. John Braun, "Data Analysis and Graphics Using R: An Example- based Approach", Third Edition, Cambridge University Press, 2010.
8. David Ruppert, "Statistics and Data Analysis for Financial Engineering", Springer, 2011

Sunday, 29 December 2013

CP7004 IMAGE PROCESSING AND ANALYSIS - ANNA UNIV 1ST SEM REG 2013 ME CSE SYLLABUS

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. COMPUTER SCIENCE AND ENGINEERING
CP7004 IMAGE PROCESSING AND ANALYSIS
OBJECTIVES: 
 To understand the basics of digital images
 To understand noise models
 To understand spatial domain filters
 To understand frequency domain filters
 To learn basic image analysis --- segmentation, edge detection, and corner detection
 To learn morphological operations and texture analysis
 To understand processing of color images
 To understand image compression techniques

UNIT I SPATIAL DOMAIN PROCESSING
Introduction to image processing – imaging modalities – image file formats – image sensing and acquisition – image sampling and quantization – noise models – spatial filtering operations – histograms – smoothing filters – sharpening filters – fuzzy techniques for spatial filtering – spatial filters for noise removal

UNIT II FREQUENCY DOMAIN PROCESSING
Frequency domain – Review of Fourier Transform (FT), Discrete Fourier Transform (DFT), and
Fast Fourier Transform (FFT) – filtering in frequency domain – image smoothing – image
sharpening – selective filtering – frequency domain noise filters – wavelets – Haar Transform – multiresolution expansions – wavelet transforms – wavelets based image processing

UNIT III SEGMENTATION AND EDGE DETECTION
Thresholding techniques – region growing methods – region splitting and merging – adaptive
thresholding – threshold selection – global valley – histogram concavity – edge detection –
template matching – gradient operators – circular operators – differential edge operators –
hysteresis thresholding – Canny operator – Laplacian operator – active contours – object
segmentation

UNIT IV INTEREST POINTS, MORPHOLOGY, AND TEXTURE
Corner and interest point detection – template matching – second order derivatives – median filter based detection – Harris interest point operator – corner orientation – local invariant feature detectors and descriptors – morphology – dilation and erosion – morphological operators – grayscale morphology – noise and morphology – texture – texture analysis – co-occurrence matrices – Laws' texture energy approach – Ade's eigen filter approach.

UNIT V COLOR IMAGES AND IMAGE COMPRESSION
Color models – pseudo colors – full-color image processing – color transformations – smoothing
and sharpening of color images – image segmentation based on color – noise in color images.
Image Compression – redundancy in images – coding redundancy – irrelevant information in
images – image compression models – basic compression methods – digital image watermarking.

TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to
 Explain image modalities, sensing, acquisition, sampling, and quantization
 Explain image noise models
 Implement spatial filter operations
 Explain frequency domain transformations
 Implement frequency domain filters
 Apply segmentation algorithms
 Apply edge detection techniques
 Apply corner and interest point detection algorithms
 Apply morphological operations
 Perform texture analysis
 Analyze color images
 Implement image compression algorithms

REFERENCES:
1. E. R. Davies, “Computer & Machine Vision”, Fourth Edition, Academic Press, 2012.
2. W. Burger and M. Burge, “Digital Image Processing: An Algorithmic Introduction using
Java”, Springer, 2008.
3. John C. Russ, “The Image Processing Handbook”, Sixth Edition, CRC Press, 2011.
4. R. C. Gonzalez and R. E. Woods, “Digital Image Processing”, Third Edition, Pearson,
2008.
5. Mark Nixon and Alberto S. Aquado, “Feature Extraction & Image Processing for Computer
Vision”, Third Edition, Academic Press, 2012.
6. D. L. Baggio et al., “Mastering OpenCV with Practical Computer Vision Projects”, Packt
Publishing, 2012.
7. Jan Erik Solem, “Programming Computer Vision with Python: Tools and algorithms for
analyzing images”, O'Reilly Media, 2012.

CP7001 PERFORMANCE EVALUATION OF COMPUTER SYSTEMS - ANNA UNIV 1ST SEM REG 2013 ME CSE SYLLABUS

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. COMPUTER SCIENCE AND ENGINEERING
CP7001 PERFORMANCE EVALUATION OF COMPUTER SYSTEMS

OBJECTIVES: 
 To understand the mathematical foundations needed for performance evaluation of computer
systems
 To understand the metrics used for performance evaluation
 To understand the analytical modeling of computer systems
 To enable the students to develop new queueing analysis for both simple and complex systems
 To appreciate the use of smart scheduling and introduce the students to analytical techniques for evaluating scheduling policies

UNIT I OVERVIEW OF PERFORMANCE EVALUATION
Need for Performance Evaluation in Computer Systems – Overview of Performance Evaluation
Methods – Introduction to Queueing – Probability Review – Generating Random Variables for
Simulation – Sample Paths, Convergence and Averages – Little’s Law and other Operational Laws – Modification for Closed Systems.

UNIT II MARKOV CHAINS AND SIMPLE QUEUES
Discrete-Time Markov Chains – Ergodicity Theory – Real World Examples – Google, Aloha – Transition to Continuous-Time Markov Chain – M/M/1 and PASTA.

UNIT III MULTI-SERVER AND MULTI-QUEUE SYSTEMS
Server Farms: M/M/k and M/M/k/k – Capacity Provisioning for Server Farms – Time Reversibility and Burke’s Theorem – Networks of Queues and Jackson Product Form – Classed and Closed Networks of Queues.

UNIT IV REAL-WORLD WORKLOADS
Case Study of Real-world Workloads – Phase-Type Distributions and Matrix-Alalytic Methods – Networks with Time-Sharing Servers – M/G/1 Queue and the Inspection Paradox – Task
Assignment Policies for Server Farms.

UNIT V SMART SCHEDULING IN THE M/G/1
Performance Metrics – Scheduling Non-Preemptive and Preemptive Non-Size-Based Policies - . Scheduling Non-Preemptive and Preemptive Size-Based Policies – Scheduling - SRPT and
Fairness.

TOTAL: 45 PERIODS

OUTCOMES:
Upon completion of the course, 
the students will be able to
 Identify the need for performance evaluation and the metrics used for it  Discuss open and closed queueing networks
 Define Little’e law and other operational laws
 Apply the operational laws to open and closed systems
 Use discrete-time and continuous-time Markov chains to model real world systems
 Develop analytical techniques for evaluating scheduling policies

REFERENCES:
1. Mor Harchol - Balter, “Performance Modeling and Design of Computer Systems – Queueing
Theory in Action”, Cambridge University Press, 2013.
2. Raj Jain, “The Art of Computer Systems Performance Analysis: Techniques for Experimental
Design, Measurement, Simulation and Modeling”, Wiley-Interscience, 1991.
3. Lieven Eeckhout, “Computer Architecture Performance Evaluation Methods”, Morgan and
Claypool Publishers, 2010.
4. Paul J. Fortier and Howard E. Michel, “Computer Systems Performance Evaluation and
Prediction”, Elsevier, 2003.26
5. David J. Lilja, “Measuring Computer Performance: A Practitioner’s Guide”, Cambridge
University Press, 2000.
6. Krishna Kant, “Introduction to Computer System Performance Evaluation”, McGraw-Hill, 1992.
7. K. S. Trivedi, “Probability and Statistics with Reliability, Queueing and Computer Science
Applications”, John Wiley and Sons, 2001.

Wednesday, 18 December 2013

VL7202 LOW POWER VLSI DESIGN - ANNA UNIV PG 2ND SEM SYLLABUS REG 2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. APPLIED ELECTRONICS - SYLLABUS
VL7202 LOW POWER VLSI DESIGN

OBJECTIVES: 
 To know the sources of power consumption in cmos circuits
 To understand the various power reduction techniques and the power estimation methods. 
 To study the design concepts of low power circuits.

UNIT I POWER DISSIPATION
Hierarchy of limits of power – Sources of power consumption – Physics of power dissipation in CMOS FET devices – Basic principle of low power design.

UNIT II POWER OPTIMIZATION
Logic level power optimization – Circuit level low power design – circuit techniques for reducing power consumption in adders and multipliers

UNIT III DESIGN OF LOW POWER CIRCUITS
Computer arithmetic techniques for low power system – reducing power consumption in memories –low power clock, Inter connect and layout design – Advanced techniques –Special techniques.

UNIT IV POWER ESTIMATION
Power Estimation technique – logic power estimation – Simulation power analysis –Probabilistic power analysis.

UNIT V SYNTHESIS AND SOFTWARE DESIGN
Synthesis for low power – Behavioral level transform – software design for low power.

TOTAL: 45 PERIODS

REFERENCES:
1. Kaushik Roy and S.C.Prasad, “Low power CMOS VLSI circuit design”, Wiley, 2000.
2. Dimitrios Soudris, Christians Pignet, Costas Goutis, “Designing CMOS Circuits for
Low Power”, Kluwer, 2002.
3. J.B.Kulo and J.H Lou, “Low voltage CMOS VLSI Circuits”, Wiley 1999.
4. A.P.Chandrasekaran and R.W.Broadersen, “Low power digital CMOS design”,
Kluwer,1995.
5. Gary Yeap, “Practical low power digital VLSI design”, Kluwer, 1998.
6. Abdelatif Belaouar, Mohamed.I.Elmasry, “Low power digital VLSI design”, Kluwer, 1995.
7. James B.Kulo, Shih-Chia Lin, “Low voltage SOI CMOS VLSI devices and Circuits”,
John Wiley and sons, inc. 2001.
8. Steven M.Rubin, “Computer Aids for VLSI Design”, Addison Wesley Publishing

Sunday, 15 December 2013

VL7102 VLSI DESIGN TECHNIQUES - ANNA UNIV PG 2ND SEM SYLLABUS REG 2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. APPLIED ELECTRONICS - SYLLABUS
VL7102 VLSI DESIGN TECHNIQUES 
OBJECTIVES: 
 To understand the concepts of MOS transistors operations and their AC , DC characteristics. 
 To know the fabrication process of cmos technology and its layout design rules
 To understand the latch up problem in cmos circuits. 
 To study the concepts of cmos invertors and their sizing methods
 To know the concepts of power estimation and delay calculations in cmos circuits.

UNIT I MOS TRANSISTOR THEORY
NMOS and PMOS transistors, CMOS logic, MOS transistor theory – Introduction, Enhancement mode transistor action, Ideal I-V characteristics, DC transfer characteristics, Threshold voltage- Body effect- Design equations- Second order effects. MOS models and small signal AC characteristics, Simple MOS capacitance Models, Detailed MOS gate capacitance model, Detailed MOS Diffusion capacitance model

UNIT II CMOS TECHNOLOGY AND DESIGN RULE
CMOS fabrication and Layout, CMOS technologies, P -Well process, N -Well process, twin -tub process, MOS layers stick diagrams and Layout diagram, Layout design rules, Latch up in CMOS circuits, CMOS process enhancements, Technology – related CAD issues, Fabrication and packaging.

UNIT III INVERTERS AND LOGIC GATES
NMOS and CMOS Inverters, Inverter ratio, DC and transient characteristics , switching times, Super buffers, Driving large capacitance loads, CMOS logic structures , Transmission gates, Static CMOS design, dynamic CMOS design.

UNIT IV CIRCUIT CHARACTERISATION AND PERFORMANCE ESTIMATION
Resistance estimation, Capacitance estimation, Inductance, switching characteristics, transistor sizing, power dissipation and design margining. Charge sharing .Scaling.

UNIT V VLSI SYSTEM COMPONENTS CIRCUITS AND SYSTEM LEVEL PHYSICAL DESIGN
Multiplexers, Decoders, comparators, priority encoders, Shift registers. Arithmetic circuits – Ripple carry adders, Carry look ahead adders, High-speed adders, Multipliers. Physical design – Delay modelling ,cross talk, floor planning, power distribution. Clock distribution. Basics of CMOS testing.

TOTAL: 45 PERIODS

REFERENCES:
1. Neil H.E. Weste and Kamran Eshraghian, Principles of CMOS VLSI Design,
Pearson Education ASIA, 2nd edition, 2000.
2. John P.Uyemura “Introduction to VLSI Circuits and Systems”, John Wiley & Sons, Inc.,
2002.
3. Eugene D.Fabricius, Introduction to VLSI Design McGraw Hill International Editions, 1990.
4. Pucknell, “Basic VLSI Design”, Prentice Hall of India Publication, 1995.
5. Wayne Wolf “Modern VLSI Design System on chip. Pearson Education.2002.

Saturday, 14 December 2013

CP7103 MULTI CORE ARCHITECTURES - ANNA UNIV PG 2ND SEM SYLLABUS REG 2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. APPLIED ELECTRONICS - SYLLABUS
CP7103 MULTI CORE ARCHITECTURES

COURSE OBJECTIVES:
 To understand the recent trends in the field of Computer Architecture and identify performance related parameters
 To appreciate the need for parallel processing
 To expose the students to the problems related to multiprocessing
 To understand the different types of multicore architectures
 To expose the students to warehouse-scale and embedded architectures

UNIT I FUNDAMENTALS OF QUANTITATIVE DESIGN AND ANALYSIS
Classes of Computers – Trends in Technology, Power, Energy and Cost – Dependability – Measuring, Reporting and Summarizing Performance – Quantitative Principles of Computer Design – Classes of Parallelism - ILP, DLP, TLP and RLP - Multithreading - SMT and CMP Architectures –Limitations of Single Core Processors - The Multicore era – Case Studies of Multicore Architectures.

UNIT II DLP IN VECTOR, SIMD AND GPU ARCHITECTURES
Vector Architecture - SIMD Instruction Set Extensions for Multimedia – Graphics Processing Units - Detecting and Enhancing Loop Level Parallelism - Case Studies.

UNIT III TLP AND MULTIPROCESSORS
Symmetric and Distributed Shared Memory Architectures – Cache Coherence Issues - Performance Issues – Synchronization Issues – Models of Memory Consistency - Interconnection Networks – Buses, Crossbar and Multi-stage Interconnection Networks.

UNIT IV RLP AND DLP IN WA REHOUSE-SCALE ARCHITECTURES
Programming Models and Workloads for Warehouse-Scale Computers – Architectures for
Warehouse-Scale Computing – Physical Infrastructure and Costs – Cloud Computing – Case Studies.

UNIT V ARCHITECTURES FOR EMBEDDED SYSTEMS
Features and Requirements of Embedded Systems – Signal Processing and Embedded Applications – The Digital Signal Processor – Embedded Multiprocessors - Case Studies.

TOTAL:45 PERIODS

OUTCOMES:
Upon completion of the course, the students will be able to
 Identify the limitations of ILP and the need for multicore architectures
 Discuss the issues related to multiprocessing and suggest solutions
 Point out the salient features of different multicore architectures and how they exploit  parallelism
 Critically analyze the different types of inter connection networks
 Discuss the architecture of GPUs, warehouse-scale computers and embedded processors

REFERENCES:
1. John L. Hennessey and David A. Patterson, “ Computer Architecture – A Quantitative Approach”,Morgan Kaufmann / Elsevier, 5th edition, 2012.
2. Kai Hwang, “Advanced Computer Architecture”, Tata McGraw-Hill Education, 2003
3. Richard Y. Kain, “Advanced Computer Architecture a Systems Design Approach”, Prentice Hall,2011.
4. David E. Culler, Jaswinder Pal Singh, “Parallel Computing Architecture : A Hardware/ Software Approach” , Morgan Kaufmann / Elsevier, 1997.

Thursday, 12 December 2013

AP7203 EMBEDDED SYSTEMS - ANNA UNIV PG 2ND SEM SYLLABUS REG 2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. APPLIED ELECTRONICS - SYLLABUS
AP7203 EMBEDDED SYSTEMS

OBJECTIVES: 
  • To afford awareness about Hardware and software design architecture for embedded processors with real time examples.
  • To learn various techniques of system design. 
UNIT I INTRODUCTION
Embedded Computers, Characteristics of Embedded Computing Applications, Challenges in
Embedded Computing system design, Embedded system design process- Requirements,
Specification, Architectural Design, Designing Hardware and Software Components, System
Integration, Formalism for System Design- Structural Description, Behavioural Description, Design Example: Model Train Controller, ARM processor- processor and memory organization.

UNIT II EMBEDDED PROCESSORS
Data operations, Flow of Control, SHARC processor- Memory organization, Data operations, Flow of Control, parallelism with instructions, CPU Bus configuration, ARM Bus, SHARC Bus, Memory devices, Input/output devices, Component interfacing, designing with microprocessor development and debugging, Design Example : Alarm Clock. Hybrid Architecture

UNIT III DISTRIBUTED EMBEDDED ARCHITECTURE
Hardware and Software Architectures, Networks for embedded systems- I2C, CAN Bus, SHARC link supports, Ethernet, Myrinet, Internet, Network-Based design- Communication Analysis, system performance Analysis, Hardware platform design, Allocation and scheduling, Design Example: Elevator Controller.

UNIT IV REAL-TIME CHARACTERISTICS
Clock driven Approach, weighted round robin Approach, Priority driven Approach, Dynamic Versus Static systems, effective release times and deadlines, Optimality of the Earliest deadline first (EDF) algorithm, challenges in validating timing constraints in priority driven systems, Off-line Versus On-line scheduling.

UNIT V SYSTEM DESIGN TECHNIQUES
Design Methodologies, Requirement Analysis, Specification, System Analysis and Architecture Design, Quality Assurance, Design Example: Telephone PBX- System Architecture, Ink jet printer- Hardware Design and Software Design, Personal Digital Assistants, Set-top Boxes.

TOTAL: 45 PERIODS
REFERENCES:
1. Wayne Wolf, “Computers as Components: Principles of Embedded Computing System
Design”, Morgan Kaufman Publishers, 2008.
2. Jane.W.S. Liu, “Real-Time systems”, Pearson Education Asia, 2000.
3. C. M. Krishna and K. G. Shin, “Real-Time Systems” , McGraw-Hill, 1997
4. Frank Vahid and Tony Givargis, “Embedded System Design: A Unified
Hardware/Software Introduction” , John Wiley & Sons, 2006.

Sunday, 1 December 2013

AP7202 ASIC AND FPGA DESIGN - ANNA UNIV PG 2ND SEM SYLLABUS REG 2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. APPLIED ELECTRONICS - SYLLABUS
AP7202 ASIC AND FPGA DESIGN

OBJECTIVES: 
 To study the design flow of different types of ASIC. 
 To familiarize the different types of programming technologies and logic devices. 
 To learn the architecture of different types of FPGA. 
 To gain knowledge about partitioning, floor planning, placement and routing including circuit
extraction of ASIC
 To analyse the synthesis, Simulation and testing of systems.  To understand the design issues of SOC. 
 To know about different high performance algorithms and its applications in ASICs.

UNIT I OVERVIEW OF ASIC AND PLD 9
Types of ASICs - Design flow – CAD tools used in ASIC Design – Programming Technologies:
Antifuse – static RAM – EPROM and EEPROM technology, Programmable Logic Devices : ROMs and EPROMs – PLA –PAL. Gate Arrays – CPLDs and FPGAs

UNIT II ASIC PHYSICAL DESIGN 9
System partition -partitioning - partitioning methods – interconnect delay models and measurement of delay - floor planning - placement – Routing : global routing - detailed routing - special routing - circuit extraction - DRC

UNIT III LOGIC SYNTHESIS, SIMULATION AND TESTING 9
Design systems - Logic Synthesis - Half gate ASIC -Schematic entry - Low level design language - PLA tools -EDIF- CFI design representation. Verilog and logic synthesis -VHDL and logic synthesis - types of simulation -boundary scan test - fault simulation - automatic test pattern generation.

UNIT IV FPGA
Field Programmable gate arrays- Logic blocks, routing architecture, Design flow technology - mapping for FPGAs, Xilinx XC4000 - ALTERA’s FLEX 8000/10000, ACTEL’s ACT-1,2,3 and their speed performance Case studies: Altera MAX 5000 and 7000 - Altera MAX 9000 – Spartan II and Virtex II FPGAs - Apex and Cyclone FPGAs

UNIT V SOC DESIGN
Design Methodologies – Processes and Flows - Embedded software development for SOC – Techniques for SOC Testing – Configurable SOC – Hardware / Software codesign Case studies: Digital camera, Bluetooth radio / modem, SDRAM and USB.

TOTAL: 45 PERIODS

REFERENCES:
1. M.J.S .Smith, "Application Specific Integrated Circuits, Addison -Wesley Longman Inc.,1997
2. S. Trimberger, Field Programmable Gate Array Technology, Edr, Kluwer Academic
Publications, 1994.
3. John V.Oldfield, Richard C Dore, Field Programmable Gate Arrays, Wiley Publications1995.
4. P.K.Chan & S. Mourad, Digital Design Using Field Programmable Gate Array, Prentice
Hall, 1994.
5. Parag.K.Lala, Digital System Design using Programmable Logic Devices , BSP, 2003.
6. S. Brown, R. Francis, J. Rose, Z. Vransic, Field Programmable Gate Array, Kluwer Pubin,
1992.
7. J. Old Field, R.Dorf, Field Programmable Gate Arrays, John Wiley & Sons, Newyork,1995.
8. Farzad Nekoogar and Faranak Nekoogar, From ASICs to SOCs: A Practical Approach,
Prentice Hall PTR, 2003.
9. Wayne Wolf, FPGA-Based System Design, Prentice Hall PTR, 2004.
10. R. Rajsuman, System-on-a-Chip Design and Test. Santa Clara, CA: Artech House Publishers, 2000.
11. F. Nekoogar. Timing Verification of Application-Specific Integrated Circuits (ASICs). Prentice Hall PTR, 1999.

Saturday, 30 November 2013

AP7201 ANALYSIS AND DESIGN OF ANALOG INTEGRATED CIRCUITS - ANNA UNIV PG 2ND SEM SYLLABUS REG 2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. APPLIED ELECTRONICS - SYLLABUS
AP7201 ANALYSIS AND DESIGN OF ANALOG INTEGRATED CIRCUITS
OBJECTIVES: 
 To design the single stage amplifiers using pmos and nmos driver circuits with different loads. 
 To analyze high frequency concepts of single stage amplifiers and noise characteristics
associated with differential amplifiers. 
 To study the different types of current mirrors and to know the concepts of voltage and current
reference circuits.

UNIT I SINGLE STAGE AMPLIFIERS 9
Common source stage, Source follower, Common gate stage, Cascode stage, Single ended and differential operation, Basic differential pair, Differential pair with MOS loads

UNIT II FREQUENCY RESPONSE AND NOISE ANALYSIS 9
Miller effect ,Association of poles with nodes, frequency response of common source stage, Sourcefollowers, Common gate stage, Cascode stage, Differential pair, Statistical characteristics of noise,noise in single stage amplifiers, noise in differential amplifiers.

UNIT III OPERATIONAL AMPLIFIERS 9
Concept of negative feedback, Effect of loading in feedback networks, operational amplifier
performance parameters, One-stage Op Amps, Two-stage Op Amps, Input range limitations, Gain boosting, slew rate, power supply rejection, noise in Op Amps.

UNIT IV STABILITY AND FREQUENCY COMPENSATION 9
General considerations, Multipole systems, Phase Margin, Frequency Compensation, and
Compensation of two stage Op Amps, Slewing in two stage Op Amps, and Other compensation techniques.

UNIT V BIASING CIRCUITS 9
Basic current mirrors, cascode current mirrors, active current mirrors, voltage references, supply independent biasing, temperature independent references, PTAT current generation, Constant-Gm Biasing.

TOTAL:45 PERIODS

REFERENCES:
1. Paul R. Gray, Paul J. Hurst, Stephen H. Lewis, Robert G. Meyer, Analysis and Design of Analog Integrated Circuits, 5th Edition, Wiley, 2009.
2. Behzad Razavi, “Design of Analog CMOS Integrated Circuits”, Tata McGraw Hill, 2001
3. Willey M.C. Sansen, “Analog design essentials”, Springer, 2006.
4. Grebene, “Bipolar and MOS Analog Integrated circuit design”, John Wiley & sons,Inc., 2003.
5. Phillip E.Allen, Douglas R.Holberg, “CMOS Analog Circuit Design”, Second edition, Oxford
University Press, 2002

AP7006 SENSORS AND SIGNAL CONDITIONING - ANNA UNIV PG 1ST SEM SYLLABUS REG 2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. APPLIED ELECTRONICS
AP7006 SENSORS AND SIGNAL CONDITIONING

OBJECTIVES:
 To know the static and dynamic characteristics of measurement systems.  To study about the various types of sensors viz. Resistive, Reactive, Self- generating.  To know the different types digital and semiconductor sensors.

UNIT I INTRODUCTION TO MEASUREMENT SYSTEMS 9
Introduction to measurement systems: general concepts and terminology, measurement systems, sensor classification, general input-output configuration, methods of correction
performance characteristics: static characteristics of measurement systems, accuracy, precision, sensitivity, other characteristics: linearity, resolution, systematic errors , random errors, dynamic characteristics of measurement systems: zero-order, first-order, and second-order measurement systems and response
UNIT II RESISTIVE SENSORS 9
Resistive sensors: potentiometers , strain gages and types, resistive temperature detectors (rtds) ,thermistors , magneto resistors, light-dependent resistors (ldrs); Signal conditioning for resistive sensors:measurement of resistance , voltage dividers , Wheatstone bridge. Balance and deflection measurements , sensor bridge calibration and compensation instrumentation amplifiers , interference types and reduction

UNIT III REACTIVE SENSORS 9
Reactance variation and electromagnetic sensors : capacitive sensors – variable & differential, inductive sensors – reluctance variation, eddy current, linear variable differential transformers (lvdts) , variable transformers: synchros, resolvers, inductosyn , magneto elastic sensors, electromagnetic sensors – sensors based on faraday’s law, hall effect sensors, Signal conditioning for reactance variation sensors : problems and alternatives, ac bridges, carrier amplifiers – application to the lvdt, variable oscillators, resolver-to-digital and digital-to-resolver converters
UNIT IV SELF-GENERATING SENSORS 9
Self-generating sensors: thermoelectric sensors, piezoelectric sensors, pyroelectric sensors, photovoltaic sensors , electrochemical sensors, Signal conditioning for self-generating sensors: chopper and low-drift amplifiers, offset and drifts amplifiers , electrometer amplifiers, charge amplifiers, noise in amplifiers

UNIT V DIGITAL SENSORS AND SEMICONDUCTOR DEVICE SENSORS 9
Digital sensors: position encoders, variable frequency sensors – quartz digital thermometer, vibrating wire strain gages , vibrating cylinder sensors, saw sensors, digital flow meters, Sensors based on semiconductor junctions : thermometers based on semiconductor junctions, magneto diodes and magneto transistors, photodiodes and phototransistors, sensors based on mosfet transistors, charge- coupled sensors – types of CCD imaging sensors , ultrasonic-based sensors , fiber-optic sensors

TOTAL: 45 PERIODS

REFERENCES:
1. Ramon Pallás Areny, John G. Webster, “Sensors and Signal Conditioning”, 2nd edition, John Wiley and Sons, 2000
2. D.Patranabis, “Sensors and Transducers”, TMH 2003
3. Jon Wilson , “Sensor Technology Handbook”, Newne 2004.
4. Herman K.P. Neubrat, “Instrument Transducers – An Introduction to Their Performance and
Design”, Oxford University Press.
5. E.O. Doeblin, “Measurement System : Applications and Design”, McGraw Hill Publications
6. D. Johnson, “Process Control Instrumentation Technology”, John Wiley and Sons
7. Kevin James, PC Interfacing and Data acquisition, Elsevier, 2011
8. Graham Brooker, Introduction to Sensors for ranging and imaging, Yesdee, 2009
9. Ian Sinclair, Sensors and Transducers, Elsevier, 3rd Edition, 2011

Sunday, 17 November 2013

AP7005 QUANTUM ELECTRONICS - ANNA UNIV PG 1ST SEM SYLLABUS REG 2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. APPLIED ELECTRONICS
AP7005 QUANTUM ELECTRONICS
COURSE OBJECTIVES:
1. To know the concepts of EM fields and wave equations.
2. To study the types of lasers and its characteristics.
3. To know the various methos of scattering.
4. To learn the concept of Non-linear optics.

UNIT I BASIC THEOREMS AND POSTULATES OF QUANTUM MECHANICS
Introduction to Quantum Electronics- Résumé of electromagnetic theory-Waveguides-Planarmirror waveguides-Modes in dielectric slab waveguides-Effective Index Method-Guided wave coupling and interference-Coupled Mode Theory-Directional coupler-Mode coupling in periodic waveguides-Mode interference-The Schrodinger wave equation, some solutions of time independent Schrodinger equation, Matrix formulation of quantum mechanics, Lattice vibration and their quantization, Electromagnetic fields and their quantization.

UNIT II LASER
Gaussian beam in a homogenous medium, Gaussian beam in a lens waveguide, Elliptic
Gaussian beams, Optical resonators, Spontaneous and induced transitions, gain coefficient,
homogenous and inhomogeneous broadening, Laser oscillations, Semiconductor laser,
quantum well laser, modulation of optical radiation, Q switching and Mode locking of laser,
Quantum wires and dots, Laser arrays, Concept of super modes, Phase amplitude in laser, Free electron lasers.

UNIT III NONLINEAR OPTICS
Introduction to nonlinear (NL) optics, 2nd order NL effects-The nonlinear optical susceptibility
tensor, Second harmonic generation, parametric oscillations, parametric amplifiers,
Applications–Nonlinear polarization –physical origin-Complex notation, conservation laws-
Second Harmonic Generation, Birefringence and Quasi- Phase Matching-3rd order NL effects-
Self-Phase Modulation, Optical soliton-Stimulated Raman Scattering-Electro-optic (EO)
modulation of light-Linear EO effect, Phase retardation-Amplitude, and Phase modulation-
Traveling wave modulator

UNIT IV STIMULATED RAMAN AND BRILLOUIN SCATTERING
Stimulated Raman scattering, Antisokes scattering, stimulated Brillouin scattering, self focusing
of optical beams.

UNIT V NOISE
Noise in laser amplifier and oscillator, Laser spectra, Measurements

TOTAL:45 PERIODS

REFERENCES: 
1. Amnon Yariv, “Quantum Electronics”, John Wiley 1989
2. Max Schubert, Bernd Wilhelmi, “Nonlinear optics and quantum electronics”, Wiley-
Interscience 1986
3. D.Marcuse, “Principle of Quantum Electronics”, Cambridge 1980
4. David Klyshko, “Physical Foundations of Quantum Electronics” , World Scientific 2011
5. J.T. Verdeyen, “Laser Electronics”, Prentice-Hall 1995
6. Harisson Paul, “Quantum Wells, Wires and Dots”, Wiley 2011
7. G.P.Agarwal and N.K.Dutta, “Long Wavelength Semiconductor lasers”, Van Nostrand
Reinhold 1986
8. A.Yariv, “Optical Electronics”, CBS College Publishing 1984