Lecture

Boolean Optimization: MIGs and Majority Gates

Description

This lecture covers the optimization of Boolean functions using Majority-Inverter Graphs (MIGs) and Majority Gates. It explains the technology-independent logic representation in MIGs, the properties of MIGs, MIG Boolean Algebra, algebraic optimization, and exact synthesis of MIGs. The lecture also delves into Boolean rewriting, Majority-n functions, and the transformation of n-argument majority functions into 3-input majorities. It concludes with references on MIGs and their applications in logic optimization.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.