Implementation of a simple arithmetic, Computer Engineering

Assignment Help:

Q. Implementation of a Simple Arithmetic?

So, by now we have concerned how logic and arithmetic micro-operations can be applied individually. If we combine these 2 circuits along with shifting logic then we may have a possible simple structure of ALU. Basically ALU is a combinational circuit whose inputs are contents of specific registers. ALU performs desired micro-operation as decided by control signals on input and places results in an output or destination register. Whole operation of ALU can be performed in a single clock pulse as it's a combinational circuit. Shift operation can be performed in a separate unit however sometimes it can be made as a part of overall ALU. The following diagram gives a simple structure of one stage of an ALU. 

2018_Implementation of a Simple Arithmetic.png

One stage of ALU with shift capability

Please note that in this diagram we have given reference to two previous figures for arithmetic and logic circuits. This phase of ALU has two data inputs; the ith bits of registers to be manipulated. But the (i - 1)th or (i+1)th bit is also fed for case of shift micro-operation of only one register. There are 4 selection lines that determine what micro-operation (arithmetic, logic or shift) on the input. The Fi is resultant bit after desired micro-operation. Let's see how value of Fi changes on the foundation of four select inputs. This is displayed in Figure below:

Please note that in Figure below arithmetic micro-operations have both S3 and S2 bits as zero. Input Ci is significant for only arithmetic micro-operations. For logic micro-operations S3, S2 values are 01. Values 10 and 11 cause shift micro-operations.

For this shift micro-operation S1 and S0 values and Ci values don't play any role. 

950_Implementation of a Simple Arithmetic1.png

Figure: Micro-operations performed by a Sample ALU


Related Discussions:- Implementation of a simple arithmetic

Illustrate basic strategy used in raid, Q. Illustrate Basic strategy used i...

Q. Illustrate Basic strategy used in RAID? Basic strategy used in RAID is to replace large capacity disk drive with multiple smaller capacity disks. Data on these disks is dist

Spirit duplicating of information, Spirit Duplicating Equipment Requir...

Spirit Duplicating Equipment Required Spirit Duplicator (also known as hectograph) Thermal copier (optional) Materials Masters Hectographic carbon COPY pa

What is the application of e-commerce in home shopping, What is the applica...

What is the application of E-Commerce in Home Shopping? Application of E-Commerce in Home Shopping: Television broadcast of goods for purchase sent it directly to a viewe

Loop level-parallelism based on granularity size, Loop Level This is...

Loop Level This is one more level of parallelism where iterative loop instructions can be parallelized. Fine Granularity  size is used at this level also. Simple loops in a

Explain message switching, Explain Message switching. Recourse computer...

Explain Message switching. Recourse computer sends data to switching office that stores the data into buffer and seems for a free link. Sends link to other switching office, if

Describe about frameset, Q. Describe about Frameset? Now make a master ...

Q. Describe about Frameset? Now make a master page in which you write below code. My Frame Page -- The Master Page

What is instruction register, Q. What is Instruction Register? Instruct...

Q. What is Instruction Register? Instruction Register (IR): Here instructions are loaded before execution. Comments on figure above are as below: All representations are

Why erlang is used, Erlang is used to (A) Measure busy period         ...

Erlang is used to (A) Measure busy period                (B) Give total busy period in minutes (C)  Measure average call rate       (D) Indicate total call period Ans

C, Drawbacks of linear arrays

Drawbacks of linear arrays

What is minimum spanning tree, Minimum Spanning Tree: Given a weighted gra...

Minimum Spanning Tree: Given a weighted graph G, it is often desired to make a spanning tree T for G, like the sum of weights of the edges in T is the least. Like tree is known as

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