How can we decrement and increment operations, Computer Engineering

Assignment Help:

How can we decrement and increment  operations

We  can  implement decrement  and increment  operations  by  using  a  combinational circuit  or  binary  down/up counters.  In  most  of  computers  multiplication  and division are implemented using subtract/add and shift micro-operations. If a digital system has implemented multiplication and division by means of combinational circuits then we can call these as micro-operations for that system. An arithmetic circuit is usually implemented by parallel adder circuits. Each of multiplexers (MUX) of given circuit has two select inputs. This 4-bit circuit takes two inputs of 4-bit data values and carry-in-bit and outputs four resultant data bits and a carry-out-bit.

With different input values we can obtain various micro-operations.

 Equivalent micro-operation Micro-operation name

R V R + R1 2 Add

R V R + R  +11 2 Add with carry

R V R + R1 2 Subtract with borrow

R V R + 2's1 Subtract

R V R1 Transfer

R VR + 11 Increment

R V R - 11 Decrement

 


Related Discussions:- How can we decrement and increment operations

What are the advantages of using xml over html, What are the advantages of ...

What are the advantages of using XML over HTML?  The root cause of the problem lies in HTML (Hyper Text Mark-up Language), the defacto standard for web publication. The main pr

What are the benefits of using e-commerce, What are the benefits of using e...

What are the benefits of using e-commerce? Basic Benefits of E-Commerce The main benefits are enhancing sales and reducing costs. The other advantages are as follows: 1.

Concept of multithreading, Concept of Multithreading: These troubles incre...

Concept of Multithreading: These troubles increase in the design of large-scale multiprocessors such as MPP as discussed above. Thus, a solution for optimizing this latency should

Labels in the sub trees, A sorting method which uses the binary tree concep...

A sorting method which uses the binary tree concept such that label of any node is larger than all  the labels in the sub trees, is called A Sorting method which uses the binar

Explain possible attacks on the wired equivalent privacy, Question : (a...

Question : (a) IEEE802.11 supports two types of network architecture, describe these architectures with the support of diagrams detailing the network components. (b) IEEE80

Explain why the ROM is a volatile memory, Is the ROM a volatile memory? Exp...

Is the ROM a volatile memory? Explain Ans. No, ROM is a Non-Volatile memory. Programming of ROM includes making of the needed  interconnections at  the time of fabrication and

Basic performance equation, Explain the basic performance equation Ans...

Explain the basic performance equation Ans: The basic performance equation is following T = N * S/ R T =>  It is processor time required to execute a program N => act

Data routing functions-network properties, Data Routing Functions The d...

Data Routing Functions The data routing functions are the functions which when implemented  the path among the source and the objective. In dynamic interconnection networks the

Handling a page in memory - computer architecture, Handling a Page: ...

Handling a Page: Typical page size today are 4 kb to 16 kb ,having tendency to use even larger page sized Organization that reduce the page fault rate are striking (comp

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