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

文章基本信息

  • 标题:Summation of binary codes without carry
  • 本地全文:下载
  • 作者:Mykhailo Solomko ; Liudmyla Zubyk ; Peter Olshansky
  • 期刊名称:Eastern-European Journal of Enterprise Technologies
  • 印刷版ISSN:1729-3774
  • 电子版ISSN:1729-4061
  • 出版年度:2016
  • 卷号:4
  • 期号:4
  • 页码:28-41
  • DOI:10.15587/1729-4061.2016.75595
  • 语种:English
  • 出版社:PC Technology Center
  • 摘要:The paper considers the operation of summation of binary codes in the scheme of a multi digit parallel adder without carry. The process of the operation of summation uses a pairing algorithm that provides for a logarithmic complexity to the algorithm of the calculation in the adder’s scheme. Since the codes for the operation of summation, known in the literature, such as Galois field codes, the XAND codes, are defined by the systems of recurrent codes that contain one of the initial codes of complete combinatorial system with repetition, then the given codes are a particular case of the class of combinatorial systems of binary codes with a ring structure and initial code of complete combinatorial system with repetition. Therefore, the only basis of the mentioned systems of binary codes indicates the usefulness of their classification generalization, within the framework of the operation of summation, on the basis of a single criterion – an object of binary codes. Thus, the generalization of the classification of binary codes simplifies the structure of the subject area, increases the variety of systems of binary codes, in particular, for their application in arithmetic operations with binary numbers. It was established that the properties of the recurrent method of the synthesis of binary codes allow focusing the principle of building codes in the range of complete combinatorial system with repetition, which ensures reduction of the thesaurus of the parallel adder of binary codes without carry.The results of this study may be a component of the technology of designing electronic computing systems because:– they expand the apparatus of obtaining recurrent binary codes for their application in the information technology;– they provide a possibility to control the selection of the code at the stage of designing a computing device;– they help predict the impact of the implementation of the selected code for the solution of problems of the information systems..– they minimize hardware costs associated with the selection of the system of binary code for the calculation.
  • 关键词:adder;combinatorial system with repetition;binary codes;summation of binary codes;cascade scheme;class of combinatorial systems;instance of the class;thesaurus;logarithmic complexity
国家哲学社会科学文献中心版权所有