COMBINATIONAL LOGIC

Jkljkl CIRCUITS
circuits are made of various logic
gates by connecting them in certain

Muhammad Yasir Arfat 1, Syed Ali Yousuf 2, Hamza Ahmed Khan 3, Raza Jawaid4
Department of Computer Science, IQRA University Karachi

Abstract: IkklCombinations. In order to produce

the required output, Digital logic
This research paper is basically the circuits are mainly classified into two
overview on the combination of types , sequential logic circuits and
circuits in the logical manner. combinational logic circuits. The
A combinational logic circuit is one in difference between sequential logic
which the present state of circuits and combinational logic
the combination of the logic inputs circuits is the combinational circuit is
decides the output. Combination the independent circuit it doesn’t
logic means combining of two or
more logic gates to form a required
jkl depend on the previous input to
generate any output. But sequential
logic circuits are those which are
function where the output at a given
dependent on the clock cycles and
time depends only on the input. This depend on present as well as past
paper briefly discussed on the basic inputs to generate any output.
needs of logic synthesis and also
discusses few interesting facts and
consideration logic synthesis. This The logic gates are the fundamental
research paper will be efficient to building blocks of a combinational
clear some basic concept about logic circuit. By using the combination of
circuit and its combination. logic gates more complex
combinational circuits can be
implemented such as multiplexers
Introduction: and de-multiplexers, comparators,
adders and sub tractors, etc.
Digital signals are processed by the
digital system which can be built with
various logic gates. These logic A combinational circuit comprises of
input variables, logic gates and
output variables. The logic gate
accepts the inputs and depending on Digital System:
the type of functioning of the logic The heart of digital system is binary
gate, output signals are generated number and many people has shown
from them. The required output data their interest towards binary number
is obtained from this process by but the major contribution is done by
transforming the binary information these people first person is Gottfried
given at the input. The figure below
Wilhelm Leibniz. The modern binary
shows the schematic representation
number system was fully documented
of a generalized combinational logic
by Gottfried Leibniz in the 17th
circuit consisting of n input variable
and m output variable. century. He also invented the binary
system, foundation of virtually all
modern computer architectures. After
Leibniz Efforts is done by many people
in the progress of digital electronics
but huge contribution was done in
nineteen century by. George Boole he
was from England he was one of the
In the above figure, there are n input greatest Mathematician of all time he
variables and hence there will be 2nd
combined arithmetic and logic
possible combinations of bits at the
operations which has only two values
input. By a Boolean expression of
input variables, each output is either true or false who helped
expressed. So the result of above establish modern symbolic logic and
generalized combinational logic whose algebra of logic, now
circuit can be expressed by m Boolean called Boolean algebra, is basic to the
expressions. In the above figure, the design of digital computer circuits.
circuit accepts the binary variables The main operations of Boolean
and depending on the logical algebra are the conjunction (AND),
combination of gates it generate the disjunction (OR) and the negation
outputs. (NOT) are his inventions. Augustus De
Keywords: Morgan also Provided his efforts
towards Digital Electronic best thing
Combinational logic, Boolean
which was provided by him to digital
function, Digital electronics, multiple
electronics was De-Morgan’s
inputs.
Theorem. De Morgan has suggested
two theorems which are extremely
useful in Boolean algebra. The two
Theorem 2:
theorems are discussed below.

Theorem 1:
 The LHS of this theorem
represents a NOR gate with
inputs A and B, whereas the
RHS represents an AND gate
with inverted inputs.
 The left hand side (LHS) of this
theorem represents a NAND  This AND gate is called
gate with inputs A and B, as Bubbled AND.
whereas the right hand side
(RHS) of the theorem
represents an OR gate with
inverted inputs.
 This OR gate is called
as Bubbled OR.

Table showing verification of the De

Morgan's second theorem −

Table showing verification of the De

Morgan's first theorem –

But the Boolean algebra of George

Boole was complex which is simplified
by Charles Sanders Peirce. A basic with the help electromagnetic
difference between ordinary algebra switching devices. After one year
and algebra of logic is clearly the company of Mr. Almon Brown
mentioned by Price. Price explain Strowger developed the first
symbol which are used in ordinary commercially successful
algebra they denote things without electromechanical stepping switch
describing them i.e. in ordinary telephone exchange system is
algebra indices are blank and may be known as Strowger switch or step-
assigned any numerical value to get by-step switch. In 1907 Lee De
some result. Peirce expresses de- Forest's proposed that modified
Morgan’s low symbolically as and. Fleming valve can be used for
which was reported in 1885. This implementation of AND logic.
representation are very useful to Walther Bothe, inventor of the
represent any logic by a single coincidence circuit, the first modern
operation, letter describe NOR and electronic AND gate in 1924, got
NAND. The first axiom system based part of the 1954 Nobel Prize in
on NAND was given by Henry Sheffer physics. Konrad Zuse built
in 1913 After Price Allan Marquand electromechanical logic gates for
student of Peirce also write some his computer Z1 (from 1935–38).
historical Research paper.
Version
Logic execution: Technique:
Many logic are implemented by Every logical expression can be
people during 19 century but some executed by using logic gates input
Implementations are historical variables, generally indicated by English
many people had implemented letters value of input either be (1) or
there logics on the logic machine (0), A Combinational circuit can be
(The Logic Machine is the 1st full represented in five different forms
functional mechanical device design and descriptions are as under:
for a general purpose truth 1) Algebraic foams
functional logic processor in which
2) Tabulated foams
all the valid implications of a logical
3) Graphics foams
proposition displayed in a
4) Statement foams
systematic way) In 1890 Price and
5) Code foams
Marquand made some
improvement in the logic machine
 1) Algebraic foams value complement of C
and (a0,b,c); // output a0
Y=A’B’C’+AB’C’+ABC’+ABC is b AND c
Y=B’C’+AB and (a1,A,B); // output a1
Y’=B+C.A’+C (A’+B’) is A AND B or (Y,a0,a1); //
Y is a0 OR a1 endmodule
2) Tabulated foams

5) Code foams

3) Graphics foams Minimization of

Boolean
Expression:
The process of simplifying the
algebraic expression of a Boolean
function is called minimization. ... It is
4) Statement foams clear from the above image that the
minimized version of the expression
module exp_y(Y, A, B, C) // Define takes a less number of logic gates &
variable for input and output. also reduces the complexity of
the circuit substantially.
input A, B, C; //
Input variable
output Y;
→ Component 3 to 5 and 4 to 5
not (b,B); // wire b logic
value complement of B
not (c,C); // wire c logic
the diagram a defines the complex the Boolean expression so also gives
level of combination In these circuit the brief introduction about Boolean
there is multiple gates are used and algebra and also describes the
also required much time to run these different forms of circuits and also
this circuit But you noticed the image describes the minimization
(b) it is also performing same techniques of combinational logic
function either the number of inputs circuits and some general application
are also same these logic simplifies of combinational circuit.
the circuit and also saves the
resources.

Application of References:
1) Computinghistory.org.uk
combinational 2) Britannica.com

Logical circuit: 3)
4)
Tutorialspoint.com
International Journal of
Combinational logic is the hardware
Computer Applications (0975 –
implementation of Boolean logic 8887) Volume 127 – No.1,
functions. That’s all there is to it. All October 2015, on synthesis of
the material you need to learn about combinational Logic Circuits
this is either how to engineer 5) Aschoff, V., "The early history
arbitrary Boolean circuits with various of the binary code," in IEEE
kinds of materials and components, Communications Magazine,
or how to construct Boolean logic vol.21, no.1, (Jan. 1983), 4-10.
functions to solve various problems. 6) Boole, George, "The
common combinational logic circuits mathematical analysis of
include: half adders, full adders, logic," in Philosophical Library,
(1847).
multiplexers, demultiplexers,
7) www.quora.com
encoders and decoders.

Conclusion:
This research paper defines the “THANK YOU”
digital electronics and its one type
combinational circuits.
Combinational circuits is based on