Note for Digital Principle and System Design - DPSD By ANNA SUPERKINGS
- Digital Principle and System Design - DPSD
- Note
- Anna univerdity chennai - Anna
- 133 Views
- 7 Offline Downloads
- Uploaded 2 months ago
Text from page-1
CS6201 – DIGITAL PRINCIPLES AND SYSTEM DESIGN Lecture Notes SEMESTER-II Regulation 2013
Text from page-2
L T P C 3 1 0 UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 4 9 Review of Binary Number Systems – Binary Arithmetic – Binary Codes – Boolean Algebra and Theorems – Boolean Functions – Simplifications of Boolean Functions Using Karnaugh Map and Tabulation Methods – Implementation of Boolean Functions using Logic Gates. UNIT II COMBINATIONAL LOGIC 9 Combinational Circuits – Analysis and Design Procedures - Circuits for Arithmetic Operations – Code Conversion – Hardware Description Language (HDL). UNIT III DESIGN WITH MSI DEVICES 9 Decoders and Encoders – Multiplexers and Demultiplexers – Memory and Programmable Logic – HDL for Combinational Circuits UNIT IV SYNCHRONOUS SEQUENTIAL LOGIC 9 Sequential Circuits – Flip flops – Analysis and Design Procedures - State Reduction and State Assignment – Shift Registers – Counters – HDL for Sequential Circuits. UNIT V ASYNCHRONOUS SEQUENTIAL LOGIC 9 Analysis and Design of Asynchronous Sequential Circuits - Reduction of State and Flow Tables – Race-Free State Assignment – Hazards – ASM Chart. L: 45 T: 15 Total: 60 TEXT BOOK 1. M. Morris Mano, ―Digital Design‖, 3rd Edition, Pearson Education, 2007. REFERENCES 1. 2. Charles H. Roth, ―Fundamentals of Logic Design‖, 5th Edition, Thomson Learning, 2003. Donald D. Givone, ―Digital Principles and Design‖, Tata McGraw-Hill, 2007.
Text from page-3
UNIT I BOOLEAN ALGEBRA AND LOGIC GATES
Text from page-4
SYLLABUS : Review of Binary Number Systems Binary Arithmetic Binary Codes Boolean Algebra and Theorems Boolean Functions Simplifications of Boolean Functions Using Karnaugh Map and Tabulation Methods Implementation of Boolean Functions using Logic Gates.
Leave your Comments