METHOD AND ALGORITHM FOR FORMATION AND FILLING OF THE FUNCTIONING TABLE OF A MULTY-BIT MULTY-OPERAND ADDER
DOI:
https://doi.org/10.30890/2567-5273.2023-25-02-080Keywords:
method, algorithm, function table, multi-bit multi-operand adder, convolution operation, bit field, bit slice, symmetric function, index, invariant, variable value set, bit counter, schematic implementationAbstract
The article proposes a method and algorithm for formation and filling the functioning table (FT) of a multi-bit multi-operand adder (MMA). The MMA is a tool for processing large data streams based on the convolution operation of multi-bit binary arithmetiMetrics
References
Паулин О.Н. Основы теории симметрических булевых функций. Саарбрюкен/Германия: Lambert Academic Publishing, 2013. 66 c.
Паулин О.Н. О параллельной обработке потока данных, адаптированной к области бит произвольной конфигурации / О.Н. Паулин // Искусственный интеллект. № 3. 2010. Донецьк: ІПШІ, "Наука і освіта", 2010. C. 127-133.
References
Paulin O.N. Osnovy teoriyi simmetricheskih bulevyh funkciy. – Saarbryuken/ Germany: Lambert Academic Publishing, 2013. 66 s.
Paulin O.N. O parallelnoy obrabotke potoka dannyh, adaptirovannoy k oblasti bit proizvolnoy konfiguraciyi/ O.N. Paulin//Iskusstvennyy intellect. № 3. 2010. Donetsk: IPII, “Nauka i osvita”, 2010. – S. 127-133.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Authors
This work is licensed under a Creative Commons Attribution 4.0 International License.