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

Determine Boolean identities using Boolean algebra, Prove the following ide...

Prove the following identities   a. A ‾B ‾C‾ + A ‾BC ‾ + AB ‾C ‾ + ABC ‾ = C ‾ b. AB + ABC + A ‾ B + AB ‾C = B + AC Ans. a. LHS = A'B'C' + A'BC' + AB'C' + ABC' =

What is process, What is Process? Process: A process is a program in ...

What is Process? Process: A process is a program in execution. It is an active entity, represented through the value of the program counter and the contents of registers o

Illustrated three stages of data mining process, Illustrated three stages o...

Illustrated three stages of data mining process? Stage 1: Exploration: This stage generally starts along with data preparation that may involve cleaning data, selecting subse

How do you track down a transition by name, Question 1: a) How do you ...

Question 1: a) How do you track down a transition by name? b) Why Premiere Pro is considered a non-linear editor? c) Explain clearly the main problem that may arise wh

What is an advantage of executing a process in background, What is an advan...

What is an advantage of executing a process in background? The most common reason to put a process in the background is to permit you to do something else interactively without

Explain bit-o-ring technique, Explain bit-O-Ring technique. The micro p...

Explain bit-O-Ring technique. The micro program represents that branches are not always made to a one branch address. This is a direct consequence of combining easy micro routi

Describe about pascaline, Q. Describe about Pascaline? Blaise Pascal ma...

Q. Describe about Pascaline? Blaise Pascal made very first attempt in the direction of automatic computing. He invented a device that comprised lots of gears and chains that us

How the simulation is done - Weather simulation, How the simulation is done...

How the simulation is done -  Information from the satellites/sensors sent to computer -  This data is compared to information stored on files ..... -  ..... Which contain kno

Highly encoded micro-instructions, Highly Encoded micro-instructions ...

Highly Encoded micro-instructions Encoded bits required in micro-instructions are small. It provided an aggregated view that is a higher view of CPU as just an encoded

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