Підхід до позиційної алгебри логіки

• Дата: 2023
• Автор: Kovalov, Mykola
• Формат: Стаття
• Мова: English
• Опубліковано: The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" 2023
• Теми: булеві функції; позиційна алгебра логіки; позиційні оператори; еквівалентні перетворення; комбінаційні схеми; FPGA; boolean functions; positional logic algebra; positional operators; equivalent transformations; logic circuits
• Онлайн доступ: http://journal.iasa.kpi.ua/article/view/273578
• Назва журналу: System research and information technologies

The method of Boolean function representation in terms of positional logic algebra in compact operator form is offered. Compared with the known method, it uses position operators with a complexity of no more than two and only one type of equivalent transformations. The method is less labor intensive. It allows parallelizing logic calculations. The corresponding way of Boolean function implementation is developed. It competes with some known ways in terms of hardware complexity, resource intensity, and speed when implemented on an FPGA basis. Possibilities open up for creating effective automating means of representing Boolean functions from a large number of variables, synthesizing the corresponding LCs, and improving modern element bases.