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

Explain the relationship b/w translated & load time address, Explain the re...

Explain the relationship amongst Translated address and Load time address. Translated address: Address assigned through the translator Load time address: Address ass

i use server session pools and connection consumers, When should I use ser...

When should I use server session pools and connection consumers? Ans) WebLogic JMS executes an optional JMS facility for defining a server-managed pool of server sessions. This

Masters and slaves, The devices on the I2C bus are either masters or slaves...

The devices on the I2C bus are either masters or slaves. The master is the device that is responsible for driving the SCL clock line, while the slaves are the devices that respond

Write a subroutine in c which toggles the cursor, Q . Write a subroutine in...

Q . Write a subroutine in C which toggles the cursor? Write a subroutine in C which toggles the cursor. It takes one argument which toggles the value between on (1) and off (0)

Explain about param super computer, Q. Explain about PARAM Super computer? ...

Q. Explain about PARAM Super computer? PARAM is a high-performance, industry standard and scalable computer. It has developed from concepts of distributes scalable computers ma

Shared memory and distributed memory, Shared Memory Refers to the memor...

Shared Memory Refers to the memory part of a computer system in which the memory can processed directly by any of the processors in the system. Distributed Memory Refer

What are the stages of data mining, What are the stages of data mining? ...

What are the stages of data mining? The procedure of data mining comprises three stages, which are given below: a) The initial exploration b) Model building c) Deploym

Speed up factor, Remember, the value of α is between 0 and 1. Now, let us p...

Remember, the value of α is between 0 and 1. Now, let us put some values of α and compute the speed up factor for increasing values of number of processors.  We get that the S(N) k

Subtraction of 01100-00011 using 2's complement method, Subtraction of 0110...

Subtraction of 01100-00011 using 2's complement method Ans. Firstly 1's complement of 00011 is 11100 and 2's complement is 11100 + 1 = 11101. Thus If a last carry is

How branching takes place in instruction pipeline, How branching takes plac...

How branching takes place in Instruction pipeline. Explain with suitable examples

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