Karnaugh map

Part of the TechTarget Network of Enterprise IT Web Sites
Home Look It Up ITKnowledge Exchange Fast References Products White Papers Blogs

Search our IT-specific encyclopedia for:
 
OR Jump to a topic:
 
Advanced Search
Browse alphabetically:
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z #
All Categories Programming

Karnaugh map

A Karnaugh map (K-map) is a pictorial method used to minimize Boolean expressions without having to use Boolean algebra theorems and equation manipulations. A K-map can be thought of as a special version of a truth table .

Using a K-map, expressions with two to four variables are easily minimized. Expressions with five to six variables are more difficult but achievable, and expressions with seven or more variables are extremely difficult (if not impossible) to minimize using a K-map.



Read more about it at:
> David Belton explains Karnaugh maps.
Last updated on: Sep 21, 2005

Are you a Know-IT-All?
Is a charge-coupled device another name for a fax machine -- or is it a light-sensitive microchip?
Answer


WORD OF THE DAY...
array-based memory
LEARN MORE ABOUT...
Viruses, Worms and Other Malware
Most popular and handy
  StumbleUpon Toolbar StumbleUpon WhatIs.com  
WhatIs.com RSS Feeds
Home Look It Up ITKnowledge Exchange Fast References Products White Papers Blogs
About Us   |   Contact Us   |   For Advertisers   |   For Business Partners   |   Reprints   |   RSS   |   Awards
TechTarget provides enterprise IT professionals with the information they need to perform their jobs - from developing strategy, to making cost-effective IT purchase decisions and managing their organizations' IT projects - with its network of technology-specific Web sites, events and magazines.

TechTarget Corporate Web Site  |  Media Kits  |  Reprints  |  Site Map




All Rights Reserved, Copyright 2008, TechTarget | Read our Privacy Policy
  TechTarget - The IT Media ROI Experts