Javascript must be enabled to continue!
Research and Design of Multibit Binary Adders on Fpga
View through CrossRef
This paper provides an analysis of the system characteristics and functional capabilities of various types of adders for the high-speed component construction of arithmetic and logical devices in modern superscalar processors. The main features of parallel prefix adders (Sklansky, Brent Kung, Kogge Stone, Ladner Fisher, Han Carlson) and tree-like structures based on incomplete binary adders have been determined in this study. The structures of typical and improved incomplete binary adders have been shown and their complexity characteristics have been calculated as well. Various architectures (structures) of multi-bit adders have been built on the basis of well-known and improved binary half-adders. Analytical expressions for calculating the hardware and time complexity of the presented multi-bit adder structures have been obtained as a result. Schematic topological modeling of the improved half-adder based on CMOS-structure has been carried out and its topology has been produced in a specialized environment. Models of multibit adders using hardware description language VHDL have been developed. Modeling and synthesis of the developed multi-bit adders on the Xilinx FPGA has been carried out. It has been established that when using the proposed improved structures of binary half-adders as part of a multi-bit adder, the hardware complexity has been reduced by 1.7 times and the computational performance was increased by 3 times.
Lviv Polytechnic National University
Title: Research and Design of Multibit Binary Adders on Fpga
Description:
This paper provides an analysis of the system characteristics and functional capabilities of various types of adders for the high-speed component construction of arithmetic and logical devices in modern superscalar processors.
The main features of parallel prefix adders (Sklansky, Brent Kung, Kogge Stone, Ladner Fisher, Han Carlson) and tree-like structures based on incomplete binary adders have been determined in this study.
The structures of typical and improved incomplete binary adders have been shown and their complexity characteristics have been calculated as well.
Various architectures (structures) of multi-bit adders have been built on the basis of well-known and improved binary half-adders.
Analytical expressions for calculating the hardware and time complexity of the presented multi-bit adder structures have been obtained as a result.
Schematic topological modeling of the improved half-adder based on CMOS-structure has been carried out and its topology has been produced in a specialized environment.
Models of multibit adders using hardware description language VHDL have been developed.
Modeling and synthesis of the developed multi-bit adders on the Xilinx FPGA has been carried out.
It has been established that when using the proposed improved structures of binary half-adders as part of a multi-bit adder, the hardware complexity has been reduced by 1.
7 times and the computational performance was increased by 3 times.
Related Results
Method of QoS evaluation of FPGA as a service
Method of QoS evaluation of FPGA as a service
The subject of study in this article is the evaluation of the performance issues of cloud services implemented using FPGA technology. The goal is to improve the performance of clou...
Improving 256x256 Vedic Multiplier Design Using Optimized Adder Architectures
Improving 256x256 Vedic Multiplier Design Using Optimized Adder Architectures
Abstract: This report presents an in-depth study focused on improving the computational efficiency of a 256×256 Vedic multiplier design, leveraging advanced adder architectures to ...
Аналіз застосування технологій ПЛІС в складі IoT
Аналіз застосування технологій ПЛІС в складі IoT
The subject of study in this article and work is the modern technologies of programmable logic devices (PLD) classified as FPGA, and the peculiarities of its application in Interne...
Fixed point multi-bit approximate adder based convolutional neural network accelerator for digit classification inference
Fixed point multi-bit approximate adder based convolutional neural network accelerator for digit classification inference
Approximate computing is a rapidly growing technique to speed up applications with less computational effort while maintaining the accuracy of error-resilient applications such as ...
Design and Implementation of 32-Bit High Valency Jackson Adders
Design and Implementation of 32-Bit High Valency Jackson Adders
Parallel prefix addition offers a highly efficient solution to most of the applications which requires fast addition of two binary numbers. An efficient adder design demands proper...
Methods of Deployment and Evaluation of FPGA as a Service Under Conditions of Changing Requirements and Environments
Methods of Deployment and Evaluation of FPGA as a Service Under Conditions of Changing Requirements and Environments
Applying Field Programmable Gate Array (FPGA) technology in cloud infrastructure and heterogeneous computations is of great interest today. FPGA as a Service assumes that the progr...
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
<p>Approximate cells can be used to design Ripple Carry Adders (RCAs) for realizing approximate addition in energy-efficient CMOS digital circuits. As inputs of approximate c...
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
Approximate cells can be used to design Ripple Carry Adders (RCAs) for
realizing approximate addition in energy-efficient CMOS digital
circuits. As inputs of approximate cells coul...

