Investigation of Ternary Function Minimization

This paper presents the algorithm for the function minimization of multivalued i.e. Radix >2 digital system. The ternary digital system which radix=3 is considered here for the demonstration of proposed algorithm and computer program is developed based on algorithm in the form of ternary 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. The proposed program is developed for the ternary system function minimization. It incorporates all designed rules for ternary logic system design and gives the output in the form of Sum-of-Product (SOP) terms. There are different rules for the minimization of ternary logic based digital system that are different from the conventional binary digital system. Output equation of ternary digital system is in the form of F = F2 + 1. (F1) where, F2 = 2´s minterms and F1 = 1´s minterms. The results are verified for ternary full adder and subtract or are tested on program and compared with truth table for ternary full adder and subtract or and obtained results are found to be accurate.