Abstract
parallal prefix adders are one of the fastest types of adder that had been created and developed. this paper investigates three types of carry-tree adders (the Kogge-Stone, sparse Kogge-Stone, and spanning tree adder) and compares them to the simple ripple carry adder and carry skip adder.these designs of varied bit widths were Implemented on a xilinx spartan 3E FPGA and delay measurements were made with a high performance logic analyzer .Due to the presence of a fast carry-chain,the RCA design exhibit better delay performance up to 128 bits.the carry tree adders are expected to have a speed advantage over the the RCA as bit widths approach 256.
Full Text
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call