BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Boolean function decomposition and optimization
DTSTART:20090630T111500
DTSTAMP:20260411T182819Z
UID:e2ec8f8694efd704204e6aef91520365339f9d9f87b1ea992c47305a
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Kartik Mohanram\, Rice University\, Texas\, USA\nThis ta
 lk introduces two new approaches for the decomposition and optimization of
  arbitrary multi-level logic circuits. The first approach\, based upon a g
 eneralization of the parallel prefix problem\, is used for the synthesis o
 f logic circuits with "lookahead" properties due to the inherent paralleli
 sm among sub-circuits. The second approach is based upon the use of OR-XOR
  primitives for Boolean function representation. We present several exampl
 es and preliminary work that addresses the decomposition and optimization 
 of logic circuits using OR-XOR expressions. \nProf. Mohanram's homepage
LOCATION:BC 01 https://plan.epfl.ch/?room==BC%2001
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR