Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.
This lecture covers the basic rules of logic design, emphasizing the node-value and node-conflict-free rules. It also delves into Shannon's expansion algorithm, demonstrating how a Boolean function can be decomposed with respect to its variables. Examples of complex switching functions and residues of Boolean functions are presented, showcasing the application of these concepts in logic design. The lecture further explores tree networks, including freeform and uniform-tree networks, and introduces the concept of 0/1-tree networks. The pitfalls of Shannon's expansion are discussed, highlighting the importance of proper variable selection. Additionally, the syllabus and implementation options for digital systems, such as ASICS and FPGAs, are outlined.
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