This paper presents an approach to obtain reduced hardware and/or delay for synthesizing logic functions using multiplexers. Replication of single control line multiplexer is used as the only design unit for defining any logic function specified by minterms. An algorithm is proposed that does exhaustive branching to reduce the number of levels and/or modules required to implement any logic function. The algorithm identifies a single variable or a function at the control input of the multiplexer which leads to an implementation with reduced number of levels and/or hardware. Simulation is done upto 9 variable functions using two levels. The approach attains a reduction in delay and/or power over other implementations of functions having larger number of variables. Theoretically, the algorithm can handle completely specified functions of any number of variables.
[1]
Ajit Pal.
An Algorithm for Optimal Logic Design Using Multiplexers
,
1986,
IEEE Transactions on Computers.
[2]
Carlos A. Coello Coello,et al.
A genetic programming approach to logic function synthesis by means of multiplexers
,
1999,
Proceedings of the First NASA/DoD Workshop on Evolvable Hardware.
[3]
André I. Reis,et al.
Classifying n-Input Boolean Functions
,
2001
.
[4]
Arturo Hernández Aguirre,et al.
Using genetic programing and multiplexers for the synthesis of logic circuits
,
2004
.
[5]
A.E.A. Almaini,et al.
Automated synthesis of digital multiplexer networks
,
1992
.
[6]
Ajit Pal,et al.
Automated synthesis of combinational circuits by cascade networks of multiplexers
,
1990
.