• Skip to primary navigation
  • Skip to main content
  • Skip to primary sidebar
  • Skip to footer
projectsgeek

ProjectsGeek

Download Mini projects with Source Code, Java projects with Source Codes

  • Home
  • Java Projects
  • C++ Projects
  • VB Projects
  • PHP projects
  • .Net Projects
  • NodeJs Projects
  • Android Projects
    • Project Ideas
      • Final Year Project Ideas
      • JSP Projects
  • Assignment Codes
    • Fundamentals of Programming Language
    • Software Design Laboratory
    • Data Structure and Files Lab
    • Computer Graphics Lab
    • Object Oriented Programming Lab
    • Assembly Codes
  • School Projects
  • Forum

Multiply Two 8 Bit Numbers using Add and Shift Method

May 4, 2011 by ProjectsGeek Leave a Comment

Write a program to Multiply Two 8 Bit Numbers using  Add and Shift Method in Assembly language .Program should take first and second numbers as input to the program . Now it should implement certain logic to multiply 8 bit Numbers using  Add and Shift Method .
Consider that one byte is present in the AL register and another byte is present in the BL register.
We have to multiply the byte in AL with the byte in BL.
We will multiply the numbers using add and shift method. In this method, you add number with itself and rotate the other number each time and shift it by one bit to left alongwith carry. If carry is present add the two numbers.
Initialize the count to 4 as we are scanning for 4 digits. Decrement counter each time the bits are added. The result is stored in AX. Display the result.
                        For example :   AL = 11 H,  BL = 10 H, Count = 4
Step I       :
AX =
11
+
11
22 H
                               Rotate BL by one bit to left along with carry.
BL = 10 H
0
¬
0
0
0
1
0
0
0
0
 ­
CY
BL =
0
0
0
1
0
0
0
0
0
CY
2
0
Step II     :    Now decrement counter count = 3.
                               Check for carry, carry is not there so add number with itself.
AX =
22
+
22
44 H
                               Rotate BL to left,
BL =
0
¬
0
1
0
0
0
0
0
0
CY
4
0
                               Carry is not there.
                               Decrement count, count=2
Step III   :    Add number with itself
AX =
44
+
44
88 H
                      Rotate BL to left,
BL =
0
1
0
0
0
0
0
0
0
CY
8
0
                               Carry is not there.
Step IV :      Decrement counter count = 1.
                               Add number with itself as carry is not there.
AX =
88
+
88
110 H
                               Rotate BL to left,
BL =
1
0
0
0
0
0
0
0
0
CY
0
0
                               Carry is there.
Step V :        Decrement counter = 0.
                               Carry is present.
                               \ add AX, BX
\
0110
i.e.
11 H
+
0000
´
10 H
0110 H
0110 H

Algorithm to Multiply Two 8 Bit Numbers using  Add and Shift Method: 

 

Step I          :    Initialize the data segment.
Step II        :    Get the first number.
Step III      :    Get the second number.
Step IV       :    Initialize count = 04.
Step V        :    number 1 = number 1 ´ 2.
Step VI       :    Shift multiplier to left along with carry.
Step VII     :    Check for carry, if present go to step VIII else go to step IX.
Step VIII   :    number 1 = number1 + shifted number 2.
Step IX      :    Decrement counter.
Step X        :    If not zero, go to step V.
Step XI      :    Display the result.
Step XII     :    Stop.

 

Multiply Two 8 Bit Numbers using Add and Shift Method 1

 

Program to Multiply Two 8 Bit Numbers using  Add and Shift Method:

 

.model small  
 .data  
 a db 11H  
 b db 10H  
 .code  
      mov      ax, @data     ; Initialize data section  
      mov      ds, ax  
      mov      al, a         ; Load number1 in al  
      mov      bl, b         ; Load number2 in bl  
      mov      ah, 0       
      mov      dl, 04h       ; initialize counter  
 ad:      add      ax, ax    ; add numbers. Result in dx                           
      rcl      bl, 01  
      jnc      skip  
      add      ax, bx   
 skip:      dec      dl      ; dec number  
      jnz      ad                 
      mov      ch, 04h       ; Count of digits to be   
                ; displayed  
      mov      cl, 04h       ; Count to roll by 4 bits  
      mov      bx, ax        ; Result in reg bx  
 l2:     rol      bx, cl     ; roll bl so that msb   
                ; comes to lsb   
      mov      dl, bl        ; load dl with data to be        
                ; displayed  
      and      dl, 0fH       ; get only lsb  
      cmp      dl, 09        ; check if digit is 0-9 or   
                ; letter A-F  
      jbe      l4  
      add      dl, 07        ; if letter add 37H else only   
                ; add 30H  
 l4:     add      dl, 30H  
      mov      ah, 02        ; Function 2 under INT 21H   
                ; (Display character)  
      int      21H  
      dec      ch            ; Decrement Count  
      jnz      l2  
      mov      ah, 4cH       ; Terminate Program  
      int      21H  
 end  

How to Run this Program :

For Running this program you should have installed Tasm on you computer . If you have not installed Tasm  yet please install from Here .

C:\programs>tasm shaddmul.asm
Turbo Assembler  Version 3.0  Copyright (c) 1988, 1991 Borland International
Assembling file:   shaddmul.asm
Error messages:    None
Warning messages:  None
Passes:            1
Remaining memory:  438k
C:\programs>tlink shaddmul.obj
Turbo Link  Version 3.0 Copyright (c) 1987, 1990 Borland International
Warning: No stack
C:\programs>shaddmul
0110

Other Projects to Try:

  1. Add 8 Bit BCD Numbers
  2. 2s Complement of a Numbers Assembly Code
  3. Multiply Two 8 Bit Numbers Successive Addition Method
  4. Program to Multiply Two 16 Bit Numbers
  5. Multiply Two 8 Bit BCD Numbers

Filed Under: Assembly Codes Tagged With: Assembly Codes

Reader Interactions

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

Primary Sidebar

Tags

.Net Projects Download Android Project Ideas Android Projects Angular 2 Assembly Codes C # Projects C & C++ Projects C++ Projects Class Diagrams Computer Graphics Database Project Data Mining Projects DataScience Projects Datastructure Assignments Download Visual Basic Projects Electronics project Hadoop Projects Installation Guides Internet of Things Project IOS Projects Java Java Interview Questions Java Projects JavaScript JavaScript Projects java tutorial JSON JSP Projects Mechanical Projects Mongodb Networking Projects Node JS Projects OS Problems php Projects Placement Papers Project Ideas Python Projects seminar and presentation Struts

Search this Website


Footer

Download Java Project
Download Visual Basic Projects
Download .Net Projects
Download VB Projects
Download C++ Projects
Download NodeJs Projects
Download School Projects
Download School Projects
Ask Questions - Forum
Latest Projects Ideas
Assembly Codes
Datastructure Assignments
Computer Graphics Lab
Operating system Lab
australia-and-India-flag
  • Home
  • About me
  • Contact Form
  • Submit Your Work
  • Site Map
  • Privacy Policy