Maximum likelihood disjunctive decomposition to reduced multirooted DAG for FIR filter design

This paper extolls the virtues of information theoretic approach to the synthesis of reduced multirooted directed acyclic graph (DAG) representation for the multiplier block of FIR filters. The proposed maximum likelihood decomposition algorithm can be viewed as an efficient divideand-conquer approach with dynamic tracking of the statistic of weight-two subexpressions. As isomorphic subgraphs of the resultant reduced multirooted binary partition tree (MBPT) represent common subexpressions, higher weight common subexpressions are eliminated implicitly in the graph synthesis process. Experimental results show that the proposed algorithm produce designs with good tradeoffs for low logic complexity and logic depth.