z-logo
open-access-imgOpen Access
Delay Efficient 128-Bit Ladner-Fischer Adder
Author(s) -
Busra Al
Publication year - 2018
Publication title -
international journal of electronics, communication and instrumentation engineering research and development/international journal of electronics, communiction and instrumentation engineering research and development
Language(s) - English
Resource type - Journals
eISSN - 2249-684X
pISSN - 2249-7951
DOI - 10.24247/ijecierdaug20181
Subject(s) - adder , arithmetic , bit (key) , computer science , mathematics , telecommunications , computer network , latency (audio)
This paper describes the VLSI Architecture for High-Speed 128-bit Ladner-Fischer adder. The performance of Ladner-Fischer adder with black cell takes huge memory. So, the gray cell can be replaced instead of black cell that improves the Efficiency in Ladner-Fischer Adder. The three stages of operations include pre-processing stage, carry generation stage, post-processing stage. In ripple carry, adder each bit of addition need to wait for the previous bit carry. In efficient Ladner Fischer adder, addition operation does not wait for previous bit carry since ripple carry adders are replaced by Carry select Adder (CSLA) and Binary to Excess-1 code Converter (BEC) to improve the speed and to decrease the memory used.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom