Summation of binary codes without carry
DOI:
https://doi.org/10.15587/1729-4061.2016.75595Keywords:
adder, combinatorial system with repetition, binary codes, summation of binary codes, cascade scheme, class of combinatorial systems, instance of the class, thesaurus, logarithmic complexityAbstract
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.
References
- Nikolaichuk, Y. M. (2010). Teorіya djerel informatsii [Theory sources]. Ternopil: TzOv Terno-Graf., 534.
- Nikolaichuk, Y. M., Zastavna, O. M., Gumen, P. V. (2012). Theoretical foundations and principles of arithmetic logic unit vertically through information technology. News of Khmelnytsky natіonal unіversity, 2, 190–196. Available at: http://www.nbuv.gov.ua/old_jrn/natural/Vchnu_tekh/2012_2/49nic.pdf
- Solomko, M., Krulikovskyi, B., Nikolaichuk, Y. M. (2015). Parallel adder carry no transfer in logic elements XAND. Proceedings of the National University "Lviv Polytechnic" Computer systems and networks, 830, 145–158. Available at: http://ena.lp.edu.ua:8080/xmlui/bitstream/handle/ntb/32480/21-145-158.pdf?sequence=4&isAllowed=y
- Gopinath, B., Sangeetha, N., Jenifer nancy, S., Umarani, T. (2015). Design and Implementation of High Speed Carry Select Adder. International Journal of Engineering Research & Technology (IJERT), 4 (02), 419–422. Available at: https://zenodo.org/record/33085/files/Design_and_Implementation_of_High_Speed_Carry_Select_Adder.pdf
- Deepthi, E., Rani, V. M., Manasa, K. (2015). Performance Analysis of a 64-bit signed Multiplier with a Carry Select Adder Using VHDL. IJCSNS International Journal of Computer Science and Network Security, 15 (11), 91–94. Available at: http://paper.ijcsns.org/07_book/201511/20151118.pdf
- Solomko, M., Krulikovskyi, B. (2016). Study of carry optimization while adding binary numbers in the rademacher number-theoretic basis. Eastern-European Journal of Enterprise Technologies, 3/4 (81), 56–63. doi: 10.15587/1729-4061.2016.70355
- Maity, S., Prasad De, B., Singh, A. Kr. (2012). Design and Implementation of Low-Power High-Performance Carry Skip Adder. International Journal of Engineering and Advanced Technology (IJEAT), 1 (4), 212–218. Availabnle at: http://202.120.43.103/Downloads4/20150616101558803.pdf
- Singh, R. P. P., Kumar, P., Singh, B. (2009). Performance Analysis of 32-Bit Array Multiplier with a Carry Save Adder and with a Carry-Look-Ahead Adder. International Journal of Recent Trends in Engineering, 2 (6), 83–86. Available at: http://searchdl.org/public/journals/2009/IJRTET/2/6/307.pdf
- Sajid, A., Nafees, A., Rahman, S. (2013). Design and Implementation of Low Power 8-bit Carry-look Ahead Adder Using Static CMOS Logic and Adiabatic Logic. International Journal of Information Technology and Computer Science, 5 (11), 78–92. doi: 10.5815/ijitcs.2013.11.09
- Srinivasa Rao, N., Satyanarayana, P. (2015). Serial Adder using Reversible Gates. International Journal of Advanced Research in Computer and Communication Engineering, 4 (5), 498–501. Available at: http://www.ijarcce.com/upload/2015/may-15/IJARCCE%20105.pdf
- Joshi, D. D., Singh, J. K. (2014). Design and Implementation of 16-bit Ripple Carry Adder for Low Power in 45nm CMOS Technology. International Journal of Emerging Technology and Advanced Engineering, 4 (1), 216–220.
- Nykolajchuk, Ja. M. (2012). Kody polja Galua: teorija ta zastosuvannja. Ternopil': TzOV Terno-Graf, 576.
- Martynjuk, T. B. (2000). Rekursyvni algorytmy bagatooperandnoi' obrobky informacii'. Vinnycja: "UNIVERSUM-Vinnycja", 216.
- Martynjuk, T. B., Homjuk, V. V. (2005). Metody ta zasoby paralel'nyh peretvoren' vektornyh masyviv danyh. Vinnycja: "UNIVERSUM-Vinnycja", 202.
- Hamaiun, V. P. (1990). On the development of computational structures mnogooperandnyh. Control systems and machines, 4, 31–33.
- Hamaiun, V. P. (1999). Theoretical bases, algorithms and structures in operational processing. Кyiv, 33.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2016 Mykhailo Solomko, Liudmyla Zubyk, Peter Olshansky, Vitalii Nazaruk
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.
