Skip to content
/ mMIG Public

This repository contains several optimization class for Minority Majority logic(mMIG).

Notifications You must be signed in to change notification settings

UmarAalam/mMIG

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

44 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Sample Analysis of mMIG Optimization

Optimization rules in mMIG

In graph-based logic networks, the transformation rules are decisive in determining the extent of achieved optimization. The rules can take multiple forms for the same graph topology. Selection of desirable transformation is done on the basis of which transformation leads to lesser resource count.

There are four permutable pairs for Majority and Minority logic possible shown in the figure below,

Permutable Pairs of mMIG1

Upon considering the reconvergent and nonreconvergent boolean variable, there are 12 basic topologies shown in the figure below,

Permutable pairs of mMIG2

About

This repository contains several optimization class for Minority Majority logic(mMIG).

Topics

Resources

Stars

Watchers

Forks