An Improved GEF Fast Addition Algorithm

TL;DR

This paper introduces an improved GEF fast addition algorithm that enhances speed and memory efficiency by optimizing carry calculation without sorting overhead, suitable for future high-speed computational devices.

Contribution

The paper presents a novel GEF fast addition algorithm that reduces time and memory usage by calculating carry based on operand bit arrival times without sorting overhead.

Findings

Reduced computation time compared to previous algorithms

Lower memory space requirements

Better performance in high-speed devices

Abstract

In this paper, an improved GEF fast addition algorithm is proposed. The proposed algorithm reduces time and memory space. In this algorithm, carry is calculated on the basis of arrival timing of the operand's bits without overhead of sorting. Intermediate terms are generated from the most significant bit and the carry is generated from the least significant bit using the functions of efficient operators. This algorithm shows better performance for use in the fastest computational devices of the near future.