Convert ascii code to its bcd equivalent, Computer Engineering

Assignment Help:

Convert ASCII code to its BCD equivalent. This can be achieved by simply replacing bits in upper four bits of byte by four zeros. For illustration the ASCII '1' is 32h = 0010B. By making upper four bits as 0 we obtain 0000 0010 that is 2 in BCD. Number attained is known as unpacked BCD number. Upper 4 bits of this byte is zero. So upper four bits can be used to store another BCD digit. The byte so obtained is known as packed BCD number. For illustration an unpacked BCD number 59 is 00000101 00001001 which is 05 09. Packed BCD will be 0101 1001 which is 59.

The algorithm to convert two ASCII digits to packed BCD can be defined as:

Convert first ASCII digit to unpacked BCD.

Convert second ASCII digit to unpacked BCD.

1110_Convert ASCII code to its BCD equivalent.png

Move first BCD to upper four positions in byte.

702_Convert ASCII code to its BCD equivalent1.png

Pack two BCD bits in one byte.

506_Convert ASCII code to its BCD equivalent2.png

The assembly language program for the above can be written in the below manner.

 

; ABSTRACT                         Program produces a packed BCD byte from 2 ASCII 

                                                ; encoded digits. Assume the number as 59.

                                                ; The first ASCII digit (5) is loaded in BL.

                                                ; The second ASCII digit (9) is loaded in AL.

                                                ; The result (packed BCD) is left in AL.

; REGISTERS                        ; Uses CS, AL, BL, CL

; PORTS                                  ; None used

CODE    SEGMENT

            ASSUME                    CS:CODE

START:  MOV BL,                '5'; Load first ASCII digit in BL

   MOV AL,                            '9'; Load second ASCII digit in AL

   AND BL,                             0Fh; Mask upper 4 bits of first digit

   AND AL,                             0Fh; Mask upper 4 bits of second digit

   MOV CL,                            04h; Load CL for 4 rotates 

   ROL BL,                              CL; Rotate BL 4 bit positions

   OR AL,                                BL; Combine nibbles, result in AL contains 59 

                                                ; As packed BCD

CODE ENDS

END START

Discussion:

8086 doesn't have any instruction to swap lower and upper 4 bits in a byte so we need to use rotate instructions that too by 4 times. Out of two rotate instructions RCL and ROL we have chosen ROL as it rotates the byte left by one or more positions whereas RCL moves MSB into carry flag and brings original carry flag in the LSB position and that is not what we want.


Related Discussions:- Convert ascii code to its bcd equivalent

Evidence of intelligent behavior - artificial intelligence, Evidence of int...

Evidence of intelligent behavior - Artificial Intelligence: Machines mean they could simply be personal computers, or they could be robots with embedded automative systems, or

What is a breeder reactor, Q. What is a breeder reactor? 92 U 238 and...

Q. What is a breeder reactor? 92 U 238 and 90 Th 232 aren't fissile materials but are abundant in nature. In the reactor these are able to be converted into a fissile mater

Define process control block, Define Process Control Block (PCB). Pr...

Define Process Control Block (PCB). Process Control Block (PCB): Information related with each process is stored into Process control Block. a)      Process state b)

How many and gates are required to realize Y = CD+EF+G, How many AND gates ...

How many AND gates are required to realize Y = CD+EF+G ? Ans. Y = CD + EF + G for realize this two AND gates are needed (for CD and EF).

8085 programs, what is the theory used to check whether a number is negativ...

what is the theory used to check whether a number is negative or positive?

Illustrate program on hypothetical machine, Q. Illustrate program on hypoth...

Q. Illustrate program on hypothetical machine? The program given in figure above is a hypothetical program which performs addition of numbers stored from locations 2001 onwards

Handlers classification, Handler's Classification In 1977, Wolfgang Han...

Handler's Classification In 1977, Wolfgang Handler proposed an detailed notation for expressing the parallelism and pipelining of computers. Handler's classification addresses

What are the steps include constructing a functional model, What are the St...

What are the Steps include constructing a Functional Model Recognize input and output values Build data flow diagrams which shows functional dependencies Explain

What is the difference among declaration and definition, The declaration te...

The declaration tells the compiler that at some later point we plan to show the definition of this declaration. E.g.: void stars () //function declaration The definition con

Why are binary, Q. Why are binary, octal and hexadecimal used for computer ...

Q. Why are binary, octal and hexadecimal used for computer applications? Q. Perform the following: (189.3) 10 = (?) 2

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd