Breakup Algorithm for Switching Circuit Simplifications

Sahadev Roy (1)

1 NIT, Arunachal Pradesh - National Institute of Technology, Arunachal Pradesh

This paper examines the generalized schemes of the breakup algorithm. It is possible to minimize multiple variable Boolean functions by breaking up into several groups. In the proposed generalized method, the number of group depends on user choice. The maximum element in each group depends on breaking point and it is quite easy to determine logic adjacency using look up table. Four point break or three point break are easily expressed as hexadecimal minterms and octal minterms respectively and both the techniques produce the same minimized results which are analyzed in this paper. A generalized Breakup Algorithm is also presented here for sequential and combinational logic circuit minimization.

Mots clés: Breakup algorithm; Combinational circuit simplification; Hexadecimal coded minterms; Logic function simplification; Octal coded minterms

Domaines: Informatique [cs]

Sahadev Roy. Breakup Algorithm for Switching Circuit Simplifications. International Journal of Advanced Engineering and Management, 2016, 1 (1), pp.1 - 11. ⟨10.24999/IJOAEM/02010001⟩. ⟨hal-01484223⟩