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

Define the edge-triggered flip-flops, Define the Edge-Triggered Flip-flops?...

Define the Edge-Triggered Flip-flops? An edge-triggered flip-flop changes states either at the negative edge (falling edge) or at the positive edge (rising edge) of the clock p

Minimax algorithm - artificial intelligence, Minimax algorithm - artificial...

Minimax algorithm - artificial intelligence: The minimax algorithm is so called because it assumes that you and your opponent are going to act rationally, so that if you will

Grounding a variable - first-order logic, Grounding a variable - first-orde...

Grounding a variable - first-order logic: The perform of making ourselves clear about a variable by introducing an exists or a forall sign is called quantifying the variable.

Five design principles, Visibility. Controls should be clearly visible, so ...

Visibility. Controls should be clearly visible, so users can see the controls that are available to them. Visual feedback should also be clearly visible, so users can understand wh

Interrupts - computer architecture, Interrupts Interrupt-request lin...

Interrupts Interrupt-request line o   Interrupt-acknowledge signal o   Interrupt-request signal Interrupt-service routine o   May have no relationship t

State and prove demorgan's second theorem, State and prove Demorgan's secon...

State and prove Demorgan's second theorem   Proof: Demorgan's second theorem   = A‾ + B‾ The two sides of the equation here   = A‾ + B‾ is represented through the logic d

Types of addressing modes in assembly language, Types of Addressing Modes: ...

Types of Addressing Modes: Each instruction of a computer mentions an operation on certain data. There are many ways of specifying address of the data to be operated on. These

What are the static and dynamic hazards in logic circuits, If for a short p...

If for a short period of time circuits goes to some dissimilar logic level then it is assumed to have then it is known as static hazard e.g. If the final logic value of output of a

Serial execution and parallel execution, Serial Execution Execution of ...

Serial Execution Execution of a program consecutively, one statement at a time. In the easiest sense, this is what occurs on a one processor machine. However, even many of the

Code segment , Specified  the code segment below and that n is the prob...

Specified  the code segment below and that n is the problem size, answer the following queries:   // . . . int sum = 0; if(x > 12){ for(int i = 1; i     for( i

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