当前位置：文档库 › MODULE I Fourier series and Fourier intergrals Periodic functions, Euler formulae for Fouri

MODULE I Fourier series and Fourier intergrals Periodic functions, Euler formulae for Fouri

The estimation of variances : Hypotheses concerning one variance – Hypotheses concerning two variances.

Note: Treatment of the topics under Modules IV , V should be oriented towards application of statistical techniques to problems in real life.Books for references:

1. Ervin Kreyszig : Advanced Engineering Mathematics, Wiley Eastern

2. Potter, Goldberg : Mathematical Methods, Prentice – Hall.

3. Churchill R.V : Fourier series and Boundary value problems – Mc Graw Hill.

4. Irvin Miller & Frieund : Probability and Statistics for Engineers , Prentice Hall of India.

5. Bowker and Lieberman : Engineering Statistics, Prentice – Hall.

6. Kirk – Patrick: Introductory Statistics and probability for engineering science and technology, Prentice Hall.

7. Parzen E : Modern Probability theory and its Applications, Wiley Eastern.

MODULE I

Transformers : working principles and elementary theory of an ideal transformer,Constructional features of single phase transformer, emf equation, turns ratio, vector diagram, equivalent circuit, impedence transformation, transformer losses, flux leakage,efficiency, open circuit and short circuit test, load test. Auto transformer – working principle and saving copper, basic idea of current transformer and potential transformer,distribution and power transformer, applications, standard rating, IS specifications.MODULE II

Basic principles of electrical machines : Concepts of motoring and generating action,DC machines – Main constructional features, principles of operation, types of generators,emf equation, characteristics, application, armature reaction and commutation, types of motors, torque, speed, and power, characteristics, applications, starting losses, and efficiency, speed control, testing load test of dc machines.MODULE III

AC machines : Alternator – rotating field, speed and frequency, effect of distribution of winding, coil span , characteristics, emf equation, losses and efficiency, regulation (emf

4150100150

CS/EC 302

Electrical Technology

L T/D/P EM IM TM

COMPUTER SCIENCE & ENGINEERING

SEMESTER - III

MODULE I

Fourier series and Fourier intergrals: Periodic functions, Euler formulae for Fourier coefficients, functions having arbitrary period, even and odd functions, half range expansions, Fourier integral, Fourier cosine and sine transformations, linearity property,transform of derivatives, convolution theorem (no proof)

Gamma and Beta functions, error functions- definitions and simple properties.MODULE II

Special functions: Legendre Polynomial, Rodrigue’s formula – generating function,recurrence formula for Pn (x), orthogonality. Bessel function, Jn(x) – recurrence formula,general function, orthogonality.MODULE III

Partial differential equations: Solutions of equations of the form F(p,q) = 0, F(x,p,q)= 0, F(y,p,q) = 0, F(z,p,q) = 0, F 1 (x,p)=F 2 (y,q), Lagrange’s form Pp+ Qq = R.Vibrating string: one dimentional wave equation, D’Alembert’s solution, solution by the method of seperation of variables. One dimensional heat equation, solution of the equation by the seperation of variables, solution of Laplace’s equation over a rectangular region and a circular region by the method of seperation of variables.MODULE IV

Probability and Statistics: Probability distributions: random variables (discrete and continuous), probability density, mathematical expectation, mean and variance of a probability distribution, binomial distribution, uniform distribution, normal distribution,Poisson approximation to Binomial Distribution.

Curve fitting: method of least squares, correlation and regression,lines of regression.MODULE V

Sampling distributions : population and samples, the sampling distribution of the mean ( known), the sampling distribution of the mean ( unknown), the sampling distribution of the variance, point estimation ,interval estimation, tests of hypotheses, null hypotheses and significance test, hypothesis concerning one mean, typeI and type II errors, hypotheses concerning two means.

100

150

L T/D/P IM EM TM Engineering Mathematics -III

CS/EC/IT 301

method only), applications, synchronous motor – principle of operation, over excited and under excited, starting, applications, synchronous capacitor.MODULE IV

Induction Motor : Three phase induction motor, principles of operation, constructional features of squirrel cage and slip ring motors, torque – slip characteristics, starting,speed control, losses and efficiency.

Single phase induction motor : Principle of operation, types of single phase induction motors.MODULE V

Generation, Transmission and distribution of electrical energy:

Different methods of power generation-thermal, hydro-electric, nuclear, diesel, gas turbine stations(general idea only), electrical equipments in power stations, concept of bus bar,load dispatching, methods of transmission, overhead lines and insulators, corona skin effect of DC & AC distribution, substation (elementary idea only).References:

1. Electrical Machines

: By F .S. Bimbra, Khanna publications.

2. Advanced Electrical Technology : By H . Cotton, Wheeler publications.

3. Electrical Machines : Nagarath & Kothari, (TMH)

MODULE I

Introduction to set theory- sets and subsets-operation on sets-sequences-characteristic functions-introduction to logic propositions and logic operations – methods of proof-mathematical induction. Counting – permutations and combinations-elements of probability.MODULE II

Relations and digraphs –properties of relations –paths in relation and digraphs –Equivalence relations and partitions –operations on relations. Functions-composition of function- functions for computer Science.MODULE III

Introduction to graph theory –graphs –Eulerian paths and circuits – Hamiltonian Path and circuits –coloring of graphs – trees –minimal spanning trees.

MODULE IV

Algebraic Systems – Semi groups and monoids.Groups –subgroups and homomorphism – group codes – error correcting codes.MODULE V

Partially ordered sets –Hasse diagram-isomorphism-extremal elements – lattice –properties of lattices.References:

1. J.P Tremblay, R. Manohar, “ Discrete mathematical structures with Applications to Computer Science”, Mc Graw Hill.

2. Bernard Kolman, et. al, “ Discrete Mathematical Structures”, 3rd ed., Prentice Hall India ,New Delhi,1999.

3. John Truss, “ Discrete Mathematical Structures for Computer Science” Addision Wesely.

4. Seymour Lipchutz, Marc Lipson , “ Discrete mathematics” Tata Mc Graw –Hill.

MODULE I

Number system and codes: Binary, Octal and Hexa-decimal number systems- Binary

arithmetic, Binary coded decimal, Excess –3 code Gray code error detection and correction – Boolean Algebra- Minimisation of Boolean function using Karnaugh Map and Quine – Mclusky methods – Formation of switching functions from word statements, realization using NAND, NOR & X-OR Gates. Combinational circuits –multiplexer demultiplexer decoder encoder MODULE II

Sequential circuits: Flip-flops, RS, JK & T& D flip-flops, shift registers-counters-Asynchronous and synchronous counters, Up –Down counter, Modulo counter, Ring counter, Johnson counter –sequence generators-Analysis of sequential circuits- state table and diagrams.MODULE III

Arithmetic circuits :Half Adder, Full Adder, Subtractor, serial and parallel addition –Carry look ahead adder-Binary multiplication and division – Multivibrators-monostable and astable multivibrators using discrete gates.MODULE IV

Memories -ROM, RAM , EPROM, Programmable logic array, devices-basic ideas- PLD

5050100150

CS/EC 304

Digital Electronics

L T/D/P IM EM 5

100

150

L T/D/P IM EM TM Discrete Math-ematical Structures

CS/IT 303

Architecture –PAL and PLA –Programming examples with software tools – Study of PAL 22v10MODULE V

Logic families : DCTL, RTL, DTL, TTL, ECL, C MOS –Tristate logic –specification and transfer characteristics of basic TTL interfaces, standard logic levels –current and voltage parameters-Fan in and Fan out –Propogation delay, Intergrated circuit modules,noise consideration –interfacing of CMOS to TTL and interfacing of TTL to CMOS References:

1. Taub & Schilling, “ Digital Integrated Electronics”, Mc Graw Hill

2. Samuel C Lee, “Digital Circuits and Logic Design”, Prentice Hall

3. A P Malvino, “Digital Computer Electronics” Tata Mc Graw Hill

4. Morris & Miller, “Design with TTL Intergrated Circuits”, Mc Graw Hill

5. Peatman, “ Digital Hardware Design”, Mc Graw Hill

6. Ronald J Tocci, “ Digital Systems, Principles and Applications” Prentice Hall.

7. Lloyd TL, “Digital Fundamentals”, Universal, N.Delhi

8. Mereins, “Switching Circuits” Prentice Hall

9. MOS-LSI Circuits, Publication of Texas Instruments

10. Douglas V Hall, “Digital Circuits and Systems”, Mc Graw Hill 11. R P Jain, Principles of Digital Electronics.

MODULE I

Semiconductor Devices P N Junction-Barrier Potential , biasing PN Junction – Principles of zener and avalanche diodes – photo diodes - LDR –Tunnel diode – PIN diode-varactor diode . Bipolar junction transistors – NPN ,PNP types , current components in transistors Transistor configurations –characteristics –Current amplification factors –Relations between alpha and beta-comparison – field effect transistors:JFET- Basic structures- principle of operation-Basic principles and characteristics of photo transistors-UJTand MOSFET MODULE II

Small signal amplifiers-biasing techniques – stabilization of operating point-h- parameter CERC coupled amplifier- concept of load lines – frequency response of RC coupled amplifier- frequency analysis of RC coupled amplifier- lower cut off frequency- upper cut off frequency-3db band width.

MODULE III

Multistage amplifiers and feedback amplifiers :negative and positive feedback-different types of Pulse circuits – pulse characteristics-pulse shaping using RC circuits-differentiating and integrating circuits-clipping and clamping circuits – transistor as a switch –multivibrators.MODULE IV

Power amplifier- Classification – Class A , Class B ,Class AB and Class C – Transformer coupled and transformerless Class AB push – pull Power amplifier-Complementary symmetry power amplifier - Harmonic Distortion- Heat Sinks –Principle of sinusoidal oscillators –Bark Hausen Criteria- RC-LC, Crystal oscillators. MODULE V

Difference amplifier. Common mode and difference mode operation – CMRR- Merits and demerits – use of constant current source, drift and Offset problems – Operational amplifier block diagram- Characteristics of ideal op-amps- linear circuits using op-amps – Inverting amplifier, Non Inverting amplifier, Instrumentation amplifier, adder,substractor, log and antilog amplifier, integrator and differentiator, peak detector ,Precision rectifier. Nonlinear circuits using op-amps- comparators, multivibrators, Function generators – Active filters.

References:

1. Millman and Halkias, “Electronic Devices and circuits”

2. Bapat K N “Electronics devices and circuits”

3. Allan Mottorshed “Electronic devices and circuits”

4. Millman and Halkias, “Integrated Electronics”

5. Boylestead and Neshelsky, “Electronic devices and circuits”

6. Schilling and Bolove , “Electronic circuits, Descrete and Integrated” TMH

7. Gayakwad, “Op-Amps and Integrated circuits”

8. Clayton, “Operational amplifier”

9. Sergio Franco, “Design with op-amps and analog Integrated circuits” MH International 10. Theodore F Bogart, “Electronic devices and circuits”, Universal book stall –New Delhi

1. Study of – Multimeter, signal generators, CRO etc. and measurement of electrical quantities

100

150

L T/D/P IM EM TM CS 305

Electronic Circuits

037575150

CS 306

Electronic Circuits Lab

L T/D/P IM EM

2. Testing of Passive and Active components – Resistors, Capacitors, inductors, Transformers, diodes, Transistors etc.

3. Characteristics of Active devices

4. Rectifying circuits

a. HW rectifier

b. FW rectifier

c. FW Bridge rectifier

d. Filter circuits – Capacitor filter, inductor filter and Pi section filter

(Measurement of ripple factor, maximum ratings of the devices)5. Differentiating circuit ad integrating circuit

6. Clipping & Clamping circuits

7. Amplifying circuits Simple common emitter amplifier configuration – gain and bandwidth 8. Oscillators

9. Multivibrators – Astable only 10. Circuits using OP –Amps

Compulsory experiments

1. (a). Preliminary study of AC and DC Power supplies in the laboratory (b). Study of instruments and their mode of use

2. Open circuit characteristics of

a. Self excited generator

b. Separately excited generator

3. Load characteristics of compound generator

4. Load characteristics of shunt generator

5. Study of face plate starter and starting of DC motors

6. Load characteristics of DC series motor

7. Swinburn’s test

8. Polarity and transformation ratio test on single phase transfer.9. O.C & SC test on single phase transformer – equivalent ciruit 10. Load rest on single phase transformer

11. Study of starting methods of squirrel cage and slip ring induction motor 12. Load test on slip ring induction motor and study of characteristics.

Optional Experiments 1. Study of single phase motors 2. Load test of DC shunt motor

3. Poly phase connection of single phase transformer

4. Load test on squirrel cage induction motor

5. Study of alternators

SEMESTER - IV

MODULE I

Complex analytic functions and conformal mapping : curves and regions in the complex plane. Complex functions, limit, derivative, analytic function, Cauchy – Riemann equations, elementary complex functions such as powers, exponential function,logarithmic, trignometric and hyperbolic functions.

Conformal mapping: Linear fractional transformations, mapping by elementary functions

like e z , sin z, cos z, sin hz, and cos hz, Schwarz – Christoffel transformations.MODULE II

Complex integration: Line integral, Cauchy’s integral theorem, Cauchy’s integral formula, Taylor’s series, Laurent’s series, residue theorem, evaluation of real integrals using integration around unit circle, around the semi circle, integrating contours having poles, on the real axis.MODULE III

Numerical Analysis: Errors in numerical computations, sources of errors, significant digits. Numerical solution of algebraic and transcendental equations: bisection method,regula falsi method, Newton-Raphson method, method of iteration, rates of convergence of these method.

Solution of linear system of algebraic equations: exact methods, Gauss elimination method, iteration methods, Gauss-Jacobi method.

Polynomial interpolation:Lagrange interpolation polynomial, divided differences,Newton’s divided differences interpolation polynomial.MODULE IV

Finite differences:Operators , V, E and Newton’s forward and backward differences interpolation polynomials, central differences, Stirlings central differences interpolation polynomial.

100

150

L T/D/P IM EM TM Engineering

Mathematics - IV

CS/EC/IT 401

037575150

CS 307

Electrical

Machines Lab

L T/D/P IM EM

Numerical differentiation :Formulae for derivatives in the case of equally spaced points.

Numerical integration : Trapezoidal and Simpson’s rules, compounded rules, errors of interpolation and integration formulae. Gauss quadrature formulae(No derivation for 2point and 3 point formulae)MODULE V

Numerical solution of ordinary differential equations :Taylor series method, Euler’s method, modified Euler’s method, Runge-Kutta formulae 4th order formula, Solution of Linear difference equations with constant co-efficients:Numerical solution of boundary value problems, methods of finite differences, finite differences methods for solving laplace’s equation in a rectangular region, finite differences methods for solving the wave equation and heat equation.

References:

1. Ervin Kreyszig: Advanced Engineering Mathematics, Wiley Eastern

2. S.S. Sastry: Introductory Method of Numerical Analysis, Prentice – Hall of India

3. Ralph G. Stanton:Numerical Methods for Science and Engg., Prentice – Hall of India

4. S.D. Conte and Carl de Boor: Elementary Numerical Analysis Analograthmic approach McGraw Hill

5. M.K. Jani, S.R.K. Iyengar and R.K. Jain: Numerical Methods for scientific and Engineering Computations. Wiley Eastern

6. P.Kandaswamy K. Thilagavathy :Numerical Methods, S.Chand & Co. K. Gunavathy

7. E.V. Krishnamurthy, S.K. Sen:Numerical Algorithms, Affiliated East West.

MODULE 1

Programming domains. Language evolution . evolution of major programming languages.Describing syntax and semantics. Formal methods of describing syntax and semantics.Backus Naur form. Attribute grammars. Describing semantics- denotational semantics.MODULE II

Data types and variables – names- variables. Scope and lifetime. Expression and assignment statements. Control structures. Subprograms- parameter passing- overloading-generic subprograms.MODULE III

Data abstraction and encapsulation. Polymorphism and inheritance. Features of object oriented languages. Smalltalk, C++ and JA V A. Design and implementation issues. Exception handling. Constructs for concurrency.MODULE IV

Functional programming languages- Lambda calculus- introduction to pure LISP.Applications of functional programming languages.MODULE V

Logic programming languages- a brief introduction to predicate calculus- horn clauses-logic programming. Introduction to prolog. Applications of logic programming.Reference

1. James Gosling JAV A programming language, Addison Wesley.

2. “Symbolic logic and logic programming”, learning material series, Indian society for tech. Education 1996.

3. Bjarn Stroustrup, design and evolution of C++, Addison Wesley 1991

4. Michael J Gordon, “programming language theory and its implementation”, prentice hall 1991.

5. Terence W Pratt, “ programming languages”, Prentice hall, ninth edition 199

6.6. Ravi Sethi, “programming languages- concepts and constructs”, Addison Wesley, second edition 1996.

7. Robert W Sebesta, “concepts of programming languages”

MODULE 1

Finite State systems – Non Deterministic Finite Automata and Deterministic Finite Automata. Equivalence of NFA and DFA. Equivalence of NFA with and without epsilon moves.MODULE II

Regular expressions – Equivalence of Finite Automata and regular expressions. Finite Automata with output . Moore and Meelay Machines. Equivalence of Moore and Meelay Machines. Applications – Lexical Analysers. Properties of regular sets. Pumping Lemma for regular sets. Closure properties. Decision algorithms. Myhill Nerode’s theorem and Minimisation of Finite Automata. Minimisation algorithm.MODULE III

Context Free Grammars – Derivation of Languages – Derivation trees. Ambiguity.Simplification . Chomsky Normal Form and Greibach Normal Form. Push Down.

4050100150

CS 402

Principles of Programming Language

L T/D/P IM EM 5

100

150

L T/D/P IM EM TM Automata Languages

and Computation

CS 403

Automata. Deterministic Push Down Automata. Equivalence of Push Down Automata and Context Free Languages. Pumping Lemma for Context free languages. Closure properties. Decision Algorithms.MODULE IV

Turing machines – Computation – languages and functions. Techniques for Turing machine construction – storage in finite control – multiple tracks- checking of symbols, shifting over – subroutines. Non Deterministic Turing machines.MODULE V

Undecidability – Recursive and recursively enumerable functions. Universal Turing machine. Halting problem of Turing machine. Chomsky Hierarchy – Equivalence of regular grammar and Finite Automata. Equivalence of Unrestricted grammar and Turing Machine. Context Sensitive Grammars. Equivalence of context Sensitive languages and Linear Bound Automata(LBA). Relation between classes of languages.Text Books:

1. J.E.Hopcroft, J.D.Ullman, “Introduction to Automata Theory, Languages and Computation”, Addison Wesley, 1990.

2. K.L.P.Misra, N. Chandrasekharan, “Theory of Computation”, Prentice Hall, 1998.References

1. H.R.Lewis, Shistos H. Papadimitrou, “Elements of Theory of Computation” , Prentice Hall India, New Delhi, 1991.

2. John Martin, “Introduction to Language and theory of Computation”, Tata McGraw- Hill, New Delhi, 1998.

3. Peter Linz, An Introduction to Formal Languages and Automata, Narosa Publications, 2000.

4. Thomas A Sudkamp, “Languages and Machine – An Introduction to Computer Science”, Addison Wesley, Reading, MA, 1990

MODULE 1

Basic structure of computer hardware and software – Addressing methods and machine program sequencing – Computer arithmetic – logic design for fast adders – multiplication-Booth’s algorithm – Fast multiplication – integer division – floating point number representation – floating point arithmetic.MODULE II

Control unit – instruction execution cycle – sequencing of control signals – hardwired control – PLAs – micro programmed control – control signals- microintstructions –micro program sequencing- Branch address modification – Prefetching of micro instructions- emulation – Bit slices.MODULE III

Memory organization – Semiconductor RAM memories – internal organization – Bipolar and MOS devices – Dynamic memories – multiple memory modules and interleaving –cache memories – mapping functions – replacement algorithms – virtual memory – address translations – page tables memory management units – Secondary memory – disk drives-organization and operations – different standards MODULE IV

Input – output organisations – accessing I/O devices – direct memory access (DMA) –interrupts – interrupt handling – handling multiple devices – device identification-vectored interrupts – interrupt nesting – Daisy chaining – I/O interfaces – serial and parallel standards – bus scheduling – bus arbitration – bus standards.MODULE V

Introduction to parallel organisations – multiple processor organisation – symmetric multiprocessors – cache coherences – non uniform memory access – vector computation – introduction to CISC & RISC – Architectures- comparison Text Books:

1. Hamacher C V , “Computer Organisation – 4th Edition”, Mc. Graw Hill, New York, 1997

2. Stallings William, “Computer Organisation and Architecture” , 6th Edition Pearson Education, 2003References:

1. Pal Chaudhary P, “Computer Organisation and Design”, Prentice Hall, New Delhi.

2. Hayes J P, “Computer Organisation and Architecture –2nd Edition”, Mc Graw Hill

3. Tanenbaum A S, “Structured Computer Organisation – 3rd Edition”, Prentice Hall.

4. Kai Hwang & Faye A Briggs “Computer Architecture and Parallel Processing” Mc. Graw Hill, New York 1985

5. D.A Pattersen and J.L Hennesy , “Computer Organisation and Design”

6. “The hardware/software Interface 2nd Edition”, Harcourt Asia private Ltd. (Morgan Kaufman) , Singapore 1998

5050100150

CS 404

Computer Architec-ture & Organiza-tion

L T/D/P IM EM 5

100

150

L T/D/P IM EM TM Data Structures &Algorithms

CS 405

MODULE I

Introduction to data structures –Arrays – Sparse matrices . Strings – representation. Implementation of abstract datatype (ADT) string, linked lists, representation of

polynomials using linked list, Doubly linked lists ,garbage collection, Buddy systems

MODULE II

Stacks, Implementation of ADT stack using arrays and lists, Typical problems, Conversion of infix to post fix, Evaluation of post fix expression, Queues and Dequeues implementation, Priority queues

MODULE III

Trees –Definition and mathematical properties –binary trees – binary tree traversal –preorder,inorder and post order. Expression trees. Threaded binary trees. Representation of trees using binary trees. Search trees. Balanced binary trees.

MODULE IV

Graphs –mathematical properties – degree- connectedness. Directed graphs – directed acyclic graphs –representation using matrix –Graph traversal, Shortest path, minimum spanning trees –Kruskal algorithm. Symbol tables, Binary search, Hash tables. Hashing functions

MODULE V

File structures, Random access files. Indexed sequential Files, B-trees and B++ trees. External and internal sorting algorithms.

Note: The course should be taught using object oriented programming language JA V A References :

1. Aaron M Tanenbaum, Moshe.J.Augestein, “Data Structures using C”,

Prentice Hall International IncEnglewood Cliffs, N J, 1986

2. Ellis Horowitz and Sartaj Sahni “An Introduction to data structures”, Computer

science press, Rock Ville, MA, 1984

3. Gregory L Heileman, “Datastructures, Algorithms and object oriented programming Mc Graw Hill, New York 1997

4. Jean Paul Tremblay and Paul G Sorenson, “An introduction to data structures with application”, Mc Graw Hill Singapore 1984

5. Mark Allen Weiss, “ Data structures and algorithm analysis in C++”, Peach Pit Press, Benjamin/ Cummings publishing Company Inc., Red wood city, CA 1991

6. Michael T Good rich and Roberto Tamassia, “Data structures and algorithms in

JAV A”, John Wiley and sons, Inc, 19997. Michael Waite and Robert Lafore, “ Data structures and algorithm in JAV A”, Tech media, New Delhi, 1998

8. Robert L Cruse, “Datastructures and Program Design”, Prentice Hall India, 3rd ed 1999

9. Sartaj Sahni , “Data Structures Algorithms and Applications in Java”. Mc.Graw-Hill

10.Mark Allen Weiss, “ Data Structures and algorithm analysis in C++” ,Benjamin/ Cummings publishing Company Inc., Red wood city, CA 1991.

1. Transfer characteristics and specifications of TTL and MOS gate

2. Design of half adder and full adder using NAND gates.

3. Set up R-S & J-K flip flops using NAND gates

4. Code converters – Binary to Gray and gray to Binary using mode control

5. Asynchronous UP/DOWN counter using JK flip flops

6. Design and realization of sequence generators

7. Study of shift registers and designs of Johnson and Ring counter using it.

8. Binary addition and subtraction (a) 1’s complement (b) 2’s complement

9. Study of IC counters 7490, 7492 and 7493

10. Astable and monostable multi-vibrators circuit using 555

11. ADC at least one method

12. Study of MUX & DeMUX

13. ROM &RAM chips - verification as memories

Implementation and study of algorithms in a suitable programming language for the following,

1. Sorting and Searching

2. Linked List

3. Stacks and Queues

4. Trees and Graphs

SEMESTER - V

037575150

L T/D/P IM EM TM Data Structures

Lab

CS 407

6050100150

L T/D/P IM EM TM Language

Processors

CS/ 501

037575150 CS 406

Digital Electronics

Lab

L T/D/P IM EM

MODULE 1

Assembler:Overview of the assembly process – Design of two pass assembler – Single pass assembler – Macros – Macro definition and usage schematics for macro expansion – Design of a Macro pre-processor – Design of a Macro assembler – Introduction to Loaders and Linkers MODULE II

Compiler: Introduction – Analysis of the source program – phases of a compiler – compiler construction tools – Lexical analysis – role of the lexical analyzer – Specification of tokens – Recognition of tokens – Lexical analyzer generators MODULE III

Syntax Analysis – Role of the parser – context free grammars – top-down parsing –Bottom-up parsing – Operator precedence parsing – LR parsers (SLR, Canonical LR,LALR ) – Parser generators.MODULE IV

Syntax- directed translation – syntax-directed definitions – S-attributed definition – L-attributed definition – Top-down and bottom-up translation – Type checking – Type systems-specification of a type checker. Run time environment – source language issues – storage organization – storage allocation strategies – Access to nonlocal names –Parameter passing - symbol tables.MODULE V

Intermediate code generation – Intermediate languages – Declaration – Assignment Statement – Boolean expression – Procedure calls – code optimisation – Introduction –sources of optimization – Introduction to data flow analysis. Code generator – Issues in the design of a code generator, the target machine, A simple code generator Text Book:

1. Alfred V . Aho, Ravi Sethi & Jeffrey D.Ullman, compilers principles, Techniques & tools.

References:

2. Aho A.V & Ullman J.D. Principles of compiler Design

3. S.S. Muchnick – Harcourt Asra (Morgan Kaufman), Advanced compiler Design implementation, 1997

4. Modern compiler Implementation in C, Cambridge Uty. Press 1997

5. Alan Holub, compiler Design in C, PHI

6. Kenneth C. Louden, compiler construction, Principle and Practice, Thomson Books.

MODULE I

Software Life cycle – Waterfall model – Prototyping – Object Oriented Analysis – Object, dynamic & functional Models – SRS – Format for SRS – Data Dictionary MODULE II

Design : principles – Cohesion & Coupling – abstraction.

Object Oriented Design :- System Design – Object Design – Designing Algorithms –Design of association – Design Implementation MODULE III

UML :Structural Modelling :

Developing UML Object diagrams – basic Components of Object Diagrams – Classes –Interfaces – packages

UML: Behavioural Modelling:Use Case Diagrams – Activity Diagrams – State Chart Diagrams MODULE IV

UML Architectural Modelling:

Component Diagrams – Deployment diagrams – Unified Process

Case Study: - applying Object oriented Methodologies in Software Development MODULE V

Case Tools:- A Study on Computer Aided Software Engineering – Workbenches –General Study on Case tool usage in various phases.

Case Study:- Preparing SRS, Plan and Object Oriented Design of typical Software project References:

1. Pankaj Jalote, An Integrated approach to Software Engg: Narosa publishers

2. Roger S. Pressman, software engg – A Practioner’s approach (Mc. Graw Hill Publishers)

3. James Rimbough & Blaha, Object Oriented Modelling & Design (PHA Publishers)

4. Booch & Rambaugh – User Guide, The Unified Modelling Language (Addisson Wesly Publishers)

MODULE I

5050100150

CS 502

Software Engineering

L T/D/P IM EM 5

100

150

L T/D/P IM EM TM CS 503

Microprocessors

Introduction to microprocessors – Architecture of typical 8 bit microprocessor – Intel 8085 microprocessors – study of functional units. Function of various controls signals – Design of CPU section with buffers and latches. Interrupt structure of 8085

MODULE II

Instruction set of 8085 microprocessors – Addressing modes – Programming – examples – Instruction timing. Memory design – Design of memory using standard chips – Address decoding – I/O addressing schemes – I/O mapped I/O, and memory mapped I/O techniques.

MODULE III

Interfacing peripherals – Basic interfacing concepts – Interfacing output displays –Interfacing input keyboards. 8085 Interrupts – Programmable Interrupt Controller (8259A) – Block diagram and operation – Direct Memory Access (DMA) – DMA Controller (Intel 8257) – Interfacing 8085 with Digital to Analog and Analog to digital converters.

MODULE IV

Programmable peripheral interface (Intel 8255A) – Programmable communication interface (Intel 8251 – Programmable interval timer (Intel 8253 and 8254). Programmable Keyboard / display controller (Intel 8279). Serial and parallel bus standards – RS 232 C, IEEE 488, Centronics. Microprocessors Application

MODULE V

Introduction to micro controllers – comparison with microprocessors – Study of Micro controller (MCS 51 family) – 8051 micro controller: Architecture – instruction set –addressing modes – interrupts – programming – Interfacing with Stepper motor, ADC and DAC – Typical applications

References:

1. Ramesh S. Gaonkar, Microprocessor Architecture, Programming, and Applications with 8085, 5/E Prentice Hall, 2002

2. Adithya P. Mathur. Introduction to Microprocessors. 3/E Tata Mc Grawhill

3. Barry B. Brey, 8085A Microprocessor, The :software, Programming and Architecture, 2/E Prentice Hall, 1993

4. Richard H. Barnett, The 8051 Family of Microcontrollers, Prentice Hall, 1995

5. Muhammad Ali Mazidi and Janice gillispie Mazidi, The 8051 Microcontroller and embedded systems, Pearson education, 2000

6. I.Scott Mackenzie, The 8051 Microcontroller, 3/E Prentice Hall , 1999

7. James W. Stewart, 8051 Microcontroller, The : Hardware, Software, and Interfacing, 2/E Prentice Hall, 1999.

MODULE I

Introduction – Various types of communication systems

Modulation: need for modulation – different types – definition – expression.

Noise in communication systems: classification, SNR, CNR, noise figure, relationships between noise figures.

Voice Signal Digitization : PAM, PPM, PWM, PCM, Delta modulation, PCM and DM voice signal comparison, TDM of PCM signals.

MODULE II

Digital Radio: block diagram, ASK, FSK, PSK, QAM, digital demodulation, QAM demodulation Components in a data communication system – Transmission media: transmission rate – bandwidth requirements

Shannon’s theorem – channel capacity – Bandwidth, Modems – Switching - Multiplexing digital PBXs

MODULE III

Data Encoding, Data transmission basics : bit – serial transmission, transmission modes – asynchronous and synchronous transmission, bit, character and frame synchronization

MODULE IV

Protocol basics, Error control, Idle RQ, Continuous RQ, Link utilization, selective repeat and go-back-N.Link management

MODULE V

Error detection methods, Parity, Block sum check, Cyclic redundancy check, Data compression, Huffman coding, Dynamic Huffman coding, Facsimile compression, transmission control circuits, Communication control devices : time division multiplexer, statistical multiplexer. Block-mode device

Text Books

1. Fred Halsall : Data Communications Computer Networks and Open systems, Pearson Education, Fourth edition

2. William Stallings : Data &Computer Communications : Pearson Education, sixth edition References

4050100150 CS 504

Data

Communication

L T/D/P IM EM

1. B. Forouzan, Introduction to Data Communication and networking 5/E, PHI, 1997

2. Prakash. C. Gupta, Data Communications, PHI, 1999

3. R. P. Singh, S.D. Sapre : Communication systems Analog & Digital

MODULE 1

Introduction:Characteristics of the Database approach – Data models, schemas and instances – DBMS architecture – Data independence – Database languages and interfaces – Database administrator – Data modeling using entity – Relationship (ER), entity sets,attributes and keys – Relationships, Relationship types, roles and structural constraints – Weak entity types – enhanced Entity – Relationship(EER) and object modeling. Sub classes, super classes and inheritance – Specialization and generalization.MODULE II

Record storage and file organizations: Placing file records on disks – Fixed length and variable length records – Spanned Vs unspanned records – Allocating file records on disk – Files of unordered records(heap files), Files of ordered records(Sorted files)-Hashing Techniques. Indexed structures for files – types of single level ordered index,multilevel indexes – B – trees and B + trees, Indexes on multiple keys, Other types of indexes.MODULE III

The Relational model : Relational model concepts – Relational model constraints – The Relational Algebra – Relational calculus – Tuple Relational calculus, Domain Relaional calculus. – SQL

Database Design: Functional dependencies – Basic definitions – Trivial and non trivial dependencies – Closure of a set of dependencies – Closure of a set of attributes –Irreducible sets of dependencies – Non loss decomposition and Functional dependencies.First, Second and Third normal forms – Boyce-codd normal form MODULE IV

Transaction processing – Desirable properties of Transactions, Schedules and Recoverability – Serializability of Schedules. Concurrency control Techniques – Locking techniques. Time Stamp Ordering, Multi version concurrency control techniques,Granularity of data items. Database recovery techniques – Database recovery techniques based on deferred update and immediate update, shadow paging, ARIES recovery

algorithm. Database security and Authorization – Security issues, Access Control based on granting/revoking of privileges, Mandatory access for Multilevel Security.MODULE V

Distributed databases:Motivation for distributed databases – concepts – Types of distribution – Distributed Query processing – commit Protocol for distributed databases.Introduction to object oriented databases, active databases, Data warehouses – Data mining References:

1. Elmasri and Navathe, “Fundamentals of Database Systems”, 3/e, Addison –Wesley, 2001

2. A.Silberschatz, H. F. Korth, and S Sudarshan, “Database System Concepts”, 3/e,Tata McGraw Hill, 1997

3. C.J.Date, “an Introduction to Database Systems”, Addison-Wesley, 1995

4. M.Tamer Ozsu & Patric Valduriez, “Principles of Distributed Database systems”.

5. Margaret.H.Dunham, “Data mining.Introductory and advanced topics”, Pearson Education,2003.

6. Hector Garcia-Molina,Jeffret D.Ullman,Jenniffer Widom, “Database System Implementation”, Prentice Hall International Inc, 2000.

PART A (compulsory)

1. study of a typical microprocessor trainer kit and its operations.

2. simple programming examples using 8085 instruction set. to understand the use of various instructions and addressing modes- monitor routines.

3. interfacing and programming of 8255.(eg:traffic light control, burglar alarm, stop watch).

4. interface and programming of 8253/8254.

5. interfacing & programming of 8279.PART B*

1. a/d and d/a converter interface

2. stepper motor interface

3. display interface

4. programming of different types of eprom 2716, 2732 etc

037575150

CS 506

Microprocessor Lab

L T/D/P IM EM 5

100

150

L T/D/P IM EM TM Data Base Man-agement Systems

CS 505

(*at least two topics from part b has to be covered).1. Creation of Single Pass- Two pass assembler – Macro processor.2. Generation of Lexical Analyzer using tools such as Lex 3. Generation of Parser using tools such as YACC.4. Generation of LL(1) Parser 5. Generation of intermediate code 6. Creation of type checker

7. Developing a compiler for a subset of a programming language.

SEMESTER - VI

MODULE I

Introduction to discrete time signals & system-Discrete time signals and systems-Properties of discrete systems-linearity-time invariance-causality-stability-convolution-difference equation representation of discrete systems -The z transform-properties of z transform- the inverse z transform-system function.MODULE II

Discrete Fourier Transform & Fast Fourier Transform. Discrete Fourier series-properties-discrete Fourier transform properties-block convolution-decimation in-time FFT algorithms-decimation infrequency FFT algorithms-FFT algorithms for N, a composite number.MODULE III

FIR digital Filters Realizations-direct-cascade- lattice forms-hardware implementation-FIR filter design using Fourier series- use of window functions - frequency sampling design.MODULE IV

IIR Digital Filters Realizations-Direct-Cascade-Parallel forms -hardware implementation-Analog filter approximations - Butterworth and Chebycheve approximations - The method of mapping of differentials- impulse invariant transformation- Bilinear transformation-Matched z transform technique.

MODULE V

Finite word length effects in digital filters- fixed point arithmetic -Floating point

arithmetic- Block floating point arithmetic - Truncation-Rounding - Quantization error in analog to digital conversion-finite register length effects in IIR & FIR filters Limit cycles. Digital signal processing application (onlybrief description required) Software implementation of digital filters- Architecture of typical DSP processor.

References:

1) Oppenheim & Ronald W Schafer : “Digital Signal Processing”, Prentice Hall India 2) Andreas Antoniou : “Digital Filters Analysis & Design”, Prentice Hall India 3) R. Rabiner & B.Gold, : “Theory & Application of Digital Signal Processing”, PHI 4) Andreas Antonion, : “Digital Signal Processing”, Prentice Hall India

5) John G Proakis & Dimitris G Manolakis : “Digital Signal Processing”, Prentice Hall India

6) Sanjit K. Mithra, : “ Digital Signal Processing”, Tata Mc- Graw Hill 7) Douglas K. Lindner, : “Introduction to Signals & Systems” McGraw Hill

MODULE 1

Introduction to operating systems . Extended machine-operating systems structure.Processes-inter process communication-race conditions-critical sections-mutual exclusion- busy waiting-sleep & wake up-semaphores-event counters – monitors –message passing. Processes scheduling-round robin scheduling- priority scheduling-multiple queues- shortest job first – guaranteed scheduling – two level scheduling.MODULE II

Memory management. Multi-programming. Multi programming & memory usage-multi programming with fixed partitions. Swapping-multi programming with variable partitions-memory management with bit maps, linked lists, buddy system- allocation of swap space.Virtual memory-paging & page tables, associative memory-inverted page table’s .page replacement algorithms.design issues for paging systems-working set model.Example systems.MODULE III

037575150

CS 507

Language Processor Lab

L T/D/P IM EM 5

100

150

L T/D/P IM EM TM Digital Signal Processing

CS/EE/EI 601

5050100150

CS/ IT 602

Operating Systems

L T/D/P IM EM

File systems & I/O files. Directories-file system implementation-security & protection mechanisms. Principles of I/O hardware-I/O devices- device controllers-DMA.principles of I/O software-interrupt handlers-device drivers-disk scheduling- clocks & terminals.MODULE IV

Deadlock-conditions for deadlock-deadlock modelling. Deadlock detection & recovery.Deadlock avoidance-resource trajectories-safe & unsafe states-bankers algorithms-deadlock prevention. Two phase locking-non resource deadlock-starvation.MODULE V

Introduction to distributed operating systems-distributed systems-design issues. Client server model. Remote procedure call.Synchronisation in distributed systems-clock synchronizations-concurrency control-deadlocks in distributed systems. Process management- threads-system models-processor allocation algorithms-distributed file systems.CASE STUDY

UNIX/LINUX operating systems Textbooks:

1. Andrew S.Tanenbaum, “Modern operating systems”, Prentice Hall, 1991Reference:

1. Bach, M.J., “design of UNIX operating system”, Prentice Hall.

2. Charles Crowley, “operating systems-a design oriented approach”, Tata Mc Graw hill, 1997

3. D.M.Dhamdhere, “system programming & operating systems”, Tata Mc Graw hill 1996.

4. Deital, H.M, “operating systems”, Addison Wesley, 1992

5. Garry Nutt, “operating systems- a modern perspective”, second edition, Addison Wesley 2000

6. Pradeep K.Sinha, “distributed operating systems”, Tata mc graw hill 1998.

7. Silberschatz et.al., “operating system concepts”, Addison Wesley, 1993.

8. William Stallings, “Operating Systems”, Prentice Hall, 1997

9. Michael Palmer, “ Guide to Operating Systems”, Vikas Thomson Learning Publishing, New Delhi.

MODULE 1

Overview of Graphics systems. Video display devices- raster scan systems- Random scan systems –input devices. Hardcopy devices-graphics software. Output primitives –points and lines. Line drawing algorithms-circle generating algorithms- polygon filling algorithms-filling arcs-pattern filling output attributes- Bundled attributes. Antialiasing.Graphical user interface-logical classification of input devices.MODULE II

Two dimensional transformations. Basic transformations - translation – rotation-scaling.Matrix representation and homogeneous cordinates - composite transformations.Tranformation between coordinate systems-Affine transformations.Two dimensional viewing-viewing pipeline-windows to viewport transformations-clipping operations-point clipping-line clipping-polygon clipping.MODULE III

Three dimensional object representations. polygon surfaces-curved surfaces. Spline representations- Hermite polynomials-Cubic splines-Bezier curves-B-splines. Octrees and BSP trees. Fractal geometry methods. Three dimensional transformations. Three dimensional viewing. Projections. View volumes. Three dimensional clipping – Hardware implementation.MODULE IV

Visible surface detection. Classification of visible surface detection algorithms.Back face detection-Depth buffer-A buffer. Scan line algorithms.-depth sorting –Area sub division methods octrees-BSP trees- octrees-Ray casting.MODULE V

Shading, Illumination models-light sources. Basic Illumination models. Polygon rendering-constant intensity – Goraud shading –Phong shading. Ray tracing Texture mapping.Color models. Introduction to Animation. Raster animation – animation languages-Key frame systems- Morphing- Motion specifications. Introduction to Virtual reality – Virtual Reality Modelling Language(VRML).Text Book:

1. Donald Hearn, M Pauline Baker, Computer Graphics C version, 2/E Pearson Education,2003.References:

1. James D.Foley et.al., Introduction to Computer Graphics, Addison Wesley Publishing Company,1994.

100

150

L T/D/P IM EM TM Computer Graphics

CS 603

2. Alan Watt, Mark Watt, introduction to Animation and Rendering, Addison Wesley Publishing Company,1994.

3. Newmann W and Sproull R.F., Principles of Interactive Computer Graphics, McGraw- Hill, 1980

4. Rogers D.F.,Procedural Elements for computer Graphics, McGraw-Hill, 198

5.MODULE 1

Architecture 16 bit microprocessors: Intel 8086 Architecture- Memory address space and data organization- Segment registers and memory segmentation-I/O address space-Addressing modes- Comparison of 8086 and 8088- Basic 8086/8088 configuration-Minimum mode- Maximum mode- System timing – Bus interface. Interrupts and interrupt priority management. Intel 80286 Architecture – Comparison with 8086 processor.MODULE II

Architecture of 32 bit Microprocessors:Intel 80386 Architecture – Special 80386Registers – Memory management – interrupts and exceptions – management of tasks –Real, protected and virtual 8086 mode- Introduction to 80486 microprocessor –Architecture – Comparison with 80386 processor.MODULE III

Advanced Microprocessors:Introduction to Pentium and Pentium pro architectures:RISC concepts- BUS operation – Super scalar architecture- Pipelining-Branch prediction – Instruction and data caches – FPU – Comparison of Pentium and Pentium pro architecture. Introduction to Pentium II, Pentium III and Pentium IV processors –Introduction to Intel and AMD 64 BIT architectures. RISC Architecture : Definition of RISC – Properties of RISC Systems- Practices in RISC Systems- Register windowing –Advantages and shortcomings – Comparison with CISC architecture.MODULE IV

I ntel 80x86 Programming: 80x86 Instruction set, Assembly level programming with DEBUG and MASM – MS-DOS

Functions and BIOS Calls – programming examples using 80x86.MODULE V

Introduction IBM PC Architecture, Peripherals & Inter face Buses:

Motherboard – Chip sets – graphic adapters and monitors – drive controllers – floppy and hard disk drives- IDE and SCSI – streamers and other drives – parallel interfaces and printers – serial interfaces –16550 UART CMOS RAM and real time clock – keyboard and mouse – the power supply (SMPS)- BIOS and Boot Process Bus Systems : PC/XT and AT Buses – Microchannel and ISA – Local Buses: VESA and PCI- I/O Buses: SCSI and USB.References:

1. Barry B. Brey, The Intel Microprocessors 8086 to Pentium 4-Architecture Programming and Interfacing, 6/e Pearson Education,2003.

2. James L.Antonacos, An Introduction to intel Family of Microprocessors, 3/e Pearson Education, 2002.

3. John Uffenbeck, The 80x86 Family – Design Programming and interfacing, 3/e Pearson Education,2002.

4. YU-Cheng-Liu & Glenn A Gibson, Microprocessor System, Architecture Programming & Design, Pentice hall of India.

5. Douglas V Hall, Microprocessors & Interfacing, Tata McGrawHill,1998.

6. Intel Users manual for8086,80386 &80486, Pentium processors.

7. H.P.Messmer, The Indispensable PC Hardware Book, 3/e, Addison Wesley, 1997.8. S.J.Bigelow, Troubleshooting, Maintaining , and Repairing PCs, 2/e, Tata McGraw Hill, New Delhi, 1999.

9. Ytha Yu and Charles Marut, Assembly Language Programming and Organisation of IBM PC, International Edition , McGrawhill inc, 1992.

10. https://www.wendangku.net/doc/6515578498.html,ler, An Assembly Language Introduction to Computer Architecture using the Intel Pentium, Oxford University Press, 1999.

MODULE 1

Basic idea of control systems and their classification – differential equations of systems-linear approximation – Laplace transform and transfer function of linear system – Model of physical system (Electrical , mechanical and electromechanical )- block diagram-signal flow graph – Mason’s gain formula.MODULE II

Time domain analysis – Representation of deterministic signals – First order system response – S- plane root location and transient response – impulse and step response of

5050100150

CS 604

Microprocessor System Design

L T/D/P IM EM 4

100

150

L T/D/P IM EM TM Control System Engineering

CS/EC 605

second order systems – performance – characteristics in the time domain – effects of derivative and integral control – steady state response – error constant – generalized definition of error coefficients – concepts of stability –Routh – Hurwitz criterion.MODULE III

Frequency domain analysis – frequency response – Bode plot, Polar plot, Nicol’s chart – closed loop frequency response and frequency domain performance characteristics .Stability in the frequency domain. Nyquist criterion.MODULE IV

Root locus method – basic theory and properties of root loci – procedure for the construction of root loci – complete root locus diagram. Design and compensation of feed back control system :- approaches to compensation – cascade compensation networks and their design in the frequency domain – simple design in S- plane.MODULE V

State variable methods :- introduction to state variable concepts – state variable description of linear dynamic systems – representation in matrix forms – block diagram and signal flow graph representation of state equations – Transfer matrix from state equations – transition matrix – general solution for linear time invariant state equations.Control system components :- Error detectors, servomotor, tachogenerator, servo amplifier, magnetic amplifier, rotating amplifier – Basic principles of adaptive control systems.References:

1. Ogata k, ‘Modern Control Engineering ‘,Prentice HaLL/Pearson.

2. Dorf Morden Communication Systems, Pearson Education

3. Franklin Feed back Control Systems, Pearson Education

4. Kuo B.C,”Automatic Control System”, Prentice Hall

5. Nagoor Kani : Control Systems, R B P

6. Ogata Discrete Time Control Systems , Pearson Education

7. Nagarath & Gopal, ‘Control System Engineering”, Wiley Eastern

8. Control Engineering Ramkayan Vikas Pub

9. Control Theory M N Bandyopadhyaya, PHI 10. Control Theory Glad, Vikas Thomson Pub

1. Identification of components/cards and PC assembling from components.

2. Assembly language program for implementing arithmetic operations.

3. Assembly Language program for time and date manipulation.

4. Assembly Language programs for display/video manipulation

5. Assembly Language program for equipment status.

6. Implementation of a file manger using DOS/BIOS interrupts.

7. TSR(Terminate and Stay Resident) Programming.

8. ADC interface.

9. Stepper Motor interface using DAC.

10. Parallel Interface: Printer and HEX keyboard.

11. Serial Interface: PC to PC serial interface using null modem.Note: Programs can be implemented using MASM/TASM.References:

1.H.P.Messmer, The Indispensable PC Hardware Book, 3/e,Addison Wesley,1997

2.S.J.Bigelow, Troubleshooting, Maintaining and Repairing PCs,2/e,Tata McGraw

Hill, New Delhi,1999.

3.Douglas V Hall, Microprocessors and interfacing, 2/e, Tata McGraw hill,1988.

4.Ytha Yu and Charles Marut , Assembly Language Programming and Organisation

of IBM PC, International Edition, McGrawhill Inc,1992.5.Barry B Brey, The Intel Microprocessors 8086 to Pentium 4 -A

ArchitectureProgramming and interfacing, 6/ePearson Education, 2003.

SEMESTER VII

MODULE I

Introduction to Computer Network and Physical Layer

Types of Networks: Broadcast and Point-to-point- LAN-MAN-WAN- Wireless

networks. Layered Architecture and Reference Models: Layered architecture- OSI reference model, TCP/IP reference model – Internet Protocol Stack – Network Entities in Layers-Connection oriented and Connection less services, Examples of networks: Novell Netware, Arpanet, and Internet. Examples of Data Communication Services: X.25

150

L T/D/P IM EM TM Minor Project

CS 607

037575150

CS 606

System Program-ming & Hardware Lab.

L T/D/P IM EM 5

100

150

L T/D/P IM EM TM Computer Networks

EC/EE/CS/IT/701

Networks, Frame relay, Broad band ISDN and ATM. Physical Layer: Transmission media- Narrow band ISDN: Services-Architecture- Interface , Broad band ISDN and ATM- Virtual Circuits versus Circuit Switching –Transmission in ATM networks . FDDI

Module II

Link Layer and Local Area Networks Data link layer:

Service provided by data link layer-Error detection and correction Techniques-Elementary data link layer protocols-Sliding Window protocols- Data link layer in HDLC, Internet and ATM. Multiple Access protocols: Channel partitioning protocols: TDM-FDM-Code Division Multiple Access(CDMA). Random Access protocols : ALOHA-CSMA and CSMA/CD. Local area Network: LAN addresses- Address Resolution Protocol-Reverse Address Resolution Protocol. Ethernet: Ethernet Technologies-IEEE standards-Hubs-Bridges and Switches

Module-III

Network Layer and Routing

Network Service model – Datagram and Virtual circuit service-Roting principles-Link state routing-distant vector routing-hierarchical routing-multicast routing-IGMP Internet Protocol (IP): IPv4 addressing-routing and forwarding datagram-datagram format-datagram fragmentation- ICMP- DHCP- Network Address Translators (NATs)-IPv6 packet format-transition from IPv4 to IPv6-Mobile IP. Routing in the Internet: Intra Autonomous System Routing : RIP and OSPF-Inter Autonomous System Routing : BGP – Network layer in ATM.

Module IV

Transport Layer

Transport Layer Services-Relationship between Transport Layer and Network Layer-Transport Layer in Internet-Multiplexing and De multiplexing. Connectionless Transport: UDP-Segment structure-Checksum Connection Oriented Transport: TCP-TCP connection-TCP Segment Structure-Round trip Time estimation and Time out-Reliable Data transfer-Flow control-TCP connection Management. Congestion Control: Causes and costs of congestion- Approaches to congestion control- TCP congestion control: Fairness-TCP delay modeling. ATM ABR congestion control. ATM AAL Layer protocols. Module V

Application Layer and Network Security .

Application Layer Protocols- WWW and HTTP-File transfer Protocol: FTP Commands and Replies – Domain Name System (DNS)- SMTP - SNMP- multimedia. Remote Procedure Call. Security in Computer Networks: Principles of Cryptography-Symmetric key-Public key-authentication protocols-Digital Signatures – Firewalls. Security in different Layers: Secure E-mail- SSL – IP security.

References:

1. James F. Kurose and Keith W. Ross, Computer Networking – A Top-Down ApproachFeaturing the Internet, 2/e Pearson Education, 2003

2. S. Keshav, An Engineering Approach to Computer Networkin g, Pearson education, 2002

3. F. Halsall, Data Communication, Computer Networks and Open System s, Addison Wesley, 1996

4. Andrew S. Tanenbaum, Computer Networks , 4/e, Pearson education, 2003

5. Behrouz A. Fourouzan ,Data Communications and Networking, 2/e Tat

McGrawhill,2000

6. Leon-Garcia and I. Widjaja, Communication Network s, Tata McGraw Hill, 2000

7. Bertsekas and Gallagar , Data Network s, 2/e, PHI, 1992

8. Douglas Comer and David L. Stevens, Internetworking with TCP/IP Vol. I, II, and III,Prentice Hall, New York, 1990

9. Richard Stevens. W, TCP/IP Utilities - Vol. I, The protocol s, Addison Wesley, 1994

10. Sidnie Feit, TCP/IP, Architecture, Protocols and implementatio n, McGraw-Hill, New York, 1993

11. Uyless Black, Computer Networks - Protocols, Statndards and Interface s, Prentice Hall India, New Delhi, 1994

MODULE I.

Introduction - Problem spaces and search - Production systems - Characteristics. Heuristic search techniques - Generate and Test - Hill climbing -Best fit. Graph search - A* algorithm. Problem reduction - constraint satisfaction - Means and End analysis. Game playing - Minimax - Alpha-beta cut-off.

MODULE II.

Logic and Deduction. Introduction to symbolic logic - Propositional logic - Well Formed Formula. Predicate Logic - predicates variables and constants - First order logic, Quantifiers. Forward chaining and Unification. Goal trees. Resolution by refutation.

MODULE III

Natural Language Processing - Levels of language. Expressing rules of syntax. Context Free Grammars. Dictionaries. Transformational grammar. Syntactic parsing. Top Down

4050100150

L T/D/P IM EM TM Artificial

Intelligence

CS 702

and Bottom up parsing. Transition Networks. Augmented Transition networks (ATN).Syntax to Semantics. Case grammar - Syntactic use of Semantic knowledge.MODULE IV .

Representing Knowledge. Procedural versus Declarative. Reasoning under uncertainty - Nonmonotonic reasoning - Statistical reasoning. Bayesian networks. Expert systems.-representing and using Domain knowledge - Expert system shell. Fuzzy Logic - Fuzzy sets - Fuzzy model - Fuzzy rule generation - Fuzzy inference systems. Fuzzy rule based expert systems.

MODULE V

Learning: Learning by analysing, by explaining experience, by correcting mistakes, by recording cases. Introduction to LISP and PROLOG: (Basic functions and methods of representing rules / knowledge is sufficient)References:1)Elaine Rich and Kevin Knight, “Artificial Intelligence ”, Tata McGraw-Hill Publishing Company Ltd., New Delhi, 1990

2)Dan W.Patterson, “Introduction to Artificial Intelligence and Expert Systems”,Prentice Hall India Ltd., New Delhi, 1996

3)Winston, P.H., “Artificial Intelligence”, Addison Wesley Publishing House, Reading,MA

4)Eugene Charmiak, Drew McDermott, “Introduction to Artificial Intelligence”,Addison Wesley, Reading, Massachusetts, 1985

5)Akshar Bharati, Vineet Chaitanya, Rajeev Sangal, “Natural Language Processing:A Paninian Perspective”, Prentice Hall India Ltd., New Delhi, 1996

Nils J.Nillson, ‘Principles of Artificial Intelligence”, Morgan Kauffman Publishers Inc., Palo Alto, CaliforniaRober J., Schalkoft, “Artificial Intelligence , An Engineering Approach”, McGraw-Hill Publishing Company, New York 1990

MODULE I

Analysing Algorithms and problems. Classifying functions by their asymptotic growth rate. Recursive procedures. Induction proofs. Proving correctness of procedures.Recurrence equations. Recurrence Tree-Master Theorem Design Techniques- Divide and Conquer, Dynamic Programming, Greedy, Backtracking MODULE II

Analysis of searching and sorting. Insertion sort, quick sort, merge sort and heap sort.Lower bounds for sorting by comparison of keys. Comparison of sorting algorithms.Amortized Time Analysis. Red-Black Trees. Hashing.MODULE III

Graphs and graph traversals. Strongly connected components of a Directed graph.Biconnected components of an undirected graph. Minimum Spanning tree algorithms.MODULE IV

Transitive closure of a Binary relation. Warshalls algorithm for Transitive closure. All pair shortest path in graphs. Dynamic programming. Subproblem graphs and their traversal.Constructing optimal binary search trees.MODULE V

Complexity Theory - Introduction. P and NP. NP-Complete problems. Approximation algorithms. Bin packing, Graph coloring. Travelling salesperson Problem.

References

1.Allen Van Gelder, Sara Baase, “Computer Algorithms - Introduction to Design and

Analysis”, 3rd ed., Addison Wesley, 2000

2. T. H. Corman, C. E. Lieserson, R. L. Rivest, Introduction to Algorithms, Prentice

Hall India, 1990.

3.Anany Levitin, “Introduction to the design and analysis of algorithms”,

4. A.V .Aho, J.E.Hopcroft and J.D. Ullman, “The Design and Analysis of Computer

Algorithms”, Addison Wesley Publishing House, Reading, MA, 1974

5. E Horowitz and S Sahni, “Fundamentals of Computer Algorithms”, Computer

Science Press, Rockville, MA, 1984

6.Jeffrey H.Kingston, “Algorithms and Data Structures - Design, Correctness and

Analysis “, Addison Wesley, Singapore, 1990

7.Knuth, “Art of Computer Programming V ol II, Sorting and Searching,”, Prentice

Hall

8.Anany levitin, Introduction to Design and Analysis of Algorithms, Pearson Education

MODULE I

Introduction to Parallel Processing-Shared Memory Multiprocessing-Distributed Memory-Parallel Processing Architectures- Introdution-Parallelism in sequential Machines-Abstract Model of Parallel Computer – Multiprocessor Architecture- Array Processors.

100

150

L T/D/P IM EM TM Advanced Architecture & Parallel Processing

CS 704

100

150

L T/D/P IM EM TM Analysis & Design of Algorithms

CS 703

MODULE II

Pipelining and Super Scalar Techniques-Linear Pipeline Processors-Non-Linear Pipeline processors-Instruction pipeline design-Arithmetic pipeline Design- Super Scalar and Super pipeline Design.MODULE III

Programmability Issues-An Overview-Operating system support-Types of Operating Systems-Parallel Programming models-Software Tools-Data Dependency Analysis- Types of Dependencies-Program Transformations.MODULE IV

Shared Memory Programming-Thread –based Implementation-thread Management-Attributes of Threads- Mutual Exclusion with Threads- Mutex Usage of Threads- Thread implementation-Events and Conditions variables-Deviation Computation with Threads-Java Threads Distributed Computing –Message Passing Model-General Model-Programming Model- PVM.MODULE V

Algorithms for Parallel Machines- Debugging Parallel programming –Other Parallelism Paradigms -Distributed Data Bases-Distributed Operating Systems.Text Books 1.Kai Hwang, “Advanced Computer Architecture : Parallelism, Scalability,Programmability”, McGRawHill International Edition, 1993.

M.Sasikumar, et.al., “Introduction to Parallel Processing”, PHI, New Delhi, 2000

References 1.P. Pal Chaudhuri , “Computer Organisation and Design”, PHI, New Delhi, 1994.2.William Stallings, “Computer Organisation and Architechture”, PHI, New Delhi,1996.

3.“Proceedings of Third International Conference on High Performance Computing”,IEEE, Computer Society Press , California, USA, 1996.

4.“Parellel Processing”, Learning Material Series, Indian Society for Technical Education, New Delhi, 1996.

V.Rajaraman, C. Siva Ram Murthy, “Parallel Computers Architecture and Programming”, PHI, New Delhi, 2000

CS/EE/IT 705(A) DIGITAL IMAGE PROCESSING

MODULE I

Image representation and modelling - enhancement - restoration - Image analysis and reconstruction - image data compression. Two dimensional systems - linear systems and shift invariance. Fourier transform - Z - transform - Block matrices and Kronecker products - Random signals MODULE II

Image perception - introduction - light - luminance - brightness and contrast - MTF of the visual system - visibility - function - monochrome vision models - color representation - color matching and reproduction - color vision model Image sampling and quantization - Two dimensional sampling theory -reconstruction of images from its samples -Myquistrate - aliasing - sampling thorem. Practical limits in sampling reconstruction.Image quantization - visual quantization.MODULE III

Image transforms - Two dimensional orthogonal and unitary transforms - properties of unitary transforms - one dimensional DFT - cosine, sine Harmrd and Haar transforms.MODULE IV

Image enhancement - Point operations - contrast stretching - clipping and thresholding - digital negative intensity level slicing - bit extraction. Histogram modelling - histogram equalisation - modification. Spatial operations - smoothing techniques. Magnification and interpolation. Transform operations. Color image enhancement.MODULE V

Image analysis and computer vision - spatial feature extraction - transform features.Edge detection - gradient operators - compass operators - stochastic gradients - line and spot detection.References:

1)Jain Anil K, “Fundamentals of Digital Image Processing-” , Prentice Hall 2)Gonzalez Rafel C, Wintz Paul , “Digital Image Processing”, Addison Wesley 3)Pratt William K, “Digital Image Processing, “John Wiley and Sons

4)Rosenfield Azriel, Kak Avinash C, “ Digital Picture Processing”, Academic Press

Inc

CS/IT 705(B) I NFORMATION RETRIEVAL

Module I

Introduction – Information versus Data Retrieval. Modelling of Information retrieval.Formal charectrisation of Information retrieval- Alternate set theoretic models. Alternate

100

150

L T/D/P IM EM TM Elective I

CS 705

algebric models. Alternate probablistic models. Stuctured text retreival models. Models for Browsing. Retreival Evaluation.

Module II

Query languages. Text and multimedia languages-structure-syntax, semantics. Mark up languages. Text Operations-Document pre processing. Text compression.

Module III

Indexing and searching.Inverted files. Suffix trees and suffix arrays. Boolean queries.

Sequential searching. Pattern matching. Structural queries. User interface and visualization.

MODULE IV

Parellel and Distributed Information Retreival. Implementation of Inverted files, suffix arrays and signature files in MIMD architecture. Implementation of Inverted files,suffix arrays and signature files in SIMD architechture.

MODULE V

Searching the web. Modelling the web. Web as graph. Hubs and Authorities. Web self organization. Searching the web. crawling, Indexing, Ranking web pages, Web self organisation. Searching the web, Crawling, Indexing, Ranking web pages, Web Directories.

Text Book

R. Baeza-yates and B. Riberio-Neto, Modern Information retrieval, Addison Wesley Longman, 1999

References

1.J. Kleinberg, et.al, The Web as a graph: Measurements, models and methods, Lecture

notes in computer Science, springer Verlag, 1999

2.Gary Flake et. Al, Selff- Organization and Identification of Web communities, IEEE

Computer”,V ol35, No 3,

3.Sergey Brin and Lawrence page, The anatomy of large scale hyper textual (Web)

search engine, Computer- Networks and ISDN systems, V ol 30, No, 1 - 7.

CS/EB/EC/EI/IT 705(C) ARTIFICIAL NEURAL NETWORKS MODULE I

Fundamentals of ANN – Biological prototype – Neural Network Concepts, Definitions - Activation. Functions – single layer and multilayer networks. Training ANNs –perceptrons – Exclusive OR problem – Linear seperability – storage efficiency –perceptron learning - perceptron training algorithms – Hebbian learning rule - Delta rule – Kohonen learning law – problem with the perceptron training algorithm.MODULE II

The back propagation Neural network – Architecture of the back propagation Network – Training algorithm – network configurations – Back propagation error surfaces – Back propagation learning laws – Network paralysis _ Local minima – temporal instability

MODULE III

Counter propagation Networks – Architecture of the counter propagation network –Kohonen layer – Training the Kohonen layer – preprocessing the input vectors – initializing the weight vectors – Statistical properties. Training the Grossberg layer- Feed forward counter propagation Neural Networks – Applications.

MODULE IV

Statistical methods – simulated annealing – Bloltzman Training – Cauchy training -artificial specific heat methods. Application to general non-linear optimization problems – back propagation and cauchy training.

MODULE V

Hopfield net – stability – Associative memory – statistical Hopfield networks –Applications – ART NETWORKS – GENETIC ALGORITHMS –Bidirectional Associative memories- retreiving stored information. Encoding the association –continous BAMS

References

1) Linus Fe, Neural Network in Computer Intelligence , McGrawHill

2) Philip D.Wasserman, Neural Computing(Theory and Practice)

3) Robert Hecht-Nilson, Neuro Computing

4) James A.Anderson, An Introduction to Neural Networks

5) Jack M. Zureda, Introduction to Artificial Neural Systems

CS 705(D) ADV ANCED DIGITAL SYSTEM DESIGN

MODULE I

Advanced topics in Boolean Algebra

Shannon’s expansion theorem, Conseusus theorem, Octal designation, Run measure, INHIBIT / INCLUSION /AOI / Driver / Buffer gates, Gate expander, Reed Muller expansion, Synthesis of multiple output combinational logic circuits by product map method, Design of static hazard free and dynamic hazard free logic circuits.

MODULE II

Threshold Logic Linear seperability, Unateness, Physical implementation, Dual comparability, Reduced functions, Various theorems in threshold logic, Synthesis of single gate and multigate threshold Network.

MODULE III

Symmetric Functions Elementary symmetric functions, Partially symmetric and totally symmetric functions, Mc Cluskey decomposition method, Unity ratio symmetric ratio functions, Synthesis of symmetric function by contact networks.

MODULE IV

Sequential Logic Circuits

Mealy machine, Moore machine, Trivial / Reversible / Isomorphic sequential machines, State diagrams, State table minimization, Incompletely specified sequential machines, State assignments, Design of synchronous and asynchronous sequential logic circuits working in the fundamental mode and pulse mode, Essential hazards Unger’s theorem. MODULE V

Programmable Logic Devices

Basic concepts, Programming technologies, Programmable Logic Element (PLE), Programmable Logic Array (PLA), Programmable Array Logic (PAL), Structure of Standard PLD’s, Complex PLD’s (CPLD). System Design Using PLD’s - Design of combinational and sequential circuits using PLD’s, Programming PAL device using PALASM, Design of state machine using Algorithmic State Machines (ASM) chart as a design tool. Introduction To Field Programmable Gate Arrays - Types of FPGA, Xilinx XC3000 series, Logic Cell array (LCA), Configurable Logic Blocks (CLB) Input/Output Block (IOB)- Programmable Interconnect Point (PIP), Introduction to Actel ACT2 family and Xilinx XC4000 families, Design examples.

Reference s:

1. William I. Fletche r, “ An Engineering Approach to Digital Design “ , Prentice Hall of India, 1996.

2. James E. Palme r, David E. Perlman, “ Introduction to Digital Systems “, Tata McGraw Hill, 1996.

3. N.N. Biswas, “ Logic Design Theory “, Prentice Hall of India, 1993.

4. S. Devadas, A. Ghosh and K. Keutze r, “ Logic Synthesis “, Mc Graw Hill, 1994.

2. CS 706 NETWORK AND OPERATING SYSTEMS LAB

1.Study of system level calls of a suitable multitasking operating system. Exercises

involving the system calls. (E.g. fork(),exec(),create() etc. in UNIX.)

2.Inter process communication. Shared memory, messages, Semaphores and monitors.

Implementation of typical problems(E.g. Bounded buffer, Dining Philosophers. etc.)

3.Study of Communication protocols. TCP/IP or a suitable protocol. Client server

programming. Distributed algorithms. performance modelling of networks.4.Internet programming using a suitable programming language and Operating system

(E.g. JAVA)

References

1.Douglas https://www.wendangku.net/doc/6515578498.html,er, Hands on Networking with Internet Technologies, Pearson

Education.

2. Bach, M.J., “Design of UNIX Operating System”, Prentice Hall

1. Implementing Line ,Circle and Ellipse drawing algorithms

2. Implementing scan line polygon filling algorithm

3. Implementing seed filling algorithms –flood fill, Boudary fill ( recursive and non recursive)

4. Implementing line clipping methods

5. Implementing polygon clipping methods

6. Generation of different 2D patterns and images.

7. 2D transformations using homogeneous coordinates

8. Generating Bazier and B-spine curves

9. Implementation of Hidden surface elimination techniques of 3D objects

10. Implementation of Shading methods for 3D objects

11. Implementation of animation methods.

12. Programming using Open GL

(Can be done as a development of a small 2D/3D graphics package or Game using OpenGL)

References:

1. Donald Hearn ,M Pauline Baker, Computer Graphics C version, 2/E

Pearson Education ,2003

2. James D.Foley ct.al., Introduction to Computer Graphics, Addison Wesley Publishing Company, 1994.

3. Mason Woo et.al, OpenGL Programming Guide – The official guide to OpenGL, 3rd Edition, OpenGL Architecture Review board

4. Noman Lin, Linux 3D Graphics Programming, Worldwide Game Development

Library.

5. Ron Fosner, OpenGL programming for Windows 95 and Windows NT

37575150

L T/D/P IM EM TM Computer Graphics

Lab

CS 707

Each student shall individually prepare and submit a seminar report on a topic of current relevance on stipulated time. Few panels consisting of three teachers (internal) each should evaluate the seminar report and the presentation. Marks should be distributed considering report writing, presentation, technical content, depth of knowledge, brevity and references and their participation in seminar. The time allotted for presentation is 30 minutes.

SEMESTER VIII

MODULE 1

Introduction – Security problem in computing – Elementary Cryptography – Introduction – Substitution ciphers – Transpositions – Encryption Algorithms – DES – AES – Public key encryption – Uses of encryption.MODULE 2

Program security – Secure programs – Nonmalicious program errors – Viruses and other malicious code – Targeted malicious code – Controls against program threats MODULE 3

Protection in general purpose operating systems – Protected objects and Methods of protection – Memory and address protection – Control of access to general objects –File protection mechanisms – User authentication – Designing – Trusted operating systems – Security policies – Models of security – Trusted operating system design – Assurance in trusted operating systems.MODULE 4

Data base security – Introduction – Security requirements – Reliability and Integrity –Sensitive data – Inference – Multilevel databases – Proposals for multilevel security.MODULE 5

Security in Networks – Threats in networks – Network security controls – Firewalls –Intrusion detection systems.Reference:

1. Charles. P. Pfleeger & Shari Lawrence Pfleeger, Security in Computing, – 3/e –

Pearson Education.

2.William Stallings, Network Security Essentials, Applications and Standards Pearson

Education.

3.William Stallings, Cryptography and Network Security Principles and practice. 2/e,

Pearson Education.

4.Michael. E. Whitman and Herbert J. Mattord – Principles of Information Security.

MODULE I

Distributed systems – architecture. Key characteristics – resource sharing openness –concurrency – scalability – fault tolerance – transparency. Design issues – naming –communication – software structure – workload allocation – consistency https://www.wendangku.net/doc/6515578498.html,er requirement – functionality – Quality of service – reconfigurability. Review of network protocols. Interprocess communication- building blocks – client server communication group communication. Interprocess communication in UNIX. Remote procedure calling. Design issues – interface definition language exception handling.Implementation - interface processing – communication handling. Binding. Case study – sun RPC – Java RMI.MODULE II

Distributed Operating systems- kernel – processes and threads – Naming and protection - Communication and Invocation – virtual memory. Distributed file service - design issues – interfaces – implementation techniques. Case study sun NFS. Name service SNS and DNS.MODULE III

Time and co-ordination. Synchronizing physical clocks -logical time and logical clocks.Distributed co-ordination –distributed mutual exclusion – elections. Replication – basic architectural model – consistency and request ordering.MODULE IV

Shared data and transactions – client server – fault tolerance and recovery – transactions – nested transactions. Concurrency control - locks – optimistic concurrency control –timestamp ordering. Distributed transactions – atomic commit protocols – concurrency control in distributed transactions – distributed deadlocks – transactions with replicated data.MODULE V

100

150

L T/D/P IM EM TM Security in Computing

CS 801

100

150

L T/D/P IM EM TM Distributed Computing

CS 802

250050L T/D/P IM EM TM Seminar

CS 708

《积分变换与数理方程》教学大纲

《积分变换与数理方程》教学大纲课程编号：112004 开课学期：4 适用专业：电子信息科学与技术编写教师：赵玉泉学时：36 学分：2 审核：彭光含第一部分说明一、课程的性质、作用《积分变换与数理方程》是继《高等数学》之后的一门数学课程，是电子信息科学与技术专业学生的必选课。其中积分变换是《信号与线性系统分析》课程的一部分，为使学生更集中地学习《信号与线性系统分析》的理论知识而将这部分数学知识从中分离出来，单独组成本课程。因此学生只有具备了本课程的基础知识和基本技能，才可能学习《信号与线性系统分析》等专业课程。即该课程内容是以后学习多门专业课程的必备工具。二、课程的任务与基本要求本课程内容主要有：信号与信号的基本运算、卷积与卷积和、傅立叶变换、拉普拉斯变换及Z变换。这些内容要求学生都必须掌握。信号部分，要求学生掌握信号的种类、信号的基本运算、阶跃函数及冲激函数定义与运算。卷积及卷积和部分，要求学生掌握卷积的定义、性质及计算方法。傅立叶变换部分，要求掌握傅立叶级数、傅立叶变换的定义及性质。拉普拉斯变换部分，要求学生掌握拉普拉斯变换的定义、性质及逆变换。离散信号的Z变换，要求掌握Z变换的定义、性质。三、教学方法建议积分变换与数理方程课程，其理论性很强。从教学的实际情况看，学生普遍感到难度大。因此，在教学方法上一般宜采用教师讲授。对于积分变换，学生感觉困难的主要原因是公式多，记不住。有的学生虽记住了公式，但不能灵活运用。建议： 1、冲击函数的教学，最好不涉及广义函数的概念和理论，以免学生感到复杂难懂。

2、信号与积分变换中，图像多，宜制作一批教学挂图或幻灯片辅助教学。 3、要引导学生适当复习，寻找公式的记忆方法，务必熟记公式。 4、要多列举范例，帮助学生理解公式，学会如何综合运用公式。四、本课程与其他课程的关系为学习本课程，学生必须具备较扎实的复数、级数、三角函数、待定系数等初等数学知识与复变函数、导数、积分等高等数学知识，具备一定的普通物理特别是电磁学方面的知识。因此，该课程以初等数学、高等数学、电磁学等课程为基础，同时它又是学习《信号与线性系统分析》、《电路》等课程的基础。第二部分本文一、基本内容与学时分配（一）信号１、复数的知识………………………………………………………………(１学时) 教学内容要点：（１）、复数的三种表示式（２）、正、余弦函数的指数形式２、信号………………………………………………………………………（1学时）教学内容要点：（１）、连续信号和离散信号（２）周期信号和非周期信号（３）、实信号和复信号３、阶跃函数和冲激函数……………………………………………………（３学时）教学内容要点：（１）、阶跃函数和单位阶跃函数序列（２）、冲激函数和单位序列（３）、冲激函数的导函数和积分（４）、冲激函数的性质 4、信号的基本运算…………………………………………………………（2学时）教学内容要点：（1）、加法和乘法（2）、平移和反转（3）、尺度变换（二）卷积 1、卷积积分…………………………………………………………………(2学时) 教学内容要点：（1）、卷积积分定义（2）、卷积的图示（3）、卷积的计算 2、卷积积分的性质………………………………………………………（2学时）教学内容要点：（1）、卷积的代数运算（2）、函数与冲激函数的卷积（3）、卷积的微分与积分 3、卷积和……………………………………………………………………(2学时) 教学内容要点：（1）、卷积和定义（2）、卷积和的图示（3）、卷积和的性质

离散傅里叶变换的分析与研究

XXXX大学 2012届学士学位论文离散傅里叶变换的分析与研究学院、专业物理与电子信息学院电子信息工程研究方向数字信号处理学生姓名XX 学号 XXXXXXXXXXX 指导教师姓名XXX 指导教师职称讲师 2012年4月26日

离散傅里叶变换的分析与研究 XX 淮北师范大学物理与电子信息学院 235000 摘要离散傅里叶变换是连续傅里叶变换在时域和频域上都离散的形式，是对连续时间信号频谱分析的逼近。离散傅里叶变换不仅在理论上有重要意义，而且在各种信号的处理中亦起着核心作用。本文首先介绍了离散傅里叶变换的定义及性质，然后介绍了离散傅里叶变换的应用，主要包括对线性卷积的计算和对连续信号的谱分析。在理解理论的基础上，在matlab环境下实现了线性卷积和对连续信号频谱分析的仿真。仿真结果表明：当循环卷积长度大于或等于线性卷积长度时，可利用循环卷积计算线性卷积；利用DFT对连续信号进行频谱分析必然是近似的，其近似的结果与信号带宽，采样频率和截取长度都有关。关键词离散傅里叶变换；线性卷积；谱分析

The Analysis and Research of Discrete Fourier Transform XX School of Physics and Electronic Information, Huai Bei Normal University, Anhui Huaibei, 235000 Abstract The discrete Fourier transform is the form that the continuous Fourier transform are discrete both in the time domain and frequency domain,it is a approach to the analysis of continuous time signal spectrum . The discrete Fourier transform not only has important significance in theory, but also plays a central role in all kinds of signal processing . This paper introduced the definition and properties of the discrete Fourier transform first of all.Then introduced the application of the discrete Fourier transform, which mainly including the calculation of linear convolution and analysis of continuous signal the spectral. On the basement of understanding theory, we realized the linear convolution and analysis of continuous signal spectrum on the Matlab environment . The simulation results show that when the length of the cyclic convolution is equal to or greater than linear convolution,we can use cyclic convolution to calculate linear convolution;It is approximately use continuous DFT spectrum to analyze the frequency domain of continuous time signal, the approximation of the results is related to the signal bandwidth, sampling frequency and intercept length. Keywords The discrete Fourier transform; Linear convolution; Spectrum analysis

量子力学期末考试题解答题

1. 你认为Bohr 的量子理论有哪些成功之处？有哪些不成功的地方？试举一例说明。 (简述波尔的原子理论，为什么说玻尔的原子理论是半经典半量子的？) 答：Bohr 理论中核心的思想有两条：一是原子具有能量不连续的定态的概念；二是两个定态之间的量子跃迁的概念及频率条件。首先，Bohr 的量子理论虽然能成功的说明氢原子光谱的规律性，但对于复杂原子光谱，甚至对于氦原子光谱，Bohr 理论就遇到了极大的困难（这里有些困难是人们尚未认识到电子的自旋问题），对于光谱学中的谱线的相对强度这个问题，在Bohr 理论中虽然借助于对应原理得到了一些有价值的结果，但不能提供系统解决它的办法；其次，Bohr 理论只能处理简单的周期运动，而不能处理非束缚态问题，例如：散射；再其次，从理论体系上来看，Bohr 理论提出的原子能量不连续概念和角动量量子化条件等，与经典力学不相容的，多少带有人为的性质，并未从根本上解决不连续性的本质。 2. 什么是光电效应？光电效应有什么规律？爱因斯坦是如何解释光电效应的？答：当一定频率的光照射到金属上时，有大量电子从金属表面逸出的现象称为光电效应；光电效应的规律：a.对于一定的金属材料做成的电极，有一个确定的临界频率0υ，当照射光频率0υυ<时，无论光的强度有多大，不会观测到光电子从电极上逸出；b.每个光电子的能量只与照射光的频率有关，而与光强无关；c.当入射光频率0υυ>时，不管光多微弱，只要光一照，几乎立刻910s -≈观测到光电子。爱因斯坦认为：(1)电磁波能量被集中在光子身上，而不是象波那样散布在空间中，所以电子可以集中地、一次性地吸收光子能量，所以对应弛豫时间应很短，是瞬间完成的。(2)所有同频率光子具有相同能量，光强则对应于光子的数目，光强越大，光子数目越多，所以遏止电压与光强无关，饱和电流与光强成正比。(3)光子能量与其频率成正比，频率越高，对应光子能量越大，所以光电效应也容易发生，光子能量小于逸出功时，则无法激发光电子。 3．简述量子力学中的态叠加原理，它反映了什么？答：对于一般情况，如果1ψ和2ψ是体系的可能状态，那么它们的线性叠加：1122c c ψψψ=+（12c c ，是复数）也是这个体系的一个可能状态。这就是量子力学中的态叠加原理。态叠加原理的含义表示当粒子处于态1ψ和2ψ的线性叠加态ψ时，粒子是既处于态1ψ，又处于态2ψ。它反映了微观粒子的波粒二象性矛盾的统一。量子力学中这种态的叠加导致在叠加态下观测结果的不确定性。 4. 什么是定态？定态有什么性质？答：体系处于某个波函数()()[]exp r t r iEt ψψ=-，所描写的状态时，能量具有确定值。这种状态称为定态。定态的性质：（1）粒子在空间中的概率密度及概率流密度不随时间变化；（2）任何力学量（不显含时间）的平均值不随时间变化；（3）任何力学量（不显含时间）取各种可能测量值的概率分布也不随时间变化。 5. 简述力学量与力学量算符的关系？答：算符是指作用在一个波函数上得出另一个函数的运算符号。量子力学中采用算符来表示微观粒子的力学量。如果量子力学中的力学量F 在经典力学中有相应的力学量，则表示这个力学量的算符?F 由经典表示式F （r,p ）中将p 换为算符?p 而得出的，即：

离散傅立叶变换及谱分析

数字信号处理实验实验二、离散傅立叶变换及谱分析学院：信息工程学院班级：电子101班姓名：*** 学号：******

一、实验目的 1．掌握离散傅里叶变换的计算机实现方法。 2．检验实序列傅里叶变换的性质。 3．掌握计算序列的循环卷积的方法。 4．学习用DFT对连续信号和时域离散信号进行谱分析的方法，了解可能出现的分析误差，以便在实际中正确应用DFT。二、实验内容 1．实现序列的离散傅里叶变换并对结果进行分析。（自己选择序列，要求包括复序列，实序列，实偶序列，实奇序列，虚奇序列）本例检验实序列的性质DFT[xec(n)]=Re[X(k)] DFT[xoc(n)]=Im[X(k)] (1)设 x(n)=10*(0.8).^n（0<=n<=10），将x(n)分解为共扼对称及共扼反对称部分 n=0:10; x=10*(0.8).^n; [xec,xoc]=circevod(x); subplot(2,1,1);stem(n,xec); title('Circular -even component') xlabel('n');ylabel('xec(n)');axis([-0.5,10.5,-1,11]) subplot(2,1,2);stem(n,xoc); title('Circular -odd component') xlabel('n');ylabel('xoc(n)');axis([-0.5,10.5,-4,4]) figure(2) X=dft(x,11); Xec=dft(xec,11); Xoc=dft(xoc,11); subplot(2,2,1);stem(n,real(X));axis([-0.5,10.5,-5,50]) title('Real{DFT[x(n)]}');xlabel('k'); subplot(2,2,2);stem(n,imag(X));axis([-0.5,10.5,-20,20]) title('Imag{DFT[x(n)]}');xlabel('k'); subplot(2,2,3);stem(n,Xec);axis([-0.5,10.5,-5,50]) title('DFT[xec(n)]');xlabel('k'); subplot(2,2,4);stem(n,imag(Xoc));axis([-0.5,10.5,-20,20]) title('DFT[xoc(n)]');xlabel('k'); 实验说明：复数序列实数部分的离散傅立叶变换是原来序列离散傅立叶变换的共轭对称分量，复数序列虚数部分的离散傅立叶变换是原来序列离散傅立叶变换的反对称分量，复序列共轭对称分量的离散傅立叶变换是原来序列离散傅立叶变换的实数部分，复序列反对称分量的离散傅立叶变换是原来序列离散傅立叶变换的虚数部分。

量子力学的矩阵形式和表象变换.

§4.5 量子力学的矩阵形式和表象变换态和力学量算符的不同表示形式称为表象。态有时称为态矢量。力学量算符对态的作用实际上是对矢量量进行变换，因此可与代数中线性变换进行类比。 1、量子态的不同表象幺正变换（1）直角坐标系中的类比取平面直角坐标系21X OX 其基矢（我们过去称之为单位矢）可表示为21,e e ,见图其标积可写成下面的形式 )2,1,(),(==j i e e ij j i δ 我们将其称之为基矢的正交归一关系。平面上的任一矢量A 可以写为 2211e A e A A += 其中),(11A e A =，),(22A e A =称为投影分量。而),(21A A A = 称为A 在坐标系21X OX 中的表示。现在将坐标系21X OX 沿垂直于自身面的轴顺时针转θ角度，则单位基矢变为','21e e ，且同样有 )2,1,()','(==j i e e ij j i δ 而平面上的任一矢量A 此时可以写为 ''''2211e A e A A += 其中投影分量是),'('11A e A =，),'('22A e A =。而)','(21A A A = 称为A 在坐标系'X 'OX 21中的表示。现在的问题是：这两个表示有何关系？显然，22112211''''e A e A e A e A A +=+=。

用'1e 、'2e 分别与上式中的后一等式点积（即作标积），有 ),'(),'('2121111e e A e e A A += ),'(),'('2221212e e A e e A A += 表成矩阵的形式为 ??? ? ?????? ??=???? ??212212211121),'(),'(),'(),'(''A A e e e e e e e e A A 由于'1e 、1e 及'2e 、2e 的夹角为θ，显然有 ??? ? ?????? ??-=??? ? ?????? ??=???? ??21212212211121cos sin sin cos ),'(),'(),'(),'(''A A A A e e e e e e e e A A θθθθ 或记为 ??? ? ??=???? ??2121)(''A A R A A θ 其中 ??? ? ? ?-=θθ θθθcos sin sin cos )(R 是把A 在两坐标中的表示???? ??''21A A 和??? ? ??21A A 联系起来的变换矩阵。变换矩阵的矩阵元正是两坐标系基矢间的标积，它表示基矢之间的关系。故R 给定，任何矢量在两坐标系间的关系也确定。很容易证明，R 具有下述性质： I R R R R ==~ ~ 由于1)(det )~ det(2==R R R , 其中 321321)1()det(p p p t R R R R -∑=，故称这种矩阵为正交矩阵。但1det =R （对应于真转动（proper rotation ））且R R =* （实矩阵）

积分变换

积分变换、数学物理方程与特殊函数经过十二周的学习，我们学到了很多知识，这与以后的学习和工作打下了基础，老师讲解十分认真，讲课效果很好。由于现在还处于理论的学习阶段，无法将学到的这些内容应用到实际问题中，但我相信，在以后的实验和实际问题中肯定能发挥相当大的作用。这门课是数学的更深一个层次，与高等数学的关系密不可分。下面就我学习的状况谈一下我对这门课的认识。首先学习的是《积分变换》的内容，我们主要学习了Fourier 变换、逆变换及其应用。Fourier 积分变换相对于后面学到的《数学物理方程》偏重于理论，其中与多种函数和理论密切相关，Fourier 变换中经常用到欧拉公式。复数形式的欧拉公式： ?? ???-=+=-=+= ---x i x e x i e i e e n w t e e n w t ix ix inwt inwt inwt inwt sin cos ,sin cos 2sin ,2cos 其中有三个基本函数，在学习《积分变换》时经常用到； 1.单位阶跃函数： ?? ?<>=0 ,00,1)(t t t u 可以用阶跃函数吧分段函数表达出来。 2.矩形脉冲函数： ???????><=2,02 ,τττ t t E t P ）（ 3.δ函数： ? ??≠=∞+=0,00 ,)(x x x δ 表示密度分布的极限。 δ函数具有筛选性质： )0()()(-f dx x f x =? +∞ ∞ δ 其一般形式为：)()()(0-0x f dx x f x x =-?+∞∞ δ 同时还学习了卷积定理：假定)(1t f ，)(2t f 都是满足Fourier 积分定理中的条件，且[])()(11w F t f =?，[])()(22w F t f =?，则

学习复变函数与积分变换的心得

学习复变函数与积分变换的心得这个学期我们学习了复变函数与积分变换这门课程，虽然它同概率统计一样也是考查课，但它的应用及延伸远比概率统计广，复杂得多。我从中学到了很多，上课也感受到了这门课程的魅力及授课老师的精彩的讲课。每周二都很空闲，除了体育课就没课了，又因为这门课程是公共考查课，是四个班级在一起上课，所以有时候经常想逃课，但自从上了梁老师的一堂课，就感觉到了他是一个很负责的老师，他每次来教室都来得很早，他很喜欢点名，上课上的也很生动，他经常会叫同学上黑板做题目，来检查学生学得怎么样，他不希望同学带早餐进教室。以后的星期二基本上都没逃过课，我深深地被复变函数与积分变换这门课程给吸引住了。关于这门课程，首先，它作为一门工科类各专业的重要基础理论课程，它与工程力学、电工技术、电磁学、无线电技术、信号系统和自动控制等课程的联系十分密切，其理论方法应用广泛。同时，作为一门工程数学的课程，它主要是以工程背景为依托来展开讨论和研究的，其前提就是为了服务于实际工程。其次，复变函数与积分变换作为一门工程数学课程，概念晦涩难懂、计算繁琐和逻辑推理不易理解。它既具有传统数学的一些特点，又具有与实际工程相结合才能理解的特点。传统数学主要注重对于基本概念的理解和对理论的讲解，要求理论推导具有严密的逻辑性，而不太注重其实际应用。而工程数学在推导定理或概念的过程中就会出现一些不完全符合严密逻辑的推理，但在现实中又是实实在在存在的一些特殊情况。如单位脉冲函数，对于集中于一点或一瞬时的量如点电荷、脉冲电流等，这些物理量都可以用通常的函数形式来描述。复变函数是在实变函数的基础上产生和发展起来的一个分支，复变函数与积分变换中的理论和方法不仅是数学的许多后续课程如数理方程泛函分析多复变函数调和分析等课程的基础，而且在其它自然科学和各种工程技术领域特别是信号处理以及流体力学电磁学热学等的研究方面有着广泛的应用，可以说复变函数与积分变换既是一门理论性较强的课程，又是解决实际问题的有力工具各高校普遍将复变函数与积分变换课程作为工科各专业的一门重要的必修科来开设，尤其作为电子、机电自动化等电力专业的学生而言，该课程更是一门必不可少的专业基础类必修课，它为电路分析信号与系统以及自动控制原理等后续专业课程的学

理解离散傅立叶变换

理解离散傅立叶变换（一） ------傅立叶变换的由来关于傅立叶变换，无论是书本还是在网上可以很容易找到关于傅立叶变换的描述，但是大都是些故弄玄虚的文章，太过抽象，尽是一些让人看了就望而生畏的公式的罗列，让人很难能够从感性上得到理解，最近，我偶尔从网上看到一个关于数字信号处理的电子书籍，是一个叫Steven W. Smith, Ph.D.外国人写的，写得非常浅显，里面有七章由浅入深地专门讲述关于离散信号的傅立叶变换，虽然是英文文档，我还是硬着头皮看完了有关傅立叶变换的有关内容，看了有茅塞顿开的感觉，在此把我从中得到的理解拿出来跟大家分享，希望很多被傅立叶变换迷惑的朋友能够得到一点启发，这电子书籍是免费的，有兴趣的朋友也可以从网上下载下来看一下，URL地址是： https://www.wendangku.net/doc/6515578498.html,/pdfbook.htm 要理解傅立叶变换，确实需要一定的耐心，别一下子想着傅立叶变换是怎么变换的，当然，也需要一定的高等数学基础，最基本的是级数变换，其中傅立叶级数变换是傅立叶变换的基础公式。一、傅立叶变换的提出让我们先看看为什么会有傅立叶变换？傅立叶是一位法国数学家和物理学家的名字，英语原名是Jean Baptiste Joseph Fourier(1768-1830), Fourier对热传递很感兴趣，于1807年在法国科学学会上发表了一篇论文，论文里描述运用正弦曲线来描述温度分布，论文里有个在当时具有争议性的决断：任何连续周期信号都可以由一组适当的正弦曲线组合而成。当时审查这个论文的人，其中有两位是历史上著名的数学家拉格朗日(Joseph Louis Lagrange, 1736-1813)和拉普拉斯(Pierre Simon de Laplace, 1749-1827)，当拉普拉斯和其它审查者投票通过并要发表这个论文时，拉格朗日坚决反对，在近50年的时间里，拉格朗日坚持认为傅立叶的方法无法表示带有棱角的信号，如在方波中出现非连续变化斜率。法国科学学会屈服于拉格朗日的威望，否定了傅立叶的工作成果，幸运的是，傅立叶还有其它事情可忙，他参加了政治运动，随拿破仑远征埃及，法国大革命后因怕会被推上断头台而一直在逃避。直到拉格朗日死后15年这个论文才被发表出来。谁是对的呢？拉格朗日是对的：正弦曲线无法组合成一个带有棱角的信号。但是，我们可以用正弦曲线来非常逼近地表示它，逼近到两种表示方法不存在能量差别，基于此，傅立叶是对的。为什么我们要用正弦曲线来代替原来的曲线呢？如我们也还可以用方波或三角波来代替呀，分解信号的方法是无穷多的，但分解信号的目的是为了更加简单地处理原来的信号。用正余弦来表示原信号会更加简单，因为正余弦拥有原信号所不具有的性质：正弦曲线保真

量子力学的表象与表示

第五章量子力学的表象与表示 §5.1 幺正变换和反幺正变换 1, 幺正算符定义对任意两个波函数)(r ?、)(r ψ，定义内积 r d r r )()(),(ψ?ψ?*?= (5.1) 按第一章中所说，(5.1)式的含义是：当微观粒子处在状态()r ψ时，找到粒子处在状态()r ?的概率幅。依据内积概念，可以定义幺正算符如下： “对任意两个波函数?、ψ，如果算符 U 恒使下式成立 ),()?,?(ψ?ψ?=U U (5.2) 而且有逆算符1?-U 存在，使得I U U U U ==--11????1，称这个算符U ?为幺正算符。” 任一算符A ?的厄米算符+A ?定义为：+A ?在任意?、ψ中的矩阵元恒由下式右方决定 ??(,)(,)A A ?ψ?ψ+= (5.3) 由此，幺正算符U ?有另一个等价的定义： “算符U ?为幺正算符的充要条件是 I U U U U ==++???? (5.4a) 或者说 1??-+=U U 。” (5.4b) 证明：若),()?,?(ψ?ψ?=U U 成立，则按+U ?定义， ),??()?,?(),(ψ?ψ?ψ?U U U U +== 由于?、ψ任意，所以 I U U =+?? 又因为U ?有唯一的逆算符1?-U 存在，对上式右乘以1?U -，即得 1??U U +-= 这就从第一种定义导出了第二种定义。类似，也能从第二种定义导出第一种定义。从而，幺正算符的这两种定义是等价的。 2, 幺正算符的性质幺正算符有如下几条性质： i, 幺正算符的逆算符是幺正算符证明：设 1-+=U U ，则()()(),1 11--+++-===U U U U 所以1-U 也是幺正 1 这里强调了 U -1 既是对 U 右乘的逆又是对 U 左乘的逆。和有限维空间情况不同，无限维空间情况下，任一算符 U 有逆算符的三种情况：1）有一个左逆算符和无穷多个右逆算符；2）有一个右逆算符和无穷多个左逆算符；3）有一个左逆算符和一个右逆算符，并且它俩相等，唯有此时可简单地写为 U -1 。

离散傅里叶变换

第三章离散傅里叶变换离散傅里叶变换不仅具有明确的物理意义，相对于DTFT他更便于用计算机处理。但是，直至上个世纪六十年代，由于数字计算机的处理速度较低以及离散傅里叶变换的计算量较大，离散傅里叶变换长期得不到真正的应用，快速离散傅里叶变换算法的提出，才得以显现出离散傅里叶变换的强大功能，并被广泛地应用于各种数字信号处理系统中。近年来，计算机的处理速率有了惊人的发展，同时在数字信号处理领域出现了许多新的方法，但在许多应用中始终无法替代离散傅里叶变换及其快速算法。 § 3-1 引言一.DFT是重要的变换 1.分析有限长序列的有用工具。 2.在信号处理的理论上有重要意义。 3.在运算方法上起核心作用，谱分析、卷积、相关都可以通DFT在计算机上实现。二.DFT是现代信号处理桥梁 DFT要解决两个问题：一是离散与量化，二是快速运算。傅氏变换 § 3-2 傅氏变换的几种可能形式一.连续时间、连续频率的傅氏变换-傅氏变换

对称性：时域连续，则频域非周期。反之亦然。二.连续时间、离散频率傅里叶变换-傅氏级数时域信号频域信号连续的非周期的非周期的连续的 t ? ∞ ∞ -Ω-= Ωdt e t x j X t j )()(:? ∞ ∞ -ΩΩ Ω= d e j X t x t j )(21 )(:π 反

*时域周期为Tp, 频域谱线间隔为2π/Tp 三.离散时间、连续频率的傅氏变换 --序列的傅氏变换 p T 0= Ω时域信号频域信号连续的周期的非周期的离散的 ? -Ω-= Ω2 /2 /00)(1 )(:p p T T t jk p dt e t x T jk X 正∑ ∞ -∞ =ΩΩ= k t jk e jk X t x 0)()(:0反

离散系统分析和离散傅里叶变换讲解

第四章离散系统分析和离散傅里叶变换 4-1概述在上一章中我们已经介绍了连续时间信号（周期的或非周期的）的傅里叶变换。在第一、二章中介绍了离散信号和离散系统的概念，在这一章中主要讨论离散信号的傅里叶变换。 4-2离散信号的傅里叶变换时域抽样定理告诉我们，连续时间信号可以由它的样本值恢复出来，即 ]2 ) ([ )()(∑ ∞ -∞ =-Ω= n s nT t Sa nT f t f 当抽样频率s Ω给定时，抽样函数]2 ) ([ nT t Sa s -Ω就确定了，唯一与信号相关的是信号的样本值)(nT f ，换句话说传载)(t f 中信息的是样本值)(nT f 。因此研究连续时间信号)(t f 中的信息，就转变为研究样本值)(nT f 中的信息。当抽样频率s Ω给定时，T 也就一定了，样本值)(nT f 就可以抽象为序列)(n f ，也就是说离散信号的数学抽象是序列。以后我们就用序列)(n f 表示离散信号（样本值）。由于序列的变量是整数变量，与连续信号的变量不同，因此对序列的处理方法与连续时间变量的处理方法也必定不同。先来看看序列的傅里叶变换，连续非周期时间信号)(t f 的傅里叶变换为 ? ∞ ∞ -Ω-= =Ωdt e t f t f F t j )(])([)(F ? ∞ ∞ -ΩΩΩ= Ω=d e F F t f t j -)(21 )]([)(1 π F 假定)(n f 是非周期的，仿照连续时间信号的傅里叶变换形式可以定义序列的傅里叶变换： ∑∞ -∞ =-= n jn j e n f e F ω ω )()( （4-1） ?- = π πωω ωπ d e e F n f jn j )(21 )( （4-2）式中ω为数字角频率。（4-1）式和（4-2）式构成了序列的傅里叶变换对，前者称为序列的傅里叶正变换，后者称为序列的傅里叶逆变换。注意到序列傅里叶正变换公式是个和式，这是因为序列)(n f 的变量是离散的整数，序列的傅里叶逆变换公式是个积分式，由此也说明序列的傅里叶变换是ω的连续函数，也就是说，离散信号的傅里叶变换是频域中连续的函数。此外因

复变函数与积分变换与高等数学的异同(完整版)

文章编号:XXXX—XXXX（2014）01 0005 03 复变函数与积分变换与高等数学相关内容的异同管会超1 （中国民航大学飞行器动力工程，河北，保定，120141607）摘要：复变函数与积分变换和高等数学的联系是很紧密的，复变函数中的许多理论，概念和方法是实变函数在复数域的推广。但我们也要明白它与实变函数的许多不同之处，更好的学习它们的相同于不同，真正的掌握知识提高自己的能力，为以后解决实际问题而运用。关键词：复函数，极限，实函数，留数，洛朗级数，傅里叶、拉普拉斯变换，解析函数中图分类号：TU973+.255文献标识码：C Similarities and differences ofcomplex functionandintegral transformandhigher mathematicsrelated content GUAN huichao (China Civil Aviation University ofaircraft engineering, Hebei, Baoding, 120141607) Abstract：ContactsComplexfunctionsandintegral transformandmathematicsarevery close, complex functionofmany theories, concepts and methodsarereal variable functionin promotingcomplex field. But we alsounderstand thatit's a lotdifferent from thereal variable function, the bettertheylearnthe sameina different, truly masterthe knowledgeto improve theirabilityto solve practicalproblemsfor futureuse. Keywords：Complex functions, limits, real function, leaving few, Laurent series, Fourier, Laplace transform, analytic function 引言：在大学的科目中有许多科目是紧紧相连的，这些联系使得各科之间使学习起来有连贯性，但是在相同之中又存在着不同点，本文就复变函数与积分变换和高等数学中的异同进行讨论，分别从复变函数和高等数学之间来进行叙述。 1、复变函数的极限和连续性复变函数的极限: 复变函数极限的定义在叙述形式上与一元函数的极限一致。即：定义[1]:设A为复常数，函数() w f z =在点0 z的去心邻域 0z zρ <-<内有定义。如果对于任意给定的整数ε，总可以找到相应的整数() δδρ ≤，使得当 0z zρ <-<时恒有() f z Aε -<，则称A为() f z当 z z →时的极限。记作0 lim()()() z z f z A f z A z z → =→→ 或

离散傅里叶变换和快速傅里叶变换

实验报告课程名称：信号分析与处理指导老师成绩：实验名称：离散傅里叶变换和快速傅里叶变换实验类型：同组学生姓名：一、实验目的和要求（必填）二、实验内容和原理（必填）三、主要仪器设备（必填）四、操作方法和实验步骤五、实验数据记录和处理六、实验结果与分析（必填）七、讨论、心得一、实验目的和要求 1. 掌握DFT 的原理和实现 2. 掌握FFT 的原理和实现，掌握用FFT 对连续信号和离散信号进行谱分析的方法。二、实验内容和原理 2.1 DTFT 和DFT 序列x (n )的离散事件傅里叶变换（DTFT ）表示为：n j n j e n x e X Ω-∞ -∞ =Ω ∑= )()( ，如果x (n )为因果有限长序列，n =0,1,...,N-1，则x (n )的DTFT 表示为：n j N n j e n x e X Ω--=Ω ∑=1 )()( ， x(n)的离散傅里叶变换（DFT ）表达式为：)1,...,1,0()()(21 -== --=∑N k e n x k X nk N j N n π ，序列的N 点DFT 是DTFT 在 [0,2π]上的N 点等间隔采样，采样间隔为2π/N 。通过DFT ，可以完成由一组有限个信号采样值x (n )直接计算得到一组有限个频谱采样值X (k )。X (k )的幅度谱为)()()(22k X k X k X I R +=，X R (k)和X I (k)分别为X(k)的实部和虚部。X (k )的相位谱为) () (arctan )(k X k X k R I =?。

离散傅里叶反变换（IDFT ）定义为)1,...,1,0()(1 )(21 -== ∑-=N n e k X N n x nk N j N n π 。 2.2 FFT 快速傅里叶变换（FFT ）是DFT 的快速算法，它减少了DFT 的运算量，使数字信号的处理速度大大提高。三、主要仪器设备 PC 一台，matlab 软件四、实验内容 4.1第一题求有限长离散时间信号x (n )的离散时间．．傅里叶变换（DTFT ）X (e j Ω )并绘图。（1）已知?? ?≤≤-=其他 0221)(n n x ；（2）已知1002 )(≤≤=n n x n 。 4.1.1理论分析 1) 由DTFT 计算式， ()25 2.5 2.52 0.50.52 e 1e e e sin(2.5) ()()e e 1e e e sin(0.5) j j j j j n j n j j j n n X x n Ω-ΩΩ-Ω+∞ -Ω-Ω-Ω Ω-Ω=-∞ =---ΩΩ= = = == --Ω∑∑ X （Ω）是实数，可以直接作出它的图像。

量子力学矩阵形表象变换

————————————————————————————————作者：————————————————————————————————日期：

§4.5 量子力学的矩阵形式和表象变换态和力学量算符的不同表示形式称为表象。态有时称为态矢量。力学量算符对态的作用实际上是对矢量量进行变换，因此可与代数中线性变换进行类比。 1、量子态的不同表象幺正变换（1）直角坐标系中的类比取平面直角坐标系21X OX 其基矢（我们过去称之为单位矢）可表示为21,e e ,见图其标积可写成下面的形式 )2,1,(),( j i e e ij j i 我们将其称之为基矢的正交归一关系。平面上的任一矢量A 可以写为 2211e A e A A 其中),(11A e A ，),(22A e A 称为投影分量。而),(21A A A 称为A 在坐标系21X OX 中的表示。现在将坐标系21X OX 沿垂直于自身面的轴顺时针转角度，则单位基矢变为','21e e ，且同样有 )2,1,()','( j i e e ij j i 而平面上的任一矢量A 此时可以写为 ''''2211e A e A A 其中投影分量是),'('11A e A ，),'('22A e A 。而)','(21A A A 称为A 在坐标系'X 'OX 21中的表示。现在的问题是：这两个表示有何关系？显然，22112211''''e A e A e A e A A 。

用'1e 、'2e 分别与上式中的后一等式点积（即作标积），有 ),'(),'('2121111e e A e e A A ),'(),'('2221212e e A e e A A 表成矩阵的形式为 212212211121),'(),'(),'(),'(''A A e e e e e e e e A A 由于'1e 、1e 及'2e 、2e 的夹角为，显然有 21212212211121cos sin sin cos ),'(),'(),'(),'(''A A A A e e e e e e e e A A 或记为 2121)(''A A R A A 其中 cos sin sin cos )(R 是把A 在两坐标中的表示 ''21A A 和 21A A 联系起来的变换矩阵。变换矩阵的矩阵元正是两坐标系基矢间的标积，它表示基矢之间的关系。故R 给定，任何矢量在两坐标系间的关系也确定。很容易证明，R 具有下述性质： I R R R R ~ ~ 由于1)(det )~ det(2 R R R , 其中 321321)1()det(p p p t R R R R ，故称这种矩阵为正交矩阵。但1det R （对应于真转动（proper rotation ））且R R * （实矩阵）

离散傅里叶变换的的讲述和实例参考

离散傅里叶变换的物理含义不知道为什么，我们的教科书总是不把读者最希望了解的东西告诉他们。这里可能有专业与非专业的区别。浸淫多年的专家认为必须让读者理解的东西其实读者并不关心，读者想要知道的简单答案课本上就是不说。以离散傅里叶变换为例，许多书都会从用一系列正弦波逼近方波开始，好的，这我们都好理解，但是从此以后大堆的公式就开始上场了，以及卷积呀，皱褶呀，截断呀，延拓呀，中间经历了傅里叶变换，拉普拉斯变换，以及Z变换，时间域从连续到离散，频域从离散到连续，最终在离散傅里叶变换里时域和频域都离散了，这时频域里的幅值与相位和我们的原始信号有何联系，物理含义是什么，现在没人说了。其实作为一个普通的，数学不怎么样的工程师，真的不关心离散傅里叶变换背后的数学原理，但是我们现在的教科书往往是告诉了他，这确实是极有用的工具，却不告诉他如何简单有效地使用它。我在网上搜索答案，发现许多作答的人其实自己也不了解。直到找到一篇说得比较明白，但是在我读它的时候，早把网页关了，也不致应向谁致谢和致敬。下面举的例子，就基于那篇文章，有的部分是原文，在此基础上改写。例子：假设我们有一个信号，它含有a、2V的直流分量，b、频率为50Hz、相位为-30度、幅度为3V的交流信号，以及c、频率为75Hz、相位为90度、幅度为1.5V的交流信号。用数学表达式就是如下： S=2+3*cos(2*pi*50*t-pi*30/180)+1.5*cos(2*pi*75*t+pi*90/180)。式中cos参数为弧度，所以-30度和90度要分别换算成弧度。我们以256Hz的采样率对这个信号进行采样，采样时间为1秒，数据长度为256点。按照我们上面的分析，Fn=(n-1)*Fs/N，我们可以知道，每两个点之间的间距就是1Hz，第n 个点的频率就是n-1。我们的信号有3个频率：0Hz、50Hz、75Hz，应该分别在第1个点、第50个点、第76个点上出现峰值，其它各点应该接近0。实际情况如何呢？我们来看看FFT的（部分）结果的模值如下所示，我们把在第1点、第51点、和第76点附近的数据拿上来细看： 1点：512+0i 2点：-2.6195E-14 - 1.4162E-13i 3点：-2.8586E-14 - 1.1898E-13i 50点：-6.2076E-13 - 2.1713E-12i 51点：332.55 - 192i 52点：-1.6707E-12 - 1.5241E-12i 75点：-2.2199E-13 -1.0076E-12i 76点：3.4315E-12 + 192i 77点：-3.0263E-14 +7.5609E-13i 很明显，1点、51点、76点的值都比较大，它附近的点值都很小，可以认为是0，即在那些频率点上的信号幅度为0。接着，我们来计算各点的幅度值。分别计算这三个点的模值，结果如下： 1点：512 51点：384 76点：192

MODULE I Fourier series and Fourier intergrals Periodic functions, Euler formulae for Fouri

《积分变换与数理方程》教学大纲

离散傅里叶变换的分析与研究

量子力学期末考试题解答题

离散傅立叶变换及谱分析

最新量子力学期末考试题解答题

量子力学的矩阵形式和表象变换.

积分变换

学习复变函数与积分变换的心得

理解离散傅立叶变换

量子力学的表象与表示

离散傅里叶变换

离散系统分析和离散傅里叶变换讲解

复变函数与积分变换与高等数学的异同(完整版)

离散傅里叶变换和快速傅里叶变换

量子力学矩阵形表象变换

离散傅里叶变换的的讲述和实例参考