David H. K. Hoe, Chris Martinez and Sri Jyothsna Vundavalli part of Electrical Engineering The University of Texas, Tyler dhoe@uttyler.edu
?
Abstractâ€"Parallel-prefix common vipers (also known as carry channelize common vipers) ar known to have the best carrying into action in VLSI designs. However, this performance advantage does not translate directly into FPGA implementations due to constraints on logic block configurations and routing overhead. This paper investigates three types of carry-tree adders (the Kogge-Stone, sparse Kogge-Stone, and spanning tree adder) and compares them to the mere(a) Ripple curb Adder (RCA) and Carry edit out Adder (CSA). These designs of varied bit-widths were implemented on a Xilinx ascetic 3E FPGA and hold in measurements were made with a high-performance logic analyzer. due to the presence of a fast carry-chain, the RCA designs exhibit better delay performance up to 128 bits. The carry-tree adders are expected to have a speed advantage over the RCA as bit widths move up 256.
described. An efficient testing strategy for evaluating the performance of these adders is discussed.
Several tree-based adder structures are implemented and characterized on a FPGA and compared with the Ripple Carry Adder (RCA) and the Carry Skip Adder (CSA). Finally, some conclusions and suggestions for meliorate FPGA designs to enable better tree-based adder performance are given. II. CARRY-TREE adder DESIGNS Parallel-prefix adders, also known as carry-tree adders, pre-compute the propagate and generate signals [1]. These signals are variously combine using the fundamental carry agent (fco) [2]. (gL, pL) ? (gR, pR) = (gL + pLgR, pL pR) (1) Due to associative property of the fco, these operators can be combined in different ways to form various adder structures. For, example the four-bit carry-lookahead generator is given by: c4 = (g4, p4) ? [ (g3, p3) ? [(g2, p2) ? (g1, p1)] ] (2) A simple rearrangement...If you want to get a full essay, order it on our website: Orderessay
If you want to get a full essay, wisit our page: write my essay .
No comments:
Post a Comment