Page 99 - R2017-REC-ECE-UG Syllabus

Department of ECE, REC

Amplifiers, open loop and closed loop amplifiers, Noise & distortion, gain boosting, feedback topologies,
common mode feedback, bipolar, CMOS and BiCMOS comparators.

UNIT III PRECISION TECHNIQUES 9
Comparator cancellation, input and output offset storage principles, comparators using offset cancelled
latches, OP-AMP offset cancellation, ADC and DAC calibration techniques.
UNIT IV ADC/DAC ARCHITECTURES 9
DAC Performance metrics, reference multiplication and division, switching and logical functions of DACs,
Current steering architectures, DAC Performance metrics, Flash ADC architecture, Gray encoding,
thermometer encoding and meta stability, Mixed Signal Layout issues.

UNIT V OVER SAMPLING CONVERTERS 9
Delta sigma modulators, alternative modulator architectures, quantization and noise shaping, decimation
filtering, implementation of Delta sigma modulators, delta sigma DACs.

TOTAL = 45 PERIODS
OUTCOMES:
Upon completion of the course, students will be able to:
• Build sample & hold circuits
• Build Data Conversion circuits.
• Discuss calibration techniques
• Analyze ADC/DAC Architecture and its Performance
• Design & Implement modulator circuits

TEXT BOOK:
1.B.Razavi “Data Conversion System Design” IEEE Press and John Wiley, 1995.

REFERENCE:
1.Phillip Allen and Douglas Holmberg “CMOS Analog Circuit Design” Second Edition, Oxford University
Press, 2004.

CS17504 CRYPTOGRAPHY AND NETWORK SECURITY L T P C
3 0 0 3
OBJECTIVES
The student should be made to:
• Learn basics of encryption and Number Theory.
• Understand methods of public key encryption.
• Learn authentication and hash functions.
• Know the Techniques of system level securities.
• Have knowledge on current trends on wireless security.

UNIT I INTRODUCTION & NUMBER THEORY 9
Services, Mechanisms and attacks-the OSI security architecture-Network security model-Classical Encryption
techniques (Symmetric cipher model, substitution techniques, transposition techniques, steganography)-Finite
Fields and Number Theory: Modular arithmetic- Euclid’s algorithm-Finite fields- Polynomial Arithmetic –
Prime numbers-Fermat’s and Euler’s theorem- Testing for primality -The Chinese Remainder theorem-
Discrete logarithms.

Curriculum and Syllabus | B.E. Electronics and Communication Engineering | R2017 Page 99