Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
27 views6 pages

Exp 2

The document describes the design and working of a carry lookahead adder. It explains that carry lookahead adders reduce computation time by pre-computing carry signals using carry propagate and generate functions, allowing the addition to be performed in parallel rather than sequentially. The key steps are: 1) Understanding how a carry lookahead adder module works, 2) Using carry propagate and generate functions to reduce computation time compared to a ripple carry adder, 3) Adding two 4-bit numbers using the designed carry lookahead adder.

Uploaded by

jatinshaarmaa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
27 views6 pages

Exp 2

The document describes the design and working of a carry lookahead adder. It explains that carry lookahead adders reduce computation time by pre-computing carry signals using carry propagate and generate functions, allowing the addition to be performed in parallel rather than sequentially. The key steps are: 1) Understanding how a carry lookahead adder module works, 2) Using carry propagate and generate functions to reduce computation time compared to a ripple carry adder, 3) Adding two 4-bit numbers using the designed carry lookahead adder.

Uploaded by

jatinshaarmaa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Objective

It computes the carries parallely thus greatly speeding up the


computation.

1. understanding behaviour of carry lookahead adder from module


designed by the student as part of the experiment
2. understanding the concept of reducing computation time with
respect of ripple carry adder by using carry generate and
propagate functions
3. the adder wil add two 4 bit numbers

Theory:

Design of Carry Lookahead Adders :

To reduce the computation time, there are faster ways to add two
binary numbers by using carry lookahead adders. They work by
creating two signals P and G known to be Carry
Propagator and Carry Generator. The carry propagator is
propagated to the next level whereas the carry generator is used
to generate the output carry ,regardless of input carry. The block
diagram of a 4-bit Carry Lookahead Adder is shown here below -
The number of gate levels for the carry propagation can be found
from the circuit of full adder. The signal from input carry Cin to output
carry Cout requires an AND gate and an OR gate, which constitutes
two gate levels. So if there are four full adders in the parallel adder,
the output carry C5 would have 2 X 4 = 8 gate levels from C1 to C5.
For an n-bit parallel adder, there are 2n gate levels to propagate
through.

Procedure
Introduction-

A Carry-Look-Ahead Adder is a type of adder circuit that optimizes the


speed of addition by reducing carry propagation delays through the
introduction of more complex hardware.

Materials Required-

1. Simulation Software

2. Documentation
3. Supporting Tools such as Computer System

Experiment Steps:

1. Step 1: Half Adder Circuit:Use a half adder circuit using the


side pallete.

2. Verify the functionality of the half adder by simulating


different input combinations.

3. Step 2: Carry-Look-Ahead Logic:

4. Integrate the Carry-Look-Ahead logic into the half adder


circuit.

5. Implement the lookahead logic to improve the speed of


carry propagation.

6. Step 3: Testing:

7. Test the Carry-Look-Ahead Adder circuit with various input


values to observe how carry propagation is optimized.
Truth Table for Carry look ahead adder


Result-
The Carry Look-Ahead Adder is a circuit that enhances binary addition speed by
pre-calculating carry signals based on input data, reducing carry propagation
delays. This approach improves the efficiency of arithmetic operations by
generating carry signals in advance, eliminating the need for carry ripples and
enabling faster parallel addition logic. The circuit complexity increases with the
number of variables, requiring more AND and OR gates for larger bit sizes.
Output

You might also like