Optimizing combinational logic circuits using Grammatical Evolution

Abstract

This paper applies Grammatical Evolution (GE) to the optimization of combinational logic circuits on gate-level logic. We demonstrate the ability of GE to evolve complex combinational circuits using gate-level combinational logic and show that GE can similarly provide optimized solutions for different digital circuit problems at the gate level. Our methodology is applied to the Advanced Encryption standard (AES) S-box building blocks and the results compared to other evolutionary algorithms. Our results show comparable results with traditional Genetic Algorithm (GA) and Cartesian Genetic Programming (CGP).