Digital Circuit Engineering IS-FCS-00056S

Description:
Information processing. Axioms of Boolean algebra. Logic gates NOT, AND, OR. NAND gate. Classification of digital circuits. Combinational circuits. Truth table. Minimization of logic functions. Karnaugh charts. Realisation of the logic function using logic gates. Minimization of functions with Quine-McCluskey method. Race hazard. Design of multi-output circuits. Standard MSI blocks performing Boolean functions: multiplexer, demultiplexer, decoder, ROM, RAM. The concept of a programmable device. Structures PLD, CPLD and FPGA. Synchronous systems. System clocking. Model of Moore and Mealy machine. Table of transitions and outputs. Minimizing the number of states. Synthesis of synchronous circuits. Encoding states. Flip-flops: D, JK, SR and T. Synthesis of synchronous circuits. The structure of asynchronous circuits. Simple SR Trigger. Synthesis of asynchronous circuits. Master-slave flip-flop. Realization of sequential circuits in the medium and large scale of integration. Functional blocks. Control circuits. Flowchart as a way to describe the control system. Microprogrammed systems. Structure of microprogrammed system. Basic microcodes.

Requirements:
Logic for Computer Scientists, Introduction to Computer Science,