Define the arithmetic micro-operations, Computer Engineering

Assignment Help:

Q. Define the Arithmetic Micro-operations?

These micro-operations execute simple arithmetic operations on numeric data stored in registers. The fundamental arithmetic micro-operations are subtraction, addition, decrement, increment and shift. 

Addition micro-operation is expressed as:

      R3 ← R1 +R2 

It means that contents of register R1 are added to contents of register R2 and sum is transferred to register R3. This operation needs three registers to hold data along with Binary Adder circuit in the ALU. Binary adder is a digital circuitthat produces the arithmetic sum of two binary numbers of any lengths and is constructed with full-adder circuits associated in cascade. An n-bit binary adder needs n full-adders. Add micro-operation in accumulator machine can be performed as:

AC ← AC + DR

Subtraction is most frequently implemented in machines through complement and adds operations. It is specified as:

        R3 ← R1 - R2  

        R3 ← R1 + (2's complement of R2)

        R3 ← R1 + (1's complement of R2 + 1)

        R3 ← R1 + R2 + 1 (The bar on top of R2 implies 1's complement of R2 that is bitwise complement)    

Adding 1 to 1's complement generates the 2's complement. Adding contents of R1 to the 2's complement of R2 is equal to subtracting contents of R2 from R1 and storing the result in R3.

The increment micro-operation adds one to a number in a register. This operation is expressed as:

                 R1 ← R1 + 1

This can be implemented in hardware by employing a binary-up counter.  

The decrement micro-operation subtracts one from a number in a register. This operation is expressed as:

                 R1 ← R1 - 1 

This can be implemented by binary-down counter.


Related Discussions:- Define the arithmetic micro-operations

Mode counter, desing mode level counter starting at 0011 using D flipflop

desing mode level counter starting at 0011 using D flipflop

State the optimal route of node, State the optimal route of node Consid...

State the optimal route of node Consider the node i which has path length K+1, with the directly preceding node on the path being j. The distance to node i is w(j, i) plus the

Dos function calls, INT 21H supports about 100 different functions. A funct...

INT 21H supports about 100 different functions. A function is recognised by putting the function number in AH register. For illustration if we want to call function number 01 then

Design a nand-to-and gate network, Q Use as few gates as possible, design a...

Q Use as few gates as possible, design a NAND-to-AND gate network that realize the following Boolean algebra expression. ABCD + A'BC'D + A'BC'D' + A'BCD + (A'B'C'D' + A'BCD')

Internet programming, Futoshiki is a game played on an N by N (usually 5 by...

Futoshiki is a game played on an N by N (usually 5 by 5) grid and uses the symbols 1 .. N. The objective of the game is to place each symbol on the grid so that it only occurs once

Search mechanisms in prolog, Search mechanisms in Prolog: Here we can ...

Search mechanisms in Prolog: Here we can needs this simple Prolog program to describe how Prolog searches as:president(X) :- first_name(X, georgedubya), second_name(X, bush).

Average data transfer rate in floppy, Q. Average data transfer rate in flop...

Q. Average data transfer rate in floppy? A floppy is about 0.64 mm thick and is available in diameters 5.25 inch and 3.5 inch. Data are arranged in form of tracks and sectors.

Explain about the mini computers, Explain about the MINI COMPUTER Minic...

Explain about the MINI COMPUTER Minicomputers are much smaller in size than mainframe computers and they are also less expensive.  The cost of these computers can differ from a

Existential elimination, Existential Elimination : Now we have a sente...

Existential Elimination : Now we have a sentence, A, is with an  existentially quantified variable, v, so then just for every constant symbol k, that it does not appear anywhe

Flynn’s classification, Flynn's Classification  This classification was...

Flynn's Classification  This classification was early proposed and studied by Michael Flynn in 1972. Flynn did not believe the machine architecture for organization of parallel

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