TEKNIK MINIMASI FUNGSI BOOLEAN DENGAN MENGGUNAKAN PETA KARNAUGH

Boolean algebra is the branch of mathematics that is more to learn about logic. In Boolean algebra is Boolean functions. Some functions of Boolean algebra may have different expressions but actually has the same function value. This simplification affects the depiction of Boolean functions of logic gates. There are several ways to simplify Boolean functions. One of them by using Karnaugh maps. Karnaugh maps not only help simplify Boolean functions but also help solve problems and maxterm the minterm Boolean functions. The difference is what causes Karnaugh map has more advantages compared with the algebraic method. Based on this background the goal of writing this final task is to determine the form of Karnaugh maps and to provide a technical solution minimize Boolean functions using Karnaugh map which is the basic for the design of the switching network, cirkuit electrical, or digital circuits Integrated circuit computers. In writing this final task, the authors studied the material or material that has accumulated on Boolean algebra, theorem - Fundamental Theorem of Boolean algebra, Boolean expression, the principle of duality, Boolean function, Boolean function complement, canonical forms of Boolean functions, logic circuits, Karnaugh maps and techniques of minimize Boolean functions using Karnaugh map. Then put it back in paper form. Thus, an understanding of the study material is the basic of this paper entitled minimize techniques Boolean functions using Karnaugh map.