Redentor B.

Foster
MIT
Computers are implementations of Boolean Logic that consist of its functions that’s
why Boolean describes how to determine the Boolean value output based on the logical
calculation of the Boolean input, Boolean algebra deals with mathematical operations on
logical values and incorporates binary value which is 0 and 1.
The Boolean algebra are completely described by the truth tables that consist of
mathematical table that used in logic specifically in Boolean algebra and functions which
consist of set of functional values of logical expression on each logical argument. Logic
gates are small circuits that implement Boolean Operations, it is also an electronic circuit
that having one or more than one input and only one output. The relationship between the
input and output is based on a certain logic like AND gates, OR gates and NOT gates which
used to compare one logic input that produces one output. Universal gates are the gate that
implement any Boolean functions without need to use any other gate type this is one of the
advantageous of the NAND and NOR gates that easily fabricate in basic gates. The computer
circuits consist of the combinational circuits and sequential logic circuits which is
combinational circuits is an independent circuit which do not depends upon previous
inputs to generate any output sometimes it also referred to as time independent logic while
sequential circuits are dependent on clock cycles and depends on present as well as pats
inputs that generate any output.
The basic sequential circuits are the flip-flop, this circuits that has two stables states
that can be used to store state information, one of the its two states represent a “one” and
the other is “zero” or the binary states, data can be stored in state described by the
sequential logic. One of the examples of sequential circuits includes memory, counters, and
Viterbi encoders and decoders.
The behaviors of the SR, JK, and D flip flops are the most important to know about
the sequential circuit, each behavior of flip flop stores in a single bit od data, the value
changes when the clock input, marked by a triangle on each flip flop rises from 0 to 1.
The behavior of sequential circuits can be expressed using the characteristic tables or
through various finite state machines.
The Moore and Mealy machines are the two finite state machines that model high –
level circuits behavior, which is Moore machine whose output values are determined only
by its current state while in Mealy machine whose output values are determined both by its
currents state and by the values of its inputs.
Algorithmic state machines are better than Moore and Mealy machine at expressing
timing and complex signal interactions, this method is design in finite state machines that
used to represent diagrams of digital integrated circuits, this state diagram is less formal
and easier to understand.

Boolean Algebra and Digital Logic