首页    期刊浏览 2024年09月20日 星期五
登录注册

文章基本信息

  • 标题:Reduction and optimal performance of acyclic adders of binary codes
  • 本地全文:下载
  • 作者:Mykhailo Solomko ; Petro Tadeyev ; Yaroslav Zubyk
  • 期刊名称:Eastern-European Journal of Enterprise Technologies
  • 印刷版ISSN:1729-3774
  • 电子版ISSN:1729-4061
  • 出版年度:2019
  • 卷号:1
  • 期号:4
  • 页码:40-53
  • DOI:10.15587/1729-4061.2019.157150
  • 语种:English
  • 出版社:PC Technology Center
  • 摘要:The conducted studies have established the prospect of increasing productivity of computing components, in particular, combinational adders, based on applying principles of computation of digital signals of the acyclic model.Application of the acyclic model is designed for:‒ the process of series (for low-order digits of the adder circuit) and parallel (for the rest of the digits) computation of sum and carry signals. Due to this approach, it is possible, in the end, to reduce complexity of the hardware part of the device and not increase the circuit depth;‒ setting the optimal number of computational steps.The assumption that the number of computational steps of the directed acyclic graph with two logical operations (AND and XOR) determines optimal number of carry operations in the circuit of the n-bit parallel adder of binary codes was experimentally proved. In particular, this is confirmed by presence of the 8-bit parallel acyclic adder with the circuit depth of 8 standard 2-input logic elements. Connection between the number of computational steps of the acyclic graph and the number of operations of a unit carry to the high-order digit causes the process of comparison of the adder structure with the corresponding acyclic graph. The purpose of this comparison is to set the minimum sufficient number of carry operations for adding binary codes in the circuit of a parallel adder using the parallel carry method.Use of the acyclic model is more advantageous in comparison with counterparts due to the following factors:‒ less development costs since the acyclic model requires a simpler adder structure;‒ presence of an optimization criterion, i.e. the number of computational steps of the acyclic graph indicates the minimum sufficient number of operations of a unit carry to the high-order digit.This provides the possibility of obtaining optimum indicators of the adder structure complexity and circuit depth. Compared to counterparts of known 8-bit prefix adder structures, this provides a 14–31% increase in the 8-bit acyclic adder operation quality, e.g. power consumption or chip area depending on the chosen structure,There are grounds to assert possibility of increasing productivity of computing components, in particular, binary code adders applying the principles of computation of digital signals of the acyclic model.
  • 关键词:acyclic model of addition of binary codes;prefix model;Ling Adder;Kogge-Stone Adder;Han-Carlson Adder
国家哲学社会科学文献中心版权所有