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

Recursion to an iterative procedure, The data structure required to convert...

The data structure required to convert a recursion to an iterative procedure is  Stack is the data structure required to convert a recursion to an iterative procedure

Describe about full adder, Q. Describe about full adder? Let's take ful...

Q. Describe about full adder? Let's take full adder. For this other variable carry from previous bit addition is added let'us call it 'p'. Truth table and K-Map for this is dis

Explain speedup performance and issues in pipelining, Speedup First, we...

Speedup First, we take the speedup factor which is we see how much speed up performance we achieve by pipelining. First we take ideal case for measuring the speedup. Let n b

Difference between visual check and parity check, Difference between Visual...

Difference between Visual check and Parity check Visual check This is checking for errors by comparing entered data with original document (NOTE: this is not the same as

Differentiate between validation and simulation, Question 1: a) Name a...

Question 1: a) Name and give a brief description of three Real-Time Systems. b) State three downfalls of Embedded Systems. c) Differentiate between a microprocessor an

Variables and quantifiers - first-order logic, Variables and Quantifiers: ...

Variables and Quantifiers: Now we have to diagnose now that if we wanted to say that there is a meal at the Red Lion which costs only 3 pounds, is well sayed. Rather thenif we

Convert a JK flipflop to T type flipflop, With the help of a suitable diagr...

With the help of a suitable diagram, explain how do you convert a JK flipflop to T type flipflop. Ans. As here flip flop is JK flip flop and it is required to convert JK in T.

Hypertext markup language, Web pages or materials which are in the form of ...

Web pages or materials which are in the form of hypermedia documents accessed through Internet can be located anywhere in world. No matter from where they originated, most Web d

Determine the o/p when i/p A=11001 is applied to a NOT gate, When an input ...

When an input signal A=11001 is applied to a NOT gate serially, its output signal is ? Ans. First input applied will be LSB 00110, as A=11001 is serially applied to a NOT gate

Explain bitwise operator, Bitwise Operators Like  other  operators  bit...

Bitwise Operators Like  other  operators  bitwise  operators  have  rules  of  precedence  and  associativity  that determine how expressions involved them are evaluated.

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