首页    期刊浏览 2024年11月10日 星期日
登录注册

文章基本信息

  • 标题:Optimization of the acyclic adders of binary codes
  • 本地全文:下载
  • 作者:Mykhailo Solomko
  • 期刊名称:Technology Audit and Production Reserves
  • 电子版ISSN:2706-5448
  • 出版年度:2018
  • 卷号:3
  • 期号:2
  • 页码:55-65
  • DOI:10.15587/2312-8372.2018.133694
  • 语种:English
  • 出版社:PC Technology Center
  • 摘要:The object of research is a prefix model for calculating adding and transport signals in a parallel adder circuit with a parallel transfer method. One of the most problematic places in the prefix model is the process of generating adding and carry signals, in which the beginning of the prefix calculation is provided from the first bit of the circuit. This leads, in the end, to excessive accumulation and complications of the hardware part of the device.In the course of the research, a mathematical model is used to calculate the adding and carry signals in a parallel adder circuit based on the properties of a directed acyclic graph with two typical operations.The complexity of the logical structure of the adder of binary codes is reduced, the depth of the circuit is reduced and the total length of the connecting wires is reduced. This is due to the fact that the proposed method for calculating adding and transport signals has a number of features of the device circuit synthesis, in particular, the application of a mathematical model based on the properties of an acyclic graph is calculated for:process of sequential (for lower order devices) and parallel calculation of adding and carry signals, which, in the end, reduces the complexity of the hardware of the device and does not increase the depth of the circuit;comparison of the number of computational steps of an oriented acyclic graph with the number of transfers of one to the high-order bit in the adder circuit, which allows to determine the optimal number of computational steps for the structure of the device.Due to this, it is possible to obtain optimal values for the complexity of the structure and the depth of the adder circuit. The connection between the number of computational steps of an oriented acyclic graph and the number of transfers in the parallel adder circuit with a parallel transport method indicates the expediency of comparing the structure of the adder with the corresponding oriented acyclic graph.In comparison with similar known structures of 8-bit prefix adders, this provides an increase in the quality index of 8-bit acyclic adders, for example, by power consumption, the chip area, depending on the chosen structure, by 10–40%.
  • 关键词:acyclic model;prefix model;directed acyclic graph;Ling Adder;Kogge-Stone Adder;Brent-Kung Adder
国家哲学社会科学文献中心版权所有