Fast Minimization of Fixed Polarity Reed-Muller Expressions

Fast Minimization of Fixed Polarity Reed-Muller Expressions

Logic minimization has recently attracted significant attention because in many applications it is important to have a compact representation as possible. In this paper, we propose a fast minimization algorithm (FMA) of fixed polarity Reed-Muller expressions (FPRMs). The main idea behind the FMA is...

Full description

Bibliographic Details
Main Authors: Zhenxue He, Limin Xiao, Zhisheng Huo, Tao Wang, Xiang Wang
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Logic minimization
fixed polarity Reed-Muller expressions
differential evolution algorithm
mutation operator
selection operator
Online Access:https://ieeexplore.ieee.org/document/8639919/

Internet

https://ieeexplore.ieee.org/document/8639919/

Similar Items