This course provides an overview of Boolean algebra number systems and digital circuits as combinatorial and sequential. It gives a general overview of the design of the logic functions, starting from the problem to the truth table. After this, obtaining a function relies on the combination of inputs. It provides students the opportunity to design a circuit based on gates that are regrouped on packages. Based on the information from this course, the student can realize many digital circuits like encoders, transcoders, multiplexers, counters, registers, and also memories. It is possible to synthesize many decision systems by converting the problems to look-up tables by defining the inputs parameters and the outputs parameters. This course represents a good basis for persons in the case of very large integrated circuits because it provides the necessary tools to perform any numerical circuit.

The essential points treated by this course is given as follow:

Binary Arithmetic

Binary, decimal, and hexadecimal system

Change of bases

The different codes

Binary arithmetic (addition, subtraction,…

The basic rules of digital logic gates like AND, OR, XOR,...

Logic functions

Truth and Karnaugh tables to simplify logic functions.

Encoders and decoders

Transcoders (binary-Aiken, binary-Gray)

Seven segment displays

Multiplexers and demultiplexers

Studying the different flip-flops like RS, JK, T,...

Synchronous and Asynchronous counters.

Shift registers.

Memories like ROM, RAM, EPROM, EEPROM…the