Lectures:
Logical system and its variable, logical value, number systems and conversion between them.
Boolean functions and their representation, combinational logic circuits, logic operation, Disjunctive Normal Form and Conjunctive Normal Form, Boolean algebra and law, DeMorgan's theorem, minimization expression using Boolean algebra.
Minimization Boolean function using Karnaugh map and Quine-McCluskey algorithm.
Realization logical networks, introduction to logical integrated circuits and their transfer graph, realization of combinatinal circuits using gates AND/OR, NAND, NOR, AND-OR-Invert, gates with open collector and programmable ROM.
Timing hazards of logical circuits, static, dynamic and concurrence hazard, design hazard free circuits.
Logical sequential circuits, state machine structure, Mealy and Moore machine, synchronous and asynchronous circuits, next state and output function, state diagram.
Analysis of flip-flop type RS and T.
Analysis of flip-flop type D and JK.
Synthesis sequential circuits, design next state and output function.
Realization sequential circuits using D FF, JK FF and programmable ROM.
Basic logic circuits as register, arithmetic and logical shift register, one and two direction, asynchronous counter, multiplexer and demultiplexer.
Control unit as classical circuits and microprogram unit, generator of serial binary sequence.
Representation number with/without floating points, binary adder unit.
Binary multiplication unit, design of comparing function.
Exercises:
Exam prerequisites, safety
training, transfers between the systems.
Proposal combinational circuits by
Boolean algebra.
Laboratories:
Proposal combinational circuits by
Karnaughovy maps and implementation of the Modular system RC2000.
Practical involvement combination
circuit.
Surrender to work independently 1st
Surrender to work independently 1st
Quiz 1: Combinatorial districts -
written, practical part.
Analysis and Synthesis KO circuit
RS, D and JK using the logic analyzer.
Design and implementation of
synchronous circuits Moorova type of memory with members of D and PROM
memory.
Design and implementation of
synchronous circuits Moorova and Mealy type of memory with members of JK.
Design and implementation of
circuits to generate binary sequences.
Quiz 2: Sequential circuits - the
design and implementation of sequential control.
Surrender to work independently 2nd
Surrender to work independently 2,
accreditation.
Projects:
Project No. 1: Synthesis
combinational circuits using Qeene-McCluske algorithm and Boolean algebra
for NAND gates and programmable ROM.
Project No. 2: Sysnthesis
sequential circuits for D and JK flip flops and programmable ROM.
Logical system and its variable, logical value, number systems and conversion between them.
Boolean functions and their representation, combinational logic circuits, logic operation, Disjunctive Normal Form and Conjunctive Normal Form, Boolean algebra and law, DeMorgan's theorem, minimization expression using Boolean algebra.
Minimization Boolean function using Karnaugh map and Quine-McCluskey algorithm.
Realization logical networks, introduction to logical integrated circuits and their transfer graph, realization of combinatinal circuits using gates AND/OR, NAND, NOR, AND-OR-Invert, gates with open collector and programmable ROM.
Timing hazards of logical circuits, static, dynamic and concurrence hazard, design hazard free circuits.
Logical sequential circuits, state machine structure, Mealy and Moore machine, synchronous and asynchronous circuits, next state and output function, state diagram.
Analysis of flip-flop type RS and T.
Analysis of flip-flop type D and JK.
Synthesis sequential circuits, design next state and output function.
Realization sequential circuits using D FF, JK FF and programmable ROM.
Basic logic circuits as register, arithmetic and logical shift register, one and two direction, asynchronous counter, multiplexer and demultiplexer.
Control unit as classical circuits and microprogram unit, generator of serial binary sequence.
Representation number with/without floating points, binary adder unit.
Binary multiplication unit, design of comparing function.
Exercises:
Exam prerequisites, safety
training, transfers between the systems.
Proposal combinational circuits by
Boolean algebra.
Laboratories:
Proposal combinational circuits by
Karnaughovy maps and implementation of the Modular system RC2000.
Practical involvement combination
circuit.
Surrender to work independently 1st
Surrender to work independently 1st
Quiz 1: Combinatorial districts -
written, practical part.
Analysis and Synthesis KO circuit
RS, D and JK using the logic analyzer.
Design and implementation of
synchronous circuits Moorova type of memory with members of D and PROM
memory.
Design and implementation of
synchronous circuits Moorova and Mealy type of memory with members of JK.
Design and implementation of
circuits to generate binary sequences.
Quiz 2: Sequential circuits - the
design and implementation of sequential control.
Surrender to work independently 2nd
Surrender to work independently 2,
accreditation.
Projects:
Project No. 1: Synthesis
combinational circuits using Qeene-McCluske algorithm and Boolean algebra
for NAND gates and programmable ROM.
Project No. 2: Sysnthesis
sequential circuits for D and JK flip flops and programmable ROM.