Scribd
Upload
1K views

Digital Systems - Short Notes

Digital signals can be either analog or digital. Numbers can be represented in any base system using digits. Negative numbers are represented using complements. Boolean algebra uses laws like De Morgan's laws and absorption. Logic gates like AND, OR, and NOT are used to represent Boolean functions. Circuits like full adders, multiplexers, and decoders are used to perform operations in digital systems. Karnaugh maps provide a method to simplify Boolean expressions.

Uploaded by

Harry Willsmith
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
1K views

Digital Systems - Short Notes

Digital signals can be either analog or digital. Numbers can be represented in any base system using digits. Negative numbers are represented using complements. Boolean algebra uses laws like De Morgan's laws and absorption. Logic gates like AND, OR, and NOT are used to represent Boolean functions. Circuits like full adders, multiplexers, and decoders are used to perform operations in digital systems. Karnaugh maps provide a method to simplify Boolean expressions.

Uploaded by

Harry Willsmith
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Digital System- Short Notes

● Signal​:
○ A physical quantity that varies with time, space or any other
independent variable by which information can be converged.There are
two types of signals:-
1. Analog signals
2.Digital signals

● Number Representation:-
○ Any number can be represented in a number system of base r as
follows:

a​ a​ a​ ...a​ .a​ a​ = a​ xr​k​ +a​ xr​ +a​ xr​ +... +a​ xr​ +a​ xr​ +a​ xr​
k​ k-1​ k-2​ 0​ -1​ -2​ k​ k-1​
k-1​
k-2​
k-2 ​
0​
0​
-1​
-1​
-2​
-2​

Where a​ {0,1,2,...,r-1}
i​

○ Addition of two n-digit numbers in any number system yields a (n+1)


digit number.

○ A number can be converted from one system to another by repeated


division with the base. The corresponding remainders must be taken in
reverse order to get the required representation.
● Complement Of A Number:-
○ The r’s complement C of a n-digit number N is defined as
follows:

C= r​n​ -N

○ The (r-1)’s complement (also known as diminished


complement) C​ of a n-digit number N is defined as follows:
’​

C​ = (r​n​-1)-N
’​

● Subtraction With Complements:-


○ The subtraction of two unsigned numbers X=M-N in base r can be
done as follows:
○ Represent -N by its r’s complement
○ Now, X= M+ ( r​n​ -N)
○ If M>N

X=M-N

Else if M<N

X= r​n​ -(N-M).

Now take r’s complement of X and append to get the right answer

● Signed Numbers:-
○ Binary numbers can be represented in two ways:
■ Unsigned
● Cannot be used to represent negative numbers
■ Signed
● Can represent negative numbers
● MSB represents the sign
● MSB=0 implies that the number is positive
● MSB=1 implies that the number is negative
● Two methods to represent negative numbers
● Signed 2’s complement
o Add a 0 as MSB to the number and take 2’s
complement
● Signed 1’s complement
o Add a 0 as MSB to the number and take 1’s
complement
● Binary Codes:-
○ Binary codes must be able to represent all the values in the
given number system
○ Binary codes are needed to easily represent individual digits of a
decimal number in binary. Some common examples are:
■ 8421 (aka BCD code)
■ 2421
■ 84-2-1
■ Excess 3
● 2’s complement of the number +3

● Laws And Properties Of Boolean Algerbra:-


○ DeMorgan’s Law
■ (A.B)’=A’ + B’
■ (A+B)’=A’.B’
○ Involution
■ (A’)’=A
○ Absorption
■ A+A.B=A
■ A.(A+B)=A
○ Consensus Theorem
■ A.B+A’.C+B.C=A.B+A’.C
■ (A+B).(A’+C).(B+C)=(A+B).(A’+C)

○ Closure
■ If A+B=C, where A and B are binary numbers then C
must be a be a binary number
○ Associative Law
■ A+(B+C)=A+(B+C)
■ A.(B.C)=(A.B).C
○ Commutative Law
■ A+B=B+A
■ A.B=B.A
○ Identity element
■ A+0=0+A=A
■ A.1=1.A=A
○ Inverse element
■ A’=1-A
○ Distributive law
■ A.(B+C)=A.B+A.C
■ A+B.C=(A+B).(A+C)
○ Duality
■ Given a logical expression, the dual can be obtained by
replacing AND by OR and OR by AND while 0 is replaced
by its complement 1.

● SOP:-
 
○ Each term in the SOP form is called minterm (represented by
m).
○ Obtained by taking the rows in the truth table whose result is 1.
○ If in a variable’s value is zero in a particular row, take its
complement while forming the expression, and if the value is 1
take the variable as it is​. 

● POS:-
○ Each term in the POS expression is called Maxterm
(represented by M).
○ Obtained by taking the rows in the truth table whose result is 0.

○ The variable rules are opposite to that of SOP form.

● Each expression separated by + (in SOP) and * (in POS) are


called ​Terms
● Each variable in the truth table is called a ​Literal.

● Basic Logic Gates:-


o AND Gate
▪ Boolean Logic:A.B.

o OR Gate
▪ Boolean Logic:A+B .

o NOT Gate
▪ Boolean Logic:~A or A’.

o NAND Gate
▪ Combination of AND gate and NOT gate.
▪ Also called AND-Invert, Invert-OR.
o NOR Gate
▪ Combination of OR gate and NOT gate.
▪ ALso called OR-invert, Invert-AND.
o XOR Gate
▪ Boolean Logic: (A^B) .
● Full Adder:-
○ Sum = A​⊕B⊕C
○ Carry = AB+AC+BC
● Half Adder:-
○ Sum = A⊕B
○ Carry = AB
● Full Adder using Half Adder

● Multiplexer:-
o Realization of if else in hardware.
o For a nx1 mux we have log of n to the base 2 number of selector lines.
o A 2x1 mux has one select line and its output is given by F = S’A+SB.
● Encoder:-
o It is a combinational circuit that produces ‘n’ outputs from 2^n inputs.
o It outputs the location of the input which is high.
o The boolean expression can be derived from the truth table.
o For 4 to 2 encoder the output is given by A0 = Y3+Y2; A1 = Y3+Y1;
where A’s are the outputs and Y’s are the inputs.
● Priority Encoder:-
o It has a priority among its inputs.
o If two inputs are simultaneously high, there would be an ambiguity in
encoder whereas in priority encoder, the location of the input which has
higher priority will be the output.
● Demultiplexer:-
o Opposite of multiplexer.
● Decoder:-
o It is a combinational circuit that will give 2^n outputs taking ‘n’ inputs.

● Binary n-Bit Adder:-

● Karnaugh Map:-
o A Karnaugh map provides a pictorial method of grouping together
expressions with common factors and therefore eliminating unwanted
variables. The Karnaugh map can also be described as a special
arrangement of a truth table.

You might also like