Comparative Analysis of ALU Implementation with RCA and Sklansky Adders In ASIC Design Flow
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 7
Abstract
An Arithmetic Logic Unit (ALU) is the heart of every central processing unit (CPU) which performs basic operations like addition, subtraction, multiplication, division and bitwise logic operations on binary numbers. This paper deals with implementation of a basic ALU unit using two different types of adder circuits, a ripple carry adder and a sklansky type adder. The ALU is designed using application specific integrated circuit (ASIC) platform where VHDL hardware description language and standard cells are used. The target process technology is 130nm CMOS from the foundry ST Microelectronics. The Cadence EDA tools are used for the ASIC implementation. A comparative analysis is provided for the two ALU circuits designed in terms of area, power and timing requirements.
Authors and Affiliations
Abdul Buzdar, Liguo Sun, Abdullah Buzdar
Keywords
Related Articles
- EP ID EP123299
- DOI 10.14569/IJACSA.2016.070767
- Views 117
- Downloads 0
Nearest Neighbor Value Interpolation
This paper presents the nearest neighbor value (NNV) algorithm for high resolution (H.R.) image interpolation. The difference between the proposed algorithm and conventional nearest neighbor algorithm is that the c...
Internet of Plants Application for Smart Agriculture
Nowadays, Internet of Things (IoT) is receiving a great attention due to its potential strength and ability to be integrated into any complex system. The IoT provides the acquired data from the environment to the Interne...
Key Schedule Algorithm using 3-Dimensional Hybrid Cubes for Block Cipher
A key scheduling algorithm is the mechanism that generates and schedules all session-keys for the encryption and decryption process. The key space of conventional key schedule algorithm using the 2D hybrid cubes is not e...
A Survey on Models and Query Languages for Temporally Annotated RDF
In this paper, we provide a survey on the models and query languages for temporally annotated RDF. In most of the works, a temporally annotated RDF ontology is essentially a set of RDF triples associated with temporal co...
XCS with an internal action table for non-Markov environments
To cope with sequential decision problems in non- Markov environments, learning classifier systems using the internal register have been proposed. Since, by utilizing the action part of classifiers, these systems control...