<p>In this episode, we take a break from proving identities of Boolean algebra and start applying them. Why? Well, so we can build our Boolean logic circuits with fewer gates. That means they'll be cheaper, smaller, and faster. That's why.</p>

In this episode, we take a break from proving identities of Boolean algebra and start applying them. Why? Well, so we can build our Boolean logic circuits with fewer gates. That means they'll be cheaper, smaller, and faster. That's why.

Episode 4.09 - Simplification of Boolean Expressions

Geek Author presents educational series covering computer organization, computer architecture, and embedded system design.  Each episode is a concise step taking the listener on a journey from the foundations of digital logic up to computer architecture and finally to system level input and output. The series is presented by engineer, author, and educator David Tarnoff. After a career in industry designing motherboards and BIOSes, David began teaching hardware concepts to students of computer science. Twenty-five years later, he's taking that content and providing it to anyone with an interest in what makes a computer tick.

Technology

Education

Geek Author presents educational series covering computer organization, computer architecture, and embedded system design. Each episode is a concise step taking the listener on a journey from the foundations of digital logic up to computer architecture and finally to system level input and output. The series is presented by engineer, author, and educator David Tarnoff. After a career in industry designing motherboards and BIOSes, David began teaching hardware concepts to students of computer science. Twenty-five years later, he's taking that content and providing it to anyone with an interest in what makes a computer tick.

Share Episode 4.09 - Simplification of Boolean Expressions

Sign up to save your podcasts

Episode 4.09 - Simplification of Boolean Expressions

Episode 4.09 - Simplification of Boolean Expressions