Optimal performance of 16-bit acyclic adders of binary codes

Abstract

<p>The conducted studies established the prospect for enhancing the performance of computing components, specifically, combinational 16-bit adders, based on the use of the principles of computation of digital signals of an acyclic model.</p><p>The application of an acyclic model for the synthesis of 16-bit parallel adders is designed for:</p><p>– the process of sequential (for lower bits) and parallel (for all other bits) computation of the sum and carry signals. Thanks to this approach, it becomes possible to reduce eventually the complexity of the hardware part without increasing the circuit depth;</p><p>– fixation (planning) of the adder circuit depth before its synthesis. This makes it possible to use the logical structure of transitive carry, which ensures the optimal adder circuit depth and does not increase its complexity.</p><p>Utilizing an acyclic model for the construction of 16-bit parallel adders is more beneficial in comparison with the analogs by the following factors:</p><p>– the lower cost development, since an acyclic model determines a simpler</p><p>structure of a 16-bit adder;</p><p>– application of the latest developed logical structures of transitive carry,</p><p>which makes it possible to decrease the delay of sum and carry signals, area, power consumption and to increase overall efficiency of 16-bit adders of binary codes.</p><p>Due to this, the possibility of obtaining optimal values of structure complexity and the depth of the adder circuit is ensured. In comparison with the analogs, it provides an increase in quality of indicator of 16-bit acyclic adders, such as power consumption, chip area by 15–27 %, depending on the chosen structure, and performance by 10–60 %.</p>There are some grounds to argue about the possibility of enhancing the performance of computing components, specifically, 16-bit adders of binary codes by using the principles of computation of digital signals of an acyclic model.

Authors and Affiliations

Mykhailo Solomko, Petro Tadeyev, Vitalii Nazaruk, Nataliia Khariv

Keywords

Related Articles

Robust identification of non-stationary objects with nongaussian interference

<p>The problem of identification of non-stationary parameters of a linear object, which can be described by the first-order Markov model, with non-Gaussian interference is considered. The identification algorithm is a gr...

Using Markov chains for predicting collective motivation of students.

Predicting students' motivation hot topic for research in higher education. In previous work had created a comprehensive model for evaluating students' motivation. As part of the floor is the algorithm of the forecast av...

Development of the simulation model of the interaction of automatic controllers in the control system of the energy complex

<p>The developed simulation model of the control system of the power plant operating in different modes is presented. Work on the development of the control system of the power plant, the physical control of which will b...

The effect of using an energy accumulator on the level of emissions of pollutant substances by a shunting locomotive

Shunting locomotives at railroad stations account for most emissions of pollutants into the atmosphere. A significant share of these emissions depends on the position of the driver's controller that is used to operate a...

Development of a formal algorithm for the formulation of a dual linear optimization problem

<p>The rigorous formal algorithm for formulating a dual problem for different forms (general, basic, standard, and canonical) of a primal linear programming problem is proposed. First, definitions of a pair of dual probl...

Download PDF file
  • EP ID EP666401
  • DOI 10.15587/1729-4061.2019.168485
  • Views 77
  • Downloads 0

How To Cite

Mykhailo Solomko, Petro Tadeyev, Vitalii Nazaruk, Nataliia Khariv (2019). Optimal performance of 16-bit acyclic adders of binary codes. Восточно-Европейский журнал передовых технологий, 3(4), 21-36. https://europub.co.uk/articles/-A-666401