DLD - Ch.1 Notes PDF

Digital Logic Design
Cell phones and handheld devices of various kinds offer new,

competing features almost daily. Underneath the attractive graphical
user interface of all of these devices sits a digital system that
processes data in a binary format.
Ch.1: Digital Systems & Binary Numbers

1.1 Digital Systems
1.2 Binary Numbers
1.3 Number‐Base Conversions
1.4 Octal and Hexadecimal Numbers
1.5 Complements of Numbers
1.6 Signed Binary Numbers
1.7 Binary Codes
1.8 Binary Storage and Registers
1.9 Binary Logic
1.1: Digital Systems

Digital systems are used in communication, business transactions,
traffic control, spacecraft guidance, medical treatment, weather
monitoring, the Internet, and many other commercial, industrial, and
scientific enterprises. We have digital telephones, digital televisions,
digital versatile discs (DVD), digital cameras, handheld devices, and,
of course, digital computers. Most, if not all, of these devices have a
special‐purpose digital computer embedded within them.
Digital computer can follow a sequence of instructions, called a

program that operates on given data. The user can specify and
change the program or the data according to the specific need.
Because of this flexibility, general‐purpose digital computers can
Mohammad S. Alzyout DLD Notes Page 1

perform a variety of information‐processing tasks that range over a
wide spectrum of applications.
Digital systems can represent and manipulate discrete elements of

information. Any set that is restricted to a finite number of elements
contains discrete information. Examples of discrete sets are the 10
decimal digits and the 26 letters of the alphabet.
Discrete elements of information are represented in a digital system

by physical quantities called signals. The signals in most present‐
day electronic digital systems use just two discrete values and are
therefore said to be binary. A binary digit, called a bit, has two
values: 0 & 1.
Discrete elements of information are represented with groups of bits

called binary codes. For example, the decimal digits 0 through 9 are
represented in a digital system with a code of four bits (e.g., the
number 7 is represented by 0111). How a pattern of bits is
interpreted as a number depends on the code system in which it
resides. We could write (0111)2 to indicate that the pattern 0111 is to
be interpreted in a binary system, and (0111)10 to indicate that the
reference system is decimal.
Through various techniques, groups of bits can be made to

represent discrete symbols, not necessarily numbers, which are then
used to develop the system in a digital format. Thus, a digital
system is a system that manipulates discrete elements of
information represented internally in binary form. In today’s
technology, binary systems are most practical because, as we will
see, they can be implemented with electronic components.
Discrete quantities of information either emerge from the nature of

the data being processed or may be quantized from a continuous
process. A research scientist may observe a continuous process, but
record only specific quantities in tabular form. The scientist is
thus quantizing continuous data, making each number in his or her

table a discrete quantity. The quantization of a process can be
performed automatically by an Analog‐to‐Digital Converter (ADC), a
device that forms a digital (discrete) representation of an analog
(continuous) quantity.
The general‐purpose digital computer is the best‐known example

of a digital system. The major parts of a computer are a memory unit,
a Central Processing Unit (CPU), and Input/Output (I/O) units. The
memory unit stores programs as well as input, output, and
intermediate data. The CPU performs arithmetic and other data‐
processing operations as specified by the program.
The program and data prepared by a user are transferred into

memory by means of an input device such as a keyboard. An output
device, such as a printer, receives the results of the computations,
and the printed results are presented to the user.
A digital computer can accommodate many input and output

devices. One very useful device is a communication unit that provides
interaction with other users through the Internet. A digital computer
is a powerful instrument that can perform not only arithmetic
computations, but also logical operations. In addition, it can
be programmed to make decisions based on internal and
external conditions.
Most digital devices are programmable. By changing the program in

a programmable device, the same underlying hardware can be used
for many different applications, thereby allowing its cost of
development to be spread across a wider customer base.
Dramatic cost reductions in digital devices have come about because

of advances in digital Integrated Circuit (IC) technology. As the
number of transistors that can be put on a piece of silicon increases
to produce complex functions, the cost per unit decreases and digital
devices can be bought at an increasingly reduced price.

Digital systems can be made to operate with extreme reliability by
using error‐correcting codes.
A digital system is an interconnection of digital modules. To

understand the operation of each digital module, it is
necessary to have a basic knowledge of digital circuits and
their logical function.
Operands used for calculations may be expressed in the binary

number system. Other discrete elements, including the decimal
digits and characters of the alphabet, are represented in binary
codes. Digital circuits, also referred to as logic circuits, process
data by means of binary logic elements (logic gates) using binary
signals. Quantities are stored in binary (two‐valued) storage elements
(flip‐flops).
The purpose of this chapter is to introduce the various binary

concepts as a frame of reference for further study in the succeeding
chapters.
1.2: Binary Numbers

A decimal number such as 7,392 represents a quantity equal to 7
thousands, plus 3 hundreds, plus 9 tens, plus 2 units. To be more
exact, 7,392 is a shorthand notation for what should be written as:
In general, a number with a decimal point is represented by a series

of coefficients:
The coefficients are any of the 10 digits (0, 1, 2, …, 9), and the
subscript value gives the place value and, hence, the power of 10 by
which the coefficient must be multiplied.

Thus, the preceding decimal number can be expressed as:
with .
The decimal number system is said to be of base, or radix, 10

because it uses 10 digits and the coefficients are multiplied by
powers of 10.
The binary system is a different number system. The coefficients of

the binary number system have only two possible values . Each
coefficient is multiplied by a power of the radix ( ), and the
results are added to obtain the decimal equivalent of the number.
The radix point (decimal point in the decimal system), distinguishes

positive powers of the radix from the negative powers. For example,
the decimal equivalent of the binary number is:
There are many different number systems. In general, a number

expressed in a base‐r has coefficients multiplied by powers of r:
The coefficients value range from . To distinguish

between numbers of different bases, we enclose the coefficients in
parentheses and write a subscript equal to the base used.
An example of a base‐5 number is:
The coefficient values for base 5 can be only 0, 1, 2, 3, and 4.
The octal number system is a base‐8 system that has eight digits: 0,
1, 2, 3, 4, 5, 6, 7.

An example of an octal number is . To determine its
equivalent decimal value, we expand the number in a power series
with a base of 8 as:
Note that the digits 8 and 9 cannot appear in an octal number.
Every system with the base of less than 10 borrows the needed r
digits for the coefficients from the decimal system. The letters of the
alphabet are used to supplement the 10 decimal digits when
the base of the number is greater than 10. For example, in the
hexadecimal (base‐16) number system, the first 10 digits are
borrowed from the decimal system. The letters A, B, C, D, E, and F
are used for the digits 10, 11, 12, 13, 14, and 15, respectively. An
example of a hexadecimal number is:
The hexadecimal system is used commonly by designers to represent

long strings of bits in the addresses, instructions, and data in digital
systems.
For example, B65F is used to represent 1011 0110 0101 1111.
As noted before, the digits in a binary number are called bits. When
a bit is equal to 0, it does not contribute to the sum during the
conversion. Therefore, the conversion from binary to decimal can be
obtained by adding only the numbers with powers of two
corresponding to the bits that are equal to 1. For example,
There are four 1’s in the binary number. The corresponding decimal
number is the sum of the four powers of two. In computer work, is
referred to as K (kilo), as M (mega), as G (giga), and as T
(tera). Thus, and .

Computer capacity is usually given in bytes. A byte is equal to
eight bits and can represent the code of one keyboard character. A
computer hard disk with four gigabytes of storage has a capacity of
(approximately 4 billion bytes). A terabyte is 1024
gigabytes, approximately 1 trillion bytes.
Arithmetic operations with numbers in base r follow the same

rules as for decimal numbers. When a base other than the familiar
base 10 is used, one must be careful to use only the r‐allowable
digits. Examples of addition, subtraction, and multiplication of two
binary numbers are as follows:
Zero and the first 24 numbers obtained from 2 to the power of

n are listed in Table 1.1

1.3: Number-Base Conversions
Representations of a number in a different radix are said to be
equivalent if they have the same decimal value. For example,
and are equivalent, both have decimal value 9.
The conversion of a number in base r to decimal is done by

expanding the number in a power series and adding all the terms as
shown previously. We now present a general procedure for the
reverse operation of converting a decimal to a number in base r.
If the number includes a radix point, it is necessary to separate the

number into an integer part and a fraction part, since each part
must be converted differently. The conversion of a decimal integer to
a number in base r is done by dividing the number and all successive
quotients by r and accumulating the remainders. This procedure is
best illustrated by example.
EXAMPLE 1.1
Convert decimal 41 to binary.
SOLUTION
Therefore, the answer is .
Conversion from decimal integers to any base‐r system is similar to

this example, except that division is done by r instead of 2.

EXAMPLE 1.2
Convert decimal 153 to octal.
SOLUTION
Therefore, the answer is .
The conversion of a decimal fraction to binary is accomplished by a

method similar to that used for integers. However, multiplication is
used instead of division, and integers instead of remainders are
accumulated. Again, the method is best explained by example.
EXAMPLE 1.3
Convert to binary.
SOLUTION
The answer is .
The process is continued until the fraction becomes 0 or until the

number of digits has sufficient accuracy.

EXAMPLE 1.4
Convert to octal.
SOLUTION
The answer, to seven significant figures, is obtained from the integer

part of the products:
1.4 Octal and Hexadecimal Numbers

The conversion from and to binary, octal, and hexadecimal plays an
important role in digital computers, because shorter patterns of hex
characters are easier to recognize than long patterns of 1’s and 0’s.
Since and , each octal digit corresponds to three binary
digits and each hexadecimal digit corresponds to four binary digits.
The conversion from binary to octal is accomplished by partitioning

the binary number into groups of three digits each, starting from the
binary point and proceeding to the left and to the right. For example,
the octal of
Conversion from binary to hexadecimal is similar, except that the

binary number is divided into groups of four digits:

Conversion from octal or hexadecimal to binary is done by reversing
the preceding procedure. Each octal digit is converted to its
three‐digit binary equivalent. Similarly, each hexadecimal digit is
converted to its four‐digit binary equivalent. The procedure is
illustrated in the following examples:
The first 16 numbers in the decimal, binary, octal, and

hexadecimal number systems are listed in Table 1.2.

The binary number has 12 digits and is expressed in
octal as 7777 (4 digits) or in hexadecimal as FFF (3 digits). The octal
or hexadecimal representation is more desirable because it can be
expressed more compactly with a third or a quarter of the number of
digits required for the equivalent binary number. Thus, most
computer manuals use either octal or hexadecimal numbers to
specify binary quantities.
1.5 Complements of Numbers

Complements are used in digital computers to simplify the
subtraction operation and for logical manipulation. Simplifying
operations leads to simpler, less expensive circuits to implement the
operations. There are two types of complements for each base‐r
system: The first is referred to as the r’s complement and the second
as the ’s complement. When the value of the base r is
substituted in the name, the two types are referred to as the 2’s
complement and 1’s complement for binary numbers and the 10’s
complement and 9’s complement for decimal numbers.
Diminished Radix ’s Complement:

Given a number N in base r having n digits, the ’s complement
of N is defined as , as the following examples:
The 9’s complement of 546700 is .
Therefore, the 1’s complement of a binary number is formed by

changing 1’s to 0’s and 0’s to 1’s.

The ’s complement of octal or hexadecimal numbers is obtained
by subtracting each digit from 7 or F (decimal 15), respectively.
Radix ’s Complement
The r’s complement of an n‐digit number N in base r is defined as
for and as 0 for . Comparing with the ’s
complement, we note that the r’s complement is obtained by adding
1 to the ’s complement.
Thus, the 10’s complement of decimal 2389 is and

is obtained by adding 1 to the 9’s complement value. The 2’s
complement of binary 101100 is by adding 1
to the 1’s‐complement value, as the following examples:
The 10’s complement of 012398 is
The 10’s complement of 246700 is
Similarly, the 2’s complement can be formed by leaving all least

significant 0’s and the first 1 unchanged and replacing 1’s with 0’s
and 0’s with 1’s in all other higher significant digits. For example:
The 2’s complement of 1101100 is 0010100
The 2’s complement of 0110111 is 1001001
In the previous definitions, it was assumed that the numbers did not
have a radix point. If the original number N contains a radix point,
the point should be removed temporarily in order to form the
complement. The radix point is then restored to the
complemented number in the same relative position.
It is also worth mentioning that the complement of the

complement restores the number to its original value.

Subtraction with Complements
The subtraction of two n‐digit unsigned numbers in base r can
be done as follows:
1. Add the minuend M to the r’s complement of the subtrahend N.

Mathematically,
2. If , the sum will produce an end carry , which can be
discarded; what is left is the result .
3. If , the sum does not produce an end carry and is equal
to , which is the r’s complement of . To
obtain the answer in a familiar form, take the r’s complement of
the sum and place a negative sign in front.
EXAMPLE 1.5
Using complement, subtract .
SOLUTION
EXAMPLE 1.6
Using complement, subtract .
SOLUTION
There is no end carry.

Therefore, the answer is
EXAMPLE 1.7
Given the two binary numbers and , using

complements perform the subtraction
a) X - Y
b) Y - X
SOLUTION
a)
b)
Subtraction of unsigned numbers can also be done by means of the

complement. Remember that the complement is one
less than the complement. Because of this, the result of adding
the minuend to the complement of the subtrahend produces a sum
that is one less than the correct difference when an end carry occurs.
Removing the end carry and adding 1 to the sum is referred to as an
end‐around carry.
EXAMPLE 1.8
Repeat Example 1.7, but this time using complement.

SOLUTION
a)
b)
Note that the negative result is obtained by taking the complement

of the sum, since this is the type of complement used.
The procedure with end‐around carry is also applicable to subtracting

unsigned decimal numbers with complement.
1.6 Signed Binary Numbers

Positive integers (including zero) can be represented as unsigned
numbers. However, to represent negative integers, we need a
notation for negative values. In ordinary arithmetic, a negative
number is indicated by a minus sign and a positive number by a plus
sign. Because of hardware limitations, computers must represent
everything with binary digits. It is customary to represent the sign
with a bit placed in the leftmost position of the number. The
convention is to make the sign bit 0 for positive and 1 for negative.

If the binary number is signed, then the leftmost bit represents the
sign and the rest of the bits represent the number. If the binary
number is assumed to be unsigned, then the leftmost bit is the Most
Significant Bit (MSB) of the number.
The string of bits represents the binary equivalent of when

considered as an unsigned number and the binary equivalent of
when considered as a signed number.
The representation of the signed numbers can be achieved by two

conventions: signed‐magnitude & signed‐ complement systems. In
the signed‐magnitude convention, the number consists of a
magnitude and a bit (0 or 1) indicating the sign. Whereas the signed-
complement, a negative number is indicated by its complement.
Since positive numbers always start with 0 (plus) in the leftmost

position, the complement will always start with a 1, indicating a
negative number.
As an example, consider the number 9, represented in binary with

eight bits. is represented with a sign bit of 0 in the leftmost
position, followed by the binary equivalent of 9, which gives
00001001. Note that all eight bits must have a value; therefore, 0’s
are inserted following the sign bit up to the first 1.
Although there is only one way to represent , there are three

different ways to represent with eight bits:
 signed‐magnitude representation: 10001001

 signed‐1’s‐complement representation: 11110110
 signed‐2’s‐complement representation: 11110111
Table 1.3 lists all possible four‐bit signed binary numbers in the
three representations. The equivalent decimal number is also shown
for reference. Note that the positive numbers in all three
representations are identical and have 0 in the leftmost position.

Arithmetic Addition
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.
Numerical examples for addition follow:

Note that negative numbers must be initially in 2’s‐complement
form and that if the sum obtained after the addition is negative, it is
in 2’s complement form. For example, -7 is represented as
11111001, which is the 2’s complement of +7.
In order to obtain a correct answer, we must ensure that the result

has a sufficient number of bits to accommodate the sum. If we
start with two n‐bit numbers and the sum occupies n+1 bits, we say
that an overflow occurs. When one performs the addition with
paper and pencil, an overflow is not a problem, because we are not
limited by the width of the page. We just add another 0 to a positive
number or another 1 to a negative number in the most significant
position to extend the number to n+1 bits and then perform the
addition.
Overflow is a problem in computers because the number of bits that

hold a number is finite, and a result that exceeds the finite value by
1 cannot be accommodated.
The complement form of representing negative numbers is unfamiliar

to those used to the signed‐magnitude system. To determine the
value of a negative number in signed‐2’s complement, it is necessary
to convert the number to a positive number to place it in a more
familiar form. For example, the signed binary number 11111001 is
negative because the leftmost bit is 1. Its 2’s complement is
00000111, which is the binary equivalent of . We therefore
recognize the original negative number to be equal to .
Arithmetic Subtraction
Take the 2’s complement of the subtrahend (including the sign bit)
and add it to the minuend (including the sign bit). A carry out of the
sign‐bit position is discarded.

To see this, consider the subtraction . In binary
with eight bits, this operation is written as .
The subtraction is changed to addition by taking the 2’s
complement of the subtrahend , giving . In binary, this
is . Removing the end carry, we
obtain the correct answer:
It is worth noting that binary numbers in the signed ‐complement

system are added and subtracted by the same basic addition and
subtraction rules as unsigned numbers. Therefore, computers need
only one common hardware circuit to handle both types of
arithmetic.
1.7 Binary Codes

A binary number of n digits, for example, may be represented by n
circuit elements, each having an output signal equivalent to 0 or 1.
Digital systems represent many discrete elements of information. Any

discrete element of information that is distinct among a group of
quantities can be represented with a binary code (i.e., a pattern of
0’s and 1’s).
An n‐bit binary code is a group of n bits that assumes up to

distinct combinations of 1’s and 0’s, with each combination
representing one element of the set that is being coded.
A set of four elements can be coded with two bits, with each element
assigned one of the following bit combinations: 00, 01, 10, and 11.
A set of eight elements requires a three‐bit code and a set of 16
elements requires a four‐bit code. The bit combination of an n‐bit
code is determined from the count in binary from to .
Although the minimum number of bits required to code distinct

quantities is n, there is no maximum number of bits that may be
used for a binary code.

For example, the 10 decimal digits can be coded with 10 bits, and
each decimal digit can be assigned a bit combination of nine 0’s and
a 1. In this particular binary code, the digit 6 is assigned the bit
combination 0001000000.
Binary-Coded Decimal (BCD) Code

Since the computer can accept only binary values, we must represent
the decimal digits by means of a code that contains 1’s and 0’s. It is
also possible to perform the arithmetic operations directly on decimal
numbers when they are stored in the computer in coded form.
A binary code will have some

unassigned bit combinations if
the number of elements in the set
is not a multiple power of 2. The
10 decimal digits form such a set.
A binary code that distinguishes
among 10 elements must contain
at least four bits, but 6 out of the
16 possible combinations remain
unassigned.
Table 1.4 gives the four‐bit code

for one decimal digit. A number
with k decimal digits will require
4k bits in BCD.
Decimal 396 is represented in BCD with 12 bits as 0011 1001

0110, with each group of 4 bits representing one decimal digit.
The binary combinations 1010 through 1111 are not used and
have no meaning in BCD.
Decimal 185 and its corresponding value in BCD and binary:

It is important to realize that BCD numbers are decimal numbers and
not binary numbers, although they use bits in their representation.
The only difference between a decimal number and BCD is that
decimals are written with the symbols and BCD numbers
use the binary code .
Decimal 10 is represented in BCD with eight bits as and

decimal 15 as . The corresponding binary values are
and and have only four bits.
BCD Addition
Since each digit does not exceed 9, the sum cannot be greater than
, with the 1 being a previous carry. Suppose we add
the BCD digits as if they were binary numbers. Then the binary sum
will produce a result in the range from 0 to 19. In binary, this range
will be from 0000 to 10011, but in BCD, it is from 0000 to 1 1001,
with the first (i.e., leftmost) 1 being a carry and the next four bits
being the BCD sum. Consider the following three BCD additions:
The addition of to the binary sum converts it to the

correct digit and also produces a carry as required. The addition of
two n‐digit unsigned BCD numbers follows the same procedure.
Consider the addition of in BCD:

Decimal Arithmetic
The procedures developed for the signed‐2’s‐complement system in
the previous section also apply to the signed‐10’s‐complement
system for decimal numbers. Addition is done by summing all digits,
including the sign digit, and discarding the end carry. This operation
assumes that all negative numbers are in 10’s‐complement form.
Consider the addition ,
done in the signed‐complement system: The 9 in the
leftmost position of the second number represents a
minus, and 9760 is the 10’s complement of 0240.
The subtraction of decimal numbers, either unsigned or signed-

10’s-complement system, is the same as in the binary case: Take
the 10’s complement of the subtrahend and add it to the minuend.
Other Decimal Codes

Many different codes can be formulated by arranging four bits into
10 distinct combinations. BCD and three other representative codes
are shown in Table 1.5.
BCD and the 2421 code are weighted codes. In a weighted code,
each bit position is assigned a weighting factor in such a way that
each digit can be evaluated by adding the weights of all the 1’s in the
coded combination. BCD adders add BCD values directly, digit by
digit, without converting the numbers to binary. However, it is
necessary to add 6 to the result if it is greater than 9.
Excess‐3 is an un-weighted code in which each coded combination is

obtained from the corresponding binary value plus 3.
The 8,4,-2,-1 code is an example of assigning both positive and

negative weights to a decimal code. In this case, the bit combination
0110 is interpreted as decimal 2 and is calculated from
.

2421 & excess‐3 codes are examples of self‐complementing codes.
Such codes have the property that the 9’s complement of a decimal
number is obtained directly by changing 1’s to 0’s and 0’s to 1’s (by
complementing each bit in the pattern). For example, decimal 395 is
represented in the excess‐3 code as . The 9’s
complement of 604 is represented as , which is
obtained simply by complementing each bit of the code (as with the
1’s complement of binary numbers).
Gray Code
The output data of many physical systems are quantities that are
continuous. These data must be converted into digital form before
they are applied to a digital system, using an Analog‐to‐Digital
Converter (ADC).

It is sometimes convenient to use the Gray code shown in Table 1.6
to represent digital data that have been converted from analog data.
The advantage of the Gray code

over the straight binary number
sequence is that only one bit in
the code group changes in going
from one number to the next.
The Gray code is used in

applications in which the normal
sequence of binary numbers
generated by the hardware may
produce an error or ambiguity
during the transition from one
number to the next.
This could have serious

consequences for the machine
using the information. The Gray
code eliminates this problem,
since only one bit changes its
value during any transition
between two numbers.
ASCII Character Code

Many applications of digital computers require the handling not only
of numbers, but also of other characters or symbols, such as the
letters of the alphabet. An alphanumeric character set is a set of
elements that includes the 10 decimal digits, the 26 letters of the
alphabet, and a number of special characters.
The standard binary code for the alphanumeric characters is the

American Standard Code for Information Interchange (ASCII),
which uses seven bits to code 128 characters, as shown in Table 1.7.

The seven bits of the code are designated by through , with
the most significant bit. The letter A, for example, is represented in
ASCII as 100 0001 (column 100, row 0001). The ASCII code also
contains 94 graphic characters that can be printed and 34
nonprinting characters used for various control functions. The graphic
characters consist of the 26 uppercase letters (A through Z), the 26
lowercase letters (a through z), the 10 numerals (0 through 9), and
32 special printable characters, such as %, *, and $.
The control characters are used for routing data and arranging the
printed text into a prescribed format. There are three types of control
characters:
 Format effectors that control the layout of printing, such as: (BS)
backspace, (HT) horizontal tabulation, and (CR) carriage return.
 Information separators that are used to separate the data
into divisions such as paragraphs and pages, such as: (RS)
record separator and (FS) file separator.
 Communication‐control characters that are useful during the
transmission of text between remote devices, such as: STX
(start of text) and ETX (end of text), which are used to frame a
text message transmitted through a communication channel.
ASCII is a seven‐bit code, but most computers manipulate an eight‐

bit quantity as a single unit called a byte. Therefore, ASCII
characters most often are stored one per byte.
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. For example:

In each case, we insert an extra bit in the leftmost position of the
code to produce an even number of 1’s in the character for even
parity or an odd number of 1’s in the character for odd parity. In
general, one or the other parity is adopted, with even parity being
more common.
The parity bit is helpful in detecting errors during the transmission

of information from one location to another. If the parity of the
received character is not even, then at least one bit has changed
value during the transmission. This method detects one, three, or any
odd combination of errors in each character that is transmitted. An
even combination of errors, however, goes undetected, and additional
error detection codes may be needed to take care of that possibility.
What is done after an error is detected depends on the particular

application. One possibility is to request retransmission of the
message on the assumption that the error was random and will not
occur again. Thus, if the receiver detects a parity error, it sends back
the ASCII NAK (negative acknowledge) control character consisting of
an even‐parity eight bits 10010101. If no error is detected, the
receiver sends back an ACK (acknowledge) control character,
namely, 00000110.
The sending end will respond to an NAK by transmitting the message

again until the correct parity is received. If, after a number of
attempts, the transmission is still in error, a message can be sent to
the operator to check for malfunctions in the transmission path.
1.8 Binary Storage and Registers

The binary information in a digital computer must have a physical
existence in some medium for storing individual bits. A binary cell is
a device that possesses two stable states and is capable of storing
one bit (0 or 1) of information. A register is a group of binary cells. A
register with n cells can store any discrete quantity of information
that contains n bits.
Consider, for example, a 16‐bit register with the following binary
content:
A register with 16 cells can be in one of possible states. The

register can store any binary number from 0 to . The content
of the register is the binary equivalent of the decimal number
50,121. If one assumes instead that the register stores
alphanumeric characters of an eight‐bit code, for the ASCII code with
an even parity, the register contains the two characters C (the
leftmost eight bits) and I (the rightmost eight bits). If, however, one
interprets the content of the register to be four decimal digits
represented by a four‐bit code, in the excess‐3 code, the register
holds the decimal number 9,096.
From this example, it is clear that a register can store discrete

elements of information and that the same bit configuration may be
interpreted differently for different types of data depending on the
application.
Register Transfer
In digital systems, a register transfer operation is a basic operation

that consists of a transfer of binary information from one set of
registers into another set of registers. The transfer may be direct,
from one register to another, or may pass through data‐processing
circuits to perform an operation.
Figure 1.1 illustrates the transfer of information among registers and

demonstrates pictorially the transfer of binary information from a
keyboard into a register in the memory unit. The input unit is
assumed to have a keyboard, a control circuit, and an input register.
Each time a key is struck, the control circuit enters an equivalent

eight‐bit alphanumeric character code into the input register.

The information from the input register is transferred into the eight
least significant cells of a processor register. After every transfer,
the input register is cleared to enable the control to insert a new
eight‐bit code when the keyboard is struck again. Each eight‐bit
character transferred to the processor register is preceded by a shift
of the previous character to the next eight cells on its left. When a
transfer of four characters is completed, the processor register is
full, and its contents are transferred into a memory register.

To process discrete quantities of information in binary form, a
computer must be provided with devices that hold the data to be
processed and with circuit elements that manipulate individual bits
of information. The device most commonly used for holding
data is a register. Binary variables are manipulated by means of
digital logic circuits. Figure 1.2 illustrates the process of adding
two 10‐bit binary numbers. The memory unit, which normally
consists of millions of registers, is shown with only three registers.

The last two examples demonstrated the information‐flow capabilities
of a digital system in a simple manner. The registers of the system
are the basic elements for storing and holding the binary information.
Digital logic circuits process the binary information stored in the
registers. Digital logic circuits and registers are covered in Chapters 2
through 6. The memory unit is explained in Chapter 7.
1.9 Binary Logic

Binary logic deals with variables that take on two discrete values
(true & false, high & low, 1 &0, etc.) and with operations that assume
logical meaning. The purpose of this section is to introduce Boolean
algebra (Ch.2) and relate it to digital logic circuits and binary signals.
Definition of Binary Logic
Binary logic consists of binary variables and a set of logical

operations. There are three basic logical operations: AND, OR, and
NOT. Each operation produces a binary result, denoted by z.
1. AND: or is read “x AND y is equal to z.” meaning

that if and only if and ; otherwise .
2. OR: is read “x OR y is equal to z,” meaning that
if or if or if both and . If both and
, then .
3. NOT: (or ) is read “not x is equal to z,” meaning that
z is what x is not. If , then , but if , then . It
is also referred to as the complement operation.
The operations AND & OR have similarities to multiplication and

addition, respectively. However, binary logic should not be
confused with binary arithmetic.
For example, in binary arithmetic, we have (read “one

plus one is equal to 2”), whereas in binary logic, we have
(read “one OR one is equal to one”).

Definitions of logical operations may be listed in a compact form
called truth tables. A truth table is a table of all possible
combinations of the variables, showing the relation between the
values that the variables may take and the result of the operation.
The truth tables for AND, OR, and NOT are given in Table 1.8.
Logic Gates
Logic gates are electronic circuits that operate on one or more input
signals to produce an output signal. Voltage‐operated logic circuits
respond to two separate voltage levels that represent a binary
variable equal to logic 1 or logic 0. For example, a particular digital
system may define logic 0 as a signal equal to 0 V and logic 1 as a
signal equal to 3 V. In practice, each voltage level has an acceptable
range, as shown in Fig. 1.3. The intermediate region between the
allowed regions is crossed only during a state transition. Any desired
information for computing or control can be operated on by passing
binary signals through various combinations of logic gates, with each
signal representing a particular binary variable. The graphic symbols
used to designate the three types of gates are shown in Fig. 1.4. The
gates are blocks of hardware that produce the equivalent of logic ‐1 or
logic‐0 output signals if input logic requirements are satisfied.

The input signals x and y in the AND & OR gates may exist in one of
four possible states: 00, 10, 11, or 01. These signals are shown in
Fig. 1.5 together with the corresponding output signal for each gate.
The timing diagrams illustrate the idealized response of each gate to

the four input signal combinations. The horizontal axis of the timing
diagram represents the time, and the vertical axis shows the signal
as it changes between the two possible voltage levels. In reality, the
transitions between logic values occur quickly, but not
instantaneously. The low level represents logic 0, the high level
logic 1.

The NOT gate is commonly referred to as an inverter. The reason for
this name is apparent from the signal response in the timing
diagram, which shows that the output signal inverts the logic sense
of the input signal.
AND & OR gates may have more than two inputs. An AND gate with
three inputs and an OR gate with four inputs are shown in Fig. 1.6.
The three‐input AND gate responds with logic 1 output if all three
inputs are logic 1. The output produces logic 0 if any input is logic 0.
The four‐input OR gate responds with logic 1 if any input is logic 1;
its output becomes logic 0 only when all inputs are logic 0.
Answer all book problems marked with * symbol.

DLD - Ch.1 Notes PDF

Uploaded by

Copyright:

Available Formats

DLD - Ch.1 Notes PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DLD - Ch.1 Notes PDF

Uploaded by

Copyright:

Available Formats

Digital Logic Design

Cell phones and handheld devices of various kinds offer new,

Ch.1: Digital Systems & Binary Numbers

1.1: Digital Systems

Digital computer can follow a sequence of instructions, called a

Mohammad S. Alzyout DLD Notes Page 1

Digital systems can represent and manipulate discrete elements of

Discrete elements of information are represented in a digital system

Discrete elements of information are represented with groups of bits

Through various techniques, groups of bits can be made to

Discrete quantities of information either emerge from the nature of

Mohammad S. Alzyout DLD Notes Page 2

The general‐purpose digital computer is the best‐known example

The program and data prepared by a user are transferred into

A digital computer can accommodate many input and output

Most digital devices are programmable. By changing the program in

Dramatic cost reductions in digital devices have come about because

Mohammad S. Alzyout DLD Notes Page 3

A digital system is an interconnection of digital modules. To

Operands used for calculations may be expressed in the binary

The purpose of this chapter is to introduce the various binary

1.2: Binary Numbers

In general, a number with a decimal point is represented by a series

Mohammad S. Alzyout DLD Notes Page 4

The decimal number system is said to be of base, or radix, 10

The binary system is a different number system. The coefficients of

The radix point (decimal point in the decimal system), distinguishes

There are many different number systems. In general, a number

The coefficients value range from . To distinguish

An example of a base‐5 number is:

The coefficient values for base 5 can be only 0, 1, 2, 3, and 4.

Mohammad S. Alzyout DLD Notes Page 5

Note that the digits 8 and 9 cannot appear in an octal number.

The hexadecimal system is used commonly by designers to represent

For example, B65F is used to represent 1011 0110 0101 1111.

Mohammad S. Alzyout DLD Notes Page 6

Arithmetic operations with numbers in base r follow the same

Zero and the first 24 numbers obtained from 2 to the power of

Mohammad S. Alzyout DLD Notes Page 7

The conversion of a number in base r to decimal is done by

If the number includes a radix point, it is necessary to separate the

Convert decimal 41 to binary.

Therefore, the answer is .

Conversion from decimal integers to any base‐r system is similar to

Mohammad S. Alzyout DLD Notes Page 8

Convert decimal 153 to octal.

Therefore, the answer is .

The conversion of a decimal fraction to binary is accomplished by a

The process is continued until the fraction becomes 0 or until the

Mohammad S. Alzyout DLD Notes Page 9

The answer, to seven significant figures, is obtained from the integer

1.4 Octal and Hexadecimal Numbers

The conversion from binary to octal is accomplished by partitioning

Conversion from binary to hexadecimal is similar, except that the

Mohammad S. Alzyout DLD Notes Page 10

The first 16 numbers in the decimal, binary, octal, and

Mohammad S. Alzyout DLD Notes Page 11

1.5 Complements of Numbers

Diminished Radix ’s Complement: