Performance of Adders with Logical Optimization in FPGA
Addition is an indispensable operation for any high speed digital system, digital signal processing or control system. Therefore, careful optimization of the adder is of the greatest importance. This optimization can be attained in two levels; it can be circuit or logic optimization. In circuit optimization the size of transistors are manipulated, where as in logic optimization the Boolean equations are rearranged (or manipulated) to optimize speed, area and power consumption. In this work technology independent logic optimization is used to design 1-bit full adder with 20 different Boolean expressions and its performance is analyzed in terms of transistor count, delay and power dissipation using Tanner EDA with TSMC MOSIS 250nm technology. All the Boolean expressions are realized in terms of CMOS logic. From the analysis the optimized equation is chosen to construct a full adder circuit in terms of multiplexer. This logic optimized multiplexer based adders are incorporated in selected existing adders like ripple carry adder, carry look-ahead adder, carry skip adder, carry select adder, carry increment adder and carry save adder and its performance is analyzed in terms of area (slices used) and maximum combinational path delay as a function of size. The target FPGA device chosen for the implementation of these adders was Xilinx ISE 12.1 Spartan3E XC3S500-5FG320. Each adder type was implemented with bit sizes of: 8, 16, 32, 64 bits. This variety of sizes will provide with more insight about the performance of each adder in terms of area and delay as a function of size.
KeywordsDigital signal processing Carry ripple adder Carry Look-ahead adder FPGA VLSI logic optimization
Unable to display preview. Download preview PDF.
- 1.Chang, S.-C., van Ginneken, L.P.P.P.: Circuit Optimization by Rewiring. IEEE Transaction on Computers 48(9) (September 1999)Google Scholar
- 2.Kwon, O.-H.: A Boolean Extraction Technique For Multiple-Level Logic Optimization. IEEE (2003)Google Scholar
- 3.Uma, R.: 4-Bit Fast Adder Design: Topology and Layout with Self-Resetting Logic for Low Power VLSI Circuits. International Journal of Advanced Engineering Sciences and Technology 7(2), 197–205 (2011)Google Scholar
- 5.Karandikar, S.K., Sapatnekar, S.S.: Fast Comparisons of Circuit Implementations. IEEE Transaction on Very Large Scale Integration (VLSI) Systems 13(12) (December 2005)Google Scholar
- 6.Sutherland, I., Sproull, B., Harris, D.: Logical Effort: Designing Fast CMOS Circuits. Morgan Kaufmann Publisher (1999)Google Scholar
- 7.Uma, R., Vijayan, V., Mohanapriya, M., Paul, S.: Area, Delay and Power Comparison of Adder Topologies. International Journal of VLSI and Communication Systems (2012)Google Scholar
- 8.Victer Paul, P., Vengattaraman, T., Dhavachelvan, P.: Improving efficiency of Peer Network Applications by formulating Distributed Spanning Tree. In: Proceedings 3rd International Conference on Emerging Trends in Engineering and Technology, ICETET 2010, Art. no. 5698439, pp. 813–818 (2010)Google Scholar
- 9.Aguirre-Hernandez, M., Linares-Aranda, M.: CMOS Full-Adders for Energy-Efficient Arithmetic Applications. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 19(4) (April 2011)Google Scholar
- 11.Shubin, V.V.: Analysis and Comparison of Ripple Carry Full Adders by Speed. In: International Conference and Seminar on Micro/Nano Technologies and Electron Devices, EDM 2010, pp. 132–135 (2010)Google Scholar
- 12.Veeramachaneni, S., Srinivas, M.B.: New Improved 1-Bit Full Adder Cells. IEEE (2008)Google Scholar