Digital Electronics 1

• Explain the basic principles and underlying assumptions for synchronous digital circuits – the ‘discrete abstraction’ and the fundamental implementation using logic functions (combinatorial circuits) and memory elements (flip-flops etc.).
• Explain the operation of the MOS-transistor as an ideal logic switch, and describe how transistors are used to implement CMOS logic (logic gates and memory elements).
• Explain the basics of Boolean algebra and use it for describing, developing and reducing logic expressions – including the canonical forms: sum-of-products and products-of sums.
• Transform between a logic expression and a digital circuit implemented using logic gates such as AND, OR, NOT, NAND and NOR.
• Describe commonly used number and data representation formats and convert between different number representations.
• Implement and operate small combinatorial circuits in the lab using discrete logic gates (simple 4000 components).
• Explain the operation and implementation of fundamental arithmetic circuits and other typical combinatorial circuit building blocks (multiplexor, decoder, etc.).
• Explain the operation and implementation of fundamental memory elements (D flip-flop’s and D-latches).
• Calculate propagation delay (critical path) of a combinatorial circuit.
• Explain the structure and operation of a finite state machine (Moore type), and explain step-by-step how such a finite state machine is designed (state graph, state table, state minimization, state encoding, etc.).
• Transform a verbal description of an intended circuit into a specification using Boolean algebra, truth tables, state-graphs, etc., and subsequently to synthesize and implement the circuit.
• Demonstrate basic knowledge about simulation and synthesis tools for digital circuits, including the ability to describe small combinatorial circuits using a hardware description language (such as VHDL).

The digital abstraction (binary signals and discrete time). Number representation. The MOS-transistor as a logic switch. Implementation of basivc digital components: gates, combinatorial circuits, latches and flip-flops. Boolean algebra. State graphs. Specification and synthesis of combinatorial circuits and finite state machines.

Lectures, group work, and home work. Mandatory laboratory exercises.

The course is a 1st semester constituent of the bachelor programmes Electrotechnology and Computer Engineering.