Why Study Digital Design
Why Study Digital Design
What is the meaning of
Digital Logic Design
Digital systems
A Digital system is an interconnection of digital modules and it is
a system that manipulates discrete elements of information that is
represented internally in the binary form.
Now a digital systems are used in wide variety of industrial
and consumer products such as automated industrial machinery,
pocket calculators, microprocessors, digital computers, digital
watches, TV games and signal processing and so on.
Characteristics of Digital systems
Digital systems manipulate discrete elements of information.
Discrete elements are nothing but the digits such as 10 decimal
digits or 26 letters of alphabets and so on.
Digital systems use physical quantities called signals to represent
discrete elements.
In digital systems, the signals have two discrete values and are
therefore said to be binary.
A signal in digital system represents one binary digit called a bit.
The bit has a value either 0 or 1.
Analog systems vs Digital systems
Analog system process information that varies continuously
i.e; they process time varying signals that can take on any
values across a continuous range of voltage, current or any
physical parameter.
Digital systems use digital circuits that can process digital
signals which can take either 0 or 1 for binary system.
Why Digital
Advantages of Digital system over Analog system:
1. Ease of programmability
The digital systems can be used for different applications by simply
changing the program without additional changes in hardware.
2. Reduction in cost of hardware
The cost of hardware gets reduced by use of digital components and
this has been possible due to advances in IC technology. With ICs
the number of components that can be placed in a given area of
Silicon are increased which helps in cost reduction.
[Link] speed
Digital processing of data ensures high speed of operation which is
possible due to advances in Digital Signal Processing.
Why Digital
4. High Reliability
Digital systems are highly reliable one of the reasons for that is use
of error correction codes.
5. Design is easy
The design of digital systems which require use of Boolean algebra
and other digital techniques is easier compared to analog designing.
6. Result can be reproduced easily
Since the output of digital systems unlike analog systems is
independent of temperature, noise, humidity and other
characteristics of components the reproducibility of results is
higher in digital systems than in analog systems.
Disadvantages of Digital Systems
1. Use more energy than analog circuits to accomplish the
same tasks, thus producing more heat as well
2. Digital circuits are often fragile, in that if a single piece of
digital data is lost or misinterpreted the meaning of large
blocks of related data can completely change.
3. Digital computer manipulates discrete elements of
information by means of a binary code.
4. Quantization error during analog signal sampling.
Chapter 1
Digital Systems and Binary Numbers
Outline of Chapter 1
1.1 Digital Systems
1.2 Binary Numbers
1.3 Number-base Conversions
1.4 Octal and Hexadecimal Numbers
1.5 Complements
1.6 Signed Binary Numbers
1.7 Binary Codes
1.8 Binary Storage and Registers
1.9 Binary Logic
Digital Systems and Binary Numbers
Digital age and information age
Digital computers
General purposes
Many scientific, industrial and commercial applications
Digital systems
Telephone switching exchanges
Digital camera
Electronic calculators, PDA's
Digital TV
Discrete information-processing systems
Manipulate discrete elements of information
For example, {1, 2, 3
1-1 INFORMATION REPRESENTATION in
Digital Systems- Signals
Information variables represented by physical
quantities.
For digital systems, the variables take on
discrete values.
Two levels or binary values are the most
prevalent values in digital systems.
Binary values are represented abstractly by:
digits 0 and 1
words (symbols) False (F) and True (T)
words (symbols) Low (L) and High (H)
and words Off and On.
What Digital Mean
Signal Examples Over Time
Advantage of Digital Circuit
Immunity to noise
Illustration:
Binary Values: Other Physical
Quantities
What are other physical quantities represent 0 and 1?
Logic Gates, CPU: Voltage
Disk
CD
Dynamic RAM
Analog and Digital Signals
Analog system
The physical quantities or signals may vary continuously over a specified
range.
Digital system
The physical quantities or signals can assume only discrete values.
Greater accuracy
() ()
Analog signal Digital signal
Binary Digital Signal
An information variable represented by physical quantity.
For digital systems, the variable takes on discrete values.
Two levels, or binary values are the most prevalent values.
Binary values are represented abstractly by:
Digits 0 and 1
Words (symbols) False (F) and True (T) ()
Words (symbols) Low (L) and High (H)
And words OFF and ON
Logic 1
Binary values are represented by values
or ranges of values of physical quantities. undefine
Logic 0
Binary digital signal
Positional-Value System
depends on its position
Binary:
Base-2 Number System
Number Systems
To talk about binary data, we must first talk about
number systems
The decimal number system (base 10) you should
be familiar with!
A digit in base 10 ranges from 0 to 9.
A digit in base 2 ranges from 0 to 1 (binary number
system). A digit in base 2 is also called a
A digit in base R can range from 0 to R-1
A digit in Base 16 can range from 0 to 16-1
(0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F). Use letters A-F to
represent values 10 to 15. Base 16 is also called
Hexadecimal Hex
Positional Number Systems
The traditional number
system is called a positional
number system.
A number is represented as
a string of digits. 6354 6 *1000 3 *100 5 *10 4
Each digit position has a
associated with it. p 1
i
D di 10
a of the digits i 0
Positional Notation more examples
Value of number is determined by multiplying each digit by
a weight and then summing. The weight of each digit is a
POWER of the BASE and is determined by position.
953.78 = 9 x 102 + 5 x 101 + 3 x 100 + 7 x 10-1 + 8 x 10-2
= 900 + 50 + 3 + .7 + .08 = 953.78
(1011.11)2 = 1x23 + 0x22 + 1x21 + 1x20 + 1x2-1 + 1x2-2
= 8 + 0 + 2 + 1 + 0.5 + 0.25
= 11.75
0xA2F = 10x162 + 2x161 + 15x160
= 10 x 256 + 2 x 16 + 15 x 1
= 2560 + 32 + 15 = 2607
2-3 = 0.125 Common Powers
2-2 = 0.25
2-1 = 0.5 0 = 1 = 20
16
20 = 1 16 1 = 16 = 24
21 = 2 16 2 = 256 = 28
22 = 4 3 = 4096 = 212
16
23 = 8
24 = 16
25 =32
26 = 64
27 = 128 10 = 1024 = 1 K
2
28 = 256 20 = 1048576 = 1 M (1 Megabits) = 1024 K = 210 x 210
2
29 = 512 30 = 1073741824 = 1 G (1 Gigabits)
2
210 = 1024
211 = 2048
212 = 4096
Decimal Number System
Base (also called radix) = 10
10 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }
Digit Position
Integer & fraction
Digit Weight 5 1 2 7 4
Weight = (
Magnitude
x
Formal Notation
2 1 0 -1 -2
2* + 1* + 0* + -1* + -2*
(512.74)10
Binary Number System
Base = 2
2 digits { 0, 1 }, called inary dig
Weights
Weight = (
Magnitude 1 0 1 0 1
x
Formal Notation * 2+ * 1+ * 0+ * -1
+ * -2
Groups of bits 4 bits =
=(5.25)10
8 bits =
(101.01)2
1011
11000101
Decimal-to-Binary Conversion
Method 1: Sum-of-W eights Method
Method 2:
(for whole
numbers)
(for fractions)
Sum-of-Weights Method
Algorithm Decimal to Binary
1. Find largest power-of-two smaller than
the decimal number.
2. 1
3. 2
decimal number.
4. Repeat steps 1 through 3 until the decimal
number becomes zero.
Sum-of-Weights Method
Determine the set of binary weights whose sum is equal to
the decimal number.
(9)10 = 8 + 1 = 23 + 20 = (1001)2
(18)10 = 16 + 2 = 24 + 21 = (10010)2
(58)10 = 32 + 16 + 8 + 2 = 25 + 24 + 23 + 21 = (111010)2
(0.625)10 = 0.5 + 0.125 = 2-1 + 2-3 = (0.101)2
Repeated Division-by-2 Method
To convert a whole number to binary, use successive
division by 2 until the quotient is 0. The remainders form
the answer, with the first remainder as the
and the last as the .
(43)10 = (101011)2
2 43
2 21 rem 1 LSB
2 10 rem 1
2 5 rem 0
2 2 rem 1
2 1 rem 0
0 rem 1 MSB
Repeated Multiplication-by-2 Method
To convert decimal fractions to binary, repeated
multiplication by 2 is used, until the fractional product is 0
(or until the desired number of decimal places). The
carried digits, or , produce the answer, with
(0.3125)10 = (.0101)2
Carry
0.3125 2=0.625 0 MSB
0.625 2=1.25 1
0.25 2=0.50 0
0.5 2=1.00 1 LSB
Decimal (Integer) to Binary Conversion
2)
Take the remainder (either 0 or 1) as a coefficient
Take the quotient and repeat the division
Example: (13)10
Quotient Remainder Coefficient
13/ 2 = 6 1 a0 = 1
6 /2= 3 0 a1 = 0
3 /2= 1 1 a2 = 1
1 /2= 0 1 a3 = 1
Answer: (13)10 = (a3 a2 a1 a0)2 = (1101)2
MSB LSB
Decimal (Fraction) to Binary Conversion
2)
Take the integer (either 0 or 1) as a coefficient
Take the resultant fraction and repeat the division
Example: (0.625)10
Integer Fraction Coefficient
0.625 * 2 = 1 . 25 a-1 = 1
0.25 * 2 = 0 . 5 a-2 = 0
0.5 *2= 1 . 0 a-3 = 1
Answer: (0.625)10 = (0.a-1 a-2 a-3)2 = (0.101)2
MSB LSB
Octal Number System
Base = 8
8 digits { 0, 1, 2, 3, 4, 5, 6, 7 }
Weights
Weight = (
Magnitude 5 1 2 7 4
x
Formal Notation
* 2+ * 1+ * 0+ * -1
+ * -2
=(330.9375)10
(512.74)8
Decimal to Octal Conversion
Example: (175)10
Quotient Remainder Coefficient
175 / 8 = 21 7 a0 = 7
21 / 8 = 2 5 a1 = 5
2 /8= 0 2 a2 = 2
Answer: (175)10 = (a2 a1 a0)8 = (257)8
Example: (0.3125)10
Integer Fraction Coefficient
0.3125 * 8 = 2 . 5 a-1 = 2
0.5 *8= 4 . 0 a-2 = 4
Answer: (0.3125)10 = (0.a-1 a-2 a-3)8 = (0.24)8
Hexadecimal Number System
Base = 16
16 digits { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F }
Weights
Weight = (
Magnitude 1 E 5 7 A
x
Formal Notation 2 1 0 -1 -2
* + * + * + * + *
=(485.4765625)10
(1E5.7A)16
The Power of 2
n 2n n 2n
0 20=1 8 28=256
1 21=2 9 29=512
2 22=4 10 210=1024 Kilo
3 23=8 11 211=2048
4 24=16 12 212=4096
5 25=32 20 220=1M Mega
6 26=64 30 230=1G Giga
7 27=128 40 240=1T Tera
Conversion between Decimal and
other Bases
Base-R to decimal: multiply digits with their corresponding
weights and add them..
Decimal to binary (base 2)
whole numbers: repeated division-by-2
fractions: repeated multiplication-by-2
Decimal to base-R
whole numbers: repeated division-by-R
fractions: repeated multiplication-by-R
Conversion between Bases
In general, conversion between bases can be done via
decimal:
Shortcuts for conversion between bases 2, 4, 8, 16.
Binary-Octal/Hexadecimal
Conversion
Binary Octal: Partition Binary into groups of 3 bits
starting from the binary point to the right and to the left,
(10 111 011 001 . 101 110)2 = (2731.56)8
Octal Binary: reverse
(2731.56)8 = (10 111 011 001 . 101 110)2
Binary Hexadecimal: Partition Binary into groups of 4
bits starting from the binary point to the right and to the left.
(101 1101 1001 . 1011 1000)2 = (5D9.B8)16
Hexadecimal Binary: reverse
(5D9.B8)16 = (101 1101 1001 . 1011 1000)2
Example: Binary Octal Conversion
Octal Binary
8 = 23
Each group of 3 bits represents an octal 0 000
digit 1 001
2 010
Example: Assume Zeros
3 011
( 1 0 1 1 0 . 0 1 )2 4 100
5 101
6 110
( 2 6 . 2 )8 7 111
Works both ways ( and )
Example: Binary Hexadecimal
Conversion
Hex Binary
16 = 24 0 0000
1 0001
Each group of 4 bits represents a 2 0010
hexadecimal digit 3 0011
4 0100
5 0101
Example: Assume Zeros 6 0110
7 0111
8 1000
( 1 0 1 1 0 . 0 1 )2 9 1001
A 1010
B 1011
C 1100
D 1101
(1 6 . 4 )16 E 1110
F 1111
Works both ways ( and )
Octal Hexadecimal Conversion
Convert to Binary as an intermediate step.
Example:
( 2 6 . 2 )8
Assume Zeros Assume Zeros
( 0 1 0 1 1 0 . 0 1 0 )2
(1 6 . 4 )16
Works both ways ( and )
Decimal, Binary, Octal and Hexadecimal
Decimal Binary Octal Hex
00 0000 00 0
01 0001 01 1
02 0010 02 2
03 0011 03 3
04 0100 04 4
05 0101 05 5
06 0110 06 6
07 0111 07 7
08 1000 10 8
09 1001 11 9
10 1010 12 A
11 1011 13 B
12 1100 14 C
13 1101 15 D
14 1110 16 E
15 1111 17 F
Arithmetic Operations
Addition
Decimal Addition
1 1 Carry
5 5
+ 5 5
1 1 0
=
Subtract a Base
Binary Addition
Column Addition
1 1 1 1 1 1
1 1 1 1 0 1 = 61
+ 1 0 1 1 1 = 23
1 0 1 0 1 0 0 = 84
2)10
Binary Subtraction
1 2 = (10)2
0 2 2 0 0 2
1 0 0 1 1 0 1 = 77
1 0 1 1 1 = 23
0 1 1 0 1 1 0 = 54
Binary Multiplication
Bit by bit
1 0 1 1 1
x 1 0 1 0
0 0 0 0 0
1 0 1 1 1
0 0 0 0 0
1 0 1 1 1
1 1 1 0 0 1 1 0
Binary Division
Binary division is also performed in the same way as we perform
decimal division. Like decimal division, we also need to follow the
binary subtraction rules while performing the binary division. The
dividend involved in binary division should be greater than the
divisor. The following are the two important points, which need to be
remembered while performing the binary division.
1. If the part of the dividend used in the division process is greater than
or equal to the divisor, put 1 in the quotient and perform the binary
subtraction.
2. If the part of the dividend used in the division process is less than the
divisor, put 0 in the quotient and append the next most significant
digit from the dividend
Long Division
Range of Numbers
Binary number: example: a 3-bit number: n=3
000, 001 111 or in decimal system: 0, 1 7
Total of 8 numbers (=23)
Range: from 0 to 7 (0 to 23-1)
In general, a n-bit number represents:
different numbers
Min: 0
Max number:
For fractions: m digits (bits) after the radix (binary)
point:
Min: 0
Max number: (2m -1)/2m
1.5 Complements
There are two types of complements for each base- system: the radix complement,
and diminished radix complement.
Diminished Radix Complement : (R-1
Given a number in base having digits, the (
is defined as:
Example for 6-digit decimal numbers:
9 = (106 1) = 999999
9 546700 is 999999 546700 = 453299
Example for 7-digit binary numbers:
1 = (27 1) = 1111111
1 1011000 is 1111111 1011000 = 0100111
Observation:
Subtraction from ( 1) will never require a borrow
Diminished radix complement can be computed digit-by-digit
For binary: 1 0 = 1 and 1 1 = 0
Complements
1 Complement)
0 1
1 0
Example (10110000)2
(01001111)2
If you add a number and its 1
10110000
+ 01001111
11111111
Complements
Radix Complement
The 's complement of an -digit number in base is defined as
for 0 and as 0 for = 0. Comparing with the ( 1) 's
complement, we note that the 's complement is obtained by adding 1
to the ( 1) 's complement, since = [( 1) ] + 1.
Example: Base-10
The 10's complement of 012398 is 987602
The 10's complement of 246700 is 753300
Example: Base-2
The 2's complement of 1101100 is 0010100
The 2's complement of 0110111 is 1001001
Complements
2 Complement)
Take 1 1
OR
1
: First Method Second Method
10110000 10110000
1 01001111
+ 1
2 01010000 01010000
Complements
Subtraction with Complements
The subtraction of two -digit unsigned numbers in base can be
done as follows:
Complements
Example 1.5
Using 10's complement, subtract 72532 3250.
Example 1.6
Using 10's complement, subtract 3250 72532.
There is no end carry.
Therefore, the answer is (10's complement of 30718) = 69282.
Complements
Example 1.7
Given the two binary numbers = 1010100 and = 1000011, perform the
subtraction (a) ; and (b) , by using 2's complement.
There is no end carry.
Therefore, the answer is
Y X = (2's complement
of 1101111) = 0010001.
Complements
Subtraction of unsigned numbers can also be done by means of the ( 1)'s
complement. Remember that the ( 1) 's complement is one less then the 's
complement.
Example 1.8
Repeat Example 1.7, but this time using 1's complement.
There is no end carry,
Therefore, the answer is Y
X = (1's complement of
1101110) = 0010001.
1.6 Signed Binary Numbers
To represent sign integers, we need a notation for the sign.
It is customary to represent the sign with a bit placed in the
leftmost position of the binary number digits.
The convention is to make the sign bit 0 for positive and 1 for
negative.
Example:
Table 1.3 lists all possible four-bit signed binary numbers in the
three representations.
Signed Binary Numbers
Signed Binary Numbers
Arithmetic addition
The addition of two numbers in the signed-magnitude system follows the rules of
ordinary arithmetic. If the signs of the two numbers are the same, we add the
two magnitudes and give the sum the common sign. If the signs of the two
numbers are different, we subtract the smaller magnitude from the larger and
give the difference the sign of the larger magnitude.
The addition of two signed binary numbers with negative numbers represented in
signed-2's-complement form is obtained from the addition of the two numbers,
including their sign bits.
A carry out of the sign-bit position is discarded.
Example:
Signed Binary Numbers
Arithmetic Subtraction
In 2 -complement form:
1. Take the 2
and add it to the minuend (including sign bit).
2. A carry out of sign-bit position is discarded.
( A) ( B) ( A) ( B )
( A) ( B) ( A) ( B )
Example:
( 6) ( 13) (11111010 11110011)
(11111010 + 00001101)
00000111 (+ 7)
Binary Codes
An n-bit binary code is an n-bit word which
can represent up to 2n different elements.
Example: 3-bit code can represent up to 8
1.7 Binary Codes
Example: A
binary code
for the seven
colors of the
rainbow
Code 100 is
not used
Given binary digits (called bits), a binary
code is a mapping from a set of represented
elements to a subset of the 2 binary
numbers or elements.
Binary Coded Decimal (BCD)
The BCD code is the 8,4,2,1 code.
This code only encodes the ten decimal
digits from 0 to 9.
Each decimal digit is coded separately by
4 bits
Example:
(325)10 = (0011 0010 0101)BCD
Exercise: (856)10 = ( )BCD
Binary Codes
BCD Code
A number with k decimal digits will
require 4k bits in BCD.
Decimal 396 is represented in BCD
with 12bits as 0011 1001 0110, with
each group of 4 bits representing one
decimal digit.
A decimal number in BCD is the
same as its equivalent binary number
only when the number is between 0
and 9.
The binary combinations 1010
through 1111 are not used and have
no meaning in BCD.
Binary Code
Example:
Consider decimal 185 and its corresponding value in BCD and binary:
BCD addition
Binary Code
Example:
Consider the addition of 184 + 576 = 760 in BCD:
Decimal Arithmetic: (+375) + (-240) = +135
Hint : using 10
Binary Codes
Weighted codes:
BCD (8421) 6311 2421 642-3 84-2-1
Non-Weighted codes:
Excess-3 Gray
Alphanumeric codes:
EBCDIC and ASCII
Weighted codes and non-weighted codes are used to
represent the decimal numbers.
Alphanumeric codes are used to represent the
numeric and nonnumeric data (characters).
Error detection codes (Parity).
Error detection codes are used to detect the errors
during the data transmission.
Weighted codes use 4 binary digits to represent (0-9)
decimal numbers.
Binary codes
Binary codes are codes which are represented in binary system with
modification from the original ones. There are two types of codes:
1. Weighted Binary codes
2. Non Weighted Codes
Codes
Weighted binary codes: are those which obey the positional weighting
principles, each position of the number represents a specific weight. The
binary counting sequence is an example.
Reflective Code:
A code is said to be reflective when code for 9 is complement for the
code for 0, and so is for 8 and 1 codes, 7 and 2, 6 and 3, 5 and 4. Codes
2421, 5211, and excess-3 are reflective, whereas the 8421 code is not.
Sequential Codes:
A code is said to be sequential when two subsequent codes, seen as
numbers in binary representation, differ by one. This greatly aids
mathematical manipulation of data. The 8421 and Excess-3 codes are
sequential, whereas the 2421 and 5211 codes are not.
Non weighted codes
Non weighted codes are codes that are not positionally weighted. That is,
each position within the binary number is not assigned a fixed value.
Codes
Excess-3 Code
Excess-3 is a non weighted code used to express decimal numbers. The
code derives its name from the fact that each binary code is the
corresponding 8421 code plus 0011(3).
Gray Code
The gray code belongs to a class of codes called minimum change
codes, in which only one bit in the code changes when moving from
one code to the next.
The Gray code is non-weighted code, as the position of bit does not
contain any weight.
The gray code is a reflective digital code which has the special
property that any two subsequent numbers codes differ by only one bit.
This is also called a unit- distance code.
In digital Gray code has got a special place.
Codes
Codes
Binary to Gray Conversion
Gray Code MSB is binary code MSB.
Gray Code MSB-1 is the XOR of binary code MSB and MSB-1.
MSB-2 bit of gray code is XOR of MSB-1 and MSB-2 bit of binary code.
MSB-N bit of gray code is XOR of MSB-N-1 and MSB-N bit of binary code
8421 BCD code ( Natural BCD code):
Each decimal digit 0 through 9 is coded by a 4 bit binary number called
natural binary codes.
Because of the 8,4,2,1 weights attached to it. It is a weighted code and also
sequential . it is useful for mathematical operations.
The advantage of this code is its case of conversion to and from decimal.
It is less efficient than the pure binary, it require more bits.
Ex: 14 1110 in binary
But as 0001 0100 in 8421 ode.
The disadvantage of the BCD code is that , arithmetic operations are more
complex than they are in pure binary .
Codes
There are 6 illegal combinations
1010,1011,1100,1101,1110,1111 in these codes, they are
not part of the 8421 BCD code system .
The disadvantage of 8421 code does not follow the
rules of binary addition 8421, but only to the individual 4
bit groups.
Binary Codes
Other Decimal Codes
Binary Codes
Gray Code
The advantage is that only one bit
in the code group changes in going
from one number to the next.
Error detection.
Representation of analog data.
Low power design.
000 001
010 011
100 101
110 111
1-1 and onto!!
Gray Code to Binary Conversion
Binary Code to Gray Conversion
ALPHANUMERIC CODES - ASCII Character Codes
American Standard Code for Information
Interchange
This code is a popular code used to
represent information sent as character-
based data. It uses 7-bits to represent:
94 Graphic printing characters.
34 Non-printing characters
Some non-printing characters are used for
text format (e.g., BS = Backspace, CR =
carriage return, STX and ETX start and end
text areas).
ASCII Code: B7B6B5 B4B3B2B1
Binary Codes
ASCII Character Code
ASCII Properties
ASCII has some interesting properties:
Digits 0 to 9 span Hexadecimal values 3016 to 3916
Upper case A-Z span 4116 to 5A16
Lower case a-z span 6116 to 7A16
Lower to upper case translation (and vice versa)
occurs by flipping the 6th bit.
Binary Codes
Error-Detecting Code
To detect errors in data communication and processing, an eighth bit is
sometimes added to the ASCII character to indicate its parity.
A parity bit is an extra bit included with a message to make the total
number of 1's either even or odd.
Example:
Consider the following two characters and their even and odd parity:
PARITY BIT Error-Detection Codes
Redundancy (e.g. extra information), in the form of
extra bits, can be incorporated into binary code words
to detect and correct errors.
A simple form of redundancy is parity, an extra bit
appended onto the code word
to make the number of 1 .
Parity can detect all single-bit errors and some
multiple-bit errors.
1.8 Binary Storage and Registers
Registers
A binary cell is a device that possesses two stable states and is capable of
storing one of the two states.
A register is a group of binary cells. A register with cells can store any
discrete quantity of information that contains bits.
n cells 2n possible states
A binary cell
Two stable state
Store one bit of information
Examples: flip-flop circuits, ferrite cores, and capacitor.
Register Transfer
A transfer of the information stored in one register to another.
One of the major operations in digital system.
1.9 Binary Logic
Definition of Binary Logic
Binary logic consists of binary variables and a set of logical operations.
The variables are designated by letters of the alphabet, such as , , , , , ,
etc, with each variable having two and only two distinct possible values: 1 and 0,
Three basic logical operations: AND, OR, and NOT.
Binary Logic
Truth Tables, Boolean Expressions, and Logic Gates
AND OR NOT
0 0 0 0 0 0 0 1
0 1 0 0 1 1 1 0
1 0 0 1 0 1
1 1 1 1 1 1
= = = + = =
x x x
y z y z z
Switching Circuits
Switching Circuits
AND OR
Binary Logic
Logic gates
Example of binary signals
3
Logic 1
2
Un-define
1
Logic 0
0
Figure 1.3 Example of binary signals
Binary Logic
Logic gates
Graphic Symbols and Input-Output Signals for Logic gates:
Fig. 1.4 Symbols for digital logic circuits
Fig. 1.5 Input-Output signals for gates
Binary Logic
Logic gates
Graphic Symbols and Input-Output Signals for Logic gates:
Fig. 1.6 Gates with multiple inputs
Ch1
105