Published Paper Details:

The algorithm for the function minimization of a multivalued, or radix >2, digital system is presented in this study. The suggested algorithm is illustrated here using a ternary digital system with radix=3, and a computer programme based on the algorithm is created in the form of a ternary map. The difficulty of minimising or reduction of the logic function grows as the system radix does. Higher radix make it harder to minimise the function design equation. The suggested programme was created to minimise the functions of ternary systems. The result is presented as Sum-of-Product (SOP) terms and includes all designed rules for ternary logic system architecture.. In contrast to the traditional binary digital system, ternary logic-based systems have alternative principles for minimization. The ternary digital system's output equation takes the form F = F2 + 1. Where F1 = 1's minterms and F2 = 2's minterms, respectively. The findings are evaluated on a programme and compared with a truth table for ternary half adders and full adders, and it is determined that the results are accurate.