Logic Optimization Using Technology Independent MUX Based Adders in FPGA
R Uma
- 31 Aug 2012
Vol. 3, Iss: 4, pp 135-149
TL;DR: This work presents 20 different logical construction of 1-bit adder cell in CMOS logic and its performance is analyzed in terms of transistor count, delay and power dissipation, and the optimized equation is chosen to construct a full adder circuit in Terms of multiplexer.
read more
Abstract: Adders form an almost obligatory component of every contemporary integrated circuit. The prerequisite of the adder is that it is primarily fast and secondarily efficient in terms of power consumption and chip area. 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. This paper focuses the optimization of adder through technology independent mapping. The work presents 20 different logical construction of 1-bit adder cell in CMOS logic and its performance is analyzed in terms of transistor count, delay and power dissipation. These performance issues are analyzed through Tanner EDA with TSMC MOSIS 250nm technology. From this 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Design of high speed Vedic multiplier using multiplexer based adder
Saji. M. Antony,S. Sri Ranjani Prasanthi,S. Indu,Rajeshwari Pandey +3 more
- 01 Nov 2015
TL;DR: A high speed Vedic multiplier using multiplexer based adder is proposed in this paper, which shows a significant improvement in speed.
11
Design of Area optimized High Speed Adder Circuits in Self Resetting Logic Style
TL;DR: A new family of self-resetting logic (SRL) adder cells is presented in this paper which can eliminate the above sited issues.
1
Hardware Implementation of a High Efficiency and High-Speed Squaring Architecture
TL;DR: The proposed architecture consists of simplification of the squaring structure, calculation and transferring of the carry bit to the next part, and finally, applying the modified Wallace Tree Adder to calculate the summation of the products.
A high-speed and area-efficiency DSP Block Embedded in FPGAs
Bang Zhang,Peng Lu,Jian Wang,Jinmei Lai +3 more
- 01 Oct 2016
TL;DR: A new DSP block which can improve the speed and area-efficiency by reducing the delay of cascade path and supporting multi-input addition is proposed.
GFCG: Glitch free combinational clock gating approach in nanometer VLSI circuits
J. Sudhakar,A. Mallikarjuna Prasad,Ajit Kumar Panda +2 more
- 01 Feb 2015
TL;DR: The way of Glitch reduction for ISCAS 85 bench mark circuits using combinational clock gating principle is explained and the functionality ofbench mark circuits are verified using Cadence physical flow with RTL compiler.
References
•Book
Logical Effort: Designing Fast CMOS Circuits
Ivan E. Sutherland,Bob Sproull,David Harris +2 more
- 01 Jan 1999
TL;DR: In this article, the authors derived the method of logical effort from design examples and calculated the logical effort of gates, and then calibrated the model to achieve equal rising and falling delays.
777
CMOS Full-Adders for Energy-Efficient Arithmetic Applications
TL;DR: Two high-speed and low-power full-adder cells designed with an alternative internal logic structure and pass-transistor logic styles that lead to have a reduced power-delay product (PDP) outperform its counterparts exhibiting an average PDP advantage.
356
Low Complexity Design of Ripple Carry and Brent–Kung Adders in QCA
Vikramkumar Pudi,K. Sridharan +1 more
TL;DR: This paper derives bounds on the number of majority gates for -bit RCA and -bit Brent-Kung, Kogge-Stone, Ladner-Fischer, and Han-Carlson adders and uses these results to present efficient QCA designs for the ripple carry adder (RCA) and various prefix adders.
234
•Proceedings Article
Logical effort: designing for speed on the back of an envelope
Ivan E. Sutherland,Robert F. Sproull +1 more
- 01 Apr 1991
TL;DR: In this paper, a delay in a logic gate is considered in a multi-stage logic gate, and the best number of stages is chosen for each gate in a multistage logic gate.
167
Area, Delay And Power Comparison Of Adder Topologies
R. Uma,Vidya Vijayan,M. Mohanapriya,Sharon Paul +3 more
- 29 Feb 2012
TL;DR: The pertinent choice for selecting the adder topology with the tradeoff between delay, power consumption and area is presented and ripple carry adder is presented.
Related Papers (5)
R. Uma,P. Dhavachelvan +1 more
- 01 Jan 2012
R. Uma,Vidya Vijayan,M. Mohanapriya,Sharon Paul +3 more
- 29 Feb 2012
M. O. V. Pavan Kumar,Kiran M +1 more
- 01 Dec 2013
Chun-Hsiang Lai,Yu-Cheng Cheng,Tung-Chi Wu,Yen-Jen Chang +3 more
- 01 Aug 2017