Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Improving the Power Delay Performance of Parallel Prefix Adders


Affiliations
1 ECE Department, JNTUACE, Anantapur, Andhra Pradesh, India
2 ECE Department, JNTUACE, Anantapur, A.P, India
     

   Subscribe/Renew Journal


Binary adder is the critical element in most digital circuit designs including digital signal processors (DSP) and microprocessor data path units. As such, extensive research continues to be focused on improving the power delay performance of the adder. In VLSI implementations, parallel-prefix adders are known to have the best performance. Parallel-prefix adders are known to have the best performance in VLSI designs. Due to routing overhead and complexity in logic blocks it will not directly translate into FPGA implementations. In this paper there are three types of parallel prefix adders i.e. 1.the Kogge-Stone, 2.sparse Kogge-Stone, and 3.spanning tree adder and compares with the simple Ripple Carry Adder, Carry Skip Adder and carry look ahead adder. These designs of varied adders were implemented on a Xilinx Spartan 3E FPGA and delay measurements. In this paper for simulation purpose Model sim is used, and further synthesizing Xilinx-ISE tool is used.


Keywords

Simple Adders, Kogge-Stone Prefix Tree, Generate and Propagate.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 209

PDF Views: 1




  • Improving the Power Delay Performance of Parallel Prefix Adders

Abstract Views: 209  |  PDF Views: 1

Authors

P. Manjunath
ECE Department, JNTUACE, Anantapur, Andhra Pradesh, India
P. Ramana Reddy
ECE Department, JNTUACE, Anantapur, A.P, India

Abstract


Binary adder is the critical element in most digital circuit designs including digital signal processors (DSP) and microprocessor data path units. As such, extensive research continues to be focused on improving the power delay performance of the adder. In VLSI implementations, parallel-prefix adders are known to have the best performance. Parallel-prefix adders are known to have the best performance in VLSI designs. Due to routing overhead and complexity in logic blocks it will not directly translate into FPGA implementations. In this paper there are three types of parallel prefix adders i.e. 1.the Kogge-Stone, 2.sparse Kogge-Stone, and 3.spanning tree adder and compares with the simple Ripple Carry Adder, Carry Skip Adder and carry look ahead adder. These designs of varied adders were implemented on a Xilinx Spartan 3E FPGA and delay measurements. In this paper for simulation purpose Model sim is used, and further synthesizing Xilinx-ISE tool is used.


Keywords


Simple Adders, Kogge-Stone Prefix Tree, Generate and Propagate.