A New High-speed and Low area Efficient Pipelined 128-bit Adder Based on Modified Carry Look-ahead Merging with Han-Carlson Tree Method

Abstract

In this paper, a 128-bit pipeline Adder is presented, in the form of a syntactic Tree Adder by an introduction of a new modified Carry-Look-Ahead (CLA) that is merged inside the Tree adder. The difference between proposed modified Carry-Look-Ahead and conventional Carry-Look-Ahead is that in proposed design by increase in the number of Carry-Look-Ahead single-block input reduces the number of groups, subsequently raises the performance of conventional Carry-Look-Ahead. In order to add two 128-bit numbers, these modified Carry-Look-Ahead Adders are merged with Tree algorithm, that the results of it have a significant improvement in complexity and gates count (25%), compared to the existing methods. This makes a significant reduction in transistor count and area efficiently.