Carry look-ahead adder and booth''s algorithm, Computer Engineering

Describe carry look-ahead adder?

Ans: The input carry required by a stage is directly computed from carry signals obtained from all of the preceding stages i-1,i-2,.....0, rather than waiting for usual carries to supply slowly from stage to stage. An adder which is uses this principle is a called carry look-ahead adder.

What are the major features of Booth's algorithm?

Ans: 1) It gain some efficiency in the number of addition required when the multiplier has a few large blocks of 1s.

2) ) It handles positive and negative both multipliers uniformly.

What is the technique to speed up the multiplication process?

Ans: There are basically 2 techniques to speed up the multiplication process:

a) The first technique guarantees that the maximum number of summands that have to

be added is n/2 for n-bit operands.

b) The second technique reduces the time required to add the summands.

 

Posted Date: 10/13/2012 8:09:27 AM | Location : United States







Related Discussions:- Carry look-ahead adder and booth''s algorithm, Assignment Help, Ask Question on Carry look-ahead adder and booth''s algorithm, Get Answer, Expert's Help, Carry look-ahead adder and booth''s algorithm Discussions

Write discussion on Carry look-ahead adder and booth''s algorithm
Your posts are moderated
Related Questions
DATA DICTIONARY ON ONLINE QUIZ SYSTEM

Q. Programmed input - output technique for computers? Programmed input/output is a useful I/O technique for computers where hardware costs need to be minimised. Input or output

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

Determine the begin - end keywords Group several statements together. Cause the statements to be evaluated sequentially (one at a time) -> Any timing within sequential group

what is bitmap and pixmap

Define the Example Client-server Implementations Once you accept the client-server mindset, the process of architecting and developing applications becomes rather easy. Clearly

What are the differences between one hot and binary encoding? Common classifications used to explain the state encoding of an FSM is Binary or highly encoded and one hot. A bin

Define MFC. To accommodate the variability in response time, the processor waits unless it receives an indication that the requested read operation has been done. The control s

Once a finite state automaton (FSA) is designed, its transition diagram can be translated in a straightforward manner into program code. However, this translation process is consid

The message queue provides the information about sizes of queues under utilization of various processors. It points to size of every processor incoming message queue that would be