Introduction to 8085 Microprocessor (μP)

Neso Academy
2 Apr 202421:08

Summary

TLDRThis educational video introduces the concept of word length in microprocessors, focusing on the Intel 4004, the first 4-bit microprocessor introduced in 1971. It explains how the 4-bit word length allows for processing, input, and output of 4-bit data chunks, performing 4-bit additions, and using place values for unsigned and signed representations. The video also covers the evolution to 8-bit microprocessors like the Intel 8085, highlighting their expanded range of numbers due to increased word length.

Takeaways

  • 😀 The 8085 microprocessor is the focus of the session, with an introduction to its capabilities and specifications.
  • 📚 The word length of a microprocessor is defined as the size of data it can handle at once, which is a key characteristic of its processing power.
  • 🛠️ The Intel 4004, introduced in 1971, was a 4-bit microprocessor, meaning it could process four bits of data simultaneously, including performing 4-bit additions.
  • 🔢 The place values for a 4-bit microprocessor in unsigned representation are 1 (2^0), 2 (2^1), 4 (2^2), and 8 (2^3), allowing it to represent numbers from 0 to 15.
  • 💡 The Intel 4004 could only perform addition and subtraction within the range of 0 to 15 for unsigned numbers due to its 4-bit word length.
  • ➕ In binary addition, a carry is generated when the sum of bits exceeds the bit capacity, which is then added to the next significant bit.
  • 🚫 The Intel 4004 cannot perform operations resulting in numbers outside its 4-bit range, such as adding 8 and 9, which would result in 17.
  • 🔄 The 4-bit microprocessor uses two's complement for subtraction, where the negative inverse of a number is found by inverting the bits and adding one.
  • 🔢 In two's complement representation, the place values for a 4-bit microprocessor are 1, 2, 4, and -8, allowing it to represent numbers from -8 to 7.
  • 🔄 The most significant bit in signed representation has a negative place value, affecting the range of numbers the microprocessor can represent.
  • 📈 The evolution of microprocessors is highlighted, with the Intel 8085 being an 8-bit microprocessor capable of handling larger data sets and more complex operations than its 4-bit predecessors.

Q & A

  • What is the word length of a microprocessor?

    -The word length of a microprocessor is the size of data it can handle at once, measured in bits.

  • What was the word length of the Intel 4004 microprocessor?

    -The Intel 4004 microprocessor, introduced in 1971, had a word length of 4 bits.

  • How did the Intel 4004 perform 4-bit addition?

    -The Intel 4004 performed 4-bit addition by taking two 4-bit inputs, processing them, and generating a 4-bit output, including handling carry operations.

  • What is the range of values that can be represented with a 4-bit unsigned representation?

    -With a 4-bit unsigned representation, the range of values is from 0 to 15.

  • How does the Intel 4004 handle subtraction?

    -The Intel 4004 handles subtraction using the two's complement technique, effectively performing addition of the minuend and the two's complement of the subtrahend.

  • What is the two's complement of a binary number?

    -The two's complement of a binary number is found by inverting all the bits of the number and then adding one to the result.

  • What is the range of values that can be represented with a 4-bit sign representation?

    -With a 4-bit sign representation, the range of values is from -8 to +7.

  • What is the significance of the most significant bit in sign representation?

    -In sign representation, the most significant bit indicates the sign of the number, with 0 typically representing positive and 1 representing negative.

  • What is the difference between unsigned and sign representation in a microprocessor?

    -Unsigned representation uses all bits to represent the magnitude of a number, while sign representation uses the most significant bit to indicate the sign of the number, with the remaining bits representing the magnitude.

  • Why is the range of values different for unsigned and sign representations in a microprocessor?

    -The range is different because unsigned representation uses all bits for magnitude, allowing for a larger range of positive values, while sign representation dedicates one bit to indicate the sign, reducing the range of positive and negative values it can represent.

  • What is the word length of the Intel 8085 microprocessor?

    -The Intel 8085 microprocessor has a word length of 8 bits.

  • What range of numbers can the Intel 8085 handle in unsigned representation?

    -In unsigned representation, the Intel 8085 can handle numbers from 0 to 255 (2^8 - 1).

  • What range of numbers can the Intel 8085 handle in sign representation?

    -In sign representation, the Intel 8085 can handle numbers from -128 to +127.

Outlines

00:00

📘 Introduction to the 8085 Microprocessor and Word Length

This paragraph introduces the 8085 microprocessor, focusing on its word length, which is the amount of data it can handle simultaneously. The Intel 44, a 4-bit microprocessor from 1971, is used as an example to explain the concept of word length. The 4-bit word length allows the Intel 44 to process, input, and output data in 4-bit chunks, enabling 4-bit addition operations. The explanation includes a step-by-step addition example using binary numbers, demonstrating how the carry bit is handled during the process. The paragraph also discusses the representation of unsigned numbers using 4 bits, which can range from 0 to 15, and how the least and maximum values are determined.

05:02

🔢 Understanding Binary Addition and the Range of 4-bit Numbers

The paragraph delves into the specifics of binary addition using the Intel 44 microprocessor as a reference. It explains the process of adding 4-bit numbers and the resulting carry bit, using a detailed example of adding two numbers, 101 and 0101, to produce a sum and carry. The explanation includes the place values for 4-bit numbers and how they are used to determine the decimal equivalent of the binary inputs and outputs. The paragraph also discusses the range of values that can be represented with 4 bits in unsigned representation, emphasizing that the Intel 44 can perform unsigned additions within this range.

10:03

🔄 Two's Complement and Binary Subtraction with the Intel 44 Microprocessor

This section explains the concept of two's complement and its application in binary subtraction using the Intel 44 microprocessor. It describes the process of finding the two's complement of a binary number to perform subtraction, using an example where the minuend is 1101 and the subtrahend is 0101. The paragraph details the step-by-step method of toggling bits to find the negative inverse of the subtrahend. It also discusses the place values in two's complement representation, which differ from unsigned representation by having the most significant bit's place value as negative. The example concludes with the addition of 9 and -5 in two's complement, resulting in a difference of 4.

15:06

🔢 Sign Representation and the Range of 4-bit Signed Numbers

The paragraph discusses sign representation in 4-bit binary numbers, explaining how the most significant bit is used to indicate the sign of the number. It details the place values for signed numbers, which include negative values for the most significant bit. The explanation includes a step-by-step calculation of decimal equivalents for various binary sequences, demonstrating how both positive and negative numbers can be represented. The range of values that can be represented with 4-bit sign representation is also discussed, showing that it extends from -8 to +7. The paragraph clarifies the difference between the ordered decimal numbers and the unordered binary bit sequences.

20:09

🚀 Evolution of Microprocessors and the 8085's 8-bit Word Length

The final paragraph summarizes the evolution of microprocessors, mentioning the introduction of the Intel 8008, 8080, and the 8-bit Intel 8085 microprocessor. It highlights the increased word length of the 8085, which allows it to handle 8 bits of data at once. The paragraph outlines the range of numbers that can be represented in both unsigned and signed representations for an 8-bit microprocessor, emphasizing the broader range of values that can be processed compared to the 4-bit Intel 44. The session concludes with a preview of the next topic, which will cover the pins of the 8085 microprocessor.

Mindmap

Keywords

💡8085 Microprocessor

The 8085 Microprocessor is a specific model of microprocessor introduced by Intel in 1977. It is an 8-bit microprocessor, meaning it can handle 8 bits of data at once. In the video, the 8085 is the central topic, and its word length, which is the size of data it can process, is a key aspect discussed. The script explains how the 8085's word length affects its capabilities, such as performing 8-bit additions and subtractions.

💡Word Length

Word length refers to the number of bits a microprocessor can process simultaneously. It is a fundamental characteristic that determines the microprocessor's data handling capacity. The script introduces the concept by discussing the evolution of microprocessors, starting with the 4-bit Intel 44 and moving to the 8-bit Intel 8085, highlighting the increase in word length and its implications for processing power.

💡Unsigned Representation

Unsigned representation is a way of encoding numeric values using binary numbers without considering sign bits. It allows for representing only non-negative integers. The script explains that with a 4-bit unsigned representation, values from 0 to 15 can be represented, which is the range of numbers the Intel 44 microprocessor could handle.

💡Two's Complement

Two's complement is a method used in digital systems to represent signed integers in binary form. It allows for the representation of both positive and negative numbers. The script describes how the Intel 44 microprocessor uses two's complement to perform subtraction by converting the subtrahend to its negative inverse before adding it to the minuend.

💡Binary Addition

Binary addition is the process of adding binary numbers, similar to decimal addition but following the binary system rules, where the base is 2 instead of 10. The script provides an example of binary addition with a 4-bit number, explaining the process of carrying over when the sum of bits exceeds 1.

💡Place Value

In the context of binary numbers, place value refers to the value of a bit based on its position in the number. The script explains the place values for both unsigned and two's complement representations in a 4-bit system, illustrating how these values contribute to the overall decimal equivalent of the binary number.

💡Carry

Carry is a term used in binary addition when the sum of two bits is greater than 1, resulting in an extra bit that must be carried over to the next higher place value. The script demonstrates this concept in the example of adding 4-bit numbers, where a carry is generated and added to the next bit position.

💡Minuend

The minuend is the number from which another number (the subtrahend) is to be subtracted in a subtraction operation. In the script, the term is used in the context of explaining binary subtraction using two's complement, where the minuend is the number being kept and the subtrahend is the number being subtracted.

💡Subtrahend

The subtrahend is the number that is to be subtracted from another number (the minuend) in a subtraction operation. The script discusses how the subtrahend is converted to its two's complement form to perform subtraction using the addition method in binary systems.

💡Sign Representation

Sign representation, also known as signed magnitude representation, is a way of encoding signed numbers in binary form where the most significant bit is used to indicate the sign of the number (positive or negative). The script explains how the Intel 44 microprocessor, with its 4-bit word length, can represent numbers from -8 to +7 using sign representation.

💡Evolution of Microprocessors

The evolution of microprocessors refers to the historical development and technological advancements in microprocessor design. The script outlines the progression from the 4-bit Intel 44 to the 8-bit Intel 8085, emphasizing the increase in word length and the expansion of capabilities such as handling more complex calculations and larger data sets.

Highlights

Introduction to the 8085 microprocessor and its significance in the evolution of microprocessors.

Definition of word length in microprocessors and its importance for data handling capabilities.

Historical context: The Intel 4000 family and the introduction of the 4-bit Intel 44 microprocessor in 1971.

Explanation of 4-bit data handling, including input, processing, and output capabilities of the Intel 44.

Demonstration of 4-bit addition using the Intel 44 microprocessor and its truth table.

Illustration of carry generation and management during 4-bit addition.

Calculation of place values for 4-bit numbers and their decimal equivalents.

Range of unsigned numbers representable with 4 bits, from 0 to 15.

Introduction to two's complement for subtraction in microprocessors.

Process of finding the two's complement of a binary number for subtraction.

Place values in two's complement representation, including negative values.

Example of performing subtraction using two's complement in a 4-bit microprocessor.

Range of signed numbers representable with 4 bits, from -8 to 7.

Comparison between unsigned and signed representations in 4-bit microprocessors.

Transition from 4-bit to 8-bit microprocessors, with the introduction of the Intel 8085.

Explanation of the range of numbers representable in unsigned and signed formats for the 8-bit Intel 8085 microprocessor.

Summary of the session on the word length of microprocessors and预告of the next session on the pins of the 8085 microprocessor.

Transcripts

play00:01

[Music]

play00:06

hello everyone and welcome to the

play00:08

chapter fundamentals of 8085

play00:11

microprocessor so this is the first

play00:13

session of our new chapter and in this

play00:16

session we will be introduced to the

play00:17

8085

play00:19

microprocessor so without any further

play00:21

Ado let's get to

play00:23

learning coming to the topic that we are

play00:25

going to cover today today we will try

play00:27

to understand what is the word length of

play00:31

microprocessor so the word length of a

play00:34

microprocessor is the size of data which

play00:37

the microprocessor can handle at once if

play00:40

you remember when we were learning about

play00:42

the evolution of microprocessor we

play00:45

learned that in 1971 as a member of the

play00:48

Intel 4000 family

play00:50

44 that is the first microprocessor was

play00:54

introduced now if you remember the word

play00:56

length of this was 4 bit now what is

play00:59

meant by that

play01:00

the Intel 44 microprocessor could handle

play01:04

four bits of data at once that is it can

play01:07

take a chunk of 4bit as input it can

play01:11

process that 4bit chunk also it can

play01:14

generate a 4bit output now since the

play01:17

word length of Intel 44 was 4bit

play01:20

therefore it can perform 4bit additions

play01:24

now in the previous session we have seen

play01:27

the truth table for addition use using

play01:30

this logic inel

play01:32

44 since it has the word length of 4bit

play01:35

could perform 4bit addition so clearly

play01:38

if we feed the aent as 1 01 and if we

play01:41

also feed the addent 01 01 until 404

play01:46

could perform the addition let's Now

play01:48

quickly perform the addition for it 1 +

play01:51

1 is supposed to generate the sum as Zer

play01:54

and the carry as one so we are going to

play01:56

have the sum as zero now what will be

play01:58

done with the carry well the place value

play02:01

of these two bits is 2 ra to the^ 0 and

play02:04

the result which is just generated by

play02:06

performing the addition between these

play02:08

two is actually one Zer that is a two

play02:10

bit number so the carry will be added

play02:14

with the bits in the 2 ra to the power

play02:15

one's place so adding one with zero we

play02:18

will get one also if we again add that

play02:21

one with 0o we will receive the sum as

play02:23

one isn't it so no carry only the sum as

play02:28

one because we are adding one with zero

play02:30

and that to twice let's move on to the

play02:33

next unit 0 + 1 we are supposed to get

play02:36

the result as 1 right finally adding one

play02:40

with zero we will again get the result

play02:42

as one let's now check whether we have

play02:45

perform the addition correctly or not

play02:47

and for that we will be needing the

play02:49

place values now if you notice the aent

play02:53

addent and also the result all are of

play02:55

four bits now for four bits what will be

play02:58

the place values well 1 2 4 and 8 to be

play03:02

precise 2 ra to the^ 0 that is 1 2 ra to

play03:06

the^ 1 that is 2 2 squar that is 4 and

play03:10

finally 2 cubed that is 8 now

play03:12

considering these wets what is the

play03:14

decimal equivalent value of the aent

play03:17

well 8 + 1 that is 9 what about the

play03:20

addent 4 + 1 that is 5 let's move on to

play03:24

the result now 8 + 4 that is 12 + 2 will

play03:28

give us 14 and yes it is correct because

play03:31

9 + 5 is

play03:34

14 now focus on the weights with these

play03:38

wordss we can only represent unsigned

play03:42

numbers so these are used for unsigned

play03:46

representation now think about it if we

play03:48

talk about unsigned representation we

play03:50

are going to use the place values 1 2 4

play03:53

and 8 to be precise 2 ra to the^ 0 2 ra

play03:57

to the^ 1 2^ 2 and 2 Cube now with four

play04:01

bits how many sequences can we have well

play04:04

we will begin with 0 0 0 0 then 0 0 0 1

play04:08

so on and at last we will have 1 1 1 1

play04:12

that is from four zeros to 4 1es now if

play04:16

we also consider the equivalent decimal

play04:18

values 0 0 0 0 is 0 then we will have 1

play04:21

2 3 4 5 and so on and the last value

play04:24

that is all ones will be

play04:26

15 so using four bits we can represent

play04:30

the values from 0 to 15 and all of these

play04:34

are positive values that is

play04:37

unsigned now from this particular list

play04:40

can you figure out the least number well

play04:43

it is zero right so if we are talking

play04:45

about the range with four bits with

play04:48

unsigned representation that is using

play04:50

these place values the least number that

play04:53

we can have is zero now what is the max

play04:56

number it is 15 and how did we get it we

play04:59

got it by placing all ones underneath

play05:02

these place

play05:03

values now for four bits I already have

play05:06

told you multiple times what are the

play05:08

actual place values 2 ra to the^ 0 2 ra

play05:11

to the^ 1 2^ 2 2 Cub now think about the

play05:15

next place if we had that place what

play05:18

would have been the place value 2 ra to

play05:20

the power 4 right and what is 2 ra to

play05:23

the^ 4 it is

play05:25

16 and we got the maximum number in this

play05:28

list as 15 that is 1 less than the next

play05:32

place value so in order to define the

play05:34

range from the least value which is zero

play05:37

we can have the max value that is 2 to ^

play05:40

4 - 1 or in other words 16 - 1 that is

play05:46

15 now you could ask me why we are using

play05:50

this particular notation why can't we

play05:52

write 15 instead well we can there is

play05:55

nothing wrong about it but it's a

play05:57

generalized formula why because in case

play06:01

of five bits if we just Place five in

play06:03

this place we will have the maximum

play06:06

number of five bits using unsigned

play06:10

representation and it's also meaningful

play06:12

since we are using four bits so we will

play06:15

only have to place the number of bits in

play06:17

here is it clear so this is the range

play06:21

for four bit numbers using unsign

play06:24

representation now focus on the Range it

play06:27

is 0 to 2 to ^ 4 -1 and we are talking

play06:31

about the unsigned

play06:33

representation so if we talk about the

play06:36

number line we are having the range from

play06:39

0 to 15 and all these 16 numbers we are

play06:44

representing using the binary sequences

play06:47

starting from 0 0 0 0 0 0 0 1 till all

play06:51

ones that is four ones so the Intel 4004

play06:56

since it has the word length of four bit

play06:59

it can perform unsigned additions of two

play07:01

4bit numbers which will involve both the

play07:04

aent and the addent from this particular

play07:07

list Additionally the result or the

play07:10

outcome will also have to be from this

play07:12

list only for an instance if we add 5

play07:16

which in binary is 0 1 0 1 with 10 that

play07:21

is 1 1 0 the result is going to be 15 or

play07:26

1111 and this can be done since 11 1 1

play07:30

is a 4bit binary number and additions as

play07:34

such can be performed by Intel 44 4bit

play07:37

micro processor however if we add 8 with

play07:41

N9 that is if we add 1 tri0 with 1

play07:44

01 the result is going to be 17 which is

play07:48

not in this particular range so this

play07:52

microprocessor is not going to produce

play07:54

that result I hope the word length for

play07:57

addition is clear to you now like this

play08:00

Intel 4004 can also perform

play08:03

subtraction now if you remember when we

play08:06

learned about the subtraction in binary

play08:08

we learned about two different

play08:09

approaches one the pen and paper method

play08:13

and on the other hand we learned about

play08:14

the machine's approach therefore when we

play08:17

are talking about subtraction performed

play08:19

by the 44 4bit microprocessor it is

play08:22

going to take this approach under

play08:24

consideration and specifically it will

play08:26

perform the subtractions using tw's

play08:28

complement technique

play08:30

let me show you one such subtraction

play08:33

where we are going to have the minu end

play08:35

as one1 and the subtra this time is 0 1

play08:39

01 now as I told you earlier we are not

play08:41

going to perform a minus B rather we are

play08:44

going to perform A+ minus B because

play08:48

that's how using addition we can also

play08:50

perform subtraction which is followed in

play08:52

both ones and two's complement

play08:55

approaches now here we have got the B

play08:58

that is the subtend at as 0 1 0 1 now in

play09:02

order to get the negative inverse

play09:04

remember we are implementing two's

play09:06

complement just like the 44 4bit

play09:09

microprocessor so we will find out the b

play09:11

complement that is a negative inverse of

play09:13

B and for that how to do it if you

play09:17

remember the technique for tw's

play09:18

complement we are going to Traverse the

play09:20

subtend from the least significant bit

play09:22

towards the most significant bit and we

play09:24

will keep retaining the data until we

play09:26

encounter one once we encounter one we

play09:29

will retain it as it is however the rest

play09:32

of the bits are going to be toggled that

play09:35

is zero will become one and one is going

play09:37

to be zero so finally in case of the

play09:39

most significant bit we toggled it to

play09:41

one so this is the two's complement of

play09:44

the subtend 01 01 now we have discussed

play09:48

about the conversion process but I

play09:51

didn't tell you what is happening in

play09:53

here in reality that is how it is min -

play09:56

5 because if we consider 01 0 1 it is 5

play10:01

and negative inverse of that is supposed

play10:03

to be minus 5 right now we just have

play10:06

observed the place values in case of

play10:08

unsigned representation for four bit now

play10:11

since we are talking about these numbers

play10:14

what is going to be the place values in

play10:17

two's complement the place values are 1

play10:20

2

play10:21

4 and minus 8 that is apart from the

play10:26

most significant bed all the remaining

play10:28

places have the same place values only

play10:31

the most significant bit has the place

play10:34

value in

play10:35

negative now look at

play10:37

this 1 1 1 that is - 8 + 2 which will

play10:44

give us - 6 + 1 that is we are adding -

play10:48

6 with 1 we will get

play10:52

-5 now you get it how did we get minus5

play10:56

well the place value of the most

play10:57

significant bear is Min -

play11:00

A remember this is for four bits in case

play11:04

of five bits apart from the most

play11:06

significant bit the rest of the bits

play11:08

will have the same place values just

play11:11

like unsigned representation however the

play11:13

most significant bit is going to have

play11:15

the place value minus 16 because we are

play11:18

talking about five bits then since we

play11:21

are dealing with four bits in here for

play11:24

four bits the most significant bits

play11:26

place value is 8 that is 2 Cub which in

play11:29

case of two's complement approach is - 8

play11:32

or -2 to^ 3 or - 2

play11:35

Cub now with - 5 if we add 1 0 0 1 now

play11:41

here do remember this is in unsigned

play11:45

representation so it is going to be 9

play11:48

because here the place value is 8 only

play11:51

so 8 + 1 is going to give us 9 now let's

play11:54

observe if we add these two what is

play11:56

going to be the result 1 + 1 will give

play11:59

us the sum as zero and the carry is

play12:01

going to be 1 1 + 0 is 1 then 1 + 1 will

play12:04

again give us the sum as 0o and the

play12:06

carry is going to be one now adding one

play12:08

with all these zeros we will receive the

play12:10

sum as one now what about the most

play12:12

significant bits 1 + 1 will give us 1 Z

play12:16

remember we are performing the

play12:18

subtraction in two's complement

play12:20

therefore whenever the carry is

play12:22

generated we are going to discard it now

play12:25

consider the result it is 0 1 0 0 what

play12:29

is the place value of this one it is

play12:33

four and yes from nine if we subtract 5

play12:37

we are getting four however we didn't

play12:40

perform subtraction this time rather we

play12:43

added 9 with minus 5 and got the

play12:46

difference as four now let's focus on

play12:49

the negative

play12:50

inverse we got this value - 5 using S

play12:57

representation now in case of sign

play12:59

presentation since we are talking about

play13:01

four bits the place values are going to

play13:03

be 1 2 4 - 8 remember whenever we are

play13:08

talking about sign representation

play13:11

whatever the number of bits may be the

play13:13

most significant bit will always have

play13:15

the place value in

play13:17

negative now just for a moment forget

play13:21

about these signs just think about it we

play13:23

are using four bits now with four bits

play13:26

how many binary sequences can we have

play13:29

well starting from all zeros till all

play13:32

ones there is 16 different

play13:36

sequences let's now try to find out the

play13:39

equivalent decimal numbers although this

play13:41

time we are going to consider these

play13:43

place

play13:44

values now if you notice these patterns

play13:47

till this particular point we haven't

play13:49

placed one in the most significant bits

play13:52

place so till this point the decimal

play13:55

equivalence will be the same as we had

play13:57

in case of unsigned numbers that is from

play13:59

0 to

play14:01

7 now once we have placed one in the

play14:03

most significant bits place of the sign

play14:06

representation considering the place

play14:08

value what is going to be the decimal

play14:10

equivalent well minus 8 isn't it now

play14:13

what about the next sequence -8 + 1 that

play14:17

is - 7 focus on the next sequence -8 + 2

play14:23

that is - 6 then - 8 + 2 that is - 6 + 1

play14:30

that is - 5 which we already used didn't

play14:34

we now what about the next sequence -8 +

play14:38

4 that is

play14:39

-4 then -8 + 4 that is -4 and with -4 if

play14:45

we add 1 we will get

play14:48

-3 focus on the next sequence - 8 + 4

play14:52

that is -4 + 2 that is

play14:56

-2 now what about the last sequence 1 1

play14:59

1 1 1 - 8 + 7 because 3 1's is 7 right

play15:06

that is

play15:08

min-1 now from all these decimal values

play15:12

can you figure out the minimum and the

play15:14

maximum

play15:16

values well the minimum value is min - 8

play15:19

right now what is the maximum value it

play15:22

is 7even that is + 7 or postive 7 so

play15:26

clearly with the sign representation of

play15:28

four piit

play15:29

we can represent from -8 till

play15:34

pos7 now what is - 8 this is actually -

play15:38

2 Cub however since we are considering

play15:41

four bits we can also state it as - 2 to

play15:45

^ 4 - 1 notice - 2 cubed 4 - 1 is 3 so

play15:53

from -2 ra to^ 4 - 1 that is - 8 using

play15:58

four bits sign representation we could

play16:01

represent till the maximum value that is

play16:03

seven and how did we get this we got

play16:07

this by adding all these ones place

play16:10

values now what is seven it is 1 less

play16:13

than 8 so we could also write 7 as 2 ra

play16:17

to the^ 4 - 1 - 1 that is 2 cubed or 8

play16:24

-1 so this is the range for 4 bit sign

play16:28

represent

play16:29

resentation now we just also have seen

play16:32

the unsigned representations range it

play16:35

was from 0 to

play16:37

15 and we use the sequence from all

play16:41

zeros that is four zeros to 4 ones to

play16:43

represent this particular

play16:45

range now when we are talking about the

play16:47

sign representation here the most

play16:50

significant bits they represent the

play16:53

negative

play16:54

weightage so the range is not going to

play16:57

be this anymore rather we will have - 8

play17:01

- 7 - 6 - 5 -4 -3 - 2

play17:06

-1 now if you notice this particular

play17:09

line this is wrong from our perspective

play17:13

because we deal in decimal number

play17:16

systems right so if we want to represent

play17:19

the range that is from - 2 to^ 4 - 1 to

play17:24

2^ 4 - 1 - 1 we should re arrange this

play17:30

that is - 2 to ^ 4 -1 or - 2 cubed or -

play17:36

8 and 2 to ^ 4 - 1 - 1 that is 2 cubed -

play17:42

1 or 8 - 1 that is

play17:45

7 now notice the decimal numbers are

play17:50

organized that is we are having the

play17:52

least value as -8 and the maximum value

play17:55

is + 7 however now we don't have the

play17:58

order in the binary bit

play18:00

sequences so remember Intel 44 4bit

play18:06

microprocessor if it used sign

play18:09

representation could deal with the numb

play18:11

starting from minus 8 that is 1 0 till

play18:15

the positive number + 7 that is 0le

play18:19

1 and that's the buy of the W length of

play18:23

4 bit so to sum it up we could say in 44

play18:28

4bit mu p in unsigned representation

play18:31

could use the numbers starting from 0

play18:34

till 2 to ^ 4 - 1 that is from 0 to 15

play18:39

16 - 1 that is 15 now coming to sign

play18:44

representation it could deal with the

play18:46

values from - 2 to^ 4 - 1 till 2 to ^ 4

play18:51

- 1 - 1 that is from - 2 cubed or - 8

play18:56

till 2 cubed - 1 or POS 7 remember this

play19:01

all these exponents are four because the

play19:05

word length of 44 was 4

play19:09

bit now during the evolution of

play19:11

microprocessors we have learned in

play19:14

1972 Intel introduced the next

play19:17

microprocessor that is Intel

play19:19

8008 in 1974 it introduced Intel

play19:23

880 and then in 1977 Intel came up with

play19:27

intel 80 85 notice this is an 8bit

play19:34

microprocessor in other words it has the

play19:36

word length of 8 bit so if we follow

play19:40

this particular format we could say

play19:42

intel

play19:44

8085 if we talk about the unsigned

play19:46

representation can deal with the range

play19:49

of numbers from 0 to to ra to the^ 8

play19:52

minus one and similarly following this

play19:57

for the 8bit microprocessor in

play19:59

8085 we can also say for sign

play20:02

representation it can deal with the

play20:04

numbers within the range - 2 ra to^ 8 -1

play20:09

2 2 to ^ 8 -1

play20:12

-1 and we are having these ranges of

play20:15

both unsigned and signed representation

play20:18

due to the word length 8

play20:20

bit in other words Intel

play20:23

8085 can deal with 8 Bits of data at

play20:27

once

play20:29

also feel free to write down the ranges

play20:32

in decimal for these two representations

play20:35

in the comment

play20:37

section so in this session we covered

play20:39

the topic word length of

play20:43

microprocessor all right people that

play20:45

will be all for this session in the next

play20:47

session we are going to learn about the

play20:49

pins of 8085 microprocessor so I hope to

play20:53

see you in the next one thank you all

play20:54

for

play20:57

watching

play20:59

[Music]

Rate This

5.0 / 5 (0 votes)

Связанные теги
Microprocessor8085Word LengthData HandlingIntel 4004Binary AdditionTwo's ComplementUnsigned NumbersSigned RepresentationMicroprocessor Evolution
Вам нужно краткое изложение на английском?