E.SURIYA

 KARNAUGH MAP A Karnaugh map (K-map for short) is a useful tool used in the simplification of combinational boolean equations and the creation of sequential logic circuits. Karnaugh maps were created by Maurice Karnaugh in 1953. The size of a Karnaugh map can be very large, however a size of four columns by four rows is easier to understand than any larger maps. The philosophy behind these drawings is that differences of only one bit for the logic of a boolean equation are adjacent to each other. This is just an organizational method for a boolean logic truth table, but it can give you the ability to help simplify logical equations. This has proven to be especially useful for digital circuit designers, as it can suggest components which can be eliminated or a way to simplify circuit designs. This reduces both the cost and complexity of these designs, and even an automated method for developing these circuits assuming that you can come up with a logical truth table in the first place. W

  COMBINATIONAL LOGIC CIRCUIT INTRODUCTION; The signals are usually represented by discrete bands of analog levels in digital electronic circuits or  digital electronics  instead of continuous ranges represented in analogue electronics. The simple electronic representations of Boolean logic functions, large assemblies of logic gates are typically used to make digital electronic circuits. In digital circuit theory, the circuits, thus formed from logic gates are used to generate outputs based on the input logic. Hence, these circuits are called as logic circuits and are classified into two types such as sequential logic and combinational logic circuits. The  logic gates  can be defined as simple physical devices used to implement the Boolean function. Logic gates are used to perform a logical operation with one or more inputs and generates a logical output. These logic circuits are formed by connecting one or more logic gates together. These logic circuits are classified into two types: