4-Bit High-Speed Binary Ling Adder

TL;DR

This paper introduces a 4-bit high-speed binary Ling adder that simplifies carry computation using a new prefix bit, improving addition speed by reducing ripple effects compared to traditional carry-look-ahead adders.

Contribution

The paper presents a novel 4-bit Ling adder design that incorporates a half sum prefix bit, offering a simplified and faster alternative to existing carry-look-ahead adder architectures.

Findings

Enhanced addition speed due to reduced ripple effect

Simplified carry computation with Ling carry and propagate bits

Comparative analysis shows performance improvements over traditional adders

Abstract

Binary addition is one of the most primitive and most commonly used applications in computer arithmetic. A large variety of algorithms and implementations have been proposed for binary addition. Huey Ling proposed a simpler form of CLA equations which rely on adjacent pair bits. Along with bit generate and bit propagate, we introduce another prefix bit, the half sum bit. Ling adder increases the speed of n-bit binary addition, which is an upgrade from the existing Carry-Look-Ahead adder. Several variants of the carry look-ahead equations, like Ling carries, have been presented that simplify carry computation and can lead to faster structures. Ling adders, make use of Ling carry and propagate bits, in order to calculate the sum bit. As a result, dependency on the previous bit addition is reduced; that is, ripple effect is lowered. This paper provides a comparative study on the implementation of the above mentioned high-speed adders.