Genetic algorithm for minimization of ESOP representations for multiple-output logic functions

This article concerns ESOP representations for multiple-output logic functions. Exclusive-or sum-of-products expression (ESOP) is a formula representing a logic function as an exclusive-or sum of products of variables and their negations. EXOR-based realization leads to reduction in size of logic ci...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2021-03, Vol.1847 (1), p.12028
Main Authors: Kazimirov, A, Maleyev, V
Format: Article
Language:English
Subjects:
Genetic algorithms
Logic circuits
Mathematical analysis
Optimization
Physics
Representations
Testability
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article concerns ESOP representations for multiple-output logic functions. Exclusive-or sum-of-products expression (ESOP) is a formula representing a logic function as an exclusive-or sum of products of variables and their negations. EXOR-based realization leads to reduction in size of logic circuits for many practical logic functions and improves their testability. Minimization of a logic function is a problem of constructing ESOP representation for the given function having the minimal number of summands. We introduce a correspondence between ESOPs for multiple-output logic functions and single-output logic functions and propose genetic algorithm obtaining close to minimal ESOP representations for multiple-output logic functions.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1847/1/012028