(18.208.202.194)
Users online: 1314    [ij] [ij] [ij] 
Email id
 

Research Journal of Science and Technology
Year : 2018, Volume : 10, Issue : 2
First page : ( 105) Last page : ( 114)
Print ISSN : 0975-4393. Online ISSN : 2349-2988.
Article DOI : 10.5958/2349-2988.2018.00015.3

An Efficient Design of 8-bit High Speed Parallel Prefix Adder

Thakur Garima**, Sohal Harsh***, Jain Shruti*

Department of Electronics and Communication Engineering, Jaypee University of Information Technology, Solan

*Corresponding Author E-mail: jain.shruti15@gmail.com

**garimathakur1994@gmail.com,

***harsh.sohal@juit.ac.in

Online published on 7 July, 2018.

Abstract

This paper discusses the comparison of various addition algorithms for different performance parameters like speed, area and power. We have studied and implemented different adders like ripple carry adder, carry skip adder, carry select adder, carry look ahead adder, Kogge stone adder and carry increment adder. To get great performance in processing system or in other multi-core devices, adders are always termed to be the most basic requirements. If the speed of adder improves or fastens, then there will be an automatic improvement in the speed of the system. Verilog coding is used for comparative analysis of various adders. Using Xilinx ISE 14.1 Design Suite various adders are simulated and synthesized for Spartan 3E FPGA. 4-bit Kogge stone adder was found to have less delay (8.608ns) and low power (0.042 W) than other 4-bit adders. The proposed 8-bit Carry increment adder using Kogge stone adder was implemented which has basic significant reduction in delay with 12.345ns and power with 0.054 W.

Top

Keywords

Ripple Carry adder, Carry Skip adder, Carry Select adder, Carry look ahead adder, Kogge Stone adder, Carry Increment adder, Xilinx ISE 14.1.

Top

  
║ Site map ║ Privacy Policy ║ Copyright ║ Terms & Conditions ║ Page Rank Tool
445,448,161 visitor(s) since 30th May, 2005.
All rights reserved. Site designed and maintained by DIVA ENTERPRISES PVT. LTD..
Note: Please use Internet Explorer (6.0 or above). Some functionalities may not work in other browsers.