Minimization of Multiple Value function using Quine Mc-Cluskey Technique

نویسندگان

  • Prashant S. Wankhade
  • Gajanan Sarate
  • Marek Perkowski
  • Jorge Pedraza
  • Venkat Reddy
چکیده

This paper presents minimization technique for multiple value function using Quine Mc-cluskey‟s method. This paper provide steps for the minimization of multivalued function i.e. radix >2 digital system. The ternary digital system which radix=3 is considered here minimized function of MVL function implemented using decoder and multiplexer and answer is verified using ternary k-map. As the radix of system increases, the difficulties in the minimization or reduction of logic function is get increases. It becomes difficult to for higher radix to reduce the function design equation. In this paper we successfully applied Quine Mc-Cluskey‟s technique to ternary system. In this paper simplified expression designed using decoder and ternary gate. Same expression implemented using ternary multiplexer. Hardware required for both cases is evaluated. It incorporates all designed rules for ternary logic system design and gives the output in the form of Sum-of-Product (SOP) terms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cubical Representation and Minimization through Cubical Technique A Tabular Approach

Tables, Boolean Laws and different traits of Karnaugh Maps are used generally to establish a solution of Boolean equations. Cubical representation is another option to help in getting a solution of equations. Largest possible k-cubes that exist for a given function are equivalent to its prime implicants. A technique of minimization of Logic functions is tried to be achieved through cubical meth...

متن کامل

Programing implementation of the Quine-McCluskey method for minimization of Boolean expression

A Boolean function is a function that produces a Boolean value output by logical calculation of Boolean inputs. It plays key roles in programing algorithms and design of circuits. Minimization of Boolean function is able to optimize the algorithms and circuits. Quine-McCluskey (QM) method is one of the most powerful techniques to simplify Boolean expressions. Compared to other techniques, QM me...

متن کامل

Total 6 Exact Hazard-free Logic Minimization. 4 Conditions for a Hazard-free Transition. Exact Two-level Minimization of Hazard-free Logic with Multiple-input Changes 3

This paper describes a new method for exact hazard-free logic minimization of Boolean functions. Given an incompletelyspecified Boolean function, the method produces a minimal sumof-products implementation which is hazard-free for a given set of multiple-input changes, if such a solution exists. The method is a constrained version of the Quine-McCluskey algorithm. It has been automated and appl...

متن کامل

A New Case for Image Compression Using Logic Function Minimization

Sum of minterms is a canonical form for representing logic functions. There are classical methods such as Karnaugh map or Quine–McCluskey tabulation for minimizing a sum of products. This minimization reduces the minterms to smaller products called implicants. If minterms are represented by bit strings, the bit strings shrink through the minimization process. This can be considered as a kind of...

متن کامل

Modified Quine-McCluskey Method

The digital gates are basic electronic component of any digital circuit. Digital circuit should be simplified in order to reduce its cost by reducing number of digital gates required to implement it. To achieve this, we use Boolean expression that helps in obtaining minimum number of terms and does not contain any redundant pair. Karnaugh map (K-map) and Quine-McCluskey (QM) methods are well kn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016