We represent such RTL as a data-flow graph, where operators and operands are represented by nodes with edges, labelled by bitwidth, connecting operands and operators. This graphical representation allows us to formulate the problem as a graph optimization problem, where we are allowed to manipulate the graph with equivalence-preserving transformations. This formulation allows us to take advantage of recent advances in e-graph and equality saturation [1]} technology, discussed in §, alongside previous motivating work in automated RTL optimization and design. Application of e-graphs to the RTL optimization problem is presented in §. We demonstrate results in § and validate
our cost metric in §.
