U-1 Pre-Requisites For DELD

BASIC ELECTRONICS ENGG.
UNIT-III: Number Systems and

Logic Gates
I NUMBER SYSTEMS & CODES
Number systems and their conversion, Signed numbers, 1’s and 2’s complements of binary numbers.
Binary Arithmetic: Addition, Subtraction, 1’s Complement Subtraction, 2’s Complement Subtraction,
Multiplication, Division, Binary Coded Decimal (BCD), 8421 Code, Digital Codes: Gray Code, Excess-3
Code & their conversion to Binary & vice versa, Alpha-Numeric Codes - ASCII code.
II. BOOLEAN ALGEBRAAND COMBINATIONAL LOGIC
Rules & Laws of Boolean Algebra, Boolean addition & Subtraction, Logic Expressions, Demorgan’s
law, Simplification of Boolean Expressions, Karnaugh Map (up to 4-variables), SOP and POS form,
NOT (Inverter), AND, OR, NAND and NOR Gates, Universal Property of NAND and NOR Gates,
NAND and NOR implementation, EXOR and EXNOR gates.
III. COMBINATIONAL LOGIC CIRCUITS
Design of combinational circuits, Half Adder and Full Adder & their realization using combination of
AND, OR, Exclusive - OR and NAND gates, Full Subtractors, Magnitude Comparators, Decoders and
Encoders, Multiplexers and Demultiplexers, Parity Generators/Checkers.
IV. SEQUENTIAL LOGIC CIRCUITS
Introduction, Flip Flops: RS, Clocked-RS, D, JK and T Flip Flops, Triggering of flip flops, Design of
Simple Sequential Circuits.
BOOKS RECOMMENDED:
• Digital Fundamentals by Thomas L. Floyd
•Digital Design (5th Edition) by M. Morris Mano & Michael D.
Ciletti Digital Computer Fundamentals by BARTEE T.
Analog Quantities
Most natural quantities that we see are analog and vary
continuously. Analog systems can generally handle higher
power than digital systems.
Temperature
(F)
100
95
90
85
80
75
70
Time of day
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3 4 5 6 7 8 9 10 11 12
A .M. P.M.
Digital Systems can process, store, and transmit data more

efficiently but can only assign discrete values to each point.
Analog and Digital Systems
Many systems use a mixture of analog and digital electronics to take

advantage of each technology. A typical CD player accepts digital data
from the CD drive and converts it to an analog signal for amplification.
CD drive
10110011101 Digital-to-analog Linear amplifier

Digital data converter Analog
reproduction
of music audio Speaker
signal
Sound
waves
Binary Digits and Logic Levels
Digital electronics uses circuits that have two states, which

are represented by two different voltage levels called HIGH
and LOW. The voltages represent numbers in the binary
system.
VH(max)
In binary, a single number is HIGH
called a bit (for binary digit). A VH(min)
bit can have the value of either Invalid

VL(max)
a 0 or a 1, depending on if the
voltage is HIGH or LOW. LOW
VL(min)
Digital Waveforms
Digital waveforms change between the LOW and HIGH

levels. A positive going pulse is one that goes from a
normally LOW logic level to a HIGH level and then back
again. Digital waveforms are made up of a series of pulses.
HIGH HIGH
Rising or Falling or Falling or Rising or

leading edge trailing edge leading edge trailing edge
LOW LOW
t0 t1 t0 t1
(a) Positive–going pulse (b) Negative–going pulse

Pulse Definitions
Actual pulses are not ideal but are described by the rise time,
fall time, amplitude, and other characteristics.
Overshoot
Ringing
Droop
90%
Amplitude tW
50%
Pulse width
10%
Ringing
Base line Undershoot

tr tf
Rise time Fall time
Periodic Pulse Waveforms
Periodic pulse waveforms are composed of pulses that repeats

in a fixed interval called the period. The frequency is the rate
it repeats and is measured in hertz.
1 1
f  T
T f
The clock is a basic timing signal that is an example of a

periodic wave.
What is the period of a repetitive wave if f = 3.2 GHz?
1 1
T   313 ps
f 3.2 GHz
 8 bits = 1 byte
 1024 Bytes = 1 KB (kilobyte)
 1024 Kilobytes = 1 MB (megabyte)
 1024 Megabytes = 1 GB (gigabyte)
 1024 Gigabytes = 1 TB (Terabyte)
103 Hz =1 kHz (kilohertz)
106 Hz =1 MHz (megahertz)
109 Hz =1 GHz (gigahertz)
1012 Hz =1 THz (terahertz)
A picosecond is 10−12 of a second
10−3 s =1 ms (millisecond)
103 s =1 ks (kilosecond)
10−6 s=1 µs (microsecond)
106 s =1 Ms (megasecond)
 10−9 s=1 ns (nanosecond)
109 s =1 Gs (gigasecond)
10−12 s=1 ps (picosecond)
 1012 s =1Ts (terasecond)
Pulse Definitions
In addition to frequency and period, repetitive pulse waveforms

are described by the amplitude (A), pulse width (tW) and duty
cycle. Duty cycle is the ratio of tW to T.
Volts
Pulse
width
Amplitude (A)
(tW)
Time
Period, T
Timing Diagrams
A timing diagram is used to show the relationship between

two or more digital waveforms,
Clock
C
Serial and Parallel Data
Data can be transmitted by either serial transfer or parallel

transfer.
1 0 1 1 0 0 1 0
t0 t1 t2 t3 t 4 t5 t6 t7
Computer Modem
Computer Printer
0
0
t0 t1
Basic Logic Functions
True only if all input conditions

are true.
True only if one or more input

conditions are true.
Indicates the opposite condition.

Basic System Functions
And, or, and not elements can be combined to form
various logic functions. A few examples are:
The comparison function A

Comparator
A> B
Two
binary A= B Outputs
numbers
B
A< B
Basic arithmetic functions Adder

A
Σ Sum
Two
binary
numbers Cout Carry out
B
Carry in Cin
HIGH
9 Encoder
8
7
6 Binary code
5 for 9 used for
4 storage and/or
The encoding function 7 8 9
3
2
computation
4 5 6
1
1 2 3 0
0 . +/–
Calculator keypad
The decoding function

Decoder
Binary input
7-segment display
The data selection function

Multiplexer Demultiplexer
A D
Data from Data from Data from Data from
Ato D B to E C to F Ato D
∆t1 ∆t1
∆t1 ∆t2 ∆t3 ∆t 1
B E
∆t2 ∆t2
∆t3 ∆t3
C F
Switching Switching
sequence sequence
control input control input
The counting function
Counter Parallel
output lines Binary Binary Binary Binary Binary
code code code code code
1 2 3 4 5 for 1 for 2 for 3 for 4 for 5
Input pulses Sequence of binary codes that represent
the number of input pulses counted.
…and other functions such as code conversion

and storage.
One type of storage function is the shift register,

that moves and stores data each time it is clocked.
Serial bits
on input line
Initially, the register contains onlyinvalid
0101 0 0 0 0 data or all zeros as shown here.
First bit (1) is shifted serially into the

010 1 0 0 0 register.
Second bit (0) is shifted serially into

01 0 1 0 0 register and first bit is shifted right.
Third bit (1) is shifted into register and

0 1 0 1 0 the first and second bits areshifted right.
Fourth bit (0) is shifted into register and

0 1 0 1 the first, second, and third bits areshifted
right. The register now stores all four bits
and is full.
Integrated Circuits
Cutaway view of DIP (Dual-In-line Pins) chip:

Plastic
Chip case
Pins
The TTL series, available as DIPs are popular

for laboratory experiments with logic.
Integrated Circuits
An example of laboratory prototyping is shown. The circuit

is wired using DIP chips and tested.
DIP chips
In this case, testing can
be done by a computer
connected to the system.
Integrated Circuits
DIP chips and surface mount chips
Pin 1
Dual in-line Package Small Outline IC (SOIC)

Decimal Numbers
The position of each digit in a weighted number

system is assigned a weight based on the base or radix of the
system. The radix of decimal numbers is ten, because only
ten symbols (0 through 9) are used to represent any number.
The column weights of decimal numbers are powers

of ten that increase from right to left beginning with 100 =1:
… 105 104 103 102 101 100

For fractional decimal numbers, the column weights
are negative powers of ten that decrease from left to right:
… 102 101 100. 10-1 10-2 10-3 10-4 …
Floyd, Digital Fundamentals, 10th ed Slide 22

Decimal Numbers
Decimal numbers can be expressed as the sum of the

products of each digit times the column value for that digit.
Thus, the number 9240 can be expressed as
(9 x 103) + (2 x 102) + (4 x 101) + (0 x 100)
or
9 x 1,000 + 2 x 100 + 4 x 10 + 0 x 1
Express the number 480.52 as the sum of values of each
digit.
480.52 = (4 x 102) + (8 x 101) + (0 x 100) + (5 x 10-1) +(2 x 10-2)

Binary Numbers
For digital systems, the binary number system is used.

Binary has a radix of two and uses the digits 0 and 1 to
represent quantities.
The column weights of binary numbers are powers of
two that increase from right to left beginning with 20 =1:
… 25 24 23 22 21 20
For fractional binary numbers, the column weights
are negative powers of two that decrease from left to right:
2n-1… 22 21 20. 2-1 2-2 2-3 2-4 … 2n

Decimal Binary
Number Number
Binary Numbers 0 0000

1 0001
A binary counting sequence for numbers 2 0010
from zero to fifteen is shown. 3 0011
4 0100
Notice the pattern of zeros and ones in 5 0101
each column. 6 0110
Digital counters frequently have this 7 0111
8 1000
same pattern of digits: 9 1001
Counter 0 1 0 1 0 1 0 1 0 1 Decoder
10 1010
0 0 1 1 0 0 1 1 0 0
11 1011
12 1100
0 0 0 0 1 1 1 1 0 0
13 1101
0 0 0 0 0 0 0 0 1 1
14 1110
15 1111

Binary Conversions
The decimal equivalent of a binary number can be

determined by adding the column values of all of the bits
that are 1 and discarding all of the bits that are 0.
Convert the binary number 100101.01 to decimal.
Start by writing the column weights; then add the
weights that correspond to each 1 in the number.
25 24 23 22 21 20. 2-1 2-2
32 16 8 4 2 1 . ½ ¼
1 0 0 1 0 1. 0 1
32 +4 +1 +¼ = 37¼

Binary Conversions
You can convert a decimal whole number to binary by

reversing the procedure. Write the decimal weight of each
column and place 1’s in the columns that sum to the decimal
number.
Convert the decimal number 49 to binary.
The column weights double in each position to the
right. Write down column weights until the last
number is larger than the one you want to convert.
26 25 24 23 22 21 20.
64 32 16 8 4 2 1.
0 1 1 0 0 0 1.

Binary Conversions
You can convert a decimal fraction to binary by repeatedly

multiplying the fractional results of successive
multiplications by 2. The carries form the binary number.
Convert the decimal fraction 0.188 to binary by
repeatedly multiplying the fractional results by 2.
0.188 x 2 = 0.376 carry = 0 MSB
0.376 x 2 = 0.752 carry = 0
0.752 x 2 = 1.504 carry = 1
0.504 x 2 = 1.008 carry = 1
0.008 x 2 = 0.016 carry = 0
Answer = .00110 (for five significant digits)

Binary Conversions
You can convert decimal to any other base by repeatedly

dividing by the base. For binary, repeatedly divide by 2:
Convert the decimal number 49 to binary by
repeatedly dividing by 2.
You can do this by “reverse division” and the
answer will read from left to right. Put quotients to
the left and remainders on top.
Answer: remainder
1 1 0 0 0 1
0 1 3 6 12 24 49 2
Continue until the
last quotient is 0 Quotient Decimal base
number

Binary Arithmetic
Binary Addition
The rules for binary addition are
0+0=0 Sum = 0, carry = 0
0+1=1 Sum = 1, carry = 0
1+0=1 Sum = 1, carry = 0
1 + 1 = 10 Sum = 0, carry = 1
When an input carry = 1 due to a previous result, the rules
are
1 + 0 + 0 = 01 Sum = 1, carry = 0
1 + 0 + 1 = 10 Sum = 0, carry = 1
1 + 1 + 0 = 10 Sum = 0, carry = 1
1 + 1 + 1 = 11 Sum = 1, carry = 1

Binary Addition
Add the binary numbers 00111 and 10101 and show

the equivalent decimal addition.
0111
00111 7
10101 21
11100 = 28

Binary Subtraction
The rules for binary subtraction are

00=0
11=0
10=1
10  1 = 1 with a borrow of 1
Subtract the binary number 00111 from 10101 and
show the equivalent decimal subtraction.
111
1/0/1/0121
00111 7
01110 = 14

1’s Complement
The 1’s complement of a binary number is just the inverse

of the digits. To form the 1’s complement, change all 0’s to
1’s and all 1’s to 0’s.
For example, the 1’s complement of 11001010 is
00110101
In digital circuits, the 1’s complement is formed by using
inverters:
1 1 0 0 1 0 1 0
0 0 1 1 0 1 0 1

2’s Complement
The 2’s complement of a binary number is found by

adding 1 to the LSB of the 1’s complement.
Recall that the 1’s complement of 11001010 is
00110101 (1’s complement)
To form the 2’s complement, add 1: +1
1 1 0 0 1 0 1 0 00110110 (2’s complement)
1
0 0 1 1 0 1 0 1
Input bits
Adder Carry
in (add 1)
Output bits (sum)
0 0 1 1 0 1 1 0

1’s Complement and 2’s Complement
are important because they permit the

representation of negative numbers

Signed Binary Numbers
There are several ways to represent signed binary numbers.

1. Sign-Magnitude Form (the least used method)
2. 1’s complement
3. 2’s complement (the most used method)
In all cases, the MSB in a signed number is the sign bit,
that tells you if the number is positive or negative.
0 indicates +ve number 1 indicates –ve number
Note: Please see Ex. 2-14 page 61

Signed Binary Numbers
Computers use a modified 2’s complement for

signed numbers. Positive numbers are stored in true form
(with a 0 for the sign bit) and negative numbers are stored
in complement form (with a 1 for the sign bit).
For example, the positive number 58 is written using 8-bits as

00111010 (true form).
Sign bit Magnitude bits

The decimal value of -ve Numbers
•Sign magnitude: sum the weights where there are 1’s in
the magnitude bit positions
•1’s compl.: sum the weights where there are 1’s and add
1 to the result. (give a negative sign to the sign bit)
•2’s compl. : sum the weights where there are 1’s while
giving a negative value to the weight of the sign bit
See Ex. 2-15, 2-16 and 2-17

Range of signed integer numbers
• To find the # of diff. combinations of n bits:
Total combinations = 2n
For 2’s compl. Range= -(2n-1) to +(2n-1-1)
ex. n=4, Range= -(23)= -8 to 23-1=+7

Floating Point Numbers
Floating point notation is capable of representing very

large or small numbers by using a form of scientific
notation. A 32-bit single precision number is illustrated.
S E (8 bits) F (23 bits)
Sign bit Biased exponent (+127) Magnitude with MSB dropped
Express the speed of light, c, in single precision floating point
notation. (c = 0.2998 x 109)
In binary, c = 0001 0001 1101 1110 1001 0101 1100 00002.
In scientific notation, c = 1.001 1101 1110 1001 0101 1100 0000 x 228.
S = 0 because the number is positive. E = 28 + 127 = 15510 = 1001 10112.
F is the next 23 bits after the first 1 is dropped.
In floating point notation, c = 0 10011011 001 1101 1110 1001 0101 1100

Arithmetic Operations with Signed Numbers
Using the signed number notation with negative
numbers in 2’s complement form simplifies addition
and subtraction of signed numbers.
Rules for addition: Add the two signed numbers. Discard
any final carries. The result is in signed form.
Examples:
00011110 = +30 00001110 = +14 11111111 = 1
00001111 = +15 11101111 = 17 11111000 = 8
00101101 = +45 11111101 = 3 111110111 = 9
Discard carry

Note that if the number of bits required for the answer is

exceeded, overflow will occur. This occurs only if both
numbers have the same sign. The overflow will be
indicated by a sign bit of the result different than the sign
bit of the two added numbers. Two examples are:
01000000 = +128 10000001 = 127

01000001 = +129 10000001 = 127
10000001 = 126 Discard carry 100000010 = +2
Wrong! The answer is incorrect

and the sign bit has changed.

Rules for subtraction: 2’s complement the subtrahend and
add the numbers. Discard any final carries. The result is in
signed form.
Repeat the examples done previously, but subtract:
00011110 (+30) 00001110 (+14) 11111111 (1)
 00001111 –(+15)  11101111 –(17)  11111000 –(8)
2’s complement subtrahend and add:
00011110 = +30 00001110 = +14 11111111 = 1
11110001 = 15 00010001 = +17 00001000 = 8
100001111 = +15 00011111 = +31 100000111 = +7
Discard carry See also Ex. 2-20, p68 Discard carry

Decimal Hexadecimal Binary
Hexadecimal Numbers 0 0 0000
1 1 0001
Hexadecimal uses sixteen characters to 2 2 0010
represent numbers: the numbers 0 3 3 0011
through 9 and the alphabetic characters 4 4 0100
A through F. 5 5 0101
6 6 0110
Counting in Hexadecimal: 7 7 0111
8 8 1000
…, E, F, 10, 11, 12
9 9 1001
10 A 1010
11 B 1011
12 C 1100
13 D 1101
14 E 1110
15 F 1111

Binary-to-Hexadecimal Conversion
Large binary number can easily be
converted to hexadecimal by grouping bits 4 at a
time and writing the equivalent hexadecimal
character.
Express 1001 0110 0000 11102 in
hexadecimal:
Group the binary number by 4-bits
starting from the right. Thus, 960E

Decimal Hexadecimal Binary
Hexadecimal-to-Decimal conversion 0 0 0000
1 1 0001
Hexadecimal is a weighted number 2 2 0010
system. The column weights are 3 3 0011
powers of 16, which increase from 4 4 0100
5 5 0101
right to left. 6 6 0110
7 7 0111
Column weights { 163 162 161 160.
4096 256 16 1 . 8 8 1000
9 9 1001
Express 1A2F16 in decimal. 10 A 1010
11 B 1011
Start by writing the column weights:
12 C 1100
4096 256 16 1
13 D 1101
1 A 2 F16
14 E 1110
1(4096) + 10(256) +2(16) +15(1) = 670310 15 F 1111

Express 11001010010101112 in Hexadecimal.
Express CF8E16 in binary.
Express 1C16 in decimal (use two different ways).
Convert 65010 to hexadecimal by repeated division method.

Hexadecimal Addition
2316 + 1616 =
DF16 + AC16 =
Hexadecimal Subtraction
Use the 2’s complement to perform the subtraction
3 ways to find the 2’s complement:
Hex Binary 2’s compl. In 2’s compl. 2A ………. D6

binary in Hex
Hex Subtract 1’s compl. in 2’s compl. 2A FF-2A D5+1 D6

from max hex plus 1 in Hex
Hex 0 1 2 3 4 5 6 7 8 9 A B C D E F 1’s compl. in 2’s compl.

F E D C B A 9 8 7 6 5 4 3 2 1 0 hex plus 1 in Hex

Decimal Octal Binary
Octal Numbers 0 0 0000
1 1 0001
Octal uses eight characters the numbers 2 2 0010
0 through 7 to represent numbers. 3 3 0011
There is no 8 or 9 character in octal. 4 4 0100
5 5 0101
Binary number can easily be
6 6 0110
converted to octal by grouping bits 3 at 7 7 0111
a time and writing the equivalent octal 8 10 1000
character for each group. 9 11 1001
10 12 1010
Express 1 001 011 000 001 110 2 in
11 13 1011
octal:
12 14 1100
Group the binary number by 3-bits 13 15 1101
starting from the right. Thus, 1130168 14 16 1110
15 17 1111

Decimal Octal Binary
Octal-to-Decimal Conversion
0 0 0000
Decimal-to-Octal Conversion 1 1 0001
Octal is also a weighted number 2 2 0010
system. The column weights are 3 3 0011
powers of 8, which increase from right 4 4 0100
5 5 0101
to left. 6 6 0110
7 7 0111
Column weights { 83 82
512 64
81 80 .
8 1 . 8 10 1000
9 11 1001
Express 37028 in decimal. 10 12 1010
11 13 1011
Start by writing the column weights:
12 14 1100
512 64 8 1
13 15 1101
3 7 0 28
14 16 1110
3(512) + 7(64) +0(8) +2(1) = 198610 15 17 1111

Decimal Binary BCD
BCD 0 0000 0000
1 0001 0001
Binary coded decimal (BCD) is a 2 0010 0010
weighted code that is commonly 3 0011 0011
used in digital systems when it is 4 0100 0100
5 0101 0101
necessary to show decimal 6 0110 0110
numbers such as in clock displays. 7 0111 0111
The table illustrates the 8 1000 1000
difference between straight binary and 9 1001 1001
BCD. BCD represents each decimal 10 1010 00010000
digit with a 4-bit code. Notice that the 11 1011 00010001
codes 1010 through 1111 are not used in 12 1100 00010010
BCD. 13 1101 00010011
14 1110 00010100
15 1111 00010101

BCD
You can think of BCD in terms of column weights in

groups of four bits. For an 8-bit BCD number, the column
weights are: 80 40 20 10 8 4 2 1.
What are the column weights for the BCD number
1000 0011 0101 1001?
8000 4000 2000 1000 800 400 200 100 80 40 20 10 8 4 2 1

Note that you could add the column weights where there is
a 1 to obtain the decimal number. For this case:
8000 + 200 +100 + 40 + 10 + 8 +1 = 835910

BCD
A lab experiment in which BCD
is converted to decimal is shown.

BCD
Convert the decimal numbers 35 and 2469 to BCD
35=00110101 2469=0010010001101001
Convert the BCD codes 10000110 and 1001010001110000

to decimal
10000110 =86 1001010001110000=9470

BCD Addition
Add the following BCD numbers

a)0011+0100 b)010001010000+010000010111
c)1001+0100 d) See more examples in the book
a) 0011+0100=0111
b) 010001010000+010000010111=100 0110 0111
c) 1001+0100=0001 0011 (Add 6 to the invalid BCD number
which is >9)

Decimal Binary Gray code
Gray code 0 0000 0000
1 0001 0001
Gray code is an unweighted code 2 0010 0011
that has a single bit change between 3 0011 0010
one code word and the next in a 4 0100 0110
5 0101 0111
sequence. Gray code is used to 6 0110 0101
avoid problems in systems where an 7 0111 0100
error can occur if more than one bit 8 1000 1100
changes at a time. 9 1001 1101
10 1010 1111
11 1011 1110
12 1100 1010
13 1101 1011
14 1110 1001
15 1111 1000

Gray code
A shaft encoder is a typical application. Three IR
emitter/detectors are used to encode the position of the shaft.
The encoder on the left uses binary and can have three bits
change together, creating a potential error. The encoder on the
right uses gray code and only 1-bit changes, eliminating
potential errors.
Binary sequence
Gray code sequence

ASCII
ASCII is a code for alphanumeric characters and control

characters. In its original form, ASCII encoded 128
characters and symbols using 7-bits. The first 32 characters
are control characters, that are based on obsolete teletype
requirements, so these characters are generally assigned to
other functions in modern usage.
In 1981, IBM introduced extended ASCII, which is an 8-
bit code and increased the character set to 256. Other
extended sets (such as Unicode) have been introduced to
handle characters in languages other than English.

Parity Method
The parity method is a method of error detection for
simple transmission errors involving one bit (or an odd
number of bits). A parity bit is an “extra” bit attached to
a group of bits to force the number of 1’s to be either
even (even parity) or odd (odd parity). It can be attached
to the code at either the beginning or the end, depending
on system design.
The ASCII character for “a” is 1100001 and for “A” is

1000001. What is the correct bit to append to make both of
these have odd parity?
The ASCII “a” has an odd number of bits that are equal to 1;
therefore the parity bit is 0. The ASCII “A” has an even
number of bits that are equal to 1; therefore the parity bit is 1.

Cyclic Redundancy Check
The cyclic redundancy check (CRC) is an error detection method
that can detect multiple errors in larger blocks of data. At the
sending end, a checksum is appended to a block of data. At the
receiving end, the check sum is generated and compared to the sent
checksum. If the check sums are the same, no error is detected.

Selected Key Terms
Byte A group of eight bits

Floating-point A number representation based on scientific
number notation in which the number consists of an
exponent and a mantissa.
Hexadecimal A number system with a base of 16.
Octal A number system with a base of 8.
BCD Binary coded decimal; a digital code in which each
of the decimal digits, 0 through 9, is represented by
a group of four bits.
Selected Key Terms
Alphanumeric Consisting of numerals, letters, and other

characters
ASCII American Standard Code for Information
Interchange; the most widely used alphanumeric
code.
Parity In relation to binary codes, the condition of
evenness or oddness in the number of 1s in a code
group.
Cyclic A type of error detection code.
redundancy
check (CRC)

U-1 Pre-Requisites For DELD

Uploaded by

Copyright:

Available Formats

U-1 Pre-Requisites For DELD

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

U-1 Pre-Requisites For DELD

Uploaded by

Copyright:

Available Formats

BASIC ELECTRONICS ENGG.

UNIT-III: Number Systems and

Digital Systems can process, store, and transmit data more

Many systems use a mixture of analog and digital electronics to take

10110011101 Digital-to-analog Linear amplifier

Digital electronics uses circuits that have two states, which

bit can have the value of either Invalid

Digital waveforms change between the LOW and HIGH

Rising or Falling or Falling or Rising or

(a) Positive–going pulse (b) Negative–going pulse

Base line Undershoot

Periodic pulse waveforms are composed of pulses that repeats

The clock is a basic timing signal that is an example of a

In addition to frequency and period, repetitive pulse waveforms

A timing diagram is used to show the relationship between

Data can be transmitted by either serial transfer or parallel

True only if all input conditions

True only if one or more input

Indicates the opposite condition.

The comparison function A

Basic arithmetic functions Adder

The decoding function

The data selection function

The counting function

…and other functions such as code conversion

One type of storage function is the shift register,

First bit (1) is shifted serially into the

Second bit (0) is shifted serially into

Third bit (1) is shifted into register and

Fourth bit (0) is shifted into register and

Cutaway view of DIP (Dual-In-line Pins) chip:

The TTL series, available as DIPs are popular

An example of laboratory prototyping is shown. The circuit

DIP chips and surface mount chips

Dual in-line Package Small Outline IC (SOIC)

The position of each digit in a weighted number

The column weights of decimal numbers are powers

… 105 104 103 102 101 100

Floyd, Digital Fundamentals, 10th ed Slide 22

Decimal numbers can be expressed as the sum of the

480.52 = (4 x 102) + (8 x 101) + (0 x 100) + (5 x 10-1) +(2 x 10-2)

Floyd, Digital Fundamentals, 10th ed Slide 23

For digital systems, the binary number system is used.

Floyd, Digital Fundamentals, 10th ed Slide 24

Binary Numbers 0 0000

Floyd, Digital Fundamentals, 10th ed Slide 25

The decimal equivalent of a binary number can be

Floyd, Digital Fundamentals, 10th ed Slide 26

You can convert a decimal whole number to binary by

Floyd, Digital Fundamentals, 10th ed Slide 27

You can convert a decimal fraction to binary by repeatedly

Floyd, Digital Fundamentals, 10th ed Slide 28

You can convert decimal to any other base by repeatedly

Floyd, Digital Fundamentals, 10th ed Slide 29

Floyd, Digital Fundamentals, 10th ed Slide 30

Add the binary numbers 00111 and 10101 and show

Floyd, Digital Fundamentals, 10th ed Slide 31

The rules for binary subtraction are

Floyd, Digital Fundamentals, 10th ed Slide 32