Podcasts about karnaugh

Digital logic circuit simplification using Karnaugh Maps. How to use a visual method to solve boolean algebraic equations and truth tables. Part 5 of the digital logic design tutorial series. Playlist: https://www.youtube.com/playlist?list=PLvOlSehNtuHs2LwEdDwTp3n7mxb-MyBbo Forum: https://www.eevblog.com/forum/blog/eevacademy-digital-design-series-part-5-karnaugh-maps/ 00:00 – Part 5 of the digital logic design tutorial series 02:15 – Solving a logic truth table algebraically 04:17 – ...

In memory of Maurice Karnaugh, we discuss the "K-Map", a nice shortcut for desinging electronic circuits. (Send feeback to erik@mathmutation.com)

Sometimes, it's nice to take a look at old tech to learn a new tool. The 7-segment display has been in our lives for years - mostly in alarm clocks. Join us as we use a Karnaugh map to design a driver for one.

Like a wild card in a game of poker, an unspecified truth table entry called a "don't care" can make our sum-of-products expressions so much nicer.

Many digital designs begin with a truth table. In this episode, we do just that, and then create the simplified sum-of-products expression by way of the Karnaugh map.

Let’s expand the capabilities of Karnaugh maps to combine more than just two rows of the truth table into a single product.

To make the move to a four-variable Karnaugh map, we are going to double the number of columns found in the three-variable map. And what happens when we halve the three-variable map? We get a two-variable Karnaugh map!

Here we introduce a graphical tool that when used correctly will produce a most simplified sum-of-products expression, all without meddling in any simplification of Boolean expressions.

Neste episódio, com uma introdução especial ambientada no universo de Game of Thrones, fizemos uma introdução à eletrônica digital, explicando como ela se diferencia da eletrônica analógica, e os principais conceitos do mundo ditial: portas lógicas, bases numéricas, álgebra booleana, teorema de De Morgan, os famigerados Mapas de Karnaugh e ...Leia o restante do show notes no site.

Clase "Adyacencias y Mapas de Karnaugh" de la asignatura Electrónica Digital del Grado de Ingeniería Tecnologías de Telecomunicación. Impartida por Antonio García Ríos, profesor del Departamento de Electrónica y Tecnología de Computadores. Fue grabada en la Escuela Técnica Superior de Ingenieras Informática y de Telecomunicación de Granada (ETSIIT) el día 6 de Marzo de 2013. Forma parte de la colección "Experiencia Piloto de Grabación en Aula de la ETSIIT". Contenidos: Síntesis de funciones de conmutación mediante búsquedade adyacencias y mediante mapas de Karnaugh.

Clase "AAdyacencias y Mapas de Karnaugh" de la asignatura Electrónica Digital del Grado de Ingeniería Tecnologías de Telecomunicación. Impartida por Antonio García Ríos, profesor del Departamento de Electrónica y Tecnología de Computadores. Fue grabada en la Escuela Técnica Superior de Ingenieras Informática y de Telecomunicación de Granada (ETSIIT) el día 6 de Marzo de 2013. Forma parte de la colección "Experiencia Piloto de Grabación en Aula de la ETSIIT". Contenidos: Síntesis de funciones de conmutación mediante búsquedade adyacencias y mediante mapas de Karnaugh.

In this screencast we look at how to set up a 2-variable Karnaugh map, followed by an example of simplifying a particular Boolean expression and simplifying its negation, using a 2-variable Karnaugh map

Given a diagram of a particular switching circuit, we start by identifying a Boolean function to represent it. We then find the negation of the switching circuit and finally, the simplest possible expression for it using Boolean algebra and a Karnaugh map

With reference to a specific example, this screencast demonstrates how to use a 4-variable Karnaugh map and De Morgan's laws to simplify a Boolean expression of 4 variables both into a 'sum of products' and a 'product of sums'

In this recording, we look at how to identify '8-squares', '4-squares', '2-squares' and '1-squares' in a 4-variable Karnaugh map, with reference to the different ways each of these type of groupings can appear and how to write the corresponding Boolean ex

Example of simplifying a Boolean expression by using a 3-variable Karnaugh map.

Example of simplifying a Boolean expression by using a 4-variable Karnaugh map.

Breve Presentazione del Testo