Current Proceedings on Technology

Yazarlar: Peter Pistek, Karol Suty

Konular:-

Anahtar Kelimeler:Multiplexer,Analysis,Circuit,Faster method,Brutall force,Searching paths, 

Özet:   The proposed work is focused on analysis of multiplexer trees.  In nowadays there is one universal solution (brutal force) how to obtain Boolean function from the known circuit. This solution has to be modified a little for each type of gates which are used in analyzed circuits.  It can be used for each type of gate but because of this universality it has disadvantages – i.e. in analysis of multiplexer trees, all combinations of logic zeroes and ones have to be tested for each variable (we have to test all rows in lookup table) to obtain Boolean function. We propose a new method which is focused on multiplexer trees. The method analyzes circuit from the output (outputs for multiple output circuits) and finds out variables on following multiplexer. Consequential, according to these variables, term is created for specified value of variables connected to this multiplexer.  This process is repeated for each multiplexer in the path until the inputs of the circuit are found after this we repeat the process for all paths in the multiplexer tree.  This method saves computation time two times compared to “brutal force” solution. We do not have to try all binary combinations for variables; usually not all of them are used in all paths. Thanks to this reverse approach we eliminate unused transmissions of inputs which usually are not transmit to the output (i.e. in multiplexer tree only one input from 2n is transmitted to the output).

---