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

Returns information about present virtual machine, Q. Returns information a...

Q. Returns information about present virtual machine? int pvm_parent( void ) Returns the tid of process which spawned the calling process.  int pvm_tidtohost(

What is flash memory, Q. What is Flash Memory? This memory is other fo...

Q. What is Flash Memory? This memory is other form of semiconductor memory that was first introduced in mid-1980.  These memories can be reprogrammed at high speed and therefo

Explain the term granularity, Granularity In 'Parallel computing', Gran...

Granularity In 'Parallel computing', Granularity can be defined as a qualitative assess of the ratio of computation to communication. 1) Coarse Granularity - relatively hug

Colour management, There are three primary colours in pigments - Red, Yello...

There are three primary colours in pigments - Red, Yellow and Blue. There are two ways to produce more colours:   Physical Mixing: Physically mix colours to produce a new colour

Give difference between compiler and interpreter, Give difference between c...

Give difference between compiler and interpreter. Compiler: It is a translator for machine independent HLL as FORTRAN and COBOL etc. Interpreter: It analysis the source

Define memory address map, Define memory address map? Addressing of mem...

Define memory address map? Addressing of memory can be established by means of a table that specifies the memory address assigned to each chip. The tables, known as memory addr

How does multiplexer know which line to select, How does multiplexer know w...

How does multiplexer know which line to select? This is managed by select lines. The select lines provide communication among different components of a computer. Now let's see

Rules for minimisation using k maps, 1) All squares containing a 1 must be ...

1) All squares containing a 1 must be grouped. 2) The largest possible groups must be formed. 3) Groups can overlap if this allows larger groups to be formed. 4) Groups mu

Grapgh, representation of the adjacency matrix and adjacency list

representation of the adjacency matrix and adjacency list

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