STATIC STRUCTURE SIMPLIFICATION OF BOOLEAN FUNCTION FOR ‘N’ VARIABLES - A NOVEL APPROACH

Abstract
Digital Systems have a prominent role in everyday life that we refer to the present technological period as the digital age. Digital Systems implement digital circuits which are mostly combination of digital gates. These gates can be represented in an understandable form called Boolean expressions. These expressions formed vary for each circuit. Hence for building an efficient circuit the Boolean expression should be minimized. To achieve this, we use, Karnaugh map (K-map) and Quine-McCluskey (QM) methods which are well known methods to simplify Boolean expression. The K-map until now is introduced to solve up to 6 variable and QM which can solve ‘n’ variables, yet it involve a serious of steps and does not provide a visual way to minimising the expression. The following paper implements the idea of K-map to reduce the expression except that it could solve ‘n’ variables as QM method. The method Divide and Conquer Karnaugh map (DC-K-map) implements 4 variable K-map in a redundant way to reduce the expression for variables greater than 7.

Authors
Visvam Devadoss Ambeth Kumar, S. Gokul Amuthan
Panimalar Engineering College, India

Keywords
Pseudo Noise Sequence; Tent Map; Shift Registers; Correlation; FPGA
Published By :
ICTACT
Published In :
ICTACT Journal on Microelectronics
( Volume: 1 , Issue: 4 )
Date of Publication :
January 2016

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.